Access the full text.
Sign up today, get DeepDyve free for 14 days.
Benjamin Marlin, R. Zemel, S. Roweis, Malcolm Slaney (2007)
Collaborative Filtering and the Missing at Random AssumptionArXiv, abs/1206.5267
Dohyun Kim, B. Yum (2005)
Collaborative filtering based on iterative principal component analysisExpert Syst. Appl., 28
(2009)
Received January
Robert Bell, Y. Koren (2007)
Scalable Collaborative Filtering with Jointly Derived Neighborhood Interpolation WeightsSeventh IEEE International Conference on Data Mining (ICDM 2007)
Kamal Ali, Wijnand Stam (2004)
TiVo: making show recommendations using a distributed collaborative filtering architectureProceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
J. Bennett, S. Lanning (2007)
The Netflix Prize
Arkadiusz Paterek (2007)
Improving regularized singular value decomposition for collaborative filtering
G. Linden, Brent Smith, J. York (2003)
Industry Report: Amazon.com Recommendations: Item-to-Item Collaborative FilteringIEEE Distributed Syst. Online, 4
G. Takács, I. Pilászy, B. Németh, D. Tikk (2007)
Major components of the gravity recommendation systemSIGKDD Explor., 9
N. Tintarev, Judith Masthoff (2007)
A Survey of Explanations in Recommender Systems2007 IEEE 23rd International Conference on Data Engineering Workshop
J. Canny (2002)
Collaborative filtering with privacy via factor analysis
Jonathan Herlocker, J. Konstan, Al Borchers, J. Riedl (1999)
An algorithmic framework for performing collaborative filtering
A. Tuzhilin (2010)
Towards the Next Generation of Recommender Systems
Jun Wang, A. Vries, M. Reinders (2006)
Unifying user-based and item-based collaborative filtering approaches by similarity fusionProceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
G. Piatetsky-Shapiro (2007)
Interview with Simon FunkSIGKDD Explor., 9
(2003)
Latent Dirichlet Allocati on
(2010)
Article 1, Publication date
Thomas Hofmann (2004)
Latent semantic models for collaborative filteringACM Trans. Inf. Syst., 22
Seung-Taek Park, David Pennock (2007)
Applying collaborative filtering techniques to movie search for better ranking and browsing
R. Salakhutdinov, A. Mnih, Geoffrey Hinton (2007)
Restricted Boltzmann machines for collaborative filtering
G. Adomavicius, A. Tuzhilin (2005)
Toward the next generation of recommender systems: a survey of the state-of-the-art and possible extensionsIEEE Transactions on Knowledge and Data Engineering, 17
Jonathan Herlocker, J. Konstan, J. Riedl (2000)
Explaining collaborative filtering recommendations
Abhinandan Das, Mayur Datar, A. Garg, S. Rajaram (2007)
Google news personalization: scalable online collaborative filtering
Y. Koren (2008)
Factorization meets the neighborhood: a multifaceted collaborative filtering model
Robert Bell, Y. Koren, C. Volinsky (2007)
Modeling relationships at multiple scales to improve accuracy of large recommender systems
Gregory Piatetsky (2007)
Interview with Simon FunkSigkdd Explorations, 9
J. Bennett, C. Elkan, B. Liu, Padhraic Smyth, D. Tikk (2007)
KDD Cup and workshop 2007SIGKDD Explor., 9
T. Landauer, S. Dumais (2008)
Latent semantic analysisScholarpedia, 3
B. Sarwar, G. Karypis, J. Konstan, J. Riedl (2001)
Item-based collaborative filtering recommendation algorithms
David Goldberg, D. Nichols, B. Oki, D. Terry (1992)
Using collaborative filtering to weave an information tapestryCommun. ACM, 35
(2006)
Netflix Update: Try This At Home
R. Salakhutdinov, A. Mnih (2007)
Probabilistic Matrix Factorization
B. Sarwar, G. Karypis, J. Konstan, J. Riedl (2000)
Application of Dimensionality Reduction in Recommender System - A Case Study
Robert Bell, Y. Koren (2007)
Lessons from the Netflix prize challengeSIGKDD Explor., 9
Douglas Oard, Jinmook Kim (1998)
Implicit Feedback for Recommender Systems
Recommender systems provide users with personalized suggestions for products or services. These systems often rely on collaborating filtering (CF), where past transactions are analyzed in order to establish connections between users and products. The most common approach to CF is based on neighborhood models, which originate from similarities between products or users. In this work we introduce a new neighborhood model with an improved prediction accuracy. Unlike previous approaches that are based on heuristic similarities, we model neighborhood relations by minimizing a global cost function. Further accuracy improvements are achieved by extending the model to exploit both explicit and implicit feedback by the users. Past models were limited by the need to compute all pairwise similarities between items or users, which grow quadratically with input size. In particular, this limitation vastly complicates adopting user similarity models, due to the typical large number of users. Our new model solves these limitations by factoring the neighborhood model, thus making both item-item and user-user implementations scale linearly with the size of the data. The methods are tested on the Netflix data, with encouraging results.
ACM Transactions on Knowledge Discovery from Data (TKDD) – Association for Computing Machinery
Published: Jan 1, 2010
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.