Hybrid Recommender Systems: Survey and Experiments
User Modeling and User-Adapted Interaction
Latent semantic models for collaborative filtering
ACM Transactions on Information Systems (TOIS)
Large Margin Methods for Structured and Interdependent Output Variables
The Journal of Machine Learning Research
Fast maximum margin matrix factorization for collaborative prediction
ICML '05 Proceedings of the 22nd international conference on Machine learning
Training linear SVMs in linear time
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Major components of the gravity recommendation system
ACM SIGKDD Explorations Newsletter - Special issue on visual analytics
COLT'05 Proceedings of the 18th annual conference on Learning Theory
Collaborative prediction and ranking with non-random missing data
Proceedings of the third ACM conference on Recommender systems
Optimizing multiple objectives in collaborative filtering
Proceedings of the fourth ACM conference on Recommender systems
Goal-driven collaborative filtering – a directional error based approach
ECIR'2010 Proceedings of the 32nd European conference on Advances in Information Retrieval
Co-factorization machines: modeling user interests and predicting individual decisions in Twitter
Proceedings of the sixth ACM international conference on Web search and data mining
ACM Transactions on Intelligent Systems and Technology (TIST) - Special Section on Intelligent Mobile Knowledge Discovery and Management Systems and Special Issue on Social Web Mining
Hi-index | 0.00 |
We present a flexible approach to collaborative filtering which stems from basic research results. The approach is flexible in several dimensions: We introduce an algorithm where the loss can be tailored to a particular recommender problem. This allows us to optimize the prediction quality in a way that matters for the specific recommender system. The introduced algorithm can deal with structured estimation of the predictions for one user. The most prominent outcome of this is the ability of learning to rank items along user preferences. To this end, we also present a novel algorithm to compute the ordinal loss in O(n log(n)) as apposed to O(n2). We extend this basic model such that it can accommodate user and item offsets as well as user and item features if they are present. The latter unifies collaborative filtering with content based filtering. We present an analysis of the algorithm which shows desirable properties in terms of privacy needs of users, parallelization of the algorithm as well as collaborative filtering as a service. We evaluate the algorithm on data provided by WikiLens. This data is a cross-domain data set as it contains ratings on items from a vast array of categories. Evaluation shows that cross-domain prediction is possible.