paper-with-me

Papers

Modeling Scale-free Graphs with Hyperbolic Geometry for Knowledge-aware Recommendation

2021-08-14 · Yankai Chen, Menglin Yang, Yingxue Zhang, Mengchen Zhao, Ziqiao Meng, Jianye Hao, Irwin King

Aiming to alleviate data sparsity and cold-start problems of traditional recommender systems, incorporating knowledge graphs (KGs) to supplement auxiliary information has recently gained considerable attention. Via unifying the KG with user-item interactions into a tripartite graph, recent works explore the graph topologies to learn the low-dimensional representations of users and items with rich semantics. However, these real-world tripartite graphs are usually scale-free, the intrinsic hierarchical graph structures of which are underemphasized in existing works, consequently, leading to suboptimal recommendation performance. To address this issue and provide more accurate recommendation, we propose a knowledge-aware recommendation method with the hyperbolic geometry, namely Lorentzian Knowledge-enhanced Graph convolutional networks for Recommendation (LKGR). LKGR facilitates better modeling of scale-free tripartite graphs after the data unification. Specifically, we employ different information propagation strategies in the hyperbolic space to explicitly encode heterogeneous information from historical interactions and KGs. Our proposed knowledge-aware attention mechanism enables the model to automatically measure the information contribution, producing the coherent information aggregation in the hyperbolic space. Extensive experiments on three real-world benchmarks demonstrate that LKGR outperforms state-of-the-art methods by 3.6-15.3% of Recall@20 on Top-K recommendation.

📄 PDF Abstract BibTeX arXiv:2108.06468

Code (0)

등록된 구현이 없습니다.

Tasks

Knowledge-Aware RecommendationKnowledge GraphsRecommendation Systems

Methods 이 논문이 사용한 방법론

Graph Convolutional Networks 설명 없음

Similar Papers 제목 키워드 기반

Hyperbolic Graph Convolutional Neural Networks

2019-10-28 · NeurIPS 2019 12 · Ines Chami, Rex Ying, Christopher Ré, Jure Leskovec

Graph convolutional neural networks (GCNs) embed nodes in a graph into Euclidean space, which has been shown to incur a large distortion when embedding real-world graphs with scale-free or hierarchical structure. Hyperbo…

Link PredictionNode Classification

Lorentzian Graph Convolutional Networks

2021-04-15 · Yiding Zhang, Xiao Wang, Chuan Shi, Nian Liu 외

Graph convolutional networks (GCNs) have received considerable research attention recently. Most GCNs learn the node representations in Euclidean geometry, but that could have a high distortion in the case of embedding g…

Temporal Hyperbolic Graph Representation Learning for Scale-Free Internet Routing and Delay Prediction

2026-05-27 · Yi-Ling Kuo, Hao-Yu Tien, Shih-Yu Tsai arxiv

Predicting Internet round-trip time (RTT) is critical for routing optimization, quality-of-service (QoS) provisioning, and traffic engineering, yet remains challenging due to long-term temporal dependencies, evolving rou…

Graph Representation LearningLink PredictionGraph Learning

Weighted Embeddings for Low-Dimensional Graph Representation

2024-10-08 · Thomas Bläsius, Jean-Pierre von der Heydt, Maximilian Katzmann, Nikolai Maas

Learning low-dimensional numerical representations from symbolic data, e.g., embedding the nodes of a graph into a geometric space, is an important concept in machine learning. While embedding into Euclidean space is com…

HYPHEN: Hyperbolic Hawkes Attention For Text Streams

2022-05-01 · ACL 2022 5 · Shivam Agarwal, Ramit Sawhney, Sanchit Ahuja, Ritesh Soun 외

Analyzing the temporal sequence of texts from sources such as social media, news, and parliamentary debates is a challenging problem as it exhibits time-varying scale-free properties and fine-grained timing irregularitie…

Stock Price Prediction