Challenge: Presently, graph-based recommendations are limited by session dependencies and data sparsity in real-world scenarios.
Approach: They propose a method which uses multi-collaborative self-supervised learning in hypergraph neural networks to model item transitions and to mitigate the challenges of data sparsity.
Outcome: The proposed method outperforms existing methods in a number of domains and consistently outperformed existing methods.

Similar Papers

Multi-Graph Co-Training for Capturing User Intent in Session-based Recommendation (2025.coling-main)

Copied to clipboard

Challenge: Existing methods rely on user actions within the current session, overlooking the wealth of auxiliary information available.
Approach: They propose a session-based recommendation model that leverages the current session graph and similar session graphs to capture the intrinsic relationships between items.
Outcome: The proposed model improves on the Diginetica dataset by 2.00% and 10.70% respectively.
Social-aware Sparse Attention Network for Session-based Social Recommendation (2022.findings-emnlp)

Copied to clipboard

Challenge: Existing methods for predicting the next item for an anonymous session do not capture user preferences and noisy irrelevant interactions.
Approach: They propose to use social networks and historical sessions to provide personalized recommendations for the current session.
Outcome: The proposed model outperforms existing models on two benchmark datasets.
Mitigating Matthew Effect: Multi-Hypergraph Boosted Multi-Interest Self-Supervised Learning for Conversational Recommendation (2024.emnlp-main)

Copied to clipboard

Challenge: Existing methods to mitigate Matthew effect in offline recommendation systems are not effective . a number of studies have identified two root causes for the Matthew effect .
Approach: They propose a framework to address the Matthew effect in conversational recommendation systems . they build hypergraphs to learn multi-level user interests to alleviate the Matthew effec .
Outcome: The proposed framework achieves state-of-the-art performance on four CRS-based datasets . it improves on item-, entity-, word-oriented multiple-channel hypergraphs compared with existing methods .
HyCoRec: Hypergraph-Enhanced Multi-Preference Learning for Alleviating Matthew Effect in Conversational Recommendation (2024.acl-long)

Copied to clipboard

Challenge: Existing methods to study the Matthew effect in Recommender Systems (RSs) however, it is amplified when the user interacts with the system over time.
Approach: They propose a paradigm to alleviate the Matthew effect in conversational recommendation by learning multi-aspect preferences.
Outcome: The proposed paradigm achieves state-of-the-art performance and superior of alleviating Matthew effect in conversational recommendation tasks.
CERES: Pretraining of Graph-Conditioned Transformer for Semi-Structured Session Data (2022.naacl-main)

Copied to clipboard

Challenge: Despite advances in self-supervised learning, there is a lack of models that can effectively capture both intra- and intra-item semantics for semi-structured session data.
Approach: They propose a graph-based transformer model for semi-structured session data that captures both intra- and intra-item semantics.
Outcome: The proposed model outperforms baselines in three session search and entity linking tasks by up to 9%.
Be More with Less: Hypergraph Attention Networks for Inductive Text Classification (2020.emnlp-main)

Copied to clipboard

Challenge: Text classification is a critical research topic with broad applications in natural language processing. graph neural networks (GNNs) have received increasing attention but their performance is jeopardized in practice.
Approach: They propose a model which captures long-distance interactions between words and a graph-based model which can be used to perform text classification.
Outcome: The proposed model can achieve more expressive power with less computational consumption on the text classification task.
From Graphs to Hypergraphs: Enhancing Aspect-Term Sentiment Analysis via Multi-Level Relational Modeling (2026.acl-srw)

Copied to clipboard

Challenge: Existing graph-based approaches to predict sentiment polarity for specific aspect terms rely on predefined pairwise structures to improve expressive capacity.
Approach: They propose a dynamic hypergraph framework that can be used to generate a single instance-specific hypergraph from contextual token representations.
Outcome: The proposed framework improves on Lap14, Rest14, and MAMS . it uses a single instance-specific hypergraph constructed directly from contextual token representations .
RecStream: Graph-aware Stream Management for Concurrent Recommendation Model Online Serving (2025.coling-industry)

Copied to clipboard

Challenge: Existing systems that use recommendation models perform poorly under highly concurrent scenarios.
Approach: They propose a system that optimizes stream configurations based on model characteristics and concurrency levels.
Outcome: The proposed system outperforms existing methods under high concurrency scenarios.
Reviews Meet Graphs: Enhancing User and Item Representations for Recommendation with Hierarchical Attentive Graph Neural Network (D19-1)

Copied to clipboard

Challenge: Existing methods to learn user and item representations from review texts do not take into account the user-user and item-item relatedness of the user.
Approach: They propose to use review content and user-item graphs to integrate them as different views.
Outcome: The proposed approach can learn user and item representations from review content and user-item graphs.
EvoHyper: Evolving Hypergraph Topologies for Unified Collaboration in Multi-Agent Communication (2026.findings-acl)

Copied to clipboard

Challenge: Existing methods for multi-agent collaboration use a fixed communication graph and manage collaboration structure and shared memory in separate modules.
Approach: They propose a framework that uses an evolving hypergraph topology for multi-agent collaboration.
Outcome: The proposed framework achieves 3.2% to 7.8% accuracy gains over state-of-the-art methods and efficient, reducing token consumption by up to 23.5%.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations