Neural Graph Matching based Collaborative Filtering
Not on the map. Why?
Abstract (arXiv)
User and item attributes are essential side-information; their interactions (i.e., their co-occurrence in the sample data) can significantly enhance prediction accuracy in various recommender systems. We identify two different types of attribute interactions, inner interactions and cross interactions: inner interactions are those between only user attributes or those between only item attributes; cross interactions are those between user attributes and item attributes. Existing models do not distinguish these two types of attribute interactions, which may not be the most effective way to exploit the information carried by the interactions. To address this drawback, we propose a neural Graph Matching based Collaborative Filtering model (GMCF), which effectively captures the two types of attribute interactions through modeling and aggregating attribute interactions in a graph matching structure for recommendation. In our model, the two essential recommendation procedures, characteristic learning and preference matching, are explicitly conducted through graph learning (based on inner interactions) and node matching (based on cross interactions), respectively. Experimental results show that our model outperforms state-of-the-art models. Further studies verify the effectiveness of GMCF in improving the accuracy of recommendation.
Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). Builds on 27 of its 47 references that are in the map. First posted on arXiv 10 May 2021.
Builds on
27 of 47 references.
References · 27
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2018How Powerful are Graph Neural Networks?cited by 4,355
- 2017Neural Message Passing for Quantum Chemistrycited by 3,460
- 2017Neural Collaborative Filteringcited by 1,108
- 2015Convolutional Networks on Graphs for Learning Molecular Fingerprintscited by 751
- 2016Wide & Deep Learning for Recommender Systemscited by 745
- 2017DeepFM: A Factorization-Machine based Neural Network for CTR Predictioncited by 673
- 2019Neural Graph Collaborative Filteringcited by 660
- 2017Deep Interest Network for Click-Through Rate Predictioncited by 541
- 2016Interaction Networks for Learning about Objects, Relations and Physicscited by 503
- 2019KGAT: Knowledge Graph Attention Network for Recommendationcited by 342
- 2018AutoInt: Automatic Feature Interaction Learning via Self-Attentive Neural Networkscited by 319
15 more
- 2019Graph Matching Networks for Learning the Similarity of Graph Structured Objectscited by 202
- 2017Neural Factorization Machines for Sparse Predictive Analyticscited by 183
- 2017Attentional Factorization Machines: Learning the Weight of Feature Interactions via Attention Networkscited by 126
- 2016A Compositional Object-Based Approach to Learning Physical Dynamicscited by 119
- 2019Knowledge-aware Graph Neural Networks with Label Smoothness Regularization for Recommender Systemscited by 107
- 2019Reinforcement Knowledge Graph Reasoning for Explainable Recommendationcited by 102
- 2018SimGNN: A Neural Network Approach to Fast Graph Similarity Computationcited by 89
- 2019Fi-GNN: Modeling Feature Interactions via Graph Neural Networks for CTR Predictioncited by 54
- 2020AutoFIS: Automatic Feature Interaction Selection in Factorization Models for Click-Through Rate Predictioncited by 52
- 2020Detecting Beneficial Feature Interactions for Recommender Systemscited by 22
- 2021Graph Pooling via Coarsened Graph Infomaxcited by 15
- 2021WGCN: Graph Convolutional Networks with Weighted Structural Featurescited by 12
- 2014Incorporating Side Information in Probabilistic Matrix Factorization with Gaussian Processescited by 4
- 2019MMF: Attribute Interpretable Collaborative Filteringcited by 2
- 2019CARL: Aggregated Search with Context-Aware Module Embedding Learningcited by 1
Built on by
Citing papers per year: 2021: 1; 2022: 3; 2023: 2; 2024: 1; 2025: 2.
9 papers.
- 2021Memorize, Factorize, or be Na"ive: Learning Optimal Feature Interaction Methods for CTR Predictioncited by 12
- 2022CGMN: A Contrastive Graph Matching Network for Self-Supervised Graph Similarity Learningcited by 8
- 2023Multi-domain Recommendation with Embedding Disentangling and Domain Alignmentcited by 7
- 2022Detecting Arbitrary Order Beneficial Feature Interactions for Recommender Systemscited by 6
- 2025Learning without Isolation: Pathway Protection for Continual Learningcited by 6
- 2024A Survey on Deep Neural Networks in Collaborative Filtering Recommendation Systemscited by 3
- 2022Privacy-Preserved Neural Graph Similarity Learningcited by 2
- 2023Ripple Knowledge Graph Convolutional Networks For Recommendation Systemscited by 2
- 2025Intrinsic and Extrinsic Factor Disentanglement for Recommendation in Various Context Scenarioscited by 0
- 2025Learning without Isolation: Pathway Protection for Continual Learning24 May 2025
- 2025Intrinsic and Extrinsic Factor Disentanglement for Recommendation in Various Context Scenarios5 Mar 2025
- 2024A Survey on Deep Neural Networks in Collaborative Filtering Recommendation Systems2 Dec 2024
- 2023Multi-domain Recommendation with Embedding Disentangling and Domain Alignment10 Aug 2023
- 2023Ripple Knowledge Graph Convolutional Networks For Recommendation Systems2 May 2023
- 2022Privacy-Preserved Neural Graph Similarity Learning21 Oct 2022
- 2022Detecting Arbitrary Order Beneficial Feature Interactions for Recommender Systems28 Jun 2022
- 2022CGMN: A Contrastive Graph Matching Network for Self-Supervised Graph Similarity Learning30 May 2022
- 2021Memorize, Factorize, or be Na"ive: Learning Optimal Feature Interaction Methods for CTR Prediction3 Aug 2021