Please use this identifier to cite or link to this item: http://idr.iimranchi.ac.in:8080/xmlui/handle/123456789/680
Title: Improving recommendation quality by identifying more similar neighbours in a collaborative filtering mechanism.
Authors: Kumar, Rahul.
Bala, Pradip Kumar.
Mukherjee, Shubhadeep.
Keywords: Collaborative filtering
Recommender systems
Similarity coefficient
True neighbours
Prediction algorithm
IIM Ranchi
Issue Date: Mar-2020
Publisher: International Journal of Operational Research
Citation: Kumar, R., Bala, P. K., & Mukherjee, S. (2020). Improving recommendation quality by identifying more similar neighbours in a collaborative filtering mechanism. International Journal of Operational Research, 38(3), 321-342.
Abstract: Recommender systems (RS) act as an information filtering technology to ease the decision-making process of online consumers. Of all the known recommendation techniques, collaborative filtering (CF) remains the most popular. CF mechanism is based on the principle of word-of-mouth communication between like-minded users who share similar historical rating preferences for a common set of items. Traditionally, only those like-minded or similar users of the given user are selected as neighbours who have rated the item under consideration. Resultantly, the similarity strength of neighbours deteriorates as the most similar users may not have rated that item. This paper proposes a new approach for neighbourhood formation by selecting more similar neighbours who have not necessarily rated the item under consideration. Owing to data sparsity, most of the selected neighbours have missing ratings which are predicted using a unique algorithm adopting item based regression. The efficacy of the proposed approach remains superior over existing methods.
URI: https://doi.org/10.1504/IJOR.2020.107532
http://idr.iimranchi.ac.in:8080/xmlui/handle/123456789/680
ISSN: 1745-7653
Appears in Collections:Journal Articles

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.