Social Recommendation with Self-Supervised Metagraph Informax Network
In recent years, researchers attempt to utilize online social information to alleviate data sparsity for collaborative filtering, based on the rationale that social networks offers the insights to understand the behavioral patterns. However, due to the overlook of inter-dependent knowledge across it...
Gespeichert in:
Veröffentlicht in: | arXiv.org 2021-10 |
---|---|
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 | |
container_start_page | |
container_title | arXiv.org |
container_volume | |
creator | Long, Xiaoling Huang, Chao Xu, Yong Xu, Huance Dai, Peng Xia, Lianghao Liefeng Bo |
description | In recent years, researchers attempt to utilize online social information to alleviate data sparsity for collaborative filtering, based on the rationale that social networks offers the insights to understand the behavioral patterns. However, due to the overlook of inter-dependent knowledge across items (e.g., categories of products), existing social recommender systems are insufficient to distill the heterogeneous collaborative signals from both user and item sides. In this work, we propose a Self-Supervised Metagraph Infor-max Network (SMIN) which investigates the potential of jointly incorporating social- and knowledge-aware relational structures into the user preference representation for recommendation. To model relation heterogeneity, we design a metapath-guided heterogeneous graph neural network to aggregate feature embeddings from different types of meta-relations across users and items, em-powering SMIN to maintain dedicated representations for multi-faceted user- and item-wise dependencies. Additionally, to inject high-order collaborative signals, we generalize the mutual information learning paradigm under the self-supervised graph-based collaborative filtering. This endows the expressive modeling of user-item interactive patterns, by exploring global-level collaborative relations and underlying isomorphic transformation property of graph topology. Experimental results on several real-world datasets demonstrate the effectiveness of our SMIN model over various state-of-the-art recommendation methods. We release our source code at https://github.com/SocialRecsys/SMIN. |
doi_str_mv | 10.48550/arxiv.2110.03958 |
format | Article |
fullrecord | <record><control><sourceid>proquest_arxiv</sourceid><recordid>TN_cdi_arxiv_primary_2110_03958</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2580808906</sourcerecordid><originalsourceid>FETCH-LOGICAL-a526-1e94149fbe87e21b38cc4124f4e7c02a450b6cd402e818930b56ebbdfde814b63</originalsourceid><addsrcrecordid>eNotj01Lw0AQhhdBsNT-AE8ueE7dz2RzlFK1UBVM72E3mbVbk2zcJP3498ZW3sPwDg_DPAjdUTIXSkryqMPR7eeMjgvCU6mu0IRxTiMlGLtBs67bEUJYnDAp-QQtM184XeFPKHxdQ1Pq3vkGH1y_xRlUNsqGFsLedVDiN-j1V9DtFq8a60Otj_gd-oMP37fo2uqqg9n_nKLN83KzeI3WHy-rxdM60pLFEYVUUJFaAyoBRg1XRSEoE1ZAUhCmhSQmLkpBGCiqUk6MjMGY0pZjFybmU3R_OXt2zNvgah1O-Z9rfnYdiYcL0Qb_M0DX5zs_hGb8KWdSkTEpifkvMwVXCg</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2580808906</pqid></control><display><type>article</type><title>Social Recommendation with Self-Supervised Metagraph Informax Network</title><source>arXiv.org</source><source>Free E- Journals</source><creator>Long, Xiaoling ; Huang, Chao ; Xu, Yong ; Xu, Huance ; Dai, Peng ; Xia, Lianghao ; Liefeng Bo</creator><creatorcontrib>Long, Xiaoling ; Huang, Chao ; Xu, Yong ; Xu, Huance ; Dai, Peng ; Xia, Lianghao ; Liefeng Bo</creatorcontrib><description>In recent years, researchers attempt to utilize online social information to alleviate data sparsity for collaborative filtering, based on the rationale that social networks offers the insights to understand the behavioral patterns. However, due to the overlook of inter-dependent knowledge across items (e.g., categories of products), existing social recommender systems are insufficient to distill the heterogeneous collaborative signals from both user and item sides. In this work, we propose a Self-Supervised Metagraph Infor-max Network (SMIN) which investigates the potential of jointly incorporating social- and knowledge-aware relational structures into the user preference representation for recommendation. To model relation heterogeneity, we design a metapath-guided heterogeneous graph neural network to aggregate feature embeddings from different types of meta-relations across users and items, em-powering SMIN to maintain dedicated representations for multi-faceted user- and item-wise dependencies. Additionally, to inject high-order collaborative signals, we generalize the mutual information learning paradigm under the self-supervised graph-based collaborative filtering. This endows the expressive modeling of user-item interactive patterns, by exploring global-level collaborative relations and underlying isomorphic transformation property of graph topology. Experimental results on several real-world datasets demonstrate the effectiveness of our SMIN model over various state-of-the-art recommendation methods. We release our source code at https://github.com/SocialRecsys/SMIN.</description><identifier>EISSN: 2331-8422</identifier><identifier>DOI: 10.48550/arxiv.2110.03958</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Collaboration ; Computer Science - Artificial Intelligence ; Computer Science - Information Retrieval ; Filtration ; Graph neural networks ; Heterogeneity ; Recommender systems ; Representations ; Social networks ; Source code ; Topology</subject><ispartof>arXiv.org, 2021-10</ispartof><rights>2021. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><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,780,881,27902</link.rule.ids><backlink>$$Uhttps://doi.org/10.1145/3459637.3482480$$DView published paper (Access to full text may be restricted)$$Hfree_for_read</backlink><backlink>$$Uhttps://doi.org/10.48550/arXiv.2110.03958$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Long, Xiaoling</creatorcontrib><creatorcontrib>Huang, Chao</creatorcontrib><creatorcontrib>Xu, Yong</creatorcontrib><creatorcontrib>Xu, Huance</creatorcontrib><creatorcontrib>Dai, Peng</creatorcontrib><creatorcontrib>Xia, Lianghao</creatorcontrib><creatorcontrib>Liefeng Bo</creatorcontrib><title>Social Recommendation with Self-Supervised Metagraph Informax Network</title><title>arXiv.org</title><description>In recent years, researchers attempt to utilize online social information to alleviate data sparsity for collaborative filtering, based on the rationale that social networks offers the insights to understand the behavioral patterns. However, due to the overlook of inter-dependent knowledge across items (e.g., categories of products), existing social recommender systems are insufficient to distill the heterogeneous collaborative signals from both user and item sides. In this work, we propose a Self-Supervised Metagraph Infor-max Network (SMIN) which investigates the potential of jointly incorporating social- and knowledge-aware relational structures into the user preference representation for recommendation. To model relation heterogeneity, we design a metapath-guided heterogeneous graph neural network to aggregate feature embeddings from different types of meta-relations across users and items, em-powering SMIN to maintain dedicated representations for multi-faceted user- and item-wise dependencies. Additionally, to inject high-order collaborative signals, we generalize the mutual information learning paradigm under the self-supervised graph-based collaborative filtering. This endows the expressive modeling of user-item interactive patterns, by exploring global-level collaborative relations and underlying isomorphic transformation property of graph topology. Experimental results on several real-world datasets demonstrate the effectiveness of our SMIN model over various state-of-the-art recommendation methods. We release our source code at https://github.com/SocialRecsys/SMIN.</description><subject>Collaboration</subject><subject>Computer Science - Artificial Intelligence</subject><subject>Computer Science - Information Retrieval</subject><subject>Filtration</subject><subject>Graph neural networks</subject><subject>Heterogeneity</subject><subject>Recommender systems</subject><subject>Representations</subject><subject>Social networks</subject><subject>Source code</subject><subject>Topology</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><sourceid>BENPR</sourceid><sourceid>GOX</sourceid><recordid>eNotj01Lw0AQhhdBsNT-AE8ueE7dz2RzlFK1UBVM72E3mbVbk2zcJP3498ZW3sPwDg_DPAjdUTIXSkryqMPR7eeMjgvCU6mu0IRxTiMlGLtBs67bEUJYnDAp-QQtM184XeFPKHxdQ1Pq3vkGH1y_xRlUNsqGFsLedVDiN-j1V9DtFq8a60Otj_gd-oMP37fo2uqqg9n_nKLN83KzeI3WHy-rxdM60pLFEYVUUJFaAyoBRg1XRSEoE1ZAUhCmhSQmLkpBGCiqUk6MjMGY0pZjFybmU3R_OXt2zNvgah1O-Z9rfnYdiYcL0Qb_M0DX5zs_hGb8KWdSkTEpifkvMwVXCg</recordid><startdate>20211008</startdate><enddate>20211008</enddate><creator>Long, Xiaoling</creator><creator>Huang, Chao</creator><creator>Xu, Yong</creator><creator>Xu, Huance</creator><creator>Dai, Peng</creator><creator>Xia, Lianghao</creator><creator>Liefeng Bo</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PHGZM</scope><scope>PHGZT</scope><scope>PIMPY</scope><scope>PKEHL</scope><scope>PQEST</scope><scope>PQGLB</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20211008</creationdate><title>Social Recommendation with Self-Supervised Metagraph Informax Network</title><author>Long, Xiaoling ; Huang, Chao ; Xu, Yong ; Xu, Huance ; Dai, Peng ; Xia, Lianghao ; Liefeng Bo</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a526-1e94149fbe87e21b38cc4124f4e7c02a450b6cd402e818930b56ebbdfde814b63</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Collaboration</topic><topic>Computer Science - Artificial Intelligence</topic><topic>Computer Science - Information Retrieval</topic><topic>Filtration</topic><topic>Graph neural networks</topic><topic>Heterogeneity</topic><topic>Recommender systems</topic><topic>Representations</topic><topic>Social networks</topic><topic>Source code</topic><topic>Topology</topic><toplevel>online_resources</toplevel><creatorcontrib>Long, Xiaoling</creatorcontrib><creatorcontrib>Huang, Chao</creatorcontrib><creatorcontrib>Xu, Yong</creatorcontrib><creatorcontrib>Xu, Huance</creatorcontrib><creatorcontrib>Dai, Peng</creatorcontrib><creatorcontrib>Xia, Lianghao</creatorcontrib><creatorcontrib>Liefeng Bo</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>ProQuest Central (New)</collection><collection>ProQuest One Academic (New)</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Middle East (New)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Applied & Life Sciences</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering collection</collection><collection>arXiv Computer Science</collection><collection>arXiv.org</collection><jtitle>arXiv.org</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Long, Xiaoling</au><au>Huang, Chao</au><au>Xu, Yong</au><au>Xu, Huance</au><au>Dai, Peng</au><au>Xia, Lianghao</au><au>Liefeng Bo</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Social Recommendation with Self-Supervised Metagraph Informax Network</atitle><jtitle>arXiv.org</jtitle><date>2021-10-08</date><risdate>2021</risdate><eissn>2331-8422</eissn><abstract>In recent years, researchers attempt to utilize online social information to alleviate data sparsity for collaborative filtering, based on the rationale that social networks offers the insights to understand the behavioral patterns. However, due to the overlook of inter-dependent knowledge across items (e.g., categories of products), existing social recommender systems are insufficient to distill the heterogeneous collaborative signals from both user and item sides. In this work, we propose a Self-Supervised Metagraph Infor-max Network (SMIN) which investigates the potential of jointly incorporating social- and knowledge-aware relational structures into the user preference representation for recommendation. To model relation heterogeneity, we design a metapath-guided heterogeneous graph neural network to aggregate feature embeddings from different types of meta-relations across users and items, em-powering SMIN to maintain dedicated representations for multi-faceted user- and item-wise dependencies. Additionally, to inject high-order collaborative signals, we generalize the mutual information learning paradigm under the self-supervised graph-based collaborative filtering. This endows the expressive modeling of user-item interactive patterns, by exploring global-level collaborative relations and underlying isomorphic transformation property of graph topology. Experimental results on several real-world datasets demonstrate the effectiveness of our SMIN model over various state-of-the-art recommendation methods. We release our source code at https://github.com/SocialRecsys/SMIN.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><doi>10.48550/arxiv.2110.03958</doi><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | EISSN: 2331-8422 |
ispartof | arXiv.org, 2021-10 |
issn | 2331-8422 |
language | eng |
recordid | cdi_arxiv_primary_2110_03958 |
source | arXiv.org; Free E- Journals |
subjects | Collaboration Computer Science - Artificial Intelligence Computer Science - Information Retrieval Filtration Graph neural networks Heterogeneity Recommender systems Representations Social networks Source code Topology |
title | Social Recommendation with Self-Supervised Metagraph Informax Network |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-14T16%3A45%3A12IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_arxiv&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Social%20Recommendation%20with%20Self-Supervised%20Metagraph%20Informax%20Network&rft.jtitle=arXiv.org&rft.au=Long,%20Xiaoling&rft.date=2021-10-08&rft.eissn=2331-8422&rft_id=info:doi/10.48550/arxiv.2110.03958&rft_dat=%3Cproquest_arxiv%3E2580808906%3C/proquest_arxiv%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2580808906&rft_id=info:pmid/&rfr_iscdi=true |