Abstract

Memory-based collaborating filtering techniques are widely used in recommender systems. They are based on full initial ratings in a user-item matrix. However, most of the time in group recommender systems, this matrix is sparse and users’ preferences are unknown. This deficiency may make memory-based collaborative filtering unsuitable for group recommender systems. This paper, improves memory-based techniques for group recommendation systems by resolving the data sparsity problem. The core of the proposed method is based on a support vector machine learning model that computes similarities between items. This method employs calculated similarities and enhances basic memory-based techniques. Experiments demonstrate that the proposed method overcomes the memory-based techniques. It also indicates that the presented work outperforms the latent factor approach, which is very efficient in sparse conditions. Finally, it is indicated that the proposed method gives a better performance than existing approaches on generating group recommendations.

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.