Next Article in Journal
Modeling Hourly Soil Temperature Using Deep BiLSTM Neural Network
Next Article in Special Issue
Towards Cognitive Recommender Systems
Previous Article in Journal
Approximate Triangulations of Grassmann Manifolds
Previous Article in Special Issue
A Hybrid Ontology-Based Recommendation System in e-Commerce
Article

An Algorithm for Density Enrichment of Sparse Collaborative Filtering Datasets Using Robust Predictions as Derived Ratings

1
Department of Informatics and Telecommunications, University of Athens, 15784 Athens, Greece
2
Department of Informatics and Telecommunications, University of the Peloponnese, 22131 Tripolis, Greece
3
Department of Digital Systems, University of the Peloponnese, 23100 Sparti, Greece
*
Author to whom correspondence should be addressed.
Algorithms 2020, 13(7), 174; https://doi.org/10.3390/a13070174
Received: 23 April 2020 / Revised: 9 July 2020 / Accepted: 13 July 2020 / Published: 17 July 2020
(This article belongs to the Special Issue Algorithms for Personalization Techniques and Recommender Systems)
Collaborative filtering algorithms formulate personalized recommendations for a user, first by analysing already entered ratings to identify other users with similar tastes to the user (termed as near neighbours), and then using the opinions of the near neighbours to predict which items the target user would like. However, in sparse datasets, too few near neighbours can be identified, resulting in low accuracy predictions and even a total inability to formulate personalized predictions. This paper addresses the sparsity problem by presenting an algorithm that uses robust predictions, that is predictions deemed as highly probable to be accurate, as derived ratings. Thus, the density of sparse datasets increases, and improved rating prediction coverage and accuracy are achieved. The proposed algorithm, termed as CFDR, is extensively evaluated using (1) seven widely-used collaborative filtering datasets, (2) the two most widely-used correlation metrics in collaborative filtering research, namely the Pearson correlation coefficient and the cosine similarity, and (3) the two most widely-used error metrics in collaborative filtering, namely the mean absolute error and the root mean square error. The evaluation results show that, by successfully increasing the density of the datasets, the capacity of collaborative filtering systems to formulate personalized and accurate recommendations is considerably improved. View Full-Text
Keywords: recommender systems; collaborative filtering; sparse datasets; density enrichment; robust predictions; derived ratings; rating prediction coverage; rating prediction accuracy recommender systems; collaborative filtering; sparse datasets; density enrichment; robust predictions; derived ratings; rating prediction coverage; rating prediction accuracy
Show Figures

Graphical abstract

MDPI and ACS Style

Margaris, D.; Spiliotopoulos, D.; Karagiorgos, G.; Vassilakis, C. An Algorithm for Density Enrichment of Sparse Collaborative Filtering Datasets Using Robust Predictions as Derived Ratings. Algorithms 2020, 13, 174. https://doi.org/10.3390/a13070174

AMA Style

Margaris D, Spiliotopoulos D, Karagiorgos G, Vassilakis C. An Algorithm for Density Enrichment of Sparse Collaborative Filtering Datasets Using Robust Predictions as Derived Ratings. Algorithms. 2020; 13(7):174. https://doi.org/10.3390/a13070174

Chicago/Turabian Style

Margaris, Dionisis; Spiliotopoulos, Dimitris; Karagiorgos, Gregory; Vassilakis, Costas. 2020. "An Algorithm for Density Enrichment of Sparse Collaborative Filtering Datasets Using Robust Predictions as Derived Ratings" Algorithms 13, no. 7: 174. https://doi.org/10.3390/a13070174

Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Search more from Scilit
 
Search
Back to TopTop