SUGER: A Subgraph-based Graph Convolutional Network Method for Bundle Recommendation
Bundle recommendation is an emerging research direction in the recommender system with the focus on recommending customized bundles of items for users. Although Graph Neural Networks (GNNs) have been applied in this problem and achieve superior performance, existing methods underexplore the graph-le...
Gespeichert in:
Hauptverfasser: | , , |
---|---|
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | |
---|---|
container_issue | |
container_start_page | |
container_title | |
container_volume | |
creator | Zhang, Zhenning Du, Boxin Tong, Hanghang |
description | Bundle recommendation is an emerging research direction in the recommender
system with the focus on recommending customized bundles of items for users.
Although Graph Neural Networks (GNNs) have been applied in this problem and
achieve superior performance, existing methods underexplore the graph-level GNN
methods, which exhibit great potential in traditional recommender system.
Furthermore, they usually lack the transferability from one domain with
sufficient supervision to another domain which might suffer from the label
scarcity issue. In this work, we propose a subgraph-based Graph Neural Network
model, SUGER, for bundle recommendation to handle these limitations. SUGER
generates heterogeneous subgraphs around the user-bundle pairs, and then maps
those subgraphs to the users' preference predictions via neural relational
graph propagation. Experimental results show that SUGER significantly
outperforms the state-of-the-art baselines in both the basic and the transfer
bundle recommendation problems. |
doi_str_mv | 10.48550/arxiv.2205.11231 |
format | Article |
fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2205_11231</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2205_11231</sourcerecordid><originalsourceid>FETCH-LOGICAL-a671-7db8758981f9794cade348eb11f24fd929c81ee924b140f4c3b7b28b64a614103</originalsourceid><addsrcrecordid>eNotz0FPgzAcBfBePJjpB_BkvwDIvxTaeptkosnUZGNn0tJ_NyLQpYOp394wPb13eHnJj5A7SGIusyx50OG7PceMJVkMwFK4JtV2V642j3RJt5PZB308REaf0NJy7rTww9l309j6QXf0HccvHz7pG44Hb6nzgT5Ng-2QbrDxfY-D1fP0hlw53Z3w9j8XpHpeVcVLtP4oX4vlOtK5gEhYI0UmlQSnhOKNtphyiQbAMe6sYqqRgKgYN8ATx5vUCMOkybnOgUOSLsj93-2FVR9D2-vwU8-8-sJLfwHqVUn4</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>SUGER: A Subgraph-based Graph Convolutional Network Method for Bundle Recommendation</title><source>arXiv.org</source><creator>Zhang, Zhenning ; Du, Boxin ; Tong, Hanghang</creator><creatorcontrib>Zhang, Zhenning ; Du, Boxin ; Tong, Hanghang</creatorcontrib><description>Bundle recommendation is an emerging research direction in the recommender
system with the focus on recommending customized bundles of items for users.
Although Graph Neural Networks (GNNs) have been applied in this problem and
achieve superior performance, existing methods underexplore the graph-level GNN
methods, which exhibit great potential in traditional recommender system.
Furthermore, they usually lack the transferability from one domain with
sufficient supervision to another domain which might suffer from the label
scarcity issue. In this work, we propose a subgraph-based Graph Neural Network
model, SUGER, for bundle recommendation to handle these limitations. SUGER
generates heterogeneous subgraphs around the user-bundle pairs, and then maps
those subgraphs to the users' preference predictions via neural relational
graph propagation. Experimental results show that SUGER significantly
outperforms the state-of-the-art baselines in both the basic and the transfer
bundle recommendation problems.</description><identifier>DOI: 10.48550/arxiv.2205.11231</identifier><language>eng</language><subject>Computer Science - Information Retrieval</subject><creationdate>2022-05</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2205.11231$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2205.11231$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Zhang, Zhenning</creatorcontrib><creatorcontrib>Du, Boxin</creatorcontrib><creatorcontrib>Tong, Hanghang</creatorcontrib><title>SUGER: A Subgraph-based Graph Convolutional Network Method for Bundle Recommendation</title><description>Bundle recommendation is an emerging research direction in the recommender
system with the focus on recommending customized bundles of items for users.
Although Graph Neural Networks (GNNs) have been applied in this problem and
achieve superior performance, existing methods underexplore the graph-level GNN
methods, which exhibit great potential in traditional recommender system.
Furthermore, they usually lack the transferability from one domain with
sufficient supervision to another domain which might suffer from the label
scarcity issue. In this work, we propose a subgraph-based Graph Neural Network
model, SUGER, for bundle recommendation to handle these limitations. SUGER
generates heterogeneous subgraphs around the user-bundle pairs, and then maps
those subgraphs to the users' preference predictions via neural relational
graph propagation. Experimental results show that SUGER significantly
outperforms the state-of-the-art baselines in both the basic and the transfer
bundle recommendation problems.</description><subject>Computer Science - Information Retrieval</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotz0FPgzAcBfBePJjpB_BkvwDIvxTaeptkosnUZGNn0tJ_NyLQpYOp394wPb13eHnJj5A7SGIusyx50OG7PceMJVkMwFK4JtV2V642j3RJt5PZB308REaf0NJy7rTww9l309j6QXf0HccvHz7pG44Hb6nzgT5Ng-2QbrDxfY-D1fP0hlw53Z3w9j8XpHpeVcVLtP4oX4vlOtK5gEhYI0UmlQSnhOKNtphyiQbAMe6sYqqRgKgYN8ATx5vUCMOkybnOgUOSLsj93-2FVR9D2-vwU8-8-sJLfwHqVUn4</recordid><startdate>20220505</startdate><enddate>20220505</enddate><creator>Zhang, Zhenning</creator><creator>Du, Boxin</creator><creator>Tong, Hanghang</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20220505</creationdate><title>SUGER: A Subgraph-based Graph Convolutional Network Method for Bundle Recommendation</title><author>Zhang, Zhenning ; Du, Boxin ; Tong, Hanghang</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a671-7db8758981f9794cade348eb11f24fd929c81ee924b140f4c3b7b28b64a614103</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Computer Science - Information Retrieval</topic><toplevel>online_resources</toplevel><creatorcontrib>Zhang, Zhenning</creatorcontrib><creatorcontrib>Du, Boxin</creatorcontrib><creatorcontrib>Tong, Hanghang</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Zhang, Zhenning</au><au>Du, Boxin</au><au>Tong, Hanghang</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>SUGER: A Subgraph-based Graph Convolutional Network Method for Bundle Recommendation</atitle><date>2022-05-05</date><risdate>2022</risdate><abstract>Bundle recommendation is an emerging research direction in the recommender
system with the focus on recommending customized bundles of items for users.
Although Graph Neural Networks (GNNs) have been applied in this problem and
achieve superior performance, existing methods underexplore the graph-level GNN
methods, which exhibit great potential in traditional recommender system.
Furthermore, they usually lack the transferability from one domain with
sufficient supervision to another domain which might suffer from the label
scarcity issue. In this work, we propose a subgraph-based Graph Neural Network
model, SUGER, for bundle recommendation to handle these limitations. SUGER
generates heterogeneous subgraphs around the user-bundle pairs, and then maps
those subgraphs to the users' preference predictions via neural relational
graph propagation. Experimental results show that SUGER significantly
outperforms the state-of-the-art baselines in both the basic and the transfer
bundle recommendation problems.</abstract><doi>10.48550/arxiv.2205.11231</doi><oa>free_for_read</oa></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | DOI: 10.48550/arxiv.2205.11231 |
ispartof | |
issn | |
language | eng |
recordid | cdi_arxiv_primary_2205_11231 |
source | arXiv.org |
subjects | Computer Science - Information Retrieval |
title | SUGER: A Subgraph-based Graph Convolutional Network Method for Bundle Recommendation |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-23T21%3A51%3A48IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=SUGER:%20A%20Subgraph-based%20Graph%20Convolutional%20Network%20Method%20for%20Bundle%20Recommendation&rft.au=Zhang,%20Zhenning&rft.date=2022-05-05&rft_id=info:doi/10.48550/arxiv.2205.11231&rft_dat=%3Carxiv_GOX%3E2205_11231%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |