Name
Abstract | ||
|---|---|---|
Collaborative filtering (CF) approaches are widely applied in recommender systems. Traditional CF approaches have high costs to train the models and cannot capture changes in user interests and item popularity. Most CF approaches assume that user interests remain unchanged throughout the whole process. However, user preferences are always evolving and the popularity of items is always changing. Additionally, in a sparse matrix, the amount of known rating data is very small. In this paper, we propose a method of online collaborative filtering with dynamic regularization (OCF-DR), that considers dynamic information and uses the neighborhood factor to track the dynamic change in online collaborative filtering (OCF). The results from experiments on the MovieLens100K, MovieLens1M, and HetRec2011 datasets show that the proposed methods are significant improvements over several baseline approaches. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.ins.2019.07.093 | Information Sciences |
Keywords | Field | DocType |
Collaborative filtering,Dynamic regularization,Online collaborative filtering,Neighborhood factor | Recommender system,Collaborative filtering,Popularity,Regularization (mathematics),Artificial intelligence,Machine learning,Mathematics,Sparse matrix | Journal |
Volume | ISSN | Citations |
505 | 0020-0255 | 1 |
PageRank | References | Authors |
0.36 | 0 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kangkang Li | 1 | 2 | 0.71 |
| Xiuze Zhou | 2 | 17 | 4.14 |
| Fan Lin | 3 | 67 | 15.98 |
| Wenhua Zeng | 4 | 136 | 14.83 |
| Beizhan Wang | 5 | 8 | 4.25 |
| Gil Alterovitz | 6 | 155 | 18.52 |