dc.contributor.author |
Almu, A |
|
dc.contributor.author |
Bello, Z |
|
dc.date.accessioned |
2021-04-02T19:10:38Z |
|
dc.date.available |
2021-04-02T19:10:38Z |
|
dc.date.issued |
2021-02 |
|
dc.identifier.issn |
2349-7084 |
|
dc.identifier.uri |
http://hdl.handle.net/123456789/948 |
|
dc.description.abstract |
Similarity measure is the fundamental component used in collaborative filtering recommendation technique to provide ratings prediction to users by employing either item-based or user-based recommender algorithms. The collaborative filtering has been widely implemented using various similarity measures but ignores to consider the time taken by the similarity measures to make accurate predictions in different application domains. This paper attempted to assist recommender systems developers to understand appropriate similarity measure depending on the application domain under consideration with less execution time and error rate. It also takes the effect of neighbrhood sizes (k) on the prediction accuracy and efficiency into consideration. The experimental evaluations were conducted on the four similarity measures with the same dataset using Python programming language implementation. The evaluation metrics considered during the experiments are Execution Time, Mean Absolute Error and Root Mean Square Error. The results of the evaluation demonstrated that, Manhattan Distance similarity measure had the best accuracy as well as efficiency of predictions in this study |
en_US |
dc.language.iso |
en |
en_US |
dc.publisher |
International Journal of Computer Engineering in Research Trends |
en_US |
dc.subject |
Department of Mathematics |
en_US |
dc.title |
An Experimental Study on the Accuracy and Efficiency of Some Similarity Measures for Collaborative Filtering Recommender Systems |
en_US |
dc.type |
Article |
en_US |