Abstract

Finding relevant and interesting items on e-commerce websites is a major challenge in the information era. Recommender systems are widely used to help users deal with the information overload problem by giving them personalized recommendations. Furthermore, they help businesses make more profits. Collaborative filtering represents one of the most successful recommendation approaches. In general, several existing recommendation methods have demonstrated good performance in terms of prediction quality. However, they may require prohibitive computational times, and they often confront the sparsity problem, which negatively affects the efficiency of the system.In this paper, we propose a fast recommendation algorithm based on self-adaptation and multi-thresholding. It is designed to deal with the mentioned drawbacks, and improve the prediction quality. In addition, it is able to converge automatically. Extensive experiments on two real-world data sets demonstrate that our proposed method can achieve significantly better performance than other state-of-the-art methods. Particularly, it improves the MAE between 1.02% and 12.93%, and the computational time between 25.38% and 54.83%.

Full Text
Published version (Free)

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