A continuous weighted low-rank approximation for collaborative filtering problems

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Collaborative filtering is a recent technique that recommends products to customers using other users' preference data. The performance of a collaborative filtering system generally degrades when the number of customers and products increases, hence the dimensionality of filtering database needs to be reduced. In this paper, we discuss the use of weighted low rank matrix approximation to reduce the dimensionality of a partially known dataset in a collaborative filtering system. Particularly, we introduce a projected gradient flow approach to compute a weighted low rank approximation of the dataset matrix. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Del Buono, N., & Politi, T. (2005). A continuous weighted low-rank approximation for collaborative filtering problems. In Lecture Notes in Computer Science (Vol. 3686, pp. 45–53). Springer Verlag. https://doi.org/10.1007/11551188_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free