Improving Graph Collaborative Filtering with Directional Behavior Enhanced Contrastive Learning

Graph Collaborative Filtering is a widely adopted approach for recommendation, which captures similar behavior features through Graph Neural Network (GNN). Recently, Contrastive Learning (CL) has been demonstrated as an effective method to enhance the performance of graph collaborative filtering. Ty...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:ACM transactions on knowledge discovery from data 2024-09, Vol.18 (8), p.1-20, Article 183
Hauptverfasser: Yu, Penghang, Bao, Bing-Kun, Tan, Zhiyi, Lu, Guanming
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 20
container_issue 8
container_start_page 1
container_title ACM transactions on knowledge discovery from data
container_volume 18
creator Yu, Penghang
Bao, Bing-Kun
Tan, Zhiyi
Lu, Guanming
description Graph Collaborative Filtering is a widely adopted approach for recommendation, which captures similar behavior features through Graph Neural Network (GNN). Recently, Contrastive Learning (CL) has been demonstrated as an effective method to enhance the performance of graph collaborative filtering. Typically, CL-based methods first perturb users’ history behavior data (e.g., drop clicked items), then construct a self-discriminating task for behavior representations under different random perturbations. However, for widely existing inactive users, random perturbation makes their sparse behavior information more incomplete, thereby harming the behavior feature extraction. To tackle the above issue, we design a novel directional perturbation-based CL method to improve the graph collaborative filtering performance. The idea is to perturb node representations through directionally enhancing behavior features. To do so, we propose a simple yet effective feedback mechanism, which fuses the representations of nodes based on behavior similarity. Then, to avoid irrelevant behavior preferences introduced by the feedback mechanism, we construct a behavior self-contrast task before and after feedback, to align the node representations between the final output and the first layer of GNN. Different from the widely adopted self-discriminating task, the behavior self-contrast task avoids complex message propagation on different perturbed graphs, which is more efficient than previous methods. Extensive experiments on three public datasets demonstrate that the proposed method has distinct advantages over other CL methods on recommendation accuracy.
doi_str_mv 10.1145/3663574
format Article
fullrecord <record><control><sourceid>acm_cross</sourceid><recordid>TN_cdi_crossref_primary_10_1145_3663574</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>3663574</sourcerecordid><originalsourceid>FETCH-LOGICAL-a169t-8e6568ea16f4417b56d4f3f34e685d6d8ea8195b3726894c1acd93f0a4eb84973</originalsourceid><addsrcrecordid>eNo9kE1Pg0AQhjdGE2s13j1x84Qy7AfLUbGtTUi8aOKNDLAra4Alywbjvy-1raeZyfO8c3gJuYXoAYDxRyoE5Qk7IwvgXIQsiT_PT7uQcEmuxvE7ijgHiBek2HaDs5Ppv4KNw6EJMtu2WFqH3kwqWJvWK7enP8Y3wYtxqvLG9tgGz6rByVgXrPoG-0rVc7T3Dse_YK7Q9XPumlxobEd1c5xL8rFevWevYf622WZPeYggUh9KJbiQaj40Y5CUXNRMU02ZEpLXop6RhJSXNImFTFkFWNUp1REyVUqWJnRJ7g9_K2fH0SldDM506H4LiIp9L8Wxl9m8O5hYdf_SCe4AGxdeSQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Improving Graph Collaborative Filtering with Directional Behavior Enhanced Contrastive Learning</title><source>ACM Digital Library</source><creator>Yu, Penghang ; Bao, Bing-Kun ; Tan, Zhiyi ; Lu, Guanming</creator><creatorcontrib>Yu, Penghang ; Bao, Bing-Kun ; Tan, Zhiyi ; Lu, Guanming</creatorcontrib><description>Graph Collaborative Filtering is a widely adopted approach for recommendation, which captures similar behavior features through Graph Neural Network (GNN). Recently, Contrastive Learning (CL) has been demonstrated as an effective method to enhance the performance of graph collaborative filtering. Typically, CL-based methods first perturb users’ history behavior data (e.g., drop clicked items), then construct a self-discriminating task for behavior representations under different random perturbations. However, for widely existing inactive users, random perturbation makes their sparse behavior information more incomplete, thereby harming the behavior feature extraction. To tackle the above issue, we design a novel directional perturbation-based CL method to improve the graph collaborative filtering performance. The idea is to perturb node representations through directionally enhancing behavior features. To do so, we propose a simple yet effective feedback mechanism, which fuses the representations of nodes based on behavior similarity. Then, to avoid irrelevant behavior preferences introduced by the feedback mechanism, we construct a behavior self-contrast task before and after feedback, to align the node representations between the final output and the first layer of GNN. Different from the widely adopted self-discriminating task, the behavior self-contrast task avoids complex message propagation on different perturbed graphs, which is more efficient than previous methods. Extensive experiments on three public datasets demonstrate that the proposed method has distinct advantages over other CL methods on recommendation accuracy.</description><identifier>ISSN: 1556-4681</identifier><identifier>EISSN: 1556-472X</identifier><identifier>DOI: 10.1145/3663574</identifier><language>eng</language><publisher>New York, NY: ACM</publisher><subject>Information systems ; Recommender systems</subject><ispartof>ACM transactions on knowledge discovery from data, 2024-09, Vol.18 (8), p.1-20, Article 183</ispartof><rights>Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-a169t-8e6568ea16f4417b56d4f3f34e685d6d8ea8195b3726894c1acd93f0a4eb84973</cites><orcidid>0000-0001-5956-831X ; 0000-0002-1209-2817 ; 0000-0003-4860-8229 ; 0009-0004-3233-4248</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://dl.acm.org/doi/pdf/10.1145/3663574$$EPDF$$P50$$Gacm$$H</linktopdf><link.rule.ids>314,780,784,2282,27924,27925,40196,76228</link.rule.ids></links><search><creatorcontrib>Yu, Penghang</creatorcontrib><creatorcontrib>Bao, Bing-Kun</creatorcontrib><creatorcontrib>Tan, Zhiyi</creatorcontrib><creatorcontrib>Lu, Guanming</creatorcontrib><title>Improving Graph Collaborative Filtering with Directional Behavior Enhanced Contrastive Learning</title><title>ACM transactions on knowledge discovery from data</title><addtitle>ACM TKDD</addtitle><description>Graph Collaborative Filtering is a widely adopted approach for recommendation, which captures similar behavior features through Graph Neural Network (GNN). Recently, Contrastive Learning (CL) has been demonstrated as an effective method to enhance the performance of graph collaborative filtering. Typically, CL-based methods first perturb users’ history behavior data (e.g., drop clicked items), then construct a self-discriminating task for behavior representations under different random perturbations. However, for widely existing inactive users, random perturbation makes their sparse behavior information more incomplete, thereby harming the behavior feature extraction. To tackle the above issue, we design a novel directional perturbation-based CL method to improve the graph collaborative filtering performance. The idea is to perturb node representations through directionally enhancing behavior features. To do so, we propose a simple yet effective feedback mechanism, which fuses the representations of nodes based on behavior similarity. Then, to avoid irrelevant behavior preferences introduced by the feedback mechanism, we construct a behavior self-contrast task before and after feedback, to align the node representations between the final output and the first layer of GNN. Different from the widely adopted self-discriminating task, the behavior self-contrast task avoids complex message propagation on different perturbed graphs, which is more efficient than previous methods. Extensive experiments on three public datasets demonstrate that the proposed method has distinct advantages over other CL methods on recommendation accuracy.</description><subject>Information systems</subject><subject>Recommender systems</subject><issn>1556-4681</issn><issn>1556-472X</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><recordid>eNo9kE1Pg0AQhjdGE2s13j1x84Qy7AfLUbGtTUi8aOKNDLAra4Alywbjvy-1raeZyfO8c3gJuYXoAYDxRyoE5Qk7IwvgXIQsiT_PT7uQcEmuxvE7ijgHiBek2HaDs5Ppv4KNw6EJMtu2WFqH3kwqWJvWK7enP8Y3wYtxqvLG9tgGz6rByVgXrPoG-0rVc7T3Dse_YK7Q9XPumlxobEd1c5xL8rFevWevYf622WZPeYggUh9KJbiQaj40Y5CUXNRMU02ZEpLXop6RhJSXNImFTFkFWNUp1REyVUqWJnRJ7g9_K2fH0SldDM506H4LiIp9L8Wxl9m8O5hYdf_SCe4AGxdeSQ</recordid><startdate>20240930</startdate><enddate>20240930</enddate><creator>Yu, Penghang</creator><creator>Bao, Bing-Kun</creator><creator>Tan, Zhiyi</creator><creator>Lu, Guanming</creator><general>ACM</general><scope>AAYXX</scope><scope>CITATION</scope><orcidid>https://orcid.org/0000-0001-5956-831X</orcidid><orcidid>https://orcid.org/0000-0002-1209-2817</orcidid><orcidid>https://orcid.org/0000-0003-4860-8229</orcidid><orcidid>https://orcid.org/0009-0004-3233-4248</orcidid></search><sort><creationdate>20240930</creationdate><title>Improving Graph Collaborative Filtering with Directional Behavior Enhanced Contrastive Learning</title><author>Yu, Penghang ; Bao, Bing-Kun ; Tan, Zhiyi ; Lu, Guanming</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a169t-8e6568ea16f4417b56d4f3f34e685d6d8ea8195b3726894c1acd93f0a4eb84973</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Information systems</topic><topic>Recommender systems</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Yu, Penghang</creatorcontrib><creatorcontrib>Bao, Bing-Kun</creatorcontrib><creatorcontrib>Tan, Zhiyi</creatorcontrib><creatorcontrib>Lu, Guanming</creatorcontrib><collection>CrossRef</collection><jtitle>ACM transactions on knowledge discovery from data</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Yu, Penghang</au><au>Bao, Bing-Kun</au><au>Tan, Zhiyi</au><au>Lu, Guanming</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Improving Graph Collaborative Filtering with Directional Behavior Enhanced Contrastive Learning</atitle><jtitle>ACM transactions on knowledge discovery from data</jtitle><stitle>ACM TKDD</stitle><date>2024-09-30</date><risdate>2024</risdate><volume>18</volume><issue>8</issue><spage>1</spage><epage>20</epage><pages>1-20</pages><artnum>183</artnum><issn>1556-4681</issn><eissn>1556-472X</eissn><abstract>Graph Collaborative Filtering is a widely adopted approach for recommendation, which captures similar behavior features through Graph Neural Network (GNN). Recently, Contrastive Learning (CL) has been demonstrated as an effective method to enhance the performance of graph collaborative filtering. Typically, CL-based methods first perturb users’ history behavior data (e.g., drop clicked items), then construct a self-discriminating task for behavior representations under different random perturbations. However, for widely existing inactive users, random perturbation makes their sparse behavior information more incomplete, thereby harming the behavior feature extraction. To tackle the above issue, we design a novel directional perturbation-based CL method to improve the graph collaborative filtering performance. The idea is to perturb node representations through directionally enhancing behavior features. To do so, we propose a simple yet effective feedback mechanism, which fuses the representations of nodes based on behavior similarity. Then, to avoid irrelevant behavior preferences introduced by the feedback mechanism, we construct a behavior self-contrast task before and after feedback, to align the node representations between the final output and the first layer of GNN. Different from the widely adopted self-discriminating task, the behavior self-contrast task avoids complex message propagation on different perturbed graphs, which is more efficient than previous methods. Extensive experiments on three public datasets demonstrate that the proposed method has distinct advantages over other CL methods on recommendation accuracy.</abstract><cop>New York, NY</cop><pub>ACM</pub><doi>10.1145/3663574</doi><tpages>20</tpages><orcidid>https://orcid.org/0000-0001-5956-831X</orcidid><orcidid>https://orcid.org/0000-0002-1209-2817</orcidid><orcidid>https://orcid.org/0000-0003-4860-8229</orcidid><orcidid>https://orcid.org/0009-0004-3233-4248</orcidid><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 1556-4681
ispartof ACM transactions on knowledge discovery from data, 2024-09, Vol.18 (8), p.1-20, Article 183
issn 1556-4681
1556-472X
language eng
recordid cdi_crossref_primary_10_1145_3663574
source ACM Digital Library
subjects Information systems
Recommender systems
title Improving Graph Collaborative Filtering with Directional Behavior Enhanced 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-28T11%3A32%3A12IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-acm_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Improving%20Graph%20Collaborative%20Filtering%20with%20Directional%20Behavior%20Enhanced%20Contrastive%20Learning&rft.jtitle=ACM%20transactions%20on%20knowledge%20discovery%20from%20data&rft.au=Yu,%20Penghang&rft.date=2024-09-30&rft.volume=18&rft.issue=8&rft.spage=1&rft.epage=20&rft.pages=1-20&rft.artnum=183&rft.issn=1556-4681&rft.eissn=1556-472X&rft_id=info:doi/10.1145/3663574&rft_dat=%3Cacm_cross%3E3663574%3C/acm_cross%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