Citation: UNSPECIFIED.
Full text not available from this repository. (Request a copy)Abstract
Recommendation systems manage information overload in order to present personalized content to users based on their interests. One of the most efficient recommendation approaches is collaborative filtering, through which recommendation is based on previously rated data. Collaborative filtering techniques feature impressive solutions for suggesting favourite items to certain users. However, recommendation methods fail to reflect fluctuations in users’ behaviour over time. In this article, we propose an adaptive collaborative filtering algorithm which takes time into account when predicting users’ behaviour. The transitive relationship from one user to another is considered when computing the similarity of two different users. We predict variations of users’ preferences using their profiles. Our experimental results show that the proposed algorithm is more accurate than the classical collaborative filtering technique.
Item Type: | Journal article |
---|---|
Uncontrolled Keywords: | collaborative filtering; time-sensitive recommendation; transitive similarity |
Subjects: | Q Science > QA Mathematics > QA76 Computer software |
Divisions: | Schools > Centre for Business, Information Technology and Enterprise > School of Business and Adminstration |
Depositing User: | Reza Rafeh |
Date Deposited: | 10 Jan 2017 20:22 |
Last Modified: | 21 Jul 2023 04:34 |
URI: | http://researcharchive.wintec.ac.nz/id/eprint/5107 |