UGRec: Modeling Directed and Undirected Relations for Recommendation
Xinxiao Zhao, Zhiyong Cheng, Lei Zhu, Jiecai Zheng, Xueqing Li
摘要
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., 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 itemitem 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.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper3
- HAKG: Hierarchy-Aware Knowledge Gated Network for RecommendationYuntao Du, Xinjun Zhu, Lu Chen, Baihua Zheng 等SIGIR 2022 · 被引用 52 次
- Toward Effective Digraph Representation Learning: A Magnetic Adaptive Propagation based ApproachXunkai Li, Daohan Su, Zhengyu Wu, Guang Zeng 等WWW 2025 · 被引用 4 次
- InBox: Recommendation with Knowledge Graph using Interest Box EmbeddingZezhong Xu, Yincen Qu, Wen Zhang, Lei Liang 等VLDB 2024 · 被引用 1 次
它引用的顶会 Paper3
- LightGCN: Simplifying and Powering Graph Convolution Network for RecommendationXiangnan He, Kuan Deng, Xiang Wang, Yan Li 等SIGIR 2020 · 被引用 4,448 次
- Try This Instead: Personalized and Interpretable Substitute RecommendationTong Chen, Hongzhi Yin, Guanhua Ye, Zi Huang 等SIGIR 2020 · 被引用 108 次
- Joint Item Recommendation and Attribute Inference: An Adaptive Graph Convolutional Network ApproachLe Wu, Yonghui Yang, Kun Zhang, Richang Hong 等SIGIR 2020 · 被引用 104 次
相关 Paper
- CKAN: Collaborative Knowledge-aware Attentive Network for Recommender SystemsZe Wang, Guangyan Lin, Huobin Tan, Qinghong Chen 等SIGIR 2020 · 被引用 311 次
- Neural Graph Matching based Collaborative FilteringYixin Su, Rui Zhang, Sarah M. Erfani, Junhao GanSIGIR 2021 · 被引用 45 次
- Knowledge-Enhanced Recommendation with User-Centric Subgraph NetworkGuangyi Liu, Quanming Yao, Yongqi Zhang, Lei ChenICDE 2024 · 被引用 6 次
- Attentive Knowledge-aware Graph Convolutional Networks with Collaborative Guidance for Personalized RecommendationYankai Chen, Yaming Yang, Yujing Wang, Jing Bai 等ICDE 2022 · 被引用 81 次
- Unify Local and Global Information for Top-N RecommendationXiaoming Liu, Shaocong Wu, Zhaohan Zhang, Chao ShenSIGIR 2022 · 被引用 11 次
