UGRec: Modeling Directed and Undirected Relations for Recommendation

15Citations
Citations of this article
20Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The 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 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.

References Powered by Scopus

Matrix factorization techniques for recommender systems

9139Citations
N/AReaders
Get full text

Neural collaborative filtering

5599Citations
N/AReaders
Get full text

LightGCN: Simplifying and Powering Graph Convolution Network for Recommendation

3118Citations
N/AReaders
Get full text

Cited by Powered by Scopus

HAKG: Hierarchy-Aware Knowledge Gated Network for Recommendation

34Citations
N/AReaders
Get full text

MetaKG: Meta-Learning on Knowledge Graph for Cold-Start Recommendation

24Citations
N/AReaders
Get full text

Learning from Hierarchical Structure of Knowledge Graph for Recommendation

10Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Zhao, X., Cheng, Z., Zhu, L., Zheng, J., & Li, X. (2021). UGRec: Modeling Directed and Undirected Relations for Recommendation. In SIGIR 2021 - Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval (pp. 193–202). Association for Computing Machinery, Inc. https://doi.org/10.1145/3404835.3462835

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 6

100%

Readers' Discipline

Tooltip

Computer Science 6

86%

Business, Management and Accounting 1

14%

Save time finding and organizing research with Mendeley

Sign up for free