GroupLens: an open architecture for collaborative filtering of netnews
CSCW '94 Proceedings of the 1994 ACM conference on Computer supported cooperative work
Item-based collaborative filtering recommendation algorithms
Proceedings of the 10th international conference on World Wide Web
Cumulated gain-based evaluation of IR techniques
ACM Transactions on Information Systems (TOIS)
Eigentaste: A Constant Time Collaborative Filtering Algorithm
Information Retrieval
Amazon.com Recommendations: Item-to-Item Collaborative Filtering
IEEE Internet Computing
Collaborative Filtering by Personality Diagnosis: A Hybrid Memory and Model-Based Approach
UAI '00 Proceedings of the 16th Conference on Uncertainty in Artificial Intelligence
Optimizing search engines using clickthrough data
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
The Journal of Machine Learning Research
Web metasearch: rank vs. score based rank aggregation methods
Proceedings of the 2003 ACM symposium on Applied computing
Collaborative filtering with decoupled models for preferences and ratings
CIKM '03 Proceedings of the twelfth international conference on Information and knowledge management
Latent semantic models for collaborative filtering
ACM Transactions on Information Systems (TOIS)
Scalable collaborative filtering using cluster-based smoothing
Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval
Query chains: learning to rank from implicit feedback
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Learning to rank: from pairwise approach to listwise approach
Proceedings of the 24th 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
EigenRank: a ranking-oriented approach to collaborative filtering
Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval
Journal of Artificial Intelligence Research
Probabilistic latent semantic analysis
UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence
Empirical analysis of predictive algorithms for collaborative filtering
UAI'98 Proceedings of the Fourteenth conference on Uncertainty in artificial intelligence
List-wise learning to rank with matrix factorization for collaborative filtering
Proceedings of the fourth ACM conference on Recommender systems
Adapting neighborhood and matrix factorization models for context aware recommendation
Proceedings of the Workshop on Context-Aware Movie Recommendation
Mining mood-specific movie similarity with matrix factorization for context-aware recommendation
Proceedings of the Workshop on Context-Aware Movie Recommendation
Informative household recommendation with feature-based matrix factorization
Proceedings of the 2nd Challenge on Context-Aware Movie Recommendation
Towards mobile intelligence: Learning from GPS history data for collaborative recommendation
Artificial Intelligence
Feature based informative model for discriminating favorite items from unrated ones
APWeb'12 Proceedings of the 14th Asia-Pacific international conference on Web Technologies and Applications
CLiMF: learning to maximize reciprocal rank with collaborative less-is-more filtering
Proceedings of the sixth ACM conference on Recommender systems
Social contextual recommendation
Proceedings of the 21st ACM international conference on Information and knowledge management
Social recommendation across multiple relational domains
Proceedings of the 21st ACM international conference on Information and knowledge management
Adapting vector space model to ranking-based collaborative filtering
Proceedings of the 21st ACM international conference on Information and knowledge management
A latent pairwise preference learning approach for recommendation from implicit feedback
Proceedings of the 21st ACM international conference on Information and knowledge management
A modified random walk framework for handling negative ratings and generating explanations
ACM Transactions on Intelligent Systems and Technology (TIST) - Special section on twitter and microblogging services, social recommender systems, and CAMRa2010: Movie recommendation in context
Social temporal collaborative ranking for context aware movie recommendation
ACM Transactions on Intelligent Systems and Technology (TIST) - Special section on twitter and microblogging services, social recommender systems, and CAMRa2010: Movie recommendation in context
Mining contextual movie similarity with matrix factorization for context-aware recommendation
ACM Transactions on Intelligent Systems and Technology (TIST) - Special section on twitter and microblogging services, social recommender systems, and CAMRa2010: Movie recommendation in context
Unifying rating-oriented and ranking-oriented collaborative filtering for improved recommendation
Information Sciences: an International Journal
GAPfm: optimal top-n recommendations for graded relevance domains
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Pairwise learning in recommendation: experiments with community recommendation on linkedin
Proceedings of the 7th ACM conference on Recommender systems
Retargeted matrix factorization for collaborative filtering
Proceedings of the 7th ACM conference on Recommender systems
Hi-index | 0.00 |
A central goal of collaborative filtering (CF) is to rank items by their utilities with respect to individual users in order to make personalized recommendations. Traditionally, this is often formulated as a rating prediction problem. However, it is more desirable for CF algorithms to address the ranking problem directly without going through an extra rating prediction step. In this paper, we propose the probabilistic latent preference analysis (pLPA) model for ranking predictions by directly modeling user preferences with respect to a set of items rather than the rating scores on individual items. From a user's observed ratings, we extract his preferences in the form of pairwise comparisons of items which are modeled by a mixture distribution based on Bradley-Terry model. An EM algorithm for fitting the corresponding latent class model as well as a method for predicting the optimal ranking are described. Experimental results on real world data sets demonstrated the superiority of the proposed method over several existing CF algorithms based on rating predictions in terms of ranking performance measure NDCG.