arrow
Return

Time-Ordered Collaborative Filtering for News Recommendation

delete2015-12-01
delete48
PRE
AI
肖迎元 cover
肖迎元 (Yingyuan Xiao) *
P
Pengqiang Ai
C
Ching‐Hsien Hsu
王洪亚 cover
王洪亚 (Hongya Wang)
X
Xu Jiao
DOI:10.1109/CC.2015.7385528delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Faced with hundreds of thousands of news articles in the news websites, it is difficult for users to find the news articles they are interested in. Therefore, various news recommender systems were built. In the news recommendation, these news articles read by a user is typically in the form of a time sequence. However, traditional news recommendation algorithms rarely consider the time sequence characteristic of user browsing behaviors. Therefore, the performance of traditional news recommendation algorithms is not good enough in predicting the next news article which a user will read. To solve this problem, this paper proposes a time-ordered collaborative filtering recommendation algorithm (TOCF), which takes the time sequence characteristic of user behaviors into account. Besides, a new method to compute the similarity among different users, named time-dependent similarity, is proposed. To demonstrate the efficiency of our solution, extensive experiments are conducted along with detailed performance analysis.
Keywords:
time sequence
time-dependent similarity
time-ordered collaborative filtering
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

China Communications cover
China Communications
IF:
3.1
Papers:
1.9K
Citations:
5.0K

Organization

T
Tianjin University of Technology
Scholars:
8.8K
Papers: 5.9K
Citations: 1.0W