AlignGroup: Learning and Aligning Group Consensus with Member Preferences for Group Recommendation

• URL: http://arxiv.org/abs/2409.02580v1
• Date: Wed, 4 Sep 2024 10:03:09 GMT
• Title: AlignGroup: Learning and Aligning Group Consensus with Member Preferences for Group Recommendation
• Authors: Jinfeng Xu, Zheyu Chen, Jinze Li, Shuo Yang, Hewei Wang, Edith C. -H. Ngai,
• Abstract summary: 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.
• Score: 7.8148534870343225
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Group activities are important behaviors in human society, providing personalized recommendations for groups is referred to as the group recommendation task. Existing methods can usually be categorized into two strategies to infer group preferences: 1) determining group preferences by aggregating members' personalized preferences, and 2) inferring group consensus by capturing group members' coherent decisions after common compromises. However, the former would suffer from the lack of group-level considerations, and the latter overlooks the fine-grained preferences of individual users. To this end, 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. Specifically, AlignGroup explores group consensus through a well-designed hypergraph neural network that efficiently learns intra- and inter-group relationships. Moreover, AlignGroup innovatively utilizes a self-supervised alignment task to capture fine-grained group decision-making by aligning the group consensus with members' common preferences. Extensive experiments on two real-world datasets validate that our AlignGroup outperforms the state-of-the-art on both the group recommendation task and the user recommendation task, as well as outperforms the efficiency of most baselines.

Related papers

• Identify Then Recommend: Towards Unsupervised Group Recommendation [13.238029824207151]
  Group Recommendation (GR) aims to recommend items to groups of users. We present a novel unsupervised group recommendation framework named underlineIdentify underlineThen underlineRecommend (underlineITR) We deploy ITR on the industrial recommender and achieve promising results.
  arXiv  Detail & Related papers  (2024-10-31T09:24:22Z)
• GPRec: Bi-level User Modeling for Deep Recommenders [45.38687843911628]
  GPRec explicitly categorizes users into groups in a learnable manner and aligns them with corresponding group embeddings. On the individual level, GPRec identifies personal preferences from ID-like features and refines the obtained individual representations to be independent of group ones. Rigorous testing of GPRec on three public datasets has demonstrated significant improvements in recommendation quality.
  arXiv  Detail & Related papers  (2024-10-28T04:49:05Z)
• 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)
• DeepGroup: Representation Learning for Group Recommendation with Implicit Feedback [0.5584060970507505]
  We focus on making recommendations for a new group of users whose preferences are unknown, but we are given the decisions/choices of other groups. Given a set of groups and their observed decisions, group decision prediction intends to predict the decision of a new group of users. reverse social choice aims to infer the preferences of those users involved in observed group decisions.
  arXiv  Detail & Related papers  (2021-03-13T02:05:26Z)
• 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)
• GroupIM: A Mutual Information Maximization Framework for Neural Group Recommendation [24.677145454396822]
  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.
  arXiv  Detail & Related papers  (2020-06-05T23:18:19Z)
• Robust Optimization for Fairness with Noisy Protected Groups [85.13255550021495]
  We study the consequences of naively relying on noisy protected group labels. We introduce two new approaches using robust optimization. We show that the robust approaches achieve better true group fairness guarantees than the naive approach.
  arXiv  Detail & Related papers  (2020-02-21T14:58:37Z)

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.