Article thumbnail

Group Recommendation with Temporal Affinities

By Sihem Amer-Yahia, Behrooz Omidvar-Tehrani, Senjuti Basu and Nafiseh Shabib


International audienceWe examine the problem of recommending items to ad-hoc user groups. Group recommendation in collaborative rating datasets has received increased attention recently and has raised novel challenges. Different consensus functions that aggregate the ratings of group members with varying semantics ranging from least misery to pairwise disagreement, have been studied. In this paper, we explore a new dimension when computing group recommendations, that is, affinity between group members and its evolution over time. We extend existing group recommendation semantics to include temporal affinity in recommendations and design GRECA, an efficient algorithm that produces temporal affinity-aware recommendations for ad-hoc groups. We run extensive experiments that show substantial improvements in group recommendation quality when accounting for affinity while maintaining very good performance

Topics: [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]
Publisher: HAL CCSD
Year: 2015
DOI identifier: 10.5441/002/edbt.2015.37
OAI identifier: oai:HAL:hal-02001913v1
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • https://hal.archives-ouvertes.... (external link)
  • https://hal.archives-ouvertes.... (external link)
  • https://hal.archives-ouvertes.... (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.