EconPapers    
Economics at your fingertips  
 

An empirical study of the recursive input generation algorithm for memory-based collaborative filtering recommender systems

Serhiy Morozov and Hossein Saiedian

International Journal of Information and Decision Sciences, 2013, vol. 5, issue 1, 36-49

Abstract: Recommender system research has gained popularity recently because many businesses are willing to pay for a way to predict future user opinions. Such knowledge could simplify decision-making, improve customer satisfaction, and increase sales. We focus on the recommendation accuracy of memory-based collaborative filtering recommender systems and propose a novel input generation algorithm that helps identify a small group of relevant ratings. Any combination algorithm can be used to generate a recommendation from such ratings. We attempt to improve the quality of these ratings through recursive sorting. Finally, we demonstrate the effectiveness of our approach on the Netflix dataset, a popular, large, and extremely sparse collection of movie ratings.

Keywords: recommender systems; recommendation accuracy; consumer behaviour; behaviour prediction; input generation algorithms; memory based collaborative filtering; recursive sorting; movie ratings; film ratings. (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=52020 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijidsc:v:5:y:2013:i:1:p:36-49

Access Statistics for this article

More articles in International Journal of Information and Decision Sciences from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().

 
Page updated 2025-03-19
Handle: RePEc:ids:ijidsc:v:5:y:2013:i:1:p:36-49