Etd

Addressing the Data Recency Problem in Collaborative Filtering Systems

Public

Downloadable Content

open in viewer

Recommender systems are being widely applied in many E-commerce sites to suggest products, services, and information items to potential users. Collabora-tive filtering systems, the most successful recommender system technology to date, help people make choices based on the opinions of other people. While collaborative filtering systems have been a substantial success, there are sev-eral problems that researchers and commercial applications have identified: the early rater problem, the sparsity problem, and the large scale problem. Moreover, existing collaborative filtering systems do not consider data re-cency. For this reason, if a user¡¯s preferences have changed over time, the sys-tems might not recognize it quickly. This thesis studies how to apply data re-cency to collaborative filtering systems to get more predictive accuracy. We define the data recency problem as the negative impact of old data on the pre-dictive accuracy of collaborative filtering systems. In order to mitigate this shortcoming, the combinations of time-based forgetting mechanisms, pruning and non-pruning strategies and linear and kernel functions, are utilized to ap-ply weights. A clustering technique is employed to detect the user¡¯s changing preferences. We apply our research approach to the DeliBook dataset. The goal of our experiments is to show that our algorithm that incorporates tempo-ral factors provides better recommendations than existing methods.

Creator
Contributors
Degree
Unit
Publisher
Language
  • English
Identifier
  • etd-09244-024515
Keyword
Advisor
Defense date
Year
  • 2004
Date created
  • 2004-09-24
Resource type
Rights statement

Relations

In Collection:

Items

Items

Permanent link to this page: https://digital.wpi.edu/show/wd375w32h