Abstract
In modern collaborative filtering applications initial data are typically very large (holding millions of users and items) and come in real time.In this case only incremental algorithms are practically efficient. In this paper a new algorithm based on the symbiosis of Incremental Singular Value Decomposition (ISVD) and Generalized Hebbian Algorithm (GHA) is proposed. The algorithm does not require to store the initial data matrix and effectively updates user/item profiles when a new user or a new item appears or a matrix cell is modified. The results of experiments show how root mean square error (RMSE) depends on the number of algorithm’s iterations and data amount.
Chapter PDF
References
Brand, M.: Fast Low-rank modifications of the thin singular value decomposition. Linear Algebra and Its Applications 415(1), 20–30 (2006)
Takacs, G., Pilaszy, I., Nemeth, B., Tikk, D.: Scalable Collaborative Filtering Approaches for Large Recommender Systems. The Journal of Machine Learning Research 10, 623–656 (2009)
Gorrell, G.: Generalized Hebbian Algorithm for Incremental Singular Value Decomposition in Natural Language Processing. In: Proceedings of EACL (2006)
Golub, G.: Matrix Computations, p. 728. Johns Hopkins University Press (1996)
Brand, M.: Fast online SVD revisions for lightweight recommender systems. In: SIAM International Conference on Data Mining (SDM) (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Polezhaeva, E. (2011). Incremental Methods in Collaborative Filtering for Ordinal Data. In: Kuznetsov, S.O., Mandal, D.P., Kundu, M.K., Pal, S.K. (eds) Pattern Recognition and Machine Intelligence. PReMI 2011. Lecture Notes in Computer Science, vol 6744. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21786-9_73
Download citation
DOI: https://doi.org/10.1007/978-3-642-21786-9_73
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21785-2
Online ISBN: 978-3-642-21786-9
eBook Packages: Computer ScienceComputer Science (R0)