XsimGCL’s cross-layer for group recommendation using extremely simple graph contrastive learning
Group recommendation involves suggesting items or activities to a group of users based on their collective preferences or characteristics. Graph contrastive learning is a technique used to learn representations of items and users in a graph structure. Although contrastive learning-based recommendati...
Gespeichert in:
Veröffentlicht in: | Cluster computing 2024-11, Vol.27 (8), p.11537-11552 |
---|---|
1. Verfasser: | |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 11552 |
---|---|
container_issue | 8 |
container_start_page | 11537 |
container_title | Cluster computing |
container_volume | 27 |
creator | Liu, Tengjiao |
description | Group recommendation involves suggesting items or activities to a group of users based on their collective preferences or characteristics. Graph contrastive learning is a technique used to learn representations of items and users in a graph structure. Although contrastive learning-based recommendation techniques reduce the data sparsity problem by extracting general features from raw data and also make the representation of user-item bipartite graph augmentations more consistent, the factors contributing to improving the performance of this technique are still not fully understood. Meanwhile, graph augmentations have little importance in contrastive learning-based recommendation and are relatively unreliable. The eXtremely Simple Graph Contrastive Learning (XSimGCL) provides novel insights into the effect of contrastive learning on recommendation, where views for contrastive learning are created through a simple yet effective noise-based embedding augmentation. Although XSimGCL infers the final group decision by dynamically aggregating the preferences of group members and includes various types of interaction, the performance of supervised learning is reduced due to the data sparsity problem, and as a result, the efficiency of group preference representation is limited. To address this challenge, we developed a Group Recommendation model based on XsimGCL in this study (GR-GCL). GR-GCL is inspired by the Light Graph Convolution Network (LightGCN) to realize simultaneous learning of multiple graphs, where initial embedding is considered the only update parameter. Also, GR-GCL improves group recommendation by applying cross-layer contrastive learning in the XSimGCL model by representing more diverse entities. The rationality analysis of our proposed GR-GCL has been performed on several datasets from both analytical and empirical perspectives. Although our model is very simple, it performs better in group recommendations by adjusting the uniformity of representations learned from counterparts based on contrastive learning. |
doi_str_mv | 10.1007/s10586-024-04563-8 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_3102238287</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>3102238287</sourcerecordid><originalsourceid>FETCH-LOGICAL-c200t-86941c00d356a358a5c96fd9d6bc6cdd53f2f341612dfabbeca0ec2c612ba9663</originalsourceid><addsrcrecordid>eNp9kMFKxDAQhoMouK6-gKeA5-gkadL0KIuuwoIXBW8hTdO1S9vUpCvuzdfw9XwS41bw5mlmmO__h_kROqdwSQHyq0hBKEmAZQQyITlRB2hGRc5JLjJ-mHqe1rkS-TE6iXEDAEXOihkqn2PTLRerr4_PiG3wMZLW7FzAtQ94Hfx2wMFZ33Wur8zY-B5vY9OvsXsfg-tcu8NJP7QusWZ4wdb3YzBxbN4cbp0JfWJP0VFt2ujOfuscPd3ePC7uyOpheb-4XhHLAEaiZJFRC1BxIQ0XyghbyLoqKllaaatK8JrVPKOSsqo2ZemsAWeZTXNpCin5HF1MvkPwr1sXR73x29Cnk5pTYIwrpvJEsYnaPxtcrYfQdCbsNAX9k6WestQpS73PUqsk4pMoJrhfu_Bn_Y_qG59Nelg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>3102238287</pqid></control><display><type>article</type><title>XsimGCL’s cross-layer for group recommendation using extremely simple graph contrastive learning</title><source>SpringerNature Journals</source><creator>Liu, Tengjiao</creator><creatorcontrib>Liu, Tengjiao</creatorcontrib><description>Group recommendation involves suggesting items or activities to a group of users based on their collective preferences or characteristics. Graph contrastive learning is a technique used to learn representations of items and users in a graph structure. Although contrastive learning-based recommendation techniques reduce the data sparsity problem by extracting general features from raw data and also make the representation of user-item bipartite graph augmentations more consistent, the factors contributing to improving the performance of this technique are still not fully understood. Meanwhile, graph augmentations have little importance in contrastive learning-based recommendation and are relatively unreliable. The eXtremely Simple Graph Contrastive Learning (XSimGCL) provides novel insights into the effect of contrastive learning on recommendation, where views for contrastive learning are created through a simple yet effective noise-based embedding augmentation. Although XSimGCL infers the final group decision by dynamically aggregating the preferences of group members and includes various types of interaction, the performance of supervised learning is reduced due to the data sparsity problem, and as a result, the efficiency of group preference representation is limited. To address this challenge, we developed a Group Recommendation model based on XsimGCL in this study (GR-GCL). GR-GCL is inspired by the Light Graph Convolution Network (LightGCN) to realize simultaneous learning of multiple graphs, where initial embedding is considered the only update parameter. Also, GR-GCL improves group recommendation by applying cross-layer contrastive learning in the XSimGCL model by representing more diverse entities. The rationality analysis of our proposed GR-GCL has been performed on several datasets from both analytical and empirical perspectives. Although our model is very simple, it performs better in group recommendations by adjusting the uniformity of representations learned from counterparts based on contrastive learning.</description><identifier>ISSN: 1386-7857</identifier><identifier>EISSN: 1573-7543</identifier><identifier>DOI: 10.1007/s10586-024-04563-8</identifier><language>eng</language><publisher>New York: Springer US</publisher><subject>Collaboration ; Computer Communication Networks ; Computer Science ; Data augmentation ; Embedding ; Graph theory ; Graphical representations ; Graphs ; Group dynamics ; Learning ; Neural networks ; Noise ; Operating Systems ; Preferences ; Processor Architectures ; Recommender systems ; Social networks ; Sparsity ; Supervised learning</subject><ispartof>Cluster computing, 2024-11, Vol.27 (8), p.11537-11552</ispartof><rights>The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2024. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c200t-86941c00d356a358a5c96fd9d6bc6cdd53f2f341612dfabbeca0ec2c612ba9663</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s10586-024-04563-8$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s10586-024-04563-8$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,780,784,27924,27925,41488,42557,51319</link.rule.ids></links><search><creatorcontrib>Liu, Tengjiao</creatorcontrib><title>XsimGCL’s cross-layer for group recommendation using extremely simple graph contrastive learning</title><title>Cluster computing</title><addtitle>Cluster Comput</addtitle><description>Group recommendation involves suggesting items or activities to a group of users based on their collective preferences or characteristics. Graph contrastive learning is a technique used to learn representations of items and users in a graph structure. Although contrastive learning-based recommendation techniques reduce the data sparsity problem by extracting general features from raw data and also make the representation of user-item bipartite graph augmentations more consistent, the factors contributing to improving the performance of this technique are still not fully understood. Meanwhile, graph augmentations have little importance in contrastive learning-based recommendation and are relatively unreliable. The eXtremely Simple Graph Contrastive Learning (XSimGCL) provides novel insights into the effect of contrastive learning on recommendation, where views for contrastive learning are created through a simple yet effective noise-based embedding augmentation. Although XSimGCL infers the final group decision by dynamically aggregating the preferences of group members and includes various types of interaction, the performance of supervised learning is reduced due to the data sparsity problem, and as a result, the efficiency of group preference representation is limited. To address this challenge, we developed a Group Recommendation model based on XsimGCL in this study (GR-GCL). GR-GCL is inspired by the Light Graph Convolution Network (LightGCN) to realize simultaneous learning of multiple graphs, where initial embedding is considered the only update parameter. Also, GR-GCL improves group recommendation by applying cross-layer contrastive learning in the XSimGCL model by representing more diverse entities. The rationality analysis of our proposed GR-GCL has been performed on several datasets from both analytical and empirical perspectives. Although our model is very simple, it performs better in group recommendations by adjusting the uniformity of representations learned from counterparts based on contrastive learning.</description><subject>Collaboration</subject><subject>Computer Communication Networks</subject><subject>Computer Science</subject><subject>Data augmentation</subject><subject>Embedding</subject><subject>Graph theory</subject><subject>Graphical representations</subject><subject>Graphs</subject><subject>Group dynamics</subject><subject>Learning</subject><subject>Neural networks</subject><subject>Noise</subject><subject>Operating Systems</subject><subject>Preferences</subject><subject>Processor Architectures</subject><subject>Recommender systems</subject><subject>Social networks</subject><subject>Sparsity</subject><subject>Supervised learning</subject><issn>1386-7857</issn><issn>1573-7543</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><recordid>eNp9kMFKxDAQhoMouK6-gKeA5-gkadL0KIuuwoIXBW8hTdO1S9vUpCvuzdfw9XwS41bw5mlmmO__h_kROqdwSQHyq0hBKEmAZQQyITlRB2hGRc5JLjJ-mHqe1rkS-TE6iXEDAEXOihkqn2PTLRerr4_PiG3wMZLW7FzAtQ94Hfx2wMFZ33Wur8zY-B5vY9OvsXsfg-tcu8NJP7QusWZ4wdb3YzBxbN4cbp0JfWJP0VFt2ujOfuscPd3ePC7uyOpheb-4XhHLAEaiZJFRC1BxIQ0XyghbyLoqKllaaatK8JrVPKOSsqo2ZemsAWeZTXNpCin5HF1MvkPwr1sXR73x29Cnk5pTYIwrpvJEsYnaPxtcrYfQdCbsNAX9k6WestQpS73PUqsk4pMoJrhfu_Bn_Y_qG59Nelg</recordid><startdate>20241101</startdate><enddate>20241101</enddate><creator>Liu, Tengjiao</creator><general>Springer US</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>JQ2</scope></search><sort><creationdate>20241101</creationdate><title>XsimGCL’s cross-layer for group recommendation using extremely simple graph contrastive learning</title><author>Liu, Tengjiao</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c200t-86941c00d356a358a5c96fd9d6bc6cdd53f2f341612dfabbeca0ec2c612ba9663</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Collaboration</topic><topic>Computer Communication Networks</topic><topic>Computer Science</topic><topic>Data augmentation</topic><topic>Embedding</topic><topic>Graph theory</topic><topic>Graphical representations</topic><topic>Graphs</topic><topic>Group dynamics</topic><topic>Learning</topic><topic>Neural networks</topic><topic>Noise</topic><topic>Operating Systems</topic><topic>Preferences</topic><topic>Processor Architectures</topic><topic>Recommender systems</topic><topic>Social networks</topic><topic>Sparsity</topic><topic>Supervised learning</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Liu, Tengjiao</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Computer Science Collection</collection><jtitle>Cluster computing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Liu, Tengjiao</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>XsimGCL’s cross-layer for group recommendation using extremely simple graph contrastive learning</atitle><jtitle>Cluster computing</jtitle><stitle>Cluster Comput</stitle><date>2024-11-01</date><risdate>2024</risdate><volume>27</volume><issue>8</issue><spage>11537</spage><epage>11552</epage><pages>11537-11552</pages><issn>1386-7857</issn><eissn>1573-7543</eissn><abstract>Group recommendation involves suggesting items or activities to a group of users based on their collective preferences or characteristics. Graph contrastive learning is a technique used to learn representations of items and users in a graph structure. Although contrastive learning-based recommendation techniques reduce the data sparsity problem by extracting general features from raw data and also make the representation of user-item bipartite graph augmentations more consistent, the factors contributing to improving the performance of this technique are still not fully understood. Meanwhile, graph augmentations have little importance in contrastive learning-based recommendation and are relatively unreliable. The eXtremely Simple Graph Contrastive Learning (XSimGCL) provides novel insights into the effect of contrastive learning on recommendation, where views for contrastive learning are created through a simple yet effective noise-based embedding augmentation. Although XSimGCL infers the final group decision by dynamically aggregating the preferences of group members and includes various types of interaction, the performance of supervised learning is reduced due to the data sparsity problem, and as a result, the efficiency of group preference representation is limited. To address this challenge, we developed a Group Recommendation model based on XsimGCL in this study (GR-GCL). GR-GCL is inspired by the Light Graph Convolution Network (LightGCN) to realize simultaneous learning of multiple graphs, where initial embedding is considered the only update parameter. Also, GR-GCL improves group recommendation by applying cross-layer contrastive learning in the XSimGCL model by representing more diverse entities. The rationality analysis of our proposed GR-GCL has been performed on several datasets from both analytical and empirical perspectives. Although our model is very simple, it performs better in group recommendations by adjusting the uniformity of representations learned from counterparts based on contrastive learning.</abstract><cop>New York</cop><pub>Springer US</pub><doi>10.1007/s10586-024-04563-8</doi><tpages>16</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1386-7857 |
ispartof | Cluster computing, 2024-11, Vol.27 (8), p.11537-11552 |
issn | 1386-7857 1573-7543 |
language | eng |
recordid | cdi_proquest_journals_3102238287 |
source | SpringerNature Journals |
subjects | Collaboration Computer Communication Networks Computer Science Data augmentation Embedding Graph theory Graphical representations Graphs Group dynamics Learning Neural networks Noise Operating Systems Preferences Processor Architectures Recommender systems Social networks Sparsity Supervised learning |
title | XsimGCL’s cross-layer for group recommendation using extremely simple graph contrastive learning |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-28T20%3A35%3A26IST&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=XsimGCL%E2%80%99s%20cross-layer%20for%20group%20recommendation%20using%20extremely%20simple%20graph%20contrastive%20learning&rft.jtitle=Cluster%20computing&rft.au=Liu,%20Tengjiao&rft.date=2024-11-01&rft.volume=27&rft.issue=8&rft.spage=11537&rft.epage=11552&rft.pages=11537-11552&rft.issn=1386-7857&rft.eissn=1573-7543&rft_id=info:doi/10.1007/s10586-024-04563-8&rft_dat=%3Cproquest_cross%3E3102238287%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=3102238287&rft_id=info:pmid/&rfr_iscdi=true |