An analysis of group recommendation heuristics for high- and low-involvement items

21Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Group recommender systems are based on aggregation heuristics that help to determine a recommendation for a group. These heuristics aggregate the preferences of individual users in order to reflect the preferences of the whole group. There exist a couple of different aggregation heuristics (e.g., most pleasure, least misery, and average voting) that are applied in group recommendation scenarios. However, to some extent it is still unclear which heuristics should be applied in which context. In this paper, we analyze the impact of the item domain (low involvement vs. high involvement) on the appropriateness of aggregation heuristics (we use restaurants as an example of low-involvement items and shared apartments as an example of high-involvement ones). The results of our study show that aggregation heuristics in group recommendation should be tailored to the underlying item domain.

Cite

CITATION STYLE

APA

Felfernig, A., Atas, M., Tran, T. N. T., Stettinger, M., Erdeniz, S. P., & Leitner, G. (2017). An analysis of group recommendation heuristics for high- and low-involvement items. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10350 LNCS, pp. 335–344). Springer Verlag. https://doi.org/10.1007/978-3-319-60042-0_39

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