Multi-Channel Hypergraph Contrastive Learning for Matrix Completion
Rating is a typical user 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 Multi-Channel Hypergraph Contrastive Learning 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 five public datasets demonstrate that the proposed method significantly outperforms the current state-of-the-art approaches.
Code (0)
등록된 구현이 없습니다.
Tasks
Contrastive LearningHypergraph Contrastive LearningMatrix CompletionRecommendation SystemsMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Matrix Completion with Hypergraphs:Sharp Thresholds and Efficient Algorithms
This paper considers the problem of completing a rating matrix based on sub-sampled matrix entries as well as observed social graphs and hypergraphs. We show that there exists a \emph{sharp threshold} on the sample proba…
Matrix CompletionEvRainDrop: HyperGraph-guided Completion for Effective Frame and Event Stream Aggregation
Event cameras produce asynchronous event streams that are spatially sparse yet temporally dense. Mainstream event representation learning algorithms typically use event frames, voxels, or tensors as input. Although these…
Representation LearningHJE: Joint Convolutional Representation Learning for Knowledge Hypergraph Completion
Knowledge hypergraph representation learning , which projects entities and n -ary relations into a low-dimensional vector space, remains a challenging area to be explored despite the ubiquity of n -ary relational facts i…
Knowledge GraphsRepresentation LearningScalable and Explainable 1-Bit Matrix Completion via Graph Signal Learning
One-bit matrix completion is an important class of positiveunlabeled (PU) learning problems where the observations consist of only positive examples, eg, in top-N recommender systems. For the first time, we show that 1-b…
Collaborative RankingMatrix CompletionRecommendation SystemsHypergraph-Aided Task-Resource Matching for Maximizing Value of Task Completion in Collaborative IoT Systems
With the growing scale and intrinsic heterogeneity of Internet of Things (IoT) systems, distributed device collaboration becomes essential for effective task completion by dynamically utilizing limited communication and …
Hypergraph Matching