Scapin: Scalable Graph Structure Perturbation by Augmented Influence Maximization

Author:

Wang Yexin1ORCID,Yang Zhi1ORCID,Liu Junqi1ORCID,Zhang Wentao1ORCID,Cui Bin1ORCID

Affiliation:

1. Peking University, Beijing, China

Abstract

Generating data perturbations to graphs has become a useful tool for analyzing the robustness of Graph Neural Networks (GNNs). However, existing model-driven methodologies can be prohibitively expensive to apply in large graphs, which hinders the understanding of GNN robustness at scale. In this paper, we present Scapin, a data-driven methodology that opens up a new perspective by connecting graph structure perturbation for GNNs with augmented influence maximization-to either facilitate desirable spreads or curtail undesirable ones by adding or deleting a small set of edges. This connection not only allows us to perform data perturbation on GNNs with computation scalability but also provides nice interpretations. To transform such connections into efficient perturbation approaches for the new GNN setting, Scapin introduces a novel edge influence model, decomposed influence maximization objectives, and a principled algorithm for edge addition by exploiting submodularity of the objectives. Empirical studies demonstrate that Scapin can give orders of magnitude improvement over state-of-art methods in terms of runtime and memory efficiency, with comparable or even better performance.

Publisher

Association for Computing Machinery (ACM)

Reference74 articles.

1. Aleksandar Bojchevski and Stephan Günnemann. 2018. Deep Gaussian Embedding of Graphs: Unsupervised Inductive Learning via Ranking. In ICLR. Aleksandar Bojchevski and Stephan Günnemann. 2018. Deep Gaussian Embedding of Graphs: Unsupervised Inductive Learning via Ranking. In ICLR.

2. Vineet Chaoji Sayan Ranu Rajeev Rastogi and Rushi Bhatt. 2012. Recommendations to boost content spread in social networks. In WWW. Vineet Chaoji Sayan Ranu Rajeev Rastogi and Rushi Bhatt. 2012. Recommendations to boost content spread in social networks. In WWW.

3. Lei Chen , Zhengdao Chen , and Joan Bruna . 2020a. On Graph Neural Networks versus Graph-Augmented MLPs. arXiv preprint arXiv:2010.15116 ( 2020 ). Lei Chen, Zhengdao Chen, and Joan Bruna. 2020a. On Graph Neural Networks versus Graph-Augmented MLPs. arXiv preprint arXiv:2010.15116 (2020).

4. Liang Chen , Jintang Li , Jiaying Peng , Tao Xie , Zengxu Cao , Kun Xu , Xiangnan He , Zibin Zheng , and Bingzhe Wu. 2020b. A Survey of Adversarial Learning on Graph. arXiv preprint arXiv:2003.05730 ( 2020 ). Liang Chen, Jintang Li, Jiaying Peng, Tao Xie, Zengxu Cao, Kun Xu, Xiangnan He, Zibin Zheng, and Bingzhe Wu. 2020b. A Survey of Adversarial Learning on Graph. arXiv preprint arXiv:2003.05730 (2020).

5. Hanjun Dai Hui Li Tian Tian Xin Huang Lin Wang Jun Zhu and Le Song. 2018. Adversarial Attack on Graph Structured Data. ICML. Hanjun Dai Hui Li Tian Tian Xin Huang Lin Wang Jun Zhu and Le Song. 2018. Adversarial Attack on Graph Structured Data. ICML.

Cited by 3 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. NPA: Improving Large-scale Graph Neural Networks with Non-parametric Attention;Companion of the 2024 International Conference on Management of Data;2024-06-09

2. BIM: Improving Graph Neural Networks with Balanced Influence Maximization;2024 IEEE 40th International Conference on Data Engineering (ICDE);2024-05-13

3. Breaking the Entanglement of Homophily and Heterophily in Semi-supervised Node Classification;2024 IEEE 40th International Conference on Data Engineering (ICDE);2024-05-13

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3