Abstract

Collaborative Filtering (CF) approaches have been widely used in various applications of recommender systems. These methods are based on estimating the similarity between users/items by analyzing the ratings provided by users. The existing methods are often domain-specific and have not considered the time of the ratings being made in the calculation of the similarity. However, users' preferences vary over time, and so their similarity. In this paper, a novel method is proposed by re-ranking the users/items neighborhood set considering their future similarity trend. The trend of similarity is predicted, and depending on increased/decreased trend, we update the final nearest neighbor sets that are used in CF formulation. This method can be applied on a broad range of CF methods that are based on similarities between users and/or items. We apply the proposed approach on a set of CF algorithms over two benchmark datasets and show that the proposed approach significantly improves the performance of the original CF recommenders. As the proposed method only re-ranks the neighborhood set, it can be applied to any existing non-temporal similarity-based CF recommenders to improve their performance.

Highlights

  • Providing personalized user experience is a critical issue for product/service providers on the Web

  • Our experiments on benchmark datasets show that the proposed method significantly improves the performance of many similaritybased Collaborative Filtering (CF) recommenders

  • Time-unaware RSs mostly split data randomly, in time-aware RSs the order of ratings is important [46]

Read more

Summary

INTRODUCTION

Providing personalized user experience is a critical issue for product/service providers on the Web. Global industry firms have applied RSs to predict the potential preferences of customers and recommend relevant products/services to them This approach has improved the user experience and made a huge impact on their commercial success [1]. Along with using rating information, there is other valuable information that is not often considered in classical RSs, including time, device type, and location Considering such extra information often improves the quality of recommendations [15,16,17,18]. To address the above issues, in this manuscript, a novel method is proposed to add valuable time information to similarity-based RSs. The proposed method can be applied to all similarity-based RSs available in the literature to improve the performance of their recommendations.

RELATED WORKS
SEQUENTIAL PATTERN REPRESENTATION
PREDICTING SIMILARITY TREND
OBTAINING SIMILARITY TREND BETWEEN USERS
OBTAINING THE NEAREST NEIGHBORHOOD SET
RECOMMENDATION
EXPERIMENTAL RESULTS
BENCHMARK ALGORITHMS
DATASET
EVALUATION METRICS
RESULTS
CONCLUSIONS

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.