Please use this identifier to cite or link to this item:
https://doi.org/10.1145/3357384.3360317
DC Field | Value | |
---|---|---|
dc.title | Learning and Reasoning on Graph for Recommendation | |
dc.contributor.author | Xiang Wang | |
dc.contributor.author | Xiangnan He | |
dc.contributor.author | Tat-Seng Chua | |
dc.date.accessioned | 2020-05-06T04:14:56Z | |
dc.date.available | 2020-05-06T04:14:56Z | |
dc.date.issued | 2019-11-03 | |
dc.identifier.citation | Xiang Wang, Xiangnan He, Tat-Seng Chua (2019-11-03). Learning and Reasoning on Graph for Recommendation. CIKM 2019 : 2971-2972. ScholarBank@NUS Repository. https://doi.org/10.1145/3357384.3360317 | |
dc.identifier.isbn | 9781450369763 | |
dc.identifier.uri | https://scholarbank.nus.edu.sg/handle/10635/167771 | |
dc.description.abstract | Recommendation methods construct predictive models to estimate the likelihood of a user-item interaction. Previous models largely follow a general supervised learning paradigm - treating each interaction as a separate data instance and performing prediction based on the ?information isolated island?. Such methods, however, overlook the relations among data instances, which may result in suboptimal performance especially for sparse scenarios. Moreover, the models built on a separate data instance only can hardly exhibit the reasons behind a recommendation, making the recommendation process opaque to understand. In this tutorial, we revisit the recommendation problem from the perspective of graph learning. Common data sources for recommendation can be organized into graphs, such as user-item interactions (bipartite graphs), social networks, item knowledge graphs (heterogeneous graphs), among others. Such a graph-based organization connects the isolated data instances, bringing benefits to exploiting high-order connectivities that encode meaningful patterns for collaborative filtering, content-based filtering, social influence modeling and knowledge-aware reasoning. Together with the recent success of graph neural networks (GNNs), graph-based models have exhibited the potential to be the technologies for next-generation recommendation systems. This tutorial provides a review on graph-based learning methods for recommendation, with special focus on recent developments of GNNs and knowledge graph-enhanced recommendation. By introducing this emerging and promising topic in this tutorial, we expect the audience to get deep understanding and accurate insight on the spaces, stimulate more ideas and discussions, and promote developments of technologies. ? 2019 Association for Computing Machinery. | |
dc.subject | Graph Learning | |
dc.subject | Graph Neural Network | |
dc.subject | Recommendation | |
dc.type | Conference Paper | |
dc.contributor.department | DEPT OF COMPUTER SCIENCE | |
dc.description.doi | 10.1145/3357384.3360317 | |
dc.description.sourcetitle | CIKM 2019 | |
dc.description.page | 2971-2972 | |
dc.grant.id | R-252-300-002-490 | |
dc.grant.fundingagency | Infocomm Media Development Authority | |
dc.grant.fundingagency | National Research Foundation | |
Appears in Collections: | Staff Publications Elements |
Show simple item record
Files in This Item:
File | Description | Size | Format | Access Settings | Version | |
---|---|---|---|---|---|---|
3357384.3360317.pdf | 750.15 kB | Adobe PDF | OPEN | None | View/Download |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.