Tangent: A novel, "Surprise-me", recommendation algorithm

Kensuke Onuma, Hanghang Tong, Christos Faloutsos

Research output: Chapter in Book/Report/Conference proceedingConference contribution

78 Citations (Scopus)

Abstract

Most of recommender systems try to find items that are most relevant to the older choices of a given user. Here we focus on the "surprise me" query: A user may be bored with his/her usual genre of items (e.g., books, movies, hobbies), and may want a recommendation that is related, but off the beaten path, possibly leading to a new genre of books/movies/hobbies. How would we define, as well as automate, this seemingly selfcontradicting request? We introduce TANGENT, a novel recommendation algorithm to solve this problem. The main idea behind TANGENT is to envision the problem as node selection on a graph, giving high scores to nodes that are well connected to the older choices, and at the same time well connected to unrelated choices. The method is carefully designed to be (a) parameter-free (b) effective and (c) fast. We illustrate the benefits of TANGENT with experiments on both synthetic and real data sets. We show that TANGENT makes reasonable, yet surprising, horizon-broadening recommendations. Moreover, it is fast and scalable, since it can easily use existing fast algorithms on graph node proximity.

Original languageEnglish (US)
Title of host publicationProceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
Pages657-665
Number of pages9
DOIs
StatePublished - 2009
Externally publishedYes
Event15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '09 - Paris, France
Duration: Jun 28 2009Jul 1 2009

Other

Other15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '09
CountryFrance
CityParis
Period6/28/097/1/09

Fingerprint

Recommender systems
Experiments

Keywords

  • Algorithms
  • Experimentation

ASJC Scopus subject areas

  • Software
  • Information Systems

Cite this

Onuma, K., Tong, H., & Faloutsos, C. (2009). Tangent: A novel, "Surprise-me", recommendation algorithm. In Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (pp. 657-665) https://doi.org/10.1145/1557019.1557093

Tangent : A novel, "Surprise-me", recommendation algorithm. / Onuma, Kensuke; Tong, Hanghang; Faloutsos, Christos.

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 2009. p. 657-665.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Onuma, K, Tong, H & Faloutsos, C 2009, Tangent: A novel, "Surprise-me", recommendation algorithm. in Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. pp. 657-665, 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '09, Paris, France, 6/28/09. https://doi.org/10.1145/1557019.1557093
Onuma K, Tong H, Faloutsos C. Tangent: A novel, "Surprise-me", recommendation algorithm. In Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 2009. p. 657-665 https://doi.org/10.1145/1557019.1557093
Onuma, Kensuke ; Tong, Hanghang ; Faloutsos, Christos. / Tangent : A novel, "Surprise-me", recommendation algorithm. Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 2009. pp. 657-665
@inproceedings{2181b37331c0431d9ba2aad68b30c24b,
title = "Tangent: A novel, {"}Surprise-me{"}, recommendation algorithm",
abstract = "Most of recommender systems try to find items that are most relevant to the older choices of a given user. Here we focus on the {"}surprise me{"} query: A user may be bored with his/her usual genre of items (e.g., books, movies, hobbies), and may want a recommendation that is related, but off the beaten path, possibly leading to a new genre of books/movies/hobbies. How would we define, as well as automate, this seemingly selfcontradicting request? We introduce TANGENT, a novel recommendation algorithm to solve this problem. The main idea behind TANGENT is to envision the problem as node selection on a graph, giving high scores to nodes that are well connected to the older choices, and at the same time well connected to unrelated choices. The method is carefully designed to be (a) parameter-free (b) effective and (c) fast. We illustrate the benefits of TANGENT with experiments on both synthetic and real data sets. We show that TANGENT makes reasonable, yet surprising, horizon-broadening recommendations. Moreover, it is fast and scalable, since it can easily use existing fast algorithms on graph node proximity.",
keywords = "Algorithms, Experimentation",
author = "Kensuke Onuma and Hanghang Tong and Christos Faloutsos",
year = "2009",
doi = "10.1145/1557019.1557093",
language = "English (US)",
isbn = "9781605584959",
pages = "657--665",
booktitle = "Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining",

}

TY - GEN

T1 - Tangent

T2 - A novel, "Surprise-me", recommendation algorithm

AU - Onuma, Kensuke

AU - Tong, Hanghang

AU - Faloutsos, Christos

PY - 2009

Y1 - 2009

N2 - Most of recommender systems try to find items that are most relevant to the older choices of a given user. Here we focus on the "surprise me" query: A user may be bored with his/her usual genre of items (e.g., books, movies, hobbies), and may want a recommendation that is related, but off the beaten path, possibly leading to a new genre of books/movies/hobbies. How would we define, as well as automate, this seemingly selfcontradicting request? We introduce TANGENT, a novel recommendation algorithm to solve this problem. The main idea behind TANGENT is to envision the problem as node selection on a graph, giving high scores to nodes that are well connected to the older choices, and at the same time well connected to unrelated choices. The method is carefully designed to be (a) parameter-free (b) effective and (c) fast. We illustrate the benefits of TANGENT with experiments on both synthetic and real data sets. We show that TANGENT makes reasonable, yet surprising, horizon-broadening recommendations. Moreover, it is fast and scalable, since it can easily use existing fast algorithms on graph node proximity.

AB - Most of recommender systems try to find items that are most relevant to the older choices of a given user. Here we focus on the "surprise me" query: A user may be bored with his/her usual genre of items (e.g., books, movies, hobbies), and may want a recommendation that is related, but off the beaten path, possibly leading to a new genre of books/movies/hobbies. How would we define, as well as automate, this seemingly selfcontradicting request? We introduce TANGENT, a novel recommendation algorithm to solve this problem. The main idea behind TANGENT is to envision the problem as node selection on a graph, giving high scores to nodes that are well connected to the older choices, and at the same time well connected to unrelated choices. The method is carefully designed to be (a) parameter-free (b) effective and (c) fast. We illustrate the benefits of TANGENT with experiments on both synthetic and real data sets. We show that TANGENT makes reasonable, yet surprising, horizon-broadening recommendations. Moreover, it is fast and scalable, since it can easily use existing fast algorithms on graph node proximity.

KW - Algorithms

KW - Experimentation

UR - http://www.scopus.com/inward/record.url?scp=70350656339&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=70350656339&partnerID=8YFLogxK

U2 - 10.1145/1557019.1557093

DO - 10.1145/1557019.1557093

M3 - Conference contribution

AN - SCOPUS:70350656339

SN - 9781605584959

SP - 657

EP - 665

BT - Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

ER -