mlsanityData to 14 Oct 2026

Knowledge-based Multiple Adaptive Spaces Fusion for Recommendation

arXiv 2308.15244 ↗First posted 29 Aug 2023cs.IR cs.AIcited by 2

Not on the map. Why?

Abstract (arXiv)

Since Knowledge Graphs (KGs) contain rich semantic information, recently there has been an influx of KG-enhanced recommendation methods. Most of existing methods are entirely designed based on euclidean space without considering curvature. However, recent studies have revealed that a tremendous graph-structured data exhibits highly non-euclidean properties. Motivated by these observations, in this work, we propose a knowledge-based multiple adaptive spaces fusion method for recommendation, namely MCKG. Unlike existing methods that solely adopt a specific manifold, we introduce the unified space that is compatible with hyperbolic, euclidean and spherical spaces. Furthermore, we fuse the multiple unified spaces in an attention manner to obtain the high-quality embeddings for better knowledge propagation. In addition, we propose a geometry-aware optimization strategy which enables the pull and push processes benefited from both hyperbolic and spherical spaces. Specifically, in hyperbolic space, we set smaller margins in the area near to the origin, which is conducive to distinguishing between highly similar positive items and negative ones. At the same time, we set larger margins in the area far from the origin to ensure the model has sufficient error tolerance. The similar manner also applies to spherical spaces. Extensive experiments on three real-world datasets demonstrate that the MCKG has a significant improvement over state-of-the-art recommendation methods. Further ablation experiments verify the importance of multi-space fusion and geometry-aware optimization strategy, justifying the rationality and effectiveness of MCKG.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 24 of its 39 references that are in the map. First posted on arXiv 29 Aug 2023.

Builds on

24 of 39 references.

References · 24

  1. 2017Inductive Representation Learning on Large Graphscited by 6,320
  2. 2019Neural Graph Collaborative Filteringcited by 661
  3. 2019Hyperbolic Graph Convolutional Neural Networkscited by 402
  4. 2019KGAT: Knowledge Graph Attention Network for Recommendationcited by 343
  5. 2016Learning Convolutional Neural Networks for Graphscited by 314
  6. 2017A Comprehensive Survey of Graph Embedding: Problems, Techniques and Applicationscited by 260
  7. 2019Hyperbolic Graph Neural Networkscited by 244
  8. 2018Representation Tradeoffs for Hyperbolic Embeddingscited by 206
  9. 2021Hyperbolic Deep Neural Networks: A Surveycited by 139
  10. 2018RippleNet: Propagating User Preferences on the Knowledge Graph for Recommender Systemscited by 138
  11. 2018DKN: Deep Knowledge-Aware Network for News Recommendationcited by 137
  12. 2019Knowledge Graph Convolutional Networks for Recommender Systemscited by 121
12 more
  1. 2020Revisiting Graph based Collaborative Filtering: A Linear Residual Graph Convolutional Network Approachcited by 120
  2. 2022Hyperbolic Vision Transformers: Combining Improvements in Metric Learningcited by 111
  3. 2019Constant Curvature Graph Convolutional Networkscited by 108
  4. 2021Learning Intents behind Interactions with Knowledge Graph for Recommendationcited by 94
  5. 2019Mixed-curvature Variational Autoencoderscited by 86
  6. 2021Clipped Hyperbolic Classifiers Are Super-Hyperbolic Classifierscited by 57
  7. 2018HyperML: A Boosting Metric Learning Approach in Hyperbolic Space for Recommender Systemscited by 47
  8. 2021Modeling Scale-free Graphs with Hyperbolic Geometry for Knowledge-aware Recommendationcited by 38
  9. 2020DyERNIE: Dynamic Evolution of Riemannian Manifold Embeddings for Temporal Knowledge Graph Completioncited by 30
  10. 2022HICF: Hyperbolic Informative Collaborative Filteringcited by 24
  11. 2019An End-to-End Neighborhood-based Interaction Model for Knowledge-enhanced Recommendationcited by 8
  12. 2020Are Hyperbolic Representations in Graphs Created Equal?cited by 4

Built on by

Cited by year

Citing papers per year: 2025: 2.

2 papers.