Forgetting methods for incremental matrix factorization in recommender systems
Open Access
- 13 April 2015
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 947-953
Abstract
Numerous stream mining algorithms are equipped with forgetting mechanisms, such as sliding windows or fading factors, to make them adaptive to changes. In recommender systems those techniques have not been investigated thoroughly despite the very volatile nature of users' preferences that they deal with. We developed five new forgetting techniques for incremental matrix factorization in recommender systems. We show on eight datasets that our techniques improve the predictive power of recommender systems. Experiments with both explicit rating feedback and positive-only feedback confirm our findings showing that forgetting information is beneficial despite the extreme data sparsity that recommender systems struggle with. Improvement through forgetting also proves that users' preferences are subject to concept drift.Keywords
Funding Information
- European Commission (ICT-2013-612944)
- Fundação para a Ciência e a Tecnologia (-01-0124-FEDER-037281)
This publication has 14 references indexed in Scilit:
- Selective Forgetting for Incremental Matrix Factorization in Recommender SystemsLecture Notes in Computer Science, 2014
- Online learning for collaborative filtering2012
- Performance of recommender algorithms on top-n recommendation tasks2010
- Music Recommendation and Discovery2010
- Issues in evaluation of stream learning algorithms2009
- Incremental Collaborative Filtering for Binary Ratings2008
- Trust-aware recommender systems2007
- Collaborative filtering on streaming data with interest-driftingIntelligent Data Analysis: An International Journal, 2007
- Time weight collaborative filtering2005
- Using Linear Algebra for Intelligent Information RetrievalSIAM Review, 1995