arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2101.04852cs.IRcs.LG
收藏

Poincaré Ball中知识增强的Top-K推荐算法

Knowledge-Enhanced Top-K Recommendation in Poincaré Ball

Huawei Noah’s Ark Lab(华为诺亚方舟实验室)

Chen Ma, Liheng Ma, Yingxue Zhang, Haolun Wu, Xue Liu, Mark Coates

摘要:

个性化推荐系统越来越重要,因为越来越多的内容和服务变得可用,用户很难确定他们可能感兴趣的内容。由于能够提供丰富的信息,知识图谱(KG)被纳入,以提高推荐性能和可解释性。为了有效地利用知识图谱,我们提出了一个双曲空间的推荐模型,这有利于学习的知识图谱的层次结构。此外,双曲线注意力网络被用来确定某一项目的相邻实体的相对重要性。此外,我们提出了一个自适应和细粒度的正则化机制,自适应正则化项目及其相邻的表示。通过使用三个真实世界的数据集与最先进的方法进行比较,我们表明,该模型在Top-K推荐的NDCG@K方面比现有的最佳模型高出2-16%。

英文摘要:

Personalized recommender systems are increasingly important as more content and services become available and users struggle to identify what might interest them. Thanks to the ability for providing rich information, knowledge graphs (KGs) are being incorporated to enhance the recommendation performance and interpretability. To effectively make use of the knowledge graph, we propose a recommendation model in the hyperbolic space, which facilitates the learning of the hierarchical structure of knowledge graphs. Furthermore, a hyperbolic attention network is employed to determine the relative importances of neighboring entities of a certain item. In addition, we propose an adaptive and fine-grained regularization mechanism to adaptively regularize items and their neighboring representations. Via a comparison using three real-world datasets with state-of-the-art methods, we show that the proposed model outperforms the best existing models by 2-16% in terms of NDCG@K on Top-K recommendation.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑