RETRACTED: A Global Structural Hypergraph Convolutional Model for Bundle Recommendation
Bundle recommendations provide personalized suggestions to users by combining related items into bundles, aiming to enhance users’ shopping experiences and boost merchants’ sales revenue. Existing solutions based on graph neural networks (GNN) face several significant challenges: (1) it is demanding...
Gespeichert in:
Veröffentlicht in: | Electronics (Basel) 2023-09, Vol.12 (18), p.3952 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | |
---|---|
container_issue | 18 |
container_start_page | 3952 |
container_title | Electronics (Basel) |
container_volume | 12 |
creator | Liu, Xingtong Yuan, Man |
description | Bundle recommendations provide personalized suggestions to users by combining related items into bundles, aiming to enhance users’ shopping experiences and boost merchants’ sales revenue. Existing solutions based on graph neural networks (GNN) face several significant challenges: (1) it is demanding to explicitly model multiple complex associations using standard graph neural networks, (2) numerous additional nodes and edges are introduced to approximate higher-order associations, and (3) the user–bundle historical interaction data are highly sparse. In this work, we propose a global structural hypergraph convolutional model for bundle recommendation (SHCBR) to address the above problems. Specifically, we jointly incorporate multiple complex interactions between users, items, and bundles into a relational hypergraph without introducing additional nodes and edges. The hypergraph structure inherently incorporates higher-order associations, thereby alleviating the training burden on neural networks and the dilemma of scarce data effectively. In addition, we design a special matrix propagation rule that captures non-pairwise complex relationships between entities. Using item nodes as links, structural hypergraph convolutional networks learn representations of users and bundles on a relational hypergraph. Experiments conducted on two real-world datasets demonstrate that the SHCBR outperforms the state-of-the-art baselines by 11.07–25.66% on Recall and 16.81–33.53% on NDCG. Experimental results further indicate that the approach based on hypergraphs can offer new insights for addressing bundle recommendation challenges. The codes and datasets have been publicly released on GitHub. |
doi_str_mv | 10.3390/electronics12183952 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2869329401</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2869329401</sourcerecordid><originalsourceid>FETCH-LOGICAL-c1672-731c040af31500044b0d33a69929fdd81af8dfcbd8cd7df36d57bb00dbf6bcb43</originalsourceid><addsrcrecordid>eNptkE1LAzEQhoMoWGp_gZeA59Uks93deKtrbQVFqBWPSz61Jd2sya7Qf29KPXhwLvPCPAwPL0KXlFwDcHJjnFF98O1GRcpoBXzKTtCIkZJnnHF2-iefo0mMW5KGU6iAjND7ar5ezer1_P4Wz_DCeSkcfu3DoPohpLjcdyZ8BNF94tq3394N_ca36fDstXHY-oDvhlY7g1dG-d3OtFociAt0ZoWLZvK7x-jtYb6ul9nTy-Kxnj1lihYly0qgiuREWKDTZJXnkmgAUfBka7WuqLCVtkrqSulSWyj0tJSSEC1tIZXMYYyujn-74L8GE_tm64eQBGPDqoID4zmhiYIjpYKPMRjbdGGzE2HfUNIcSmz-KRF-AJy0aEc</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2869329401</pqid></control><display><type>article</type><title>RETRACTED: A Global Structural Hypergraph Convolutional Model for Bundle Recommendation</title><source>Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals</source><source>MDPI - Multidisciplinary Digital Publishing Institute</source><creator>Liu, Xingtong ; Yuan, Man</creator><creatorcontrib>Liu, Xingtong ; Yuan, Man</creatorcontrib><description>Bundle recommendations provide personalized suggestions to users by combining related items into bundles, aiming to enhance users’ shopping experiences and boost merchants’ sales revenue. Existing solutions based on graph neural networks (GNN) face several significant challenges: (1) it is demanding to explicitly model multiple complex associations using standard graph neural networks, (2) numerous additional nodes and edges are introduced to approximate higher-order associations, and (3) the user–bundle historical interaction data are highly sparse. In this work, we propose a global structural hypergraph convolutional model for bundle recommendation (SHCBR) to address the above problems. Specifically, we jointly incorporate multiple complex interactions between users, items, and bundles into a relational hypergraph without introducing additional nodes and edges. The hypergraph structure inherently incorporates higher-order associations, thereby alleviating the training burden on neural networks and the dilemma of scarce data effectively. In addition, we design a special matrix propagation rule that captures non-pairwise complex relationships between entities. Using item nodes as links, structural hypergraph convolutional networks learn representations of users and bundles on a relational hypergraph. Experiments conducted on two real-world datasets demonstrate that the SHCBR outperforms the state-of-the-art baselines by 11.07–25.66% on Recall and 16.81–33.53% on NDCG. Experimental results further indicate that the approach based on hypergraphs can offer new insights for addressing bundle recommendation challenges. The codes and datasets have been publicly released on GitHub.</description><identifier>ISSN: 2079-9292</identifier><identifier>EISSN: 2079-9292</identifier><identifier>DOI: 10.3390/electronics12183952</identifier><language>eng</language><publisher>Basel: MDPI AG</publisher><subject>Collaboration ; Data mining ; Datasets ; Graph neural networks ; Graph theory ; Graphs ; Integer programming ; Neural networks ; Nodes ; Propagation ; Recommender systems ; Sparsity</subject><ispartof>Electronics (Basel), 2023-09, Vol.12 (18), p.3952</ispartof><rights>2023 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c1672-731c040af31500044b0d33a69929fdd81af8dfcbd8cd7df36d57bb00dbf6bcb43</citedby><cites>FETCH-LOGICAL-c1672-731c040af31500044b0d33a69929fdd81af8dfcbd8cd7df36d57bb00dbf6bcb43</cites><orcidid>0009-0002-7954-941X</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>315,781,785,27928,27929</link.rule.ids></links><search><creatorcontrib>Liu, Xingtong</creatorcontrib><creatorcontrib>Yuan, Man</creatorcontrib><title>RETRACTED: A Global Structural Hypergraph Convolutional Model for Bundle Recommendation</title><title>Electronics (Basel)</title><description>Bundle recommendations provide personalized suggestions to users by combining related items into bundles, aiming to enhance users’ shopping experiences and boost merchants’ sales revenue. Existing solutions based on graph neural networks (GNN) face several significant challenges: (1) it is demanding to explicitly model multiple complex associations using standard graph neural networks, (2) numerous additional nodes and edges are introduced to approximate higher-order associations, and (3) the user–bundle historical interaction data are highly sparse. In this work, we propose a global structural hypergraph convolutional model for bundle recommendation (SHCBR) to address the above problems. Specifically, we jointly incorporate multiple complex interactions between users, items, and bundles into a relational hypergraph without introducing additional nodes and edges. The hypergraph structure inherently incorporates higher-order associations, thereby alleviating the training burden on neural networks and the dilemma of scarce data effectively. In addition, we design a special matrix propagation rule that captures non-pairwise complex relationships between entities. Using item nodes as links, structural hypergraph convolutional networks learn representations of users and bundles on a relational hypergraph. Experiments conducted on two real-world datasets demonstrate that the SHCBR outperforms the state-of-the-art baselines by 11.07–25.66% on Recall and 16.81–33.53% on NDCG. Experimental results further indicate that the approach based on hypergraphs can offer new insights for addressing bundle recommendation challenges. The codes and datasets have been publicly released on GitHub.</description><subject>Collaboration</subject><subject>Data mining</subject><subject>Datasets</subject><subject>Graph neural networks</subject><subject>Graph theory</subject><subject>Graphs</subject><subject>Integer programming</subject><subject>Neural networks</subject><subject>Nodes</subject><subject>Propagation</subject><subject>Recommender systems</subject><subject>Sparsity</subject><issn>2079-9292</issn><issn>2079-9292</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><recordid>eNptkE1LAzEQhoMoWGp_gZeA59Uks93deKtrbQVFqBWPSz61Jd2sya7Qf29KPXhwLvPCPAwPL0KXlFwDcHJjnFF98O1GRcpoBXzKTtCIkZJnnHF2-iefo0mMW5KGU6iAjND7ar5ezer1_P4Wz_DCeSkcfu3DoPohpLjcdyZ8BNF94tq3394N_ca36fDstXHY-oDvhlY7g1dG-d3OtFociAt0ZoWLZvK7x-jtYb6ul9nTy-Kxnj1lihYly0qgiuREWKDTZJXnkmgAUfBka7WuqLCVtkrqSulSWyj0tJSSEC1tIZXMYYyujn-74L8GE_tm64eQBGPDqoID4zmhiYIjpYKPMRjbdGGzE2HfUNIcSmz-KRF-AJy0aEc</recordid><startdate>20230919</startdate><enddate>20230919</enddate><creator>Liu, Xingtong</creator><creator>Yuan, Man</creator><general>MDPI AG</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SP</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L7M</scope><scope>P5Z</scope><scope>P62</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><orcidid>https://orcid.org/0009-0002-7954-941X</orcidid></search><sort><creationdate>20230919</creationdate><title>RETRACTED: A Global Structural Hypergraph Convolutional Model for Bundle Recommendation</title><author>Liu, Xingtong ; Yuan, Man</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c1672-731c040af31500044b0d33a69929fdd81af8dfcbd8cd7df36d57bb00dbf6bcb43</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Collaboration</topic><topic>Data mining</topic><topic>Datasets</topic><topic>Graph neural networks</topic><topic>Graph theory</topic><topic>Graphs</topic><topic>Integer programming</topic><topic>Neural networks</topic><topic>Nodes</topic><topic>Propagation</topic><topic>Recommender systems</topic><topic>Sparsity</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Liu, Xingtong</creatorcontrib><creatorcontrib>Yuan, Man</creatorcontrib><collection>CrossRef</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><jtitle>Electronics (Basel)</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Liu, Xingtong</au><au>Yuan, Man</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>RETRACTED: A Global Structural Hypergraph Convolutional Model for Bundle Recommendation</atitle><jtitle>Electronics (Basel)</jtitle><date>2023-09-19</date><risdate>2023</risdate><volume>12</volume><issue>18</issue><spage>3952</spage><pages>3952-</pages><issn>2079-9292</issn><eissn>2079-9292</eissn><abstract>Bundle recommendations provide personalized suggestions to users by combining related items into bundles, aiming to enhance users’ shopping experiences and boost merchants’ sales revenue. Existing solutions based on graph neural networks (GNN) face several significant challenges: (1) it is demanding to explicitly model multiple complex associations using standard graph neural networks, (2) numerous additional nodes and edges are introduced to approximate higher-order associations, and (3) the user–bundle historical interaction data are highly sparse. In this work, we propose a global structural hypergraph convolutional model for bundle recommendation (SHCBR) to address the above problems. Specifically, we jointly incorporate multiple complex interactions between users, items, and bundles into a relational hypergraph without introducing additional nodes and edges. The hypergraph structure inherently incorporates higher-order associations, thereby alleviating the training burden on neural networks and the dilemma of scarce data effectively. In addition, we design a special matrix propagation rule that captures non-pairwise complex relationships between entities. Using item nodes as links, structural hypergraph convolutional networks learn representations of users and bundles on a relational hypergraph. Experiments conducted on two real-world datasets demonstrate that the SHCBR outperforms the state-of-the-art baselines by 11.07–25.66% on Recall and 16.81–33.53% on NDCG. Experimental results further indicate that the approach based on hypergraphs can offer new insights for addressing bundle recommendation challenges. The codes and datasets have been publicly released on GitHub.</abstract><cop>Basel</cop><pub>MDPI AG</pub><doi>10.3390/electronics12183952</doi><orcidid>https://orcid.org/0009-0002-7954-941X</orcidid><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | ISSN: 2079-9292 |
ispartof | Electronics (Basel), 2023-09, Vol.12 (18), p.3952 |
issn | 2079-9292 2079-9292 |
language | eng |
recordid | cdi_proquest_journals_2869329401 |
source | Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals; MDPI - Multidisciplinary Digital Publishing Institute |
subjects | Collaboration Data mining Datasets Graph neural networks Graph theory Graphs Integer programming Neural networks Nodes Propagation Recommender systems Sparsity |
title | RETRACTED: A Global Structural Hypergraph Convolutional Model 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=2024-12-17T09%3A04%3A48IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=RETRACTED:%20A%20Global%20Structural%20Hypergraph%20Convolutional%20Model%20for%20Bundle%20Recommendation&rft.jtitle=Electronics%20(Basel)&rft.au=Liu,%20Xingtong&rft.date=2023-09-19&rft.volume=12&rft.issue=18&rft.spage=3952&rft.pages=3952-&rft.issn=2079-9292&rft.eissn=2079-9292&rft_id=info:doi/10.3390/electronics12183952&rft_dat=%3Cproquest_cross%3E2869329401%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2869329401&rft_id=info:pmid/&rfr_iscdi=true |