Online evolutionary collaborative filtering

115Citations
Citations of this article
114Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Collaborative filtering algorithms attempt to predict a user's interests based on his past feedback. In real world applications, a user's feedback is often continuously collected over a long period of time. It is very common for a user's interests or an item's popularity to change over a long period of time. Therefore, the underlying recommendation algorithm should be able to adapt to such changes accordingly. However, most existing algorithms do not distinguish current and historical data when predicting the users' current interests. In this paper, we consider a new problem - online evolutionary collaborative filtering, which tracks user interests over time in order to make timely recommendations. We extended the widely used neighborhood based algorithms by incorporating temporal information and developed an incremental algorithm for updating neighborhood similarities with new data. Experiments on two real world datasets demonstrated both improved effectiveness and efficiency of the proposed approach. Copyright 2010 ACM.

Cite

CITATION STYLE

APA

Liu, N. N., Zhao, M., Xiang, E., & Yang, Q. (2010). Online evolutionary collaborative filtering. In RecSys’10 - Proceedings of the 4th ACM Conference on Recommender Systems (pp. 95–102). Association for Computing Machinery. https://doi.org/10.1145/1864708.1864729

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free