A NEW CURVE FITTING BASED RATING PREDICTION ALGORITHM FOR RECOMMENDER SYSTEMS

Creative Commons License

Ar Y., Amrahov Ş., Gasilov N., Yiğit Sert S.

KYBERNETIKA, cilt.58, sa.3, ss.440-455, 2022 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 58 Sayı: 3
  • Basım Tarihi: 2022
  • Doi Numarası: 10.14736/kyb-2022-3-0440
  • Dergi Adı: KYBERNETIKA
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus, Linguistic Bibliography, zbMATH
  • Sayfa Sayıları: ss.440-455
  • Anahtar Kelimeler: recommender systems, collaborative filtering, curve fitting, MATRIX FACTORIZATION, SOCIAL NETWORKS, INFORMATION, ONTOLOGY
  • Ankara Üniversitesi Adresli: Evet

Özet

The most algorithms for Recommender Systems (RSs) are based on a Collaborative Filtering (CF) approach, in particular on the Probabilistic Matrix Factorization (PMF) method. It is known that the PMF method is quite successful for the rating prediction. In this study, we consider the problem of rating prediction in RSs. We propose a new algorithm which is also in the CF framework; however, it is completely different from the PMF-based algorithms. There are studies in the literature that can increase the accuracy of rating prediction by using additional information. However, we seek the answer to the question that if the input data does not contain additional information, how we can increase the accuracy of rating prediction. In the proposed algorithm, we construct a curve (a low-degree polynomial) for each user using the sparse input data and by this curve, we predict the unknown ratings of items. The proposed algorithm is easy to implement. The main advantage of the algorithm is that the running time is polynomial, namely it is theta(n2), for sparse matrices. Moreover, in the experiments we get slightly more accurate results compared to the known rating prediction algorithms.