Abstract

In the next generation of recommender systems, multi- criteria recommendation could be regarded as one of the most important branches. Compared with traditional recommender systems with usually one single rating, multi-criteria recommender systems have several ratings from different aspects, and generally describe users' interests more accurately. However, owing to the cost of ratings, multi-criteria recommender systems meet more severe data sparsity problem than traditional single criteria recommender systems. In this paper, We design a new approach to compute the similarity between users, which tackles the challenge posed by data sparsity that one cannot obtain the similarity between users with no common rated items. With a new method of data preprocessing, the features of items are combined to eliminate the effect of noise and evaluation scale. We model the aggregation function using support vector regression which is more accurate and robust than linear regression. The experiments demonstrate that our method produces a better performance, while providing more powerful suitability on sparse and noisy datasets.

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