GroupIM: A Mutual Information Maximization Framework for Neural Group Recommendation

• URL: http://arxiv.org/abs/2006.03736v2
• Date: Tue, 9 Jun 2020 03:13:09 GMT
• Title: GroupIM: A Mutual Information Maximization Framework for Neural Group Recommendation
• Authors: Aravind Sankar, Yanhong Wu, Yuhang Wu, Wei Zhang, Hao Yang, Hari Sundaram
• Abstract summary: We study the problem of making item recommendations to ephemeral groups, which comprise users with limited or no historical activities together. Existing studies target persistent groups with substantial activity history, while ephemeral groups lack historical interactions. We propose data-driven regularization strategies to exploit both the preference covariance amongst users who are in the same group, as well as the contextual relevance of users' individual preferences to each group.
• Score: 24.677145454396822
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We study the problem of making item recommendations to ephemeral groups, which comprise users with limited or no historical activities together. Existing studies target persistent groups with substantial activity history, while ephemeral groups lack historical interactions. To overcome group interaction sparsity, we propose data-driven regularization strategies to exploit both the preference covariance amongst users who are in the same group, as well as the contextual relevance of users' individual preferences to each group. We make two contributions. First, we present a recommender architecture-agnostic framework GroupIM that can integrate arbitrary neural preference encoders and aggregators for ephemeral group recommendation. Second, we regularize the user-group latent space to overcome group interaction sparsity by: maximizing mutual information between representations of groups and group members; and dynamically prioritizing the preferences of highly informative members through contextual preference weighting. Our experimental results on several real-world datasets indicate significant performance improvements (31-62% relative NDCG@20) over state-of-the-art group recommendation techniques.

Related papers

• AlignGroup: Learning and Aligning Group Consensus with Member Preferences for Group Recommendation [7.8148534870343225]
  Group activities are important behaviors in human society, providing personalized recommendations for groups is referred to as the group recommendation task. We propose a novel group recommendation method AlignGroup, which focuses on both group consensus and individual preferences of group members to infer the group decision-making.
  arXiv  Detail & Related papers  (2024-09-04T10:03:09Z)
• Towards More Practical Group Activity Detection: A New Benchmark and Model [61.39427407758131]
  Group activity detection (GAD) is the task of identifying members of each group and classifying the activity of the group at the same time in a video. We present a new dataset, dubbed Caf'e, which presents more practical scenarios and metrics. We also propose a new GAD model that deals with an unknown number of groups and latent group members efficiently and effectively.
  arXiv  Detail & Related papers  (2023-12-05T16:48:17Z)
• Group-Aware Interest Disentangled Dual-Training for Personalized Recommendation [42.92141160362361]
  We propose IGRec (Interest-based Group enhanced Recommendation) to utilize the group information accurately. We conduct extensive experiments on three publicly available datasets. Results show IGRec can effectively alleviate the data sparsity problem and enhance the recommender system with interest-based group representation.
  arXiv  Detail & Related papers  (2023-11-16T05:23:53Z)
• Multi-Granularity Attention Model for Group Recommendation [7.764789596492022]
  Group recommendation provides personalized recommendations to a group of users based on their shared interests, preferences, and characteristics. We present the Multi-Granularity Attention Model (MGAM) to uncover group members' latent preferences and mitigate recommendation noise. Our method effectively reduces group recommendation noise across multiple granularities and comprehensively learns individual interests.
  arXiv  Detail & Related papers  (2023-08-08T03:24:44Z)
• Towards Group Robustness in the presence of Partial Group Labels [61.33713547766866]
  spurious correlations between input samples and the target labels wrongly direct the neural network predictions. We propose an algorithm that optimize for the worst-off group assignments from a constraint set. We show improvements in the minority group's performance while preserving overall aggregate accuracy across groups.
  arXiv  Detail & Related papers  (2022-01-10T22:04:48Z)
• Focus on the Common Good: Group Distributional Robustness Follows [47.62596240492509]
  This paper proposes a new and simple algorithm that explicitly encourages learning of features that are shared across various groups. While Group-DRO focuses on groups with worst regularized loss, focusing instead, on groups that enable better performance even on other groups, could lead to learning of shared/common features.
  arXiv  Detail & Related papers  (2021-10-06T09:47:41Z)
• Double-Scale Self-Supervised Hypergraph Learning for Group Recommendation [35.841350982832545]
  Group recommendation suffers seriously from the problem of data sparsity. We propose a self-supervised hypergraph learning framework for group recommendation to achieve two goals.
  arXiv  Detail & Related papers  (2021-09-09T12:19:49Z)
• Learning Multi-Attention Context Graph for Group-Based Re-Identification [214.84551361855443]
  Learning to re-identify or retrieve a group of people across non-overlapped camera systems has important applications in video surveillance. In this work, we consider employing context information for identifying groups of people, i.e., group re-id. We propose a novel unified framework based on graph neural networks to simultaneously address the group-based re-id tasks.
  arXiv  Detail & Related papers  (2021-04-29T09:57:47Z)
• Overcoming Data Sparsity in Group Recommendation [52.00998276970403]
  Group recommender systems should be able to accurately learn not only users' personal preferences but also preference aggregation strategy. In this paper, we take Bipartite Graphding Model (BGEM), the self-attention mechanism and Graph Convolutional Networks (GCNs) as basic building blocks to learn group and user representations in a unified way.
  arXiv  Detail & Related papers  (2020-10-02T07:11:19Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.