Multi-level Cross-view Contrastive Learning for Knowledge-aware Recommender System
Ding Zou,Wei Wei,Xianling Mao,Zi-Jun Wang,Minghui Qiu,Feida Zhu,Xin Cao +6 more
- 19 Apr 2022
TL;DR: This paper proposes a novel multi-level cross-view contrastive learning mechanism, named MCCLK, which comprehensively considers three different graph views for KG-aware recommendation, including global-level structural view, local-level collaborative and semantic views, and a k-Nearest-Neighbor item-item semantic graph construction module is proposed.
read more
Abstract: Knowledge graph (KG) plays an increasingly important role in recommender systems. Recently, graph neural networks (GNNs) based model has gradually become the theme of knowledge-aware recommendation (KGR). However, there is a natural deficiency for GNN-based KGR models, that is, the sparse supervised signal problem, which may make their actual performance drop to some extent. Inspired by the recent success of contrastive learning in mining supervised signals from data itself, in this paper, we focus on exploring the contrastive learning in KG-aware recommendation and propose a novel multi-level cross-view contrastive learning mechanism, named MCCLK. Different from traditional contrastive learning methods which generate two graph views by uniform data augmentation schemes such as corruption or dropping, we comprehensively consider three different graph views for KG-aware recommendation, including global-level structural view, local-level collaborative and semantic views. Specifically, we consider the user-item graph as a collaborative view, the item-entity graph as a semantic view, and the user-item-entity graph as a structural view. MCCLK hence performs contrastive learning across three views on both local and global levels, mining comprehensive graph feature and structure information in a self-supervised manner. Besides, in semantic view, a k-Nearest-Neighbor (k NN) item-item semantic graph construction module is proposed, to capture the important item-item semantic relation which is usually ignored by previous work. Extensive experiments conducted on three benchmark datasets show the superior performance of our proposed method over the state-of-the-arts. The implementations are available at: https://github.com/CCIIPLab/MCCLK.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
LLMRec: Large Language Models with Graph Augmentation for Recommendation
Wei Wei,Xubin Ren,Jiabin Tang,Qinyong Wang,Lixin Su,Su-hua Cheng,Junfeng Wang,Dawei Yin,Chao Huang +8 more
TL;DR: A novel framework called LLMRec is proposed that enhances recommender systems by employing three simple yet effective LLM-based graph augmentation strategies and develops a denoised data robustification mechanism that includes techniques of noisy implicit feedback pruning and MAE-based feature enhancement that help refine the augmented data and improve its reliability.
Knowledge Graph Self-Supervised Rationalization for Recommendation
Chao Huang,Liang Xia +1 more
TL;DR: KGRec as discussed by the authors integrates generative and contrastive self-supervised tasks for recommendation through rational masking to highlight rationales in the knowledge graph and further rationalize the effect of collaborative interactions on knowledge graph learning.
Improving Knowledge-aware Recommendation with Multi-level Interactive Contrastive Learning
Ding Zou,Wei Wei,Zi-Jun Wang,Xian-Ling Mao,Feida Zhu,Rui Fang,Dangyang Chen +6 more
- 22 Aug 2022
TL;DR: This paper focuses on exploring contrastive learning in KGR and proposes a novel multi-level interactive contrastiveLearning mechanism, which conducts layer-wise self-supervised learning by contrasting layers of different parts within graphs, which is also an "interaction" action.
SVD-GCN: A Simplified Graph Convolution Paradigm for Recommendation
Shaowen Peng,Kazunari Sugiyama,Tsunenori Mine +2 more
- 26 Aug 2022
TL;DR: This work replaces the core design of GCN-based methods with a flexible truncated SVD and proposes a simplified GCN learning paradigm dubbed SVD-GCN, which only exploits K-largest singular vectors for recommendation and solves the over-smoothing issue.
Knowledge-Adaptive Contrastive Learning for Recommendation
Hao Wang,Yao Xu,Cheng Yang,Chuan Shi,Xin Li,Ning Guo,Zhiyuan Liu +6 more
- 27 Feb 2023
TL;DR: Wang et al. as mentioned in this paper proposed a novel algorithm named Knowledge-Adaptive Contrastive Learning (KACL) to solve the problem of interaction domination and knowledge overload in KG-based recommender systems.
43
References
•Proceedings Article
Adam: A Method for Stochastic Optimization
Diederik P. Kingma,Jimmy Ba +1 more
- 01 Jan 2015
TL;DR: This work introduces Adam, an algorithm for first-order gradient-based optimization of stochastic objective functions, based on adaptive estimates of lower-order moments, and provides a regret bound on the convergence rate that is comparable to the best known results under the online convex optimization framework.
138.5K
•Posted Content
Adam: A Method for Stochastic Optimization
Diederik P. Kingma,Jimmy Ba +1 more
TL;DR: In this article, the adaptive estimates of lower-order moments are used for first-order gradient-based optimization of stochastic objective functions, based on adaptive estimate of lowerorder moments.
82.5K
•Posted Content
Semi-Supervised Classification with Graph Convolutional Networks
Thomas Kipf,Max Welling +1 more
TL;DR: A scalable approach for semi-supervised learning on graph-structured data that is based on an efficient variant of convolutional neural networks which operate directly on graphs which outperforms related methods by a significant margin.
22.7K
•Posted Content
A Simple Framework for Contrastive Learning of Visual Representations
TL;DR: It is shown that composition of data augmentations plays a critical role in defining effective predictive tasks, and introducing a learnable nonlinear transformation between the representation and the contrastive loss substantially improves the quality of the learned representations, and contrastive learning benefits from larger batch sizes and more training steps compared to supervised learning.
•Proceedings Article
Semi-Supervised Classification with Graph Convolutional Networks
Thomas Kipf,Max Welling +1 more
- 09 Sep 2016
TL;DR: In this paper, a scalable approach for semi-supervised learning on graph-structured data is presented based on an efficient variant of convolutional neural networks which operate directly on graphs.