Group Recommendation with Temporal Affinities

Sihem Amer-Yahia (1) , Behrooz Omidvar-Tehrani (1) , Senjuti Basu (2) , Nafiseh Shabib

1 SLIDE - ScaLable Information Discovery and Exploitation [Saint Martin d’Hères]
2 NJIT - New Jersey Institute of Technology [Newark]

We 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.

Domaines: Algorithme et structure de données [cs.DS]

Sihem Amer-Yahia, Behrooz Omidvar-Tehrani, Senjuti Basu, Nafiseh Shabib. Group Recommendation with Temporal Affinities. International Conference on Extending Database Technology (EDBT), Mar 2015, Brussels, Belgium. ⟨10.5441/002/edbt.2015.37⟩. ⟨hal-02001913⟩