HyCoRec: Hypergraph-Enhanced Multi-Preference Learning for Alleviating Matthew Effect in Conversational Recommendation

• URL: http://arxiv.org/abs/2607.17461v1
• Date: Mon, 20 Jul 2026 01:22:06 GMT
• Title: HyCoRec: Hypergraph-Enhanced Multi-Preference Learning for Alleviating Matthew Effect in Conversational Recommendation
• Abstract summary: We propose a novel paradigm, Hypergraph-Enhanced Multi-Preference Learning for Alleviating Matthew Effect in Conversational Recommendation (HyCoRec)<n>HyCoRec devotes to alleviate the Matthew effect by learning multi-aspect preferences, emphi.e., item-, entity-, word-, review-, and knowledge-aspect preferences, to effectively generate responses in the conversational task and accurately predict items in the recommendation task when the user chats with the system over time.
• Score: 68.19856372870741
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The Matthew effect is a notorious issue in Recommender Systems (RSs), \emph{i.e.}, the rich get richer and the poor get poorer, wherein popular items are overexposed while less popular ones are regularly ignored. Most methods examine Matthew effect in static or nearly-static recommendation scenarios. However, the Matthew effect will be increasingly amplified when the user interacts with the system over time. To address these issues, we propose a novel paradigm, Hypergraph-Enhanced Multi-Preference Learning for Alleviating Matthew Effect in Conversational Recommendation (HyCoRec), which aims to alleviate the Matthew effect in conversational recommendation. Concretely, HyCoRec devotes to alleviate the Matthew effect by learning multi-aspect preferences, \emph{i.e.}, item-, entity-, word-, review-, and knowledge-aspect preferences, to effectively generate responses in the conversational task and accurately predict items in the recommendation task when the user chats with the system over time. Extensive experiments conducted on two benchmarks validate that HyCoRec achieves new state-of-the-art performance and the superior of alleviating Matthew effect. Our code is available at https://github.com/zysensmile/HyCoRec.

Related papers

• Mitigating Matthew Effect: Multi-Hypergraph Boosted Multi-Interest Self-Supervised Learning for Conversational Recommendation [77.26217251369263]
  We propose a novel framework, Multi-Hypergraph Boosted Multi-Interest Self-Supervised Learning for Conversational Recommendation (HiCore)<n>HiCore devotes to learn multi-level user interests by building a set of hypergraphs to alleviate the Matthew effect.
  arXiv  Detail & Related papers  (2026-07-21T01:07:40Z)
• HyMiRec: A Hybrid Multi-interest Learning Framework for LLM-based Sequential Recommendation [24.720767926024433]
  HyMiRec is a hybrid sequential recommendation framework for large language models.<n>It extracts coarse interest embeddings from long user sequences and an LLM-based recommender to captures refined interest embeddings.<n>To model the diverse preferences of users, we design a disentangled multi-interest learning module.
  arXiv  Detail & Related papers  (2025-10-15T16:45:59Z)
• Why Multi-Interest Fairness Matters: Hypergraph Contrastive Multi-Interest Learning for Fair Conversational Recommender System [55.39026603611269]
  We propose a novel framework, Hypergraph Contrastive Multi-Interest Learning for Fair Conversational Recommender System (HyFairCRS)<n>HyFairCRS aims to promote multi-interest diversity fairness in dynamic and interactive Conversational Recommender Systems (CRSs)<n> Experiments on two CRS-based datasets show that HyFairCRS achieves a new state-of-the-art performance while effectively alleviating unfairness.
  arXiv  Detail & Related papers  (2025-07-01T11:39:42Z)
• Contextual Bandit with Herding Effects: Algorithms and Recommendation Applications [17.865143559133994]
  "Herding effects" bias user feedback toward historical ratings, breaking down the assumption of unbiased feedback inherent in contextual bandits. This paper develops a novel variant of the contextual bandit that is tailored to address the feedback bias caused by the herding effects. We show that TS-Conf effectively mitigates the negative impact of herding effects, resulting in faster learning and improved recommendation accuracy.
  arXiv  Detail & Related papers  (2024-08-26T17:20:34Z)
• Leveraging Knowledge Graph Embedding for Effective Conversational Recommendation [4.079573593766921]
  We propose a knowledge graph based conversational recommender system (referred as KG-CRS) Specifically, we first integrate the user-item graph and item-attribute graph into a dynamic graph, dynamically changing during the dialogue process by removing negative items or attributes. We then learn informative embedding of users, items, and attributes by also considering propagation through neighbors on the graph.
  arXiv  Detail & Related papers  (2024-08-02T15:38:55Z)
• Multi-grained Hypergraph Interest Modeling for Conversational Recommendation [75.65483522949857]
  We propose a novel multi-grained hypergraph interest modeling approach to capture user interest beneath intricate historical data. In our approach, we first employ the hypergraph structure to model users' historical dialogue sessions and form a session-based hypergraph, which captures coarse-grained, session-level relations. We further conduct multi-grained hypergraph convolution on the two kinds of hypergraphs, and utilize the enhanced representations to develop interest-aware CRS.
  arXiv  Detail & Related papers  (2023-05-04T13:13:44Z)
• Progressive End-to-End Object Detection in Crowded Scenes [96.92416613336096]
  Previous query-based detectors suffer from two drawbacks: first, multiple predictions will be inferred for a single object, typically in crowded scenes; second, the performance saturates as the depth of the decoding stage increases. We propose a progressive predicting method to address the above issues. Specifically, we first select accepted queries to generate true positive predictions, then refine the rest noisy queries according to the previously accepted predictions. Experiments show that our method can significantly boost the performance of query-based detectors in crowded scenes.
  arXiv  Detail & Related papers  (2022-03-15T06:12:00Z)
• Dynamic Graph Collaborative Filtering [64.87765663208927]
  Dynamic recommendation is essential for recommender systems to provide real-time predictions based on sequential data. Here we propose Dynamic Graph Collaborative Filtering (DGCF), a novel framework leveraging dynamic graphs to capture collaborative and sequential relations. Our approach achieves higher performance when the dataset contains less action repetition, indicating the effectiveness of integrating dynamic collaborative information.
  arXiv  Detail & Related papers  (2021-01-08T04:16:24Z)
• Towards Topic-Guided Conversational Recommender System [80.3725246715938]
  We contribute a new CRS dataset named textbfTG-ReDial (textbfRecommendation through textbfTopic-textbfGuided textbfDialog) We present the task of topic-guided conversational recommendation, and propose an effective approach to this task.
  arXiv  Detail & Related papers  (2020-10-08T17:04:30Z)

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.