Denoising Implicit Feedback for Graph Collaborative Filtering via Causal Intervention

IF 7.5 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Huiting Liu;Huaxiu Zhang;Peipei Li;Peng Zhao;Xindong Wu
{"title":"Denoising Implicit Feedback for Graph Collaborative Filtering via Causal Intervention","authors":"Huiting Liu;Huaxiu Zhang;Peipei Li;Peng Zhao;Xindong Wu","doi":"10.1109/TBDATA.2024.3423727","DOIUrl":null,"url":null,"abstract":"The performance of graph collaborative filtering (GCF) models could be affected by noisy user-item interactions. Existing studies on data denoising either ignore the nature of noise in implicit feedback or seldom consider the long-tail distribution of historical interaction data. For the first challenge, we analyze the role of noise from a causal perspective: noise is an unobservable confounder. Therefore, we use the instrumental variable for causal intervention without requiring confounder observation. For the second challenge, we consider degree distribution of nodes in the course of causal intervention. And then we propose a model named causal graph collaborative filtering (CausalGCF) to denoise implicit feedback for GCF. Specifically, we design a degree augmentation strategy as the instrumental variable. First, we divide nodes into head and tail nodes according to their degree. Then, we purify the interactions of the head nodes and enrich those of the tail nodes based on similarity. We perform degree augmentation strategy from the user and item sides to obtain two different graph structures, which are trained together with self-supervised learning. Empirical studies on four real and four synthetic datasets demonstrate the effectiveness of CausalGCF, which is more robust against noisy interactions in implicit feedback than the baselines.","PeriodicalId":13106,"journal":{"name":"IEEE Transactions on Big Data","volume":"11 2","pages":"696-709"},"PeriodicalIF":7.5000,"publicationDate":"2024-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Big Data","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10587068/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

The performance of graph collaborative filtering (GCF) models could be affected by noisy user-item interactions. Existing studies on data denoising either ignore the nature of noise in implicit feedback or seldom consider the long-tail distribution of historical interaction data. For the first challenge, we analyze the role of noise from a causal perspective: noise is an unobservable confounder. Therefore, we use the instrumental variable for causal intervention without requiring confounder observation. For the second challenge, we consider degree distribution of nodes in the course of causal intervention. And then we propose a model named causal graph collaborative filtering (CausalGCF) to denoise implicit feedback for GCF. Specifically, we design a degree augmentation strategy as the instrumental variable. First, we divide nodes into head and tail nodes according to their degree. Then, we purify the interactions of the head nodes and enrich those of the tail nodes based on similarity. We perform degree augmentation strategy from the user and item sides to obtain two different graph structures, which are trained together with self-supervised learning. Empirical studies on four real and four synthetic datasets demonstrate the effectiveness of CausalGCF, which is more robust against noisy interactions in implicit feedback than the baselines.
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
11.80
自引率
2.80%
发文量
114
期刊介绍: The IEEE Transactions on Big Data publishes peer-reviewed articles focusing on big data. These articles present innovative research ideas and application results across disciplines, including novel theories, algorithms, and applications. Research areas cover a wide range, such as big data analytics, visualization, curation, management, semantics, infrastructure, standards, performance analysis, intelligence extraction, scientific discovery, security, privacy, and legal issues specific to big data. The journal also prioritizes applications of big data in fields generating massive datasets.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信