A Maximum Entropy Approach for Collaborative Filtering

Authors:
John Browning;David J. Miller
Affiliations:
Department of Electrical Engineering, The Pennsylvania State University, Rm 227-C EEW, University Park, PA 16802-2701, USA;Department of Electrical Engineering, The Pennsylvania State University, Rm 227-C EEW, University Park, PA 16802-2701, USA
Venue:
Journal of VLSI Signal Processing Systems
Year:
2004

Citing 11
Cited 3

On the minimum probability of error of classification with incomplete patterns

Pattern Recognition
A maximum entropy approach to natural language processing

Computational Linguistics
Inducing Features of Random Fields

IEEE Transactions on Pattern Analysis and Machine Intelligence
Minimax entropy principle and its application to texture modeling

Neural Computation
Probabilistic latent semantic indexing

Proceedings of the 22nd annual international ACM SIGIR conference on Research and development in information retrieval
SWAMI (poster session): a framework for collaborative filtering algorithm development and evaluation

SIGIR '00 Proceedings of the 23rd annual international ACM SIGIR conference on Research and development in information retrieval
Analysis of recommendation algorithms for e-commerce

Proceedings of the 2nd ACM conference on Electronic commerce
Latent Class Models for Collaborative Filtering

IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Approximate Maximum Entropy Joint Feature Inference Consistent with Arbitrary Lower-Order Probability Constraints: Application to Statistical Classification

Neural Computation
Empirical analysis of predictive algorithms for collaborative filtering

UAI'98 Proceedings of the Fourteenth conference on Uncertainty in artificial intelligence
General statistical inference for discrete and mixed spaces by an approximate application of the maximum entropy principle

IEEE Transactions on Neural Networks

Guest Editorial for Special Issue on Machine Learning for Signal Processing

Journal of VLSI Signal Processing Systems
Don't look stupid: avoiding pitfalls when recommending research papers

CSCW '06 Proceedings of the 2006 20th anniversary conference on Computer supported cooperative work
An entropy-based neighbor selection approach for collaborative filtering

Knowledge-Based Systems

Quantified Score

Hi-index	0.01

Visualization

Abstract

Collaborative filtering (CF) involves predicting the preferences of a user for a set of items given partial knowledge of the user's preferences for other items, while leveraging a database of profiles for other users. CF has applications e.g. in predicting Web sites a person will visit and in recommending products. Fundamentally, CF is a pattern recognition task, but a formidable one, often involving a huge feature space, a large data set, and many missing features. Even more daunting is the fact that a CF inference engine must be capable of predicting any (user-selected) items, given any available set of partial knowledge on the user's other preferences. In other words, the model must be designed to solve any of a huge (combinatoric) set of possible inference tasks. CF techniques include memory-based, classification-based, and statistical modelling approaches. Among these, modelling approaches scale best with large data sets and are the most adept at handling missing features. The disadvantage of these methods lies in the statistical assumptions (e.g. feature independence), which may be unjustified. To address this shortcoming we propose a new model-based CF method, based on the maximum entropy principle. For the MS Web application, the new method is demonstrated to outperform a number of CF approaches, including naive Bayes and latent variable (cluster) models, support vector machines (SVMs), and the (Pearson) correlation method.