arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2105.04183cs.IR
收藏

UGRec:为推荐建模有向和无向关系

UGRec: Modeling Directed and Undirected Relations for Recommendation

Xinxiao Zhao, Zhiyong Cheng, Lei Zhu, Jiecai Zheng, Xueqing Li

摘要:

推荐系统,这仅仅是利用用户项目的交互用户偏好预测(如基于协同过滤的),往往面临着显着的性能下降时,用户或项目的互动是不够的。近年来,已经探索了各种类型的边信息来缓解这个问题。其中,知识图谱(KG)由于能够将用户/项目及其关联属性编码在图结构中,从而保持关系信息,引起了广泛的研究兴趣。相比之下,较少关注项目-项目同现信息(即,\textit{co-view}),它包含丰富的项目间相似性信息。它从不同于用户/项目属性图的角度提供信息,并且对于CF推荐模型也是有价值的。在这项工作中,我们努力研究整合两种类型的辅助信息(即,KG和项目-项目共现数据)进行推荐。为了实现这一目标,我们提出了一个统一的基于图的推荐模型(UGRec),它集成了传统的KG中的有向关系和无向项目-项目共生关系的同时。特别地,对于有向关系,我们将头和尾实体转换到对应的关系空间中以建模它们的关系;对于无向同现关系,我们将头和尾实体投影到实体空间中的唯一超平面中以最小化它们的距离。此外,为细粒度关系建模设计了一种首尾关系感知的注意机制。已经进行了广泛的实验,在几个公开访问的数据集,以评估所提出的模型。结果表明,我们的模型优于以前的几个国家的最先进的方法,并证明了我们的UGRec模型的有效性。

英文摘要:

Recommender systems, which merely leverage user-item interactions for user preference prediction (such as the collaborative filtering-based ones), often face dramatic performance degradation when the interactions of users or items are insufficient. In recent years, various types of side information have been explored to alleviate this problem. Among them, knowledge graph (KG) has attracted extensive research interests as it can encode users/items and their associated attributes in the graph structure to preserve the relation information. In contrast, less attention has been paid to the item-item co-occurrence information (i.e., \textit{co-view}), which contains rich item-item similarity information. It provides information from a perspective different from the user/item-attribute graph and is also valuable for the CF recommendation models. In this work, we make an effort to study the potential of integrating both types of side information (i.e., KG and item-item co-occurrence data) for recommendation. To achieve the goal, we propose a unified graph-based recommendation model (UGRec), which integrates the traditional directed relations in KG and the undirected item-item co-occurrence relations simultaneously. In particular, for a directed relation, we transform the head and tail entities into the corresponding relation space to model their relation; and for an undirected co-occurrence relation, we project head and tail entities into a unique hyperplane in the entity space to minimize their distance. In addition, a head-tail relation-aware attentive mechanism is designed for fine-grained relation modeling. Extensive experiments have been conducted on several publicly accessible datasets to evaluate the proposed model. Results show that our model outperforms several previous state-of-the-art methods and demonstrate the effectiveness of our UGRec model.

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

↑