Abstract
Collaborative filtering is a technique widely used in recommender systems. Based on the behaviors of users with similar taste, the technique can predict and recommend products the current user is likely interested in, thus alleviates the information overload problem for Internet users. The most popular collaborative filtering approach is based on the similarity between users, or between products. The quality of similarity measure, therefore, has a large impact on the recommendation accuracy. In this paper, we propose a new similarity measure based on graph models. The similarity between two users (or symmetrically, two products) is computed from connections on a graph with vertices beeing users and products. The computed similarity measure is then used with k – nearest neighbor algorithm to generate predictions. Empirical results on real movie datasets show that the proposed method significantly outperforms both collaborative filtering with traditional similarity measures and pure graph-based collaborative filtering.
Sign-in/Register to access full text options 
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 callMore From: Các công trình nghiên cứu, phát triển và ứng dụng Công nghệ Thông tin và Truyền thông
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.
