Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6874328 | Journal of Computational Science | 2018 | 33 Pages |
Abstract
Due to a busy schedule, people highly dependent on various kinds of online recommendations to utilize their precious time. The collaborative filtering is wide as the recommendation tool in the majority of the commercial recommenders. However, the outcome of collaborative filtering is often jeopardized by the sparsity, cold start, and grey sheep problems. To solve these issues in a more efficient way, a novel collaborative filtering algorithm entitled as Altered Client-based Collaborative Filtering (ACCF) for group recommendation is proposed. ACCF employs Dragonfly Algorithm to deal with the sparsity and neighbor selection. Restaurant recommendation system is utilized as a test bed for the validation of ACCF. With the end goal of performance assessment, a comparative study has been incorporated that depicts the proposed algorithm successfully minimizes the sparsity problem. The experimental outcome rendering ACCF provides 37%, 59%, 53% more Coverage, Precision and F-Measure than the user-based collaborative filtering even applicable for a small sample of data.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Arup Roy, Soumya Banerjee, Manash Sarkar, Ashraf Darwish, Mohamed Elhoseny, Aboul Ella Hassanien,