RECORD
Incremental Collaborative Filtering Considering Temporal Effects
Information Retrieval · Submitted 24 Mar 2012
abstract compiled · 2026-09-23 · no language-model review
The authors' main claim The results show that the proposed algorithm is well suited for real-world recommendation scenarios which have a high throughput and are time sensitive.
The compiled record
The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.
Open the compiled record
The abstract, sentence by sentence
Recommender systems require their recommendation algorithms to be accurate, scalable and should handle very sparse training data which keep changing over time. Inspired by ant colony optimization, we propose a novel collaborative filtering scheme: Ant Collaborative Filtering that enjoys those favorable characteristics above mentioned. With the mechanism of pheromone transmission between users and items, our method can pinpoint most relative users and items even in face of the sparsity problem. By virtue of the evaporation of existing pheromone, we capture the evolution of user preference over time. Meanwhile, the computation complexity is comparatively small and the incremental update can be done online. We design three experiments on three typical recommender systems, namely movie recommendation, book recommendation and music recommendation, which cover both explicit and implicit rating data. The results show that the proposed algorithm is well suited for real-world recommendation scenarios which have a high throughput and are time sensitive.
background contribution method result interpretation main claim
| # | sentence | role | the authors' own work | states the main conclusion | strength |
|---|---|---|---|---|---|
| s0 | Recommender systems require their recommendation algorithms to be accurate, scalable and should handle very sparse training data which keep changing over time. | background 1.00 | 0.05 | 0.03 | asserted 1.00 |
| s1 | Inspired by ant colony optimization, we propose a novel collaborative filtering scheme: Ant Collaborative Filtering that enjoys those favorable characteristics above mentioned. | contribution 0.98 | 0.87 | 0.09 | asserted 0.99 |
| s2 | With the mechanism of pheromone transmission between users and items, our method can pinpoint most relative users and items even in face of the sparsity problem. | method 0.95 | 0.76 | 0.07 | asserted 0.85 |
| s3 | By virtue of the evaporation of existing pheromone, we capture the evolution of user preference over time. | method 0.96 | 0.79 | 0.05 | asserted 1.00 |
| s4 | Meanwhile, the computation complexity is comparatively small and the incremental update can be done online. | contribution 0.43 | 0.78 | 0.07 | asserted 0.99 |
| s5 | We design three experiments on three typical recommender systems, namely movie recommendation, book recommendation and music recommendation, which cover both explicit and implicit rating data. | method 0.95 | 0.95 | 0.03 | asserted 0.87 |
| s6 | The results show that the proposed algorithm is well suited for real-world recommendation scenarios which have a high throughput and are time sensitive. | interpretation 0.65 | 0.93 | 0.83 | asserted 1.00 |
What was examined, and what was not
- arXiv listing abstract v1
- full text
- figures and tables
- references and citing sentences
- relations to other papers
- P abstract
- S sections
- T body sentences
- C citations
- R cross-paper relations
The paper
Original abstract
Recommender systems require their recommendation algorithms to be accurate, scalable and should handle very sparse training data which keep changing over time. Inspired by ant colony optimization, we propose a novel collaborative filtering scheme: Ant Collaborative Filtering that enjoys those favorable characteristics above mentioned. With the mechanism of pheromone transmission between users and items, our method can pinpoint most relative users and items even in face of the sparsity problem. By virtue of the evaporation of existing pheromone, we capture the evolution of user preference over time. Meanwhile, the computation complexity is comparatively small and the incremental update can be done online. We design three experiments on three typical recommender systems, namely movie recommendation, book recommendation and music recommendation, which cover both explicit and implicit rating data. The results show that the proposed algorithm is well suited for real-world recommendation scenarios which have a high throughput and are time sensitive.
Human review
Discussion
Know something about this paper? Leave a comment, or highlight any passage above to comment on it.