Fully Hyperbolic Graph Convolution Network for Recommendation
文献类型:会议论文
作者 | Wang,Liping![]() ![]() ![]() ![]() |
出版日期 | 2021 |
会议日期 | November 1–5, 2021 |
会议地点 | Virtual Event, Australia |
英文摘要 | Recently, Graph Convolution Network (GCN) based methods have achieved outstanding performance for recommendation. These methods embed users and items in Euclidean space, and perform graph convolution on user-item interaction graphs. However, real-world datasets usually exhibit tree-like hierarchical structures, which make Euclidean space less effective in capturing user-item relationship. In contrast, hyperbolic space, as a continuous analogue of a tree-graph, provides a promising alternative. In this paper, we propose a fully hyperbolic GCN model for recommendation, where all operations are performed in hyperbolic space. Utilizing the advantage of hyperbolic space, our method is able to embed users/items with less distortion and capture user-item interaction relationship more accurately. Extensive experiments on public benchmark datasets show that our method outperforms both Euclidean and hyperbolic counterparts and requires far lower embedding dimensionality to achieve comparable performance. |
语种 | 英语 |
源URL | [http://ir.ia.ac.cn/handle/173211/52178] ![]() |
专题 | 自动化研究所_智能感知与计算研究中心 |
通讯作者 | Wu,Shu |
作者单位 | Center for Research on Intelligent Perception and Computing, Institute of Automation, Chinese Academy of Sciences |
推荐引用方式 GB/T 7714 | Wang,Liping,Hu,Fenyu,Wu,Shu,et al. Fully Hyperbolic Graph Convolution Network for Recommendation[C]. 见:. Virtual Event, Australia. November 1–5, 2021. |
入库方式: OAI收割
来源:自动化研究所
其他版本
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。