Precedence mining in group recommender systems

6Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We extend the Precedence mining model for personal recommendation as outlined in Parameswaran et.al., [6] in three different ways. Firstly, we show how precedence mining model can be used for recommending items of interest to a group of users (group recommendation) and compare and contrast our model with traditional group recommendation models like collaborative and Hybrid. Secondly, we extend the precedence mining model to incorporate ratings for items and experimental results show that the goodness of recommendation is improved. The third extension is related to the issue of new items being ignored which is a fundamental problem plaguing collaborative and precedence mining algorithms. When recommendations are based on other users interests (like in Collaborative recommender systems) the possibility of not recommending a new item which has not been consumed by many of the users is high though the new item may be of interest to the target user. We outline two models, Vector precedence-mining and Hybrid precedence-mining that addresses this issue. © Springer-Verlag 2013.

Cite

CITATION STYLE

APA

Kagita, V. R., Padmanabhan, V., & Pujari, A. K. (2013). Precedence mining in group recommender systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8251 LNCS, pp. 701–707). https://doi.org/10.1007/978-3-642-45062-4_99

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free