Abstract
Matrix factorization is a prominent technique for approximate matrix reconstruction and noise reduction. Its common appeal is attributed to its space efficiency and its ability to generalize with missing information. For these reasons, matrix factorization is central to collaborative filtering systems. In the real world, such systems must deal with million of users and items, and they are highly dynamic as new users and new items are constantly added. Factorization techniques, however, have difficulties to cope with such a demanding environment. Whereas they are well understood with static data, their ability to efficiently cope with new and dynamic data is limited. Scaling to extremely large numbers of users and items is also problematic. In this work, we propose to use the count sketching technique for representing the latent factors with extreme compactness, facilitating scaling.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Charikar, M., Chen, K., Farach-Colton, M.: Finding frequent items in data streams. In: ICALP (2002)
Cormode, G.: Sketch techniques for approximate query processing. In: Foundations and Trends in Databases. NOW publishers (2011)
Karatzoglou, A., Weimer, M., Smola, A.J.: Collaborative filtering on a budget. In: AISTATS (2010)
Koren, Y., Bell, R., Volinsky, C.: Matrix factorization techniques for recommender systems. Computer 8, 30–37 (2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Balu, R., Furon, T., Amsaleg, L. (2016). Sketching Techniques for Very Large Matrix Factorization. In: Ferro, N., et al. Advances in Information Retrieval. ECIR 2016. Lecture Notes in Computer Science(), vol 9626. Springer, Cham. https://doi.org/10.1007/978-3-319-30671-1_68
Download citation
DOI: https://doi.org/10.1007/978-3-319-30671-1_68
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-30670-4
Online ISBN: 978-3-319-30671-1
eBook Packages: Computer ScienceComputer Science (R0)