Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Changsheng Shui

dblp:384/9299 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2026
0009-0004-9235-3037ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 2 · 1 first-author · 2 since 2021Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Machine learning and data management · 50% Recommender systems · 50%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning and data management
matrix completion
1.012026
Multi-Channel Hypergraph Contrastive Learning for Matrix Completion · ACM Trans. Inf. Syst. 2026
Recommender systems › collaborative filtering
rating prediction
1.012026
Multi-Channel Hypergraph Contrastive Learning for Matrix Completion · ACM Trans. Inf. Syst. 2026

Methods — techniques the papers use, named apart from their topics

hypergraph neural network · 1.0contrastive learning · 1.0attention-based cross-view aggregation · 1.0
YearPublicationVenuePosition
2026 Multi-Channel Hypergraph Contrastive Learning for Matrix Completion
abstract
Rating is a typical user’s explicit feedback that visually reflects how much a user likes a related item. The (rating) matrix completion is essentially a rating prediction process, which is also a significant problem in recommender systems. Recently, graph neural networks (GNNs) have been widely used in matrix completion, which captures users’ preferences over items by formulating a rating matrix as a bipartite graph. However, existing methods are susceptible due to data sparsity and long-tail distribution in real-world scenarios. Moreover, the messaging mechanism of GNNs makes it difficult to capture high-order correlations and constraints between nodes, which are essentially useful in recommendation tasks. To tackle these challenges, we propose a M ulti-Channel H ypergraph C ontrastive L earning framework for matrix completion, named MHCL . Specifically, MHCL adaptively learns hypergraph structures to capture high-order correlations between nodes and jointly captures local and global collaborative relationships through attention-based cross-view aggregation. Additionally, to consider the magnitude and order information of ratings, we treat different rating subgraphs as different channels, encourage alignment between adjacent ratings, and further achieve the mutual enhancement between different ratings through multi-channel cross-rating contrastive learning. Extensive experiments on eight publicly available real-world datasets demonstrate that our proposed method significantly outperforms the current state-of-the-art approaches. The source code of our model is available at https://github.com/lx970414/MHCL .
Xiang Li 0111, Changsheng Shui, Zhongying Zhao 0001, Junyu Dong, Yanwei Yu
ACM Trans. Inf. Syst.2
2024 Hierarchical Graph Contrastive Learning for Review-Enhanced Recommendation
Changsheng Shui, Xiang Li 0111, Jianpeng Qi, Guiyuan Jiang, Yanwei Yu
ECML/PKDD (6)1