Abstract
Recommender systems are one of the most important technologies in the electronic commerce system. In a collaborative filtering recommendation algorithm, similarity calculation is the key to determining the efficiency of the recommendation algorithm. This paper analyzes the shortcomings of traditional similarity measurement methods in recommender systems and proposes a scoring-matrix-filling algorithm. Based on information categories and user interest similarity, the algorithm can reduce the negative influence of data sparsity on the recommendation result to some extent. The research results have certain practical and guiding significance.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.