Eigentaste: A constant time collaborative filtering algorithm. 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.par 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 in zbMATH (referenced in 57 articles )

Showing results 1 to 20 of 57.
Sorted by year (citations)

1 2 3 next

  1. Del Corso, Gianna M.; Romani, Francesco: Adaptive nonnegative matrix factorization and measure comparisons for recommender systems (2019)
  2. Feng, Yuehua; Xiao, Jianwei; Gu, Ming: Flip-flop spectrum-revealing QR factorization and its applications to singular value decomposition (2019)
  3. Nath, Swaprava; Sandholm, Tuomas: Efficiency and budget balance in general quasi-linear domains (2019)
  4. Sato, Hiroyuki; Kasai, Hiroyuki; Mishra, Bamdev: Riemannian stochastic variance reduced gradient algorithm with retraction and vector transport (2019)
  5. Bi, Xuan; Qu, Annie; Shen, Xiaotong: Multilayer tensor factorization with applications to recommender systems (2018)
  6. Khetan, Ashish; Oh, Sewoong: Generalized rank-breaking: computational and statistical tradeoffs (2018)
  7. Negahban, Sahand; Oh, Sewoong; Thekumparampil, Kiran K.; Xu, Jiaming: Learning from comparisons and choices (2018)
  8. Shi, Xiaoyu; Shang, Ming-Sheng; Luo, Xin; Khushnood, Abbas; Li, Jian: Long-term effects of user preference-oriented recommendation method on the evolution of online system (2017)
  9. Zhang, Zhipeng; Kudo, Yasuo; Murai, Tetsuya: Neighbor selection for user-based collaborative filtering using covering-based rough sets (2017)
  10. Adomavicius, Gediminas; Zhang, Jingjing: Classification, ranking, and top-K stability of recommendation algorithms (2016) ioport
  11. Carmel, Yuval; Patt-Shamir, Boaz: Comparison-based interactive collaborative filtering (2016)
  12. Hautamäki, Antti: Points of view: a conceptual space approach (2016)
  13. Jin, Zheng-Fen; Wan, Zhongping; Jiao, Yuling; Lu, Xiliang: An alternating direction method with continuation for nonconvex low rank minimization (2016)
  14. Nath, Swaprava; Sandholm, Tuomas: Efficiency and budget balance (2016)
  15. Boutilier, Craig; Caragiannis, Ioannis; Haber, Simi; Lu, Tyler; Procaccia, Ariel D.; Sheffet, Or: Optimal social choice functions: a utilitarian view (2015)
  16. Carmel, Yuval; Patt-Shamir, Boaz: Comparison-based interactive collaborative filtering (2015)
  17. Dikow, Heidi; Hasan, Omar; Kosch, Harald; Brunie, Lionel; Sornin, Renaud: Improving the accuracy of business-to-business (B2B) reputation systems through rater expertise prediction (2015) ioport
  18. Geng, Juan; Wang, Laisheng; Wang, Yanfei: A non-convex algorithm framework based on DC programming and DCA for matrix completion (2015)
  19. Nguyen, Duc Anh; Duong, Trong Hai: Video recommendation using neuro-fuzzy on social TV environment (2015) ioport
  20. Wang, Zheng; Lai, Ming-Jun; Lu, Zhaosong; Fan, Wei; Davulcu, Hasan; Ye, Jieping: Orthogonal rank-one matrix pursuit for low rank matrix completion (2015)

1 2 3 next