Loading…

SiReN: Sign-Aware Recommendation Using Graph Neural Networks

In recent years, many recommender systems using network embedding (NE) such as graph neural networks (GNNs) have been extensively studied in the sense of improving recommendation accuracy. However, such attempts have focused mostly on utilizing only the information of positive user-item interactions...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transaction on neural networks and learning systems 2024-04, Vol.35 (4), p.4729-4743
Main Authors: Seo, Changwon, Jeong, Kyeong-Joong, Lim, Sungsu, Shin, Won-Yong
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c351t-efb7544947002424888bd64c960011fb272fff0559992979752c35e1b8e9b10b3
cites cdi_FETCH-LOGICAL-c351t-efb7544947002424888bd64c960011fb272fff0559992979752c35e1b8e9b10b3
container_end_page 4743
container_issue 4
container_start_page 4729
container_title IEEE transaction on neural networks and learning systems
container_volume 35
creator Seo, Changwon
Jeong, Kyeong-Joong
Lim, Sungsu
Shin, Won-Yong
description In recent years, many recommender systems using network embedding (NE) such as graph neural networks (GNNs) have been extensively studied in the sense of improving recommendation accuracy. However, such attempts have focused mostly on utilizing only the information of positive user-item interactions with high ratings. Thus, there is a challenge on how to make use of low rating scores for representing users' preferences since low ratings can be still informative in designing NE-based recommender systems. In this study, we present Si ReN, a new Si gn-aware Re commender system based on GN N models. Specifically, SiReN has three key components: 1) constructing a signed bipartite graph for more precisely representing users' preferences, which is split into two edge-disjoint graphs with positive and negative edges each; 2) generating two embeddings for the partitioned graphs with positive and negative edges via a GNN model and a multilayer perceptron (MLP), respectively, and then using an attention model to obtain the final embeddings; and 3) establishing a sign-aware Bayesian personalized ranking (BPR) loss function in the process of optimization. Through comprehensive experiments, we empirically demonstrate that SiReN consistently outperforms state-of-the-art NE-aided recommendation methods.
doi_str_mv 10.1109/TNNLS.2022.3175772
format article
fullrecord <record><control><sourceid>proquest_pubme</sourceid><recordid>TN_cdi_pubmed_primary_35613066</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>9781816</ieee_id><sourcerecordid>2669501817</sourcerecordid><originalsourceid>FETCH-LOGICAL-c351t-efb7544947002424888bd64c960011fb272fff0559992979752c35e1b8e9b10b3</originalsourceid><addsrcrecordid>eNpdkE1Lw0AQhhdRrNT-AQUJePGSuh_ZL_FSilahROgHeFuSdFJTm6TuJhT_vVtbe3AuMzDPOwwPQlcE9wnB-n4Wx-Npn2JK-4xILiU9QReUCBpSptTpcZbvHdRzboV9CcxFpM9Rh3FBGBbiAj1OiwnED8G0WFbhYJtYCCaQ1WUJ1SJpiroK5q6olsHIJpuPIIbWJmvfmm1tP90lOsuTtYPeoXfR_PlpNnwJx2-j1-FgHGaMkyaEPJU8inQkMaYRjZRS6UJEmRYYE5KnVNI8zzHnWmuqpZac-iCQVIFOCU5ZF93t725s_dWCa0xZuAzW66SCunWGCqE5JopIj97-Q1d1ayv_nWGYMUGxZjuK7qnM1s5ZyM3GFmVivw3BZqfX_Oo1O73moNeHbg6n27SExTHyJ9MD13ugAIDjWkvlPxPsBwegetQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>3033620937</pqid></control><display><type>article</type><title>SiReN: Sign-Aware Recommendation Using Graph Neural Networks</title><source>IEEE Electronic Library (IEL) Journals</source><creator>Seo, Changwon ; Jeong, Kyeong-Joong ; Lim, Sungsu ; Shin, Won-Yong</creator><creatorcontrib>Seo, Changwon ; Jeong, Kyeong-Joong ; Lim, Sungsu ; Shin, Won-Yong</creatorcontrib><description>In recent years, many recommender systems using network embedding (NE) such as graph neural networks (GNNs) have been extensively studied in the sense of improving recommendation accuracy. However, such attempts have focused mostly on utilizing only the information of positive user-item interactions with high ratings. Thus, there is a challenge on how to make use of low rating scores for representing users' preferences since low ratings can be still informative in designing NE-based recommender systems. In this study, we present Si ReN, a new Si gn-aware Re commender system based on GN N models. Specifically, SiReN has three key components: 1) constructing a signed bipartite graph for more precisely representing users' preferences, which is split into two edge-disjoint graphs with positive and negative edges each; 2) generating two embeddings for the partitioned graphs with positive and negative edges via a GNN model and a multilayer perceptron (MLP), respectively, and then using an attention model to obtain the final embeddings; and 3) establishing a sign-aware Bayesian personalized ranking (BPR) loss function in the process of optimization. Through comprehensive experiments, we empirically demonstrate that SiReN consistently outperforms state-of-the-art NE-aided recommendation methods.</description><identifier>ISSN: 2162-237X</identifier><identifier>EISSN: 2162-2388</identifier><identifier>DOI: 10.1109/TNNLS.2022.3175772</identifier><identifier>PMID: 35613066</identifier><identifier>CODEN: ITNNAL</identifier><language>eng</language><publisher>United States: IEEE</publisher><subject>Bayesian analysis ; Bayesian personalized ranking (BPR) loss ; Bipartite graph ; Business process re-engineering ; Embedding ; graph neural network (GNN) ; Graph neural networks ; Graph theory ; Graphical representations ; Graphs ; Information processing ; Mathematical models ; Multilayer perceptrons ; Negative feedback ; network embedding (NE) ; Neural networks ; Optimization ; Probability theory ; Ratings ; recommender system ; Recommender systems ; signed bipartite graph ; Sparse matrices</subject><ispartof>IEEE transaction on neural networks and learning systems, 2024-04, Vol.35 (4), p.4729-4743</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2024</rights><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c351t-efb7544947002424888bd64c960011fb272fff0559992979752c35e1b8e9b10b3</citedby><cites>FETCH-LOGICAL-c351t-efb7544947002424888bd64c960011fb272fff0559992979752c35e1b8e9b10b3</cites><orcidid>0000-0003-2430-3551 ; 0000-0001-5924-3398 ; 0000-0003-3499-0578 ; 0000-0002-6533-3469</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/9781816$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,27924,27925,54796</link.rule.ids><backlink>$$Uhttps://www.ncbi.nlm.nih.gov/pubmed/35613066$$D View this record in MEDLINE/PubMed$$Hfree_for_read</backlink></links><search><creatorcontrib>Seo, Changwon</creatorcontrib><creatorcontrib>Jeong, Kyeong-Joong</creatorcontrib><creatorcontrib>Lim, Sungsu</creatorcontrib><creatorcontrib>Shin, Won-Yong</creatorcontrib><title>SiReN: Sign-Aware Recommendation Using Graph Neural Networks</title><title>IEEE transaction on neural networks and learning systems</title><addtitle>TNNLS</addtitle><addtitle>IEEE Trans Neural Netw Learn Syst</addtitle><description>In recent years, many recommender systems using network embedding (NE) such as graph neural networks (GNNs) have been extensively studied in the sense of improving recommendation accuracy. However, such attempts have focused mostly on utilizing only the information of positive user-item interactions with high ratings. Thus, there is a challenge on how to make use of low rating scores for representing users' preferences since low ratings can be still informative in designing NE-based recommender systems. In this study, we present Si ReN, a new Si gn-aware Re commender system based on GN N models. Specifically, SiReN has three key components: 1) constructing a signed bipartite graph for more precisely representing users' preferences, which is split into two edge-disjoint graphs with positive and negative edges each; 2) generating two embeddings for the partitioned graphs with positive and negative edges via a GNN model and a multilayer perceptron (MLP), respectively, and then using an attention model to obtain the final embeddings; and 3) establishing a sign-aware Bayesian personalized ranking (BPR) loss function in the process of optimization. Through comprehensive experiments, we empirically demonstrate that SiReN consistently outperforms state-of-the-art NE-aided recommendation methods.</description><subject>Bayesian analysis</subject><subject>Bayesian personalized ranking (BPR) loss</subject><subject>Bipartite graph</subject><subject>Business process re-engineering</subject><subject>Embedding</subject><subject>graph neural network (GNN)</subject><subject>Graph neural networks</subject><subject>Graph theory</subject><subject>Graphical representations</subject><subject>Graphs</subject><subject>Information processing</subject><subject>Mathematical models</subject><subject>Multilayer perceptrons</subject><subject>Negative feedback</subject><subject>network embedding (NE)</subject><subject>Neural networks</subject><subject>Optimization</subject><subject>Probability theory</subject><subject>Ratings</subject><subject>recommender system</subject><subject>Recommender systems</subject><subject>signed bipartite graph</subject><subject>Sparse matrices</subject><issn>2162-237X</issn><issn>2162-2388</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><recordid>eNpdkE1Lw0AQhhdRrNT-AQUJePGSuh_ZL_FSilahROgHeFuSdFJTm6TuJhT_vVtbe3AuMzDPOwwPQlcE9wnB-n4Wx-Npn2JK-4xILiU9QReUCBpSptTpcZbvHdRzboV9CcxFpM9Rh3FBGBbiAj1OiwnED8G0WFbhYJtYCCaQ1WUJ1SJpiroK5q6olsHIJpuPIIbWJmvfmm1tP90lOsuTtYPeoXfR_PlpNnwJx2-j1-FgHGaMkyaEPJU8inQkMaYRjZRS6UJEmRYYE5KnVNI8zzHnWmuqpZac-iCQVIFOCU5ZF93t725s_dWCa0xZuAzW66SCunWGCqE5JopIj97-Q1d1ayv_nWGYMUGxZjuK7qnM1s5ZyM3GFmVivw3BZqfX_Oo1O73moNeHbg6n27SExTHyJ9MD13ugAIDjWkvlPxPsBwegetQ</recordid><startdate>20240401</startdate><enddate>20240401</enddate><creator>Seo, Changwon</creator><creator>Jeong, Kyeong-Joong</creator><creator>Lim, Sungsu</creator><creator>Shin, Won-Yong</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>NPM</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7QF</scope><scope>7QO</scope><scope>7QP</scope><scope>7QQ</scope><scope>7QR</scope><scope>7SC</scope><scope>7SE</scope><scope>7SP</scope><scope>7SR</scope><scope>7TA</scope><scope>7TB</scope><scope>7TK</scope><scope>7U5</scope><scope>8BQ</scope><scope>8FD</scope><scope>F28</scope><scope>FR3</scope><scope>H8D</scope><scope>JG9</scope><scope>JQ2</scope><scope>KR7</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>P64</scope><scope>7X8</scope><orcidid>https://orcid.org/0000-0003-2430-3551</orcidid><orcidid>https://orcid.org/0000-0001-5924-3398</orcidid><orcidid>https://orcid.org/0000-0003-3499-0578</orcidid><orcidid>https://orcid.org/0000-0002-6533-3469</orcidid></search><sort><creationdate>20240401</creationdate><title>SiReN: Sign-Aware Recommendation Using Graph Neural Networks</title><author>Seo, Changwon ; Jeong, Kyeong-Joong ; Lim, Sungsu ; Shin, Won-Yong</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c351t-efb7544947002424888bd64c960011fb272fff0559992979752c35e1b8e9b10b3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Bayesian analysis</topic><topic>Bayesian personalized ranking (BPR) loss</topic><topic>Bipartite graph</topic><topic>Business process re-engineering</topic><topic>Embedding</topic><topic>graph neural network (GNN)</topic><topic>Graph neural networks</topic><topic>Graph theory</topic><topic>Graphical representations</topic><topic>Graphs</topic><topic>Information processing</topic><topic>Mathematical models</topic><topic>Multilayer perceptrons</topic><topic>Negative feedback</topic><topic>network embedding (NE)</topic><topic>Neural networks</topic><topic>Optimization</topic><topic>Probability theory</topic><topic>Ratings</topic><topic>recommender system</topic><topic>Recommender systems</topic><topic>signed bipartite graph</topic><topic>Sparse matrices</topic><toplevel>online_resources</toplevel><creatorcontrib>Seo, Changwon</creatorcontrib><creatorcontrib>Jeong, Kyeong-Joong</creatorcontrib><creatorcontrib>Lim, Sungsu</creatorcontrib><creatorcontrib>Shin, Won-Yong</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Explore</collection><collection>PubMed</collection><collection>CrossRef</collection><collection>Aluminium Industry Abstracts</collection><collection>Biotechnology Research Abstracts</collection><collection>Calcium &amp; Calcified Tissue Abstracts</collection><collection>Ceramic Abstracts</collection><collection>Chemoreception Abstracts</collection><collection>Computer and Information Systems Abstracts</collection><collection>Corrosion Abstracts</collection><collection>Electronics &amp; Communications Abstracts</collection><collection>Engineered Materials Abstracts</collection><collection>Materials Business File</collection><collection>Mechanical &amp; Transportation Engineering Abstracts</collection><collection>Neurosciences Abstracts</collection><collection>Solid State and Superconductivity Abstracts</collection><collection>METADEX</collection><collection>Technology Research Database</collection><collection>ANTE: Abstracts in New Technology &amp; Engineering</collection><collection>Engineering Research Database</collection><collection>Aerospace Database</collection><collection>Materials Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Civil Engineering Abstracts</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Biotechnology and BioEngineering Abstracts</collection><collection>MEDLINE - Academic</collection><jtitle>IEEE transaction on neural networks and learning systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Seo, Changwon</au><au>Jeong, Kyeong-Joong</au><au>Lim, Sungsu</au><au>Shin, Won-Yong</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>SiReN: Sign-Aware Recommendation Using Graph Neural Networks</atitle><jtitle>IEEE transaction on neural networks and learning systems</jtitle><stitle>TNNLS</stitle><addtitle>IEEE Trans Neural Netw Learn Syst</addtitle><date>2024-04-01</date><risdate>2024</risdate><volume>35</volume><issue>4</issue><spage>4729</spage><epage>4743</epage><pages>4729-4743</pages><issn>2162-237X</issn><eissn>2162-2388</eissn><coden>ITNNAL</coden><abstract>In recent years, many recommender systems using network embedding (NE) such as graph neural networks (GNNs) have been extensively studied in the sense of improving recommendation accuracy. However, such attempts have focused mostly on utilizing only the information of positive user-item interactions with high ratings. Thus, there is a challenge on how to make use of low rating scores for representing users' preferences since low ratings can be still informative in designing NE-based recommender systems. In this study, we present Si ReN, a new Si gn-aware Re commender system based on GN N models. Specifically, SiReN has three key components: 1) constructing a signed bipartite graph for more precisely representing users' preferences, which is split into two edge-disjoint graphs with positive and negative edges each; 2) generating two embeddings for the partitioned graphs with positive and negative edges via a GNN model and a multilayer perceptron (MLP), respectively, and then using an attention model to obtain the final embeddings; and 3) establishing a sign-aware Bayesian personalized ranking (BPR) loss function in the process of optimization. Through comprehensive experiments, we empirically demonstrate that SiReN consistently outperforms state-of-the-art NE-aided recommendation methods.</abstract><cop>United States</cop><pub>IEEE</pub><pmid>35613066</pmid><doi>10.1109/TNNLS.2022.3175772</doi><tpages>15</tpages><orcidid>https://orcid.org/0000-0003-2430-3551</orcidid><orcidid>https://orcid.org/0000-0001-5924-3398</orcidid><orcidid>https://orcid.org/0000-0003-3499-0578</orcidid><orcidid>https://orcid.org/0000-0002-6533-3469</orcidid></addata></record>
fulltext fulltext
identifier ISSN: 2162-237X
ispartof IEEE transaction on neural networks and learning systems, 2024-04, Vol.35 (4), p.4729-4743
issn 2162-237X
2162-2388
language eng
recordid cdi_pubmed_primary_35613066
source IEEE Electronic Library (IEL) Journals
subjects Bayesian analysis
Bayesian personalized ranking (BPR) loss
Bipartite graph
Business process re-engineering
Embedding
graph neural network (GNN)
Graph neural networks
Graph theory
Graphical representations
Graphs
Information processing
Mathematical models
Multilayer perceptrons
Negative feedback
network embedding (NE)
Neural networks
Optimization
Probability theory
Ratings
recommender system
Recommender systems
signed bipartite graph
Sparse matrices
title SiReN: Sign-Aware Recommendation Using Graph Neural Networks
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-06T11%3A48%3A39IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_pubme&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=SiReN:%20Sign-Aware%20Recommendation%20Using%20Graph%20Neural%20Networks&rft.jtitle=IEEE%20transaction%20on%20neural%20networks%20and%20learning%20systems&rft.au=Seo,%20Changwon&rft.date=2024-04-01&rft.volume=35&rft.issue=4&rft.spage=4729&rft.epage=4743&rft.pages=4729-4743&rft.issn=2162-237X&rft.eissn=2162-2388&rft.coden=ITNNAL&rft_id=info:doi/10.1109/TNNLS.2022.3175772&rft_dat=%3Cproquest_pubme%3E2669501817%3C/proquest_pubme%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c351t-efb7544947002424888bd64c960011fb272fff0559992979752c35e1b8e9b10b3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=3033620937&rft_id=info:pmid/35613066&rft_ieee_id=9781816&rfr_iscdi=true