GroupLens: an open architecture for collaborative filtering of netnews
CSCW '94 Proceedings of the 1994 ACM conference on Computer supported cooperative work
Recommending and evaluating choices in a virtual community of use
CHI '95 Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
Social information filtering: algorithms for automating “word of mouth”
CHI '95 Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
PHOAKS: a system for sharing recommendations
Communications of the ACM
Fab: content-based, collaborative recommendation
Communications of the ACM
GroupLens: applying collaborative filtering to Usenet news
Communications of the ACM
Learning and Revising User Profiles: The Identification ofInteresting Web Sites
Machine Learning - Special issue on multistrategy learning
CSCW '98 Proceedings of the 1998 ACM conference on Computer supported cooperative work
An algorithmic framework for performing collaborative filtering
Proceedings of the 22nd annual international ACM SIGIR conference on Research and development in information retrieval
Item-based collaborative filtering recommendation algorithms
Proceedings of the 10th international conference on World Wide Web
Collaborative filtering with privacy via factor analysis
SIGIR '02 Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval
E-Commerce Recommendation Applications
Data Mining and Knowledge Discovery
Amazon.com Recommendations: Item-to-Item Collaborative Filtering
IEEE Internet Computing
Collaborative filtering via gaussian probabilistic latent semantic analysis
Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval
Latent semantic models for collaborative filtering
ACM Transactions on Information Systems (TOIS)
ACM Transactions on Information Systems (TOIS)
Item-based top-N recommendation algorithms
ACM Transactions on Information Systems (TOIS)
An automatic weighting scheme for collaborative filtering
Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval
Fast maximum margin matrix factorization for collaborative prediction
ICML '05 Proceedings of the 22nd international conference on Machine learning
Effective missing data prediction for collaborative filtering
SIGIR '07 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval
Efficient bayesian hierarchical user modeling for recommendation system
SIGIR '07 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval
Learning multiple graphs for document recommendations
Proceedings of the 17th international conference on World Wide Web
Bayesian probabilistic matrix factorization using Markov chain Monte Carlo
Proceedings of the 25th international conference on Machine learning
EigenRank: a ranking-oriented approach to collaborative filtering
Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval
SoRec: social recommendation using probabilistic matrix factorization
Proceedings of the 17th ACM conference on Information and knowledge management
Learning to recommend with social trust ensemble
Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval
Empirical analysis of predictive algorithms for collaborative filtering
UAI'98 Proceedings of the Fourteenth conference on Uncertainty in artificial intelligence
Introduction to social computing
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part II
Hi-index | 0.00 |
Collaborative Filtering, considered by many researchers as the most important technique for information filtering, has been extensively studied by both academic and industrial communities. One of the most popular approaches to collaborative filtering recommendation algorithms is based on low-dimensional factor models. The assumption behind such models is that a user's preferences can be modeled by linearly combining item factor vectors using user-specific coefficients. In this paper, aiming at several aspects ignored by previous work, we propose a semi-nonnegative matrix factorization method with global statistical consistency. The major contribution of our work is twofold: (1) We endow a new understanding on the generation or latent compositions of the user-item rating matrix. Under the new interpretation, our work can be formulated as the semi-nonnegative matrix factorization problem. (2) Moreover, we propose a novel method of imposing the consistency between the statistics given by the predicted values and the statistics given by the data. We further develop an optimization algorithm to determine the model complexity automatically. The complexity of our method is linear with the number of the observed ratings, hence it is scalable to very large datasets. Finally, comparing with other state-of-the-art methods, the experimental analysis on the EachMovie dataset illustrates the effectiveness of our approach.