Evgeny Frolov
ABSTRACT
We propose a new hybrid algorithm that allows incorporating both user and item side information within the standard collaborative filtering technique. One of its key features is that it naturally extends a simple PureSVD approach and inherits its unique advantages, such as highly efficient Lanczos-based optimization procedure, simplified hyper-parameter tuning and a quick folding-in computation for generating recommendations instantly even in highly dynamic online environments. The algorithm utilizes a generalized formulation of the singular value decomposition, which adds flexibility to the solution and allows imposing the desired structure on its latent space. Conveniently, the resulting model also admits an efficient and straightforward solution for the cold start scenario. We evaluate our approach on a diverse set of datasets and show its superiority over similar classes of hybrid models.
- Hervé Abdi. 2007. Singular value decomposition (SVD) and generalized singular value decomposition. Encyclopedia of measurement and statistics. Thousand Oaks (CA):Sage (2007), 907--12.Google Scholar
- Evrim Acar, Tamara G Kolda, and Daniel M Dunlavy. 2011. All-at-once optimization for coupled matrix and tensor factorizations. arXiv preprint arXiv:1105.3422 (2011).Google Scholar
- Marat Akhmatnurov and Dmitry I Ignatov. 2015. Context-Aware Recommender System Based on Boolean Matrix Factorisation.. In CLA. 99--110.Google Scholar
- Genevera I Allen, Logan Grosenick, and Jonathan Taylor. 2014. A generalized least-square matrix decomposition. J. Amer. Statist. Assoc. 109, 505 (2014), 145--159.Google ScholarCross Ref
- Orly Alter, Patrick O Brown, and David Botstein. 2003. Generalized singular value decomposition for comparative analysis of genome-scale expression data sets of two different organisms. Proceedings of the National Academy of Sciences 100, 6 (2003), 3351--3356.Google ScholarCross Ref
- Sivaram Ambikasaran, Michael O'Neil, and Karan Raj Singh. 2014. Fast symmetric factorization of hierarchical matrices with applications. arXiv preprint arXiv:1405.0223 (2014).Google Scholar
- Yusuke Ariyoshi and Junzo Kamahara. 2010. A hybrid recommendation method with double SVD reduction. In International Conference on Database Systems for Advanced Applications. Springer, 365--373. Google ScholarDigital Library
- Iman Barjasteh, Rana Forsati, Farzan Masrour, Abdol-Hossein Esfahanian, and Hayder Radha. 2015. Cold-start item and user recommendation with decoupled completion and transduction. In Proceedings of the 9th ACM Conference on Recommender Systems. ACM, 91--98. Google ScholarDigital Library
- James Bergstra and Yoshua Bengio. 2012. Random search for hyper-parameter optimization. Journal of Machine Learning Research 13, Feb (2012), 281--305. Google ScholarDigital Library
- Daniel Billsus and Michael J Pazzani. 1998. Learning Collaborative Information Filters.. In Icml, Vol. 98. 46--54. Google ScholarDigital Library
- Léon Bottou. 2012. Stochastic gradient descent tricks. In Neural networks: Tricks of the trade. Springer, 421--436.Google Scholar
- Robin Burke. 2002. Hybrid recommender systems: Survey and experiments. User modeling and user-adapted interaction 12, 4 (2002), 331--370. Google ScholarDigital Library
- Hongyun Cai, Vincent W Zheng, and Kevin Chen-Chuan Chang. 2018. A comprehensive survey of graph embedding: Problems, techniques, and applications. IEEE Transactions on Knowledge and Data Engineering 30, 9 (2018), 1616--1637.Google ScholarDigital Library
- Tianqi Chen, Linpeng Tang, Qin Liu, Diyi Yang, Saining Xie, Xuezhi Cao, Chun-yang Wu, Enpeng Yao, Zhengyang Liu, Zhansheng Jiang, et al. 2012. Combining factorization model and additive forest for collaborative followee recommendation. KDD CUP (2012).Google Scholar
- Yanqing Chen, Timothy A Davis, William W Hager, and Sivasankaran Rajamanickam. 2008. Algorithm 887: CHOLMOD, supernodal sparse Cholesky factorization and update/downdate. ACM Transactions on Mathematical Software (TOMS) 35, 3 (2008), 22. Google ScholarDigital Library
- Yifan Chen and Xiang Zhao. 2017. Leveraging High-Dimensional Side Information for Top-N Recommendation. arXiv preprint arXiv:1702.01516 (2017).Google Scholar
- Deborah Cohen, Michal Aharon, Yair Koren, Oren Somekh, and Raz Nissim. 2017. Expediting exploration by attribute-to-feature mapping for cold-start recommendations. In Proceedings of the 11th ACM Conference on Recommender Systems. ACM, 184--192. Google ScholarDigital Library
- Paolo Cremonesi, Yehuda Koren, and Roberto Turrin. 2010. Performance of recommender algorithms on top-n recommendation tasks, In Proc. of fourth ACM Conf. Recomm. Syst. - RecSys '10. Proc. fourth ACM Conf. Recomm. Syst. - RecSys '10. Google ScholarDigital Library
- Mukund Deshpande and George Karypis. 2004. Item-based top-n recommendation algorithms. ACM Transactions on Information Systems (TOIS) 22, 1 (2004), 143--177. Google ScholarDigital Library
- John Duchi, Elad Hazan, and Yoram Singer. 2011. Adaptive subgradient methods for online learning and stochastic optimization. Journal of Machine Learning Research 12, Jul (2011), 2121--2159. Google ScholarDigital Library
- Michael D Ekstrand, John T Riedl, Joseph A Konstan, et al. 2011. Collaborative filtering recommender systems. Foundations and Trends<sup>®</sup> in Human-Computer Interaction 4, 2 (2011), 81--173. Google ScholarDigital Library
- Yi Fang and Luo Si. 2011. Matrix co-factorization for recommendation with rich side information and implicit feedback. In Proceedings of the 2nd International Workshop on Information Heterogeneity and Fusion in Recommender Systems. ACM, 65--69. Google ScholarDigital Library
- Zeno Gantner, Lucas Drumond, Christoph Freudenthaler, Steffen Rendle, and Lars Schmidt-Thieme. 2010. Learning attribute-to-feature mappings for cold-start recommendations. In Data Mining (ICDM), 2010 IEEE 10th International Conference on. IEEE, 176--185. Google ScholarDigital Library
- Gene H Golub and Charles F Van Loan. 2012. Matrix computations (4th ed.). The Johns Hopkins University Press.Google Scholar
- Asela Gunawardana and Christopher Meek. 2009. A unified approach to building hybrid recommender systems. In Proceedings of the third ACM conference on Recommender systems. ACM, 117--124. Google ScholarDigital Library
- Nathan Halko, Per-Gunnar Martinsson, and Joel A Tropp. 2011. Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions. SIAM review 53, 2 (2011), 217--288. Google ScholarDigital Library
- F Maxwell Harper and Joseph A Konstan. 2016. The movielens datasets: History and context. ACM Trans. Interact. Intell. Syst. (TIIS) 5, 4 (2016), 19. Google ScholarDigital Library
- Dohyun Kim and Bong-Jin Yum. 2005. Collaborative filtering based on iterative principal component analysis. Expert Systems with Applications 28, 4 (2005), 823--830. Google ScholarDigital Library
- Daniel Kluver, Michael D Ekstrand, and Joseph A Konstan. 2018. Rating-based collaborative filtering: algorithms and evaluation. In Social Information Access. Springer, 344--390.Google Scholar
- Yehuda Koren, Robert Bell, and Chris Volinsky. 2009. Matrix factorization techniques for recommender systems. Computer 42, 8 (2009). Google ScholarDigital Library
- Cornelius Lanczos. 1950. An iteration method for the solution of the eigenvalue problem of linear differential and integral operators. United States Governm. Press Office Los Angeles, CA.Google Scholar
- Linyuan Lü and Tao Zhou. 2011. Link prediction in complex networks: A survey. Physica A: statistical mechanics and its applications 390, 6 (2011), 1150--1170.Google Scholar
- Julian McAuley, Christopher Targett, Qinfeng Shi, and Anton Van Den Hengel. 2015. Image-based recommendations on styles and substitutes. In Proceedings of the 38th International ACM SIGIR Conference on Research and Development in Information Retrieval. ACM, 43--52. Google ScholarDigital Library
- Amir Hossein Nabizadeh, Alípio Mário Jorge, Suhua Tang, and Yi Yu. 2016. Predicting User Preference Based on Matrix Factorization by Exploiting Music Attributes. In Proceedings of the Ninth International C* Conference on Computer Science & Software Engineering. ACM, 61--66. Google ScholarDigital Library
- Jennifer Nguyen and Mu Zhu. 2013. Content-boosted matrix factorization techniques for recommender systems. Statistical Analysis and Data Mining 6, 4 (2013), 286--301.Google ScholarCross Ref
- Athanasios N Nikolakopoulos, Vassilis Kalantzis, Efstratios Gallopoulos, and John D Garofalakis. 2017. EigenRec: generalizing PureSVD for effective and efficient top-N recommendations. Knowledge and Information Systems (2017), 1--23. Google ScholarDigital Library
- Xia Ning and George Karypis. 2012. Sparse linear methods with side information for top-n recommendations. In Proceedings of the sixth ACM conference on Recommender systems. ACM, 155--162. Google ScholarDigital Library
- Bithika Pal and Mamata Jenamani. 2018. Kernelized probabilistic matrix factorization for collaborative filtering: exploiting projected user and item graph. In Proceedings of the 12th ACM Conference on Recommender Systems. ACM, 437--440. Google ScholarDigital Library
- István Pilászy and Domonkos Tikk. 2009. Recommending new movies: even a few ratings are more valuable than metadata. In Proceedings of the third ACM conference on Recommender systems. ACM, 93--100. Google ScholarDigital Library
- Ian Porteous, Arthur U Asuncion, and Max Welling. 2010. Bayesian Matrix Factorization with Side Information and Dirichlet Process Mixtures.. In AAAI. Google ScholarDigital Library
- Steffen Rendle. 2010. Factorization machines. In 2010 IEEE 10th International Conference on Data Mining (ICDM). IEEE, 995--1000. Google ScholarDigital Library
- Sujoy Roy and Sharat Chandra Guntuku. 2016. Latent factor representations for cold-start video recommendation. In Proceedings of the 10th ACM Conference on Recommender Systems. ACM, 99--106. Google ScholarDigital Library
- Badrul Sarwar, George Karypis, Joseph Konstan, and John Riedl. 2000. Application of dimensionality reduction in recommender system-a case study. Technical Report. Minnesota Univ Minneapolis Dept of Computer Science.Google Scholar
- Martin Saveski and Amin Mantrach. 2014. Item cold-start recommendations: learning local collective embeddings. In Proceedings of the 8th ACM Conference on Recommender systems. ACM, 89--96. Google ScholarDigital Library
- Yue Shi, Martha Larson, and Alan Hanjalic. 2010. Mining mood-specific movie similarity with matrix factorization for context-aware recommendation. In Proceedings of the workshop on context-aware movie recommendation. ACM, 34--40. Google ScholarDigital Library
- Ajit P Singh and Geoffrey J Gordon. 2008. Relational learning via collective matrix factorization. In Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, 650--658. Google ScholarDigital Library
- David H Stern, Ralf Herbrich, and Thore Graepel. 2009. Matchbox: large scale online bayesian recommendations. In Proceedings of the 18th international conference on World wide web. ACM, 111--120. Google ScholarDigital Library
- Gilbert Strang. 2006. Linear Algebra and Its Applications (4th ed.). Brooks Cole.Google Scholar
- Panagiotis Symeonidis. 2008. Content-based dimensionality reduction for recommender systems. In Data Analysis, Machine Learning and Applications. Springer, 619--626.Google Scholar
- Yahoo Labs Webscope 2014. R2 - Yahoo! Music. Retrieved 02--10-2018 from https://webscope.sandbox.yahoo.com/Google Scholar
- Tinghui Zhou, Hanhuai Shan, Arindam Banerjee, and Guillermo Sapiro. 2012. Kernelized probabilistic matrix factorization: Exploiting graphs and side information. In Proceedings of the 2012 SIAM international Conference on Data mining. SIAM, 403--414.Google ScholarCross Ref
- Cai-Nicolas Ziegler, Sean M McNee, Joseph A Konstan, and Georg Lausen. 2005. Improving recommendation lists through topic diversification. In Proceedings of the 14th international conference on World Wide Web. ACM, 22--32. Google ScholarDigital Library
Index Terms
- HybridSVD: when collaborative information is not enough
Recommendations
Improving Top-N Recommendation for Cold-Start Users via Cross-Domain Information
Making accurate recommendations for cold-start users is a challenging yet important problem in recommendation systems. Including more information from other domains is a natural solution to improve the recommendations. However, most previous work in ...
EigenRec: generalizing PureSVD for effective and efficient top-N recommendations
We introduce EigenRec, a versatile and efficient latent factor framework for top-N recommendations that includes the well-known PureSVD algorithm as a special case. EigenRec builds a low-dimensional model of an inter-item proximity matrix that combines ...
Naïve filterbots for robust cold-start recommendations
KDD '06: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data miningThe goal of a recommender system is to suggest items of interest to a user based on historical behavior of a community of users. Given detailed enough history, item-based collaborative filtering (CF) often performs as well or better than almost any ...
Comments