ACM Home Page
Please provide us with feedback. Feedback
Ensemble methods for improving the performance of neighborhood-based collaborative filtering
Full text PdfPdf (432 KB)
Source
ACM Conference On Recommender Systems archive
Proceedings of the third ACM conference on Recommender systems table of contents
New York, New York, USA
SESSION: Short papers table of contents
Pages 261-264  
Year of Publication: 2009
ISBN:978-1-60558-435-5
Authors
Alon Schclar  Deutsche Telekom Laboratories at Ben-Gurion University, Ben-Gurion University of the Negev, Beer-Sheva, Israel
Alexander Tsikinovsky  Deutsche Telekom Laboratories at Ben-Gurion University, Beer-Sheva, Israel
Lior Rokach  Ben-Gurion University of the Negev, Beer-Sheva, Israel
Amnon Meisels  Ben-Gurion University of the Negev, Beer-Sheva, Israel
Liat Antwarg  Deutsche Telekom Laboratories at Ben-Gurion University, Ben-Gurion University of the Negev, Beer-Sheva, Israel
Sponsor
SIGCHI: ACM Special Interest Group on Computer-Human Interaction
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 18,   Downloads (12 Months): 18,   Citation Count: 0
Additional Information:

abstract   references   index terms  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1639714.1639763
What is a DOI?

ABSTRACT

Recommender systems provide consumers with ratings of items. These ratings are based on a set of ratings that were obtained from a wide scope of users. Predicting the ratings can be formulated as a regression problem. Ensemble regression methods are effective tools that improve the results of simple regression algorithms by iteratively applying the simple algorithm to a diverse set of inputs. The present paper describes a simple and effective ensemble regressor for the prediction of missing ratings in recommender systems. The ensemble method is an adaptation of the AdaBoost regression algorithm for recommendation tasks. In all iterations, interpolation weights for all nearest neighbors are simultaneously derived by minimizing the root mean squared error. From iteration to iteration instances that are hard to predict are reinforced by manipulating their weights in the goal function that needs to be minimized. The experimental evaluation demonstrates that the ensemble methodology significantly improves the predictive performance of single neighborhood-based collaborative filtering.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Netflix, inc. "netflix prize", www.netflixprize.com.
 
2
H. Drucker. Improving regressor using boosting. In D. H. Fisher Jr., editor, Proceedings of the 14th International Conference on Machine Learning, pages 107--115. Morgan Kaufmann, 1997.
 
3
Yoav Freund, Raj Iyer, Robert E. Schapire, and Yoram Singer. An efficient boosting algorithm for combining preferences. Journal of Machine Learning Research, 4:933--969, 2003.
 
4
Yehuda Koren. Factorization meets the neighborhood: a multifaceted collaborative filtering model. In KDD '08: Proceeding of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 426--434, New York, NY, USA, 2008. ACM.
 
5
Y. Koren R. M. Bell and C. Volinsky. The bellkor solution to the netflix prize, 2007.
 
6
Y. Koren R. M. Bell and C. Volinsky. Modeling relationships at multiple scales to improve accuracy of large recommender systems. In Proc. 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2007.
 
7
Lior Rokach. Taxonomy for characterizing ensemble methods in classification tasks: A review and annotated bibliography. Computational Statistics & Data Analysis, In Press, Corrected Proof:--, 2009.
 
8
D. P. Solomatine and D. L. Shrestha. Adaboost.rt: A boosting algorithm for regression problems. In Proceedings of the IEEE International Joint Conference on Neural Networks, pages 1163--1168, 2004.