Collaborative filtering on skewed datasets

Authors:
Somnath Banerjee;Krishnan Ramanathan
Affiliations:
Hewlett-Packard Labs, Bangalore, India;Hewlett-Packard Labs, Bangalore, India
Venue:
Proceedings of the 17th international conference on World Wide Web
Year:
2008

Citing 4
Cited 4

Latent semantic models for collaborative filtering

ACM Transactions on Information Systems (TOIS)
Mining Skewed and Sparse Transaction Data for Personalized Shopping Recommendation

Machine Learning
Toward the Next Generation of Recommender Systems: A Survey of the State-of-the-Art and Possible Extensions

IEEE Transactions on Knowledge and Data Engineering
Google news personalization: scalable online collaborative filtering

Proceedings of the 16th international conference on World Wide Web

Improving Recommender Systems by Incorporating Social Contextual Information

ACM Transactions on Information Systems (TOIS)
Response prediction using collaborative filtering with hierarchies and side-information

Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Impact of data characteristics on recommender systems performance

ACM Transactions on Management Information Systems (TMIS)
Constructing a user similarity network to remove adverse influence of popular objects for personalized recommendation

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many real life datasets have skewed distributions of events when the probability of observing few events far exceeds the others. In this paper, we observed that in skewed datasets the state of the art collaborative filtering methods perform worse than a simple probabilistic model. Our test bench includes a real ad click stream dataset which is naturally skewed. The same conclusion is obtained even from the popular movie rating dataset when we pose a binary prediction problem of whether a user will give maximum rating to a movie or not.