research-article

Eigentaste: A Constant Time Collaborative Filtering Algorithm

Authors:

Theresa Roeder,

Chris PerkinsAuthors Info & Claims

Information Retrieval, Volume 4, Issue 2

Pages 133 - 151

https://doi.org/10.1023/A:1011419012209

Published: 01 July 2001 Publication History

Abstract

Eigentaste is a collaborative filtering algorithm that uses universal queries to elicit real-valued user ratings on a common set of items and applies principal component analysis (PCA) to the resulting dense subset of the ratings matrix. PCA facilitates dimensionality reduction for offline clustering of users and rapid computation of recommendations. For a database of n users, standard nearest-neighbor techniques require O(n) processing time to compute recommendations, whereas Eigentaste requires O(1) (constant) time. We compare Eigentaste to alternative algorithms using data from Jester, an online joke recommending system.

Jester has collected approximately 2,500,000 ratings from 57,000 users. We use the Normalized Mean Absolute Error (NMAE) measure to compare performance of different algorithms. In the Appendix we use Uniform and Normal distribution models to derive analytic estimates of NMAE when predictions are random. On the Jester dataset, Eigentaste computes recommendations two orders of magnitude faster with no loss of accuracy. Jester is online at: http://eigentaste.berkeley.edu

References

[1]

Albaum G, Best R, and Hawkins D Continuous vs discrete semantic differential ratings scales Psychological Reports 1981 49 90-97

[2]

Arrow KJ (1963) Social Choice and Individual Values, 2nd ed. Yale University Press.

[3]

Billius D and Pazzani M Learning collaborative information filters Machine Learning 1998 San Francisco Morgan Kaufmann Publishers 46-54

[4]

Breese, Heckermen and Kadie (1998) Empirical analysis of predictive algorithms for collaborative filtering. Microsoft Research Technical Report, (MSR-TR-98-12).

[5]

Chislenko A et al. (2000) US Patent 6092049: Method and apparatus for efficiently recommending items using automated collaborative filtering and feature-guided automated collaborative filtering.

[6]

Dasarathy BV NN Pattern Classification Techniques 1991 CA IEEE Computer Society Press

[7]

Deerwester S, Dumais S, Furnas G, Landauer T, and Harshman R Indexing by latent semantic analysis Journal of the American Society for Information Science 1990 41 6 391-407

[8]

Delgado JA (2000) Agent-Based Information Filtering and Recommender Systems on the Internet. PhD Thesis, Nagoya Institute of Technology.

[9]

Ding CHQ A similarity-based probability model for latent semantic indexing Proceedings of 22nd International ACM SIGIR Conference on Research and Development in Information Retrieval, Berkeley, CA, USA, August 1999 1999 New York, NY ACM 58-65

[10]

Goldberg D, Nichols D, Oki B, and Terry D Using collaborative filtering to weave an information tapestry Communication of the ACM 1992 35 12 61-70

[11]

Gupta D and Goldberg K Jester 2.0: A linear time collaborative filtering algorithm applied to jokes Proceedings of 22nd International ACM SIGIR Conference on Research and Development in Information Retrieval, Berkeley, CA, USA, August 1999 1999 New York, NY ACM 291-292

[12]

Herlocker J, Konstan J, Borchers A, and Riedl J An algorithmic framework for performing collaborative filtering Proceedings of 22nd International ACM SIGIR Conference on Research and Development in Information Retrieval, Berkeley, CA, USA, August 1999 1999 New York, NY ACM 230-237

[13]

Herlocker J, Konstan J, and Riedl J (2000) Explaining collaborative filtering recommendations. In: Proceedings of the ACM 2000 Conference on Computer Supported Cooperative Work, December 2-6, 2000.

[14]

Hey J (1989) US Patent 4870579: System and method of predicting subjective reactions.

[15]

Hofmann T Probabilistic latent semantic indexing Proceedings of 22nd International ACM SIGIR Conference on Research and Development in Information Retrieval, Berkeley, CA, USA, August 1999 1999 New York, NY ACM 50-57

[16]

Hotelling H Analysis of a complex of statistical variables into principal components Journal of Eduational Psychology 1933 24 417-441

[17]

Jackson JE A User Guide to Principal Components: A Problem Solving Approach 1991 New York John Wiley and Sons

[18]

Konstan JA and Bharat K (1996) Integrated personal and community recommendations in collaborative filtering. CSCW Workshop.

[19]

Konstan J, Miller B, Maltz D, Herlacker J, Gordon L, and Riedl J Grouplens: Applying collaborative filtering to usenet news Communications of the ACM 1997 40 3 77-87

[20]

Krishnaiah PR and Kanal LN Classification, pattern recognition and reduction in dimensionality Handbook of Statistics 2 1982 Amsterdam, New York, Oxford North-Holland Publishing Company

[21]

Landauer T, Littman M and Bell Communications Research (Bellcore) (1994) US Patent 5301109: Computerized cross-language document retrieval using latent semantic indexing.

[22]

Maltz DA and Ehlrich K (1995) Pointing the way: Active collaborative filtering. Chi'95 Proceedings Papers.

[23]

Nilsen D International Journal of Humor Research 2000 New York Walter de Gruyter Inc.

[24]

Pearson K On lines and planes of closest fit to systems of points in space Phil. Mag 1901 2 559-572

[25]

Pennock DM and Horvitz E (1999a) Analysis of the axiomatic foundations of collaborative filtering. In: AAAI Workshop on Artificial Intelligence for Electronic Commerce, Orlando, Florida, National Conference on Arti-ficial Intelligence.

[26]

Pennock DM and Horvitz E (1999b) Collaborative filtering by personality diagnosis:Ahybrid memory-and modelbased approach. In: IJCAI Workshop on Machine Learning for Information Filtering, Stockholm, Sweden, International Joint Conference on Artificial Intelligence.

[27]

Pryor M (1998) The effects of singular value decomposition on collaborative filtering. Dartmouth College CS Technical Report, PCS-TR 98-338.

[28]

Resnick P, Iacovou N, Suchak M, Bergstrom P and Riedl J (1994) Grouplens: An open architecture for collaborative filtering of netnews. Proceedings of the ACM Conference on Computer Supported Cooperative Work.

[29]

Rich E User Modeling via Stereotypes Cognitive Science 1979 3 335-366

[30]

Shardanand U and Maes P (1995) Social information filtering: Algorithms for automating word of mouth. ACM Conference on Computer Human Interaction (CHI).

[31]

Sarwar BM, Karypis G, Konstan J and Riedl JT (2000) Application of dimensionality reduction in recommender systems-a case study. ACM Conference on E-Commerce.

[32]

Varian H and Resnick P (1997) Special issue on cf and recommender systems Communication of the ACM, 40(3).

[33]

Ziv A Personality and Sense of Humor 1984 New York Springer Publishing Co.

Cited By

Gidisu PHochstenbach M(2025)Block discrete empirical interpolation methodsJournal of Computational and Applied Mathematics10.1016/j.cam.2024.116186454:COnline publication date: 15-Jan-2025
https://dl.acm.org/doi/10.1016/j.cam.2024.116186
Chen JYe W(2024)TB-BGAT With TinyBERT and BiGRU in Personalized Course RecommendationsInternational Journal of Information and Communication Technology Education10.4018/IJICTE.34535820:1(1-15)Online publication date: 17-Sep-2024
https://dl.acm.org/doi/10.4018/IJICTE.345358
Balcan MDeblasio DDick TKingsford CSandholm TVitercik E(2024)How Much Data Is Sufficient to Learn High-Performing Algorithms?Journal of the ACM10.1145/367627871:5(1-58)Online publication date: 29-Jul-2024
https://dl.acm.org/doi/10.1145/3676278
Show More Cited By

Index Terms

Eigentaste: A Constant Time Collaborative Filtering Algorithm
1. Information systems
  1. Information retrieval
    1. Retrieval tasks and goals
      1. Document filtering
      2. Information extraction
  2. Information systems applications

Index terms have been assigned to the content through auto-classification.

Recommendations

Trust-based collaborative filtering: tackling the cold start problem using regular equivalence
RecSys '18: Proceedings of the 12th ACM Conference on Recommender Systems

User-based Collaborative Filtering (CF) is one of the most popular approaches to create recommender systems. This approach is based on finding the most relevant k users from whose rating history we can extract items to recommend. CF, however, suffers ...
Eigentaste 5.0: constant-time adaptability in a recommender system using item clustering
RecSys '07: Proceedings of the 2007 ACM conference on Recommender systems

Recommender systems strive to recommend items that users will appreciate and rate highly, often presenting items in order of highest predicted ratings first. In this working paper we present Eigentaste 5.0, a constant-time recommender system that ...
Merging trust in collaborative filtering to alleviate data sparsity and cold start

Providing high quality recommendations is important for e-commerce systems to assist users in making effective selection decisions from a plethora of choices. Collaborative filtering is a widely accepted technique to generate recommendations based on ...

Comments

Information & Contributors

Information

Published In

cover image Information Retrieval

Information Retrieval Volume 4, Issue 2

Jul 2001

95 pages

ISSN:1386-4564

Issue’s Table of Contents

© Kluwer Academic Publishers 2001.

Publisher

Kluwer Academic Publishers

United States

Publication History

Published: 01 July 2001

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

418
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 15 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Gidisu PHochstenbach M(2025)Block discrete empirical interpolation methodsJournal of Computational and Applied Mathematics10.1016/j.cam.2024.116186454:COnline publication date: 15-Jan-2025
https://dl.acm.org/doi/10.1016/j.cam.2024.116186
Chen JYe W(2024)TB-BGAT With TinyBERT and BiGRU in Personalized Course RecommendationsInternational Journal of Information and Communication Technology Education10.4018/IJICTE.34535820:1(1-15)Online publication date: 17-Sep-2024
https://dl.acm.org/doi/10.4018/IJICTE.345358
Balcan MDeblasio DDick TKingsford CSandholm TVitercik E(2024)How Much Data Is Sufficient to Learn High-Performing Algorithms?Journal of the ACM10.1145/367627871:5(1-58)Online publication date: 29-Jul-2024
https://dl.acm.org/doi/10.1145/3676278
Park JShin YShin WHui Yang GWang HHan SHauff CZuccon GZhang Y(2024)Turbo-CF: Matrix Decomposition-Free Graph Filtering for Fast RecommendationProceedings of the 47th International ACM SIGIR Conference on Research and Development in Information Retrieval10.1145/3626772.3657916(2672-2676)Online publication date: 10-Jul-2024
https://dl.acm.org/doi/10.1145/3626772.3657916
Li SZeng YWang YZhong YZhou ZTong Y(2024)An Experimental Study on Federated Equi-JoinsIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2024.337502836:9(4443-4457)Online publication date: 1-Sep-2024
https://dl.acm.org/doi/10.1109/TKDE.2024.3375028
Shirali AKazemi RAmini A(2024)Collaborative filtering with representation learning in the frequency domainInformation Sciences: an International Journal10.1016/j.ins.2024.121240681:COnline publication date: 1-Oct-2024
https://dl.acm.org/doi/10.1016/j.ins.2024.121240
Liu JYe ZChen KZhang P(2024)Variational Bayesian inference for bipartite mixed-membership stochastic block model with applications to collaborative filteringComputational Statistics & Data Analysis10.1016/j.csda.2023.107836189:COnline publication date: 1-Jan-2024
https://dl.acm.org/doi/10.1016/j.csda.2023.107836
Filos-Ratsikas AVoudouris A(2024)Revisiting the Distortion of Distributed VotingTheory of Computing Systems10.1007/s00224-024-10171-168:5(1138-1159)Online publication date: 1-Oct-2024
https://dl.acm.org/doi/10.1007/s00224-024-10171-1
Medková J(2024)Classification of Datasets Used in Data Anonymization for IoT EnvironmentAdvances and Trends in Artificial Intelligence. Theory and Applications10.1007/978-981-97-4677-4_8(80-92)Online publication date: 9-Jul-2024
https://dl.acm.org/doi/10.1007/978-981-97-4677-4_8
Tsai TTsai YLin S(2024)lil’HDoC: An Algorithm for Good Arm Identification Under Small Threshold GapAdvances in Knowledge Discovery and Data Mining10.1007/978-981-97-2262-4_7(78-89)Online publication date: 7-May-2024
https://dl.acm.org/doi/10.1007/978-981-97-2262-4_7
Show More Cited By

View Options

View options

Media

Figures

Other

Tables

View Issue’s Table of Contents