Abstract

This paper focuses on the construction of collaborative filtering (CF) recommender systems for Web services. The main contribution of the proposed approach is to reduce the problems caused by sparse rating data - one of the main shortcomings of memory-base CF algorithms - using semantic markup of Web services. In the presented algorithm, the similarity between users is computed using the Pearson correlation coefficient, extended to consider also the ratings of users for similarity services. Likewise, to predict the rating a user would give to a target service, the algorithm considers the ratings of neighbor users for the target service and also for similar services. Experiments conducted to evaluate the algorithm show that our approach has a significant impact on the accuracy of the algorithm, particularly when rating data are sparse.

Full Text
Paper version not known

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.