{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T05:35:26Z","timestamp":1777613726899,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":64,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,4,25]],"date-time":"2022-04-25T00:00:00Z","timestamp":1650844800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1947135, 2134079"],"award-info":[{"award-number":["1947135, 2134079"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"DARPA","award":["HR001121C0165"],"award-info":[{"award-number":["HR001121C0165"]}]},{"name":"Army Research Office","award":["W911NF2110088"],"award-info":[{"award-number":["W911NF2110088"]}]},{"name":"Department of Homeland Security","award":["17STQAC00001-03-03"],"award-info":[{"award-number":["17STQAC00001-03-03"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,4,25]]},"DOI":"10.1145\/3485447.3512180","type":"proceedings-article","created":{"date-parts":[[2022,4,25]],"date-time":"2022-04-25T05:13:07Z","timestamp":1650863587000},"page":"1136-1147","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":19,"title":["Graph Sanitation with Application to Node Classification"],"prefix":"10.1145","author":[{"given":"Zhe","family":"Xu","sequence":"first","affiliation":[{"name":"University of Illinois at Urbana-Champaign, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Boxin","family":"Du","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hanghang","family":"Tong","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,4,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Basak Alper Benjamin Bach Nathalie Henry\u00a0Riche Tobias Isenberg and Jean-Daniel Fekete. 2013. Weighted graph comparison techniques for brain connectivity analysis. In SIGCHI. 483\u2013492.","DOI":"10.1145\/2470654.2470724"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Lars Backstrom and Jure Leskovec. 2011. Supervised random walks: predicting and recommending links in social networks. In WSDM. 635\u2013644.","DOI":"10.1145\/1935826.1935914"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/3122009.3242010"},{"key":"e_1_3_2_1_4_1","unstructured":"Antoine Bordes Nicolas Usunier Alberto Garcia-Duran Jason Weston and Oksana Yakhnenko. 2013. Translating embeddings for modeling multi-relational data. In NIPS. 1\u20139."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Chen Chen Ruiyue Peng Lei Ying and Hanghang Tong. 2018. Network connectivity optimization: Fundamental limits and effective algorithms. In SIGKDD. 1167\u20131176.","DOI":"10.1145\/3219819.3220019"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2465378"},{"key":"e_1_3_2_1_7_1","unstructured":"Long Chen Yuan Yao Feng Xu Miao Xu and Hanghang Tong. 2020. Trading Personalization for Accuracy: Data Debugging in Collaborative Filtering. NeurIPS 33(2020)."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-007-0176-2"},{"key":"e_1_3_2_1_9_1","unstructured":"Boxin Du Changhe Yuan Robert Barton Tal Neiman and Hanghang Tong. 2021. Hypergraph Pre-training with Graph Neural Networks. arXiv preprint arXiv:2105.10862(2021)."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Negin Entezari Saba\u00a0A Al-Sayouri Amirali Darvishzadeh and Evangelos\u00a0E Papalexakis. 2020. All You Need Is Low (Rank) Defending Against Adversarial Attacks on Graphs. In WSDM. 169\u2013177.","DOI":"10.1145\/3336191.3371789"},{"key":"e_1_3_2_1_11_1","unstructured":"Chelsea Finn Pieter Abbeel and Sergey Levine. 2017. Model-agnostic meta-learning for fast adaptation of deep networks. In ICML. PMLR 1126\u20131135."},{"key":"e_1_3_2_1_12_1","unstructured":"Luca Franceschi Michele Donini Paolo Frasconi and Massimiliano Pontil. 2017. Forward and reverse gradient-based hyperparameter optimization. In ICML. PMLR 1165\u20131173."},{"key":"e_1_3_2_1_13_1","volume-title":"ICML. PMLR","author":"Franceschi Luca","year":"2019","unstructured":"Luca Franceschi, Mathias Niepert, Massimiliano Pontil, and Xiao He. 2019. Learning discrete structures for graph neural networks. In ICML. PMLR, 1972\u20131982."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Zoltan Gyongyi Hector Garcia-Molina and Jan Pedersen. 2004. Combating web spam with trustrank. In VLDB.","DOI":"10.1016\/B978-012088469-8\/50052-8"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403302"},{"key":"e_1_3_2_1_16_1","unstructured":"Kaveh Hassani and Amir\u00a0Hosein Khasahmadi. 2020. Contrastive multi-view representation learning on graphs. In ICML."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2003.1208999"},{"key":"e_1_3_2_1_18_1","first-page":"1","article-title":"Imputation of missing network data: Some simple procedures","volume":"10","author":"Huisman Mark","year":"2009","unstructured":"Mark Huisman. 2009. Imputation of missing network data: Some simple procedures. Journal of Social Structure 10, 1 (2009), 1\u201329.","journal-title":"Journal of Social Structure"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Glen Jeh and Jennifer Widom. 2003. Scaling personalized web search. In WWW. 271\u2013279.","DOI":"10.1145\/775152.775191"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Wei Jin Yao Ma Xiaorui Liu Xianfeng Tang Suhang Wang and Jiliang Tang. 2020. Graph Structure Learning for Robust Graph Neural Networks. In SIGKDD. ACM 66\u201374.","DOI":"10.1145\/3394486.3403049"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449971"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449969"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Jian Kang Jingrui He Ross Maciejewski and Hanghang Tong. 2020. InFoRM: Individual Fairness on Graph Mining. In SIGKDD. 379\u2013389.","DOI":"10.1145\/3394486.3403080"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"Jian Kang and Hanghang Tong. 2019. N2n: Network derivative mining. In CIKM. 861\u2013870.","DOI":"10.1145\/3357384.3357910"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1098\/rsif.2005.0051"},{"key":"e_1_3_2_1_26_1","volume-title":"Kipf and Max Welling","author":"N.","year":"2017","unstructured":"Thomas\u00a0N. Kipf and Max Welling. 2017. Semi-Supervised Classification with Graph Convolutional Networks. In ICLR."},{"key":"e_1_3_2_1_27_1","unstructured":"Johannes Klicpera Aleksandar Bojchevski and Stephan G\u00fcnnemann. 2018. Predict then Propagate: Graph Neural Networks meet Personalized PageRank. In ICLR."},{"key":"e_1_3_2_1_28_1","unstructured":"Bo Li Yining Wang Aarti Singh and Yevgeniy Vorobeychik. 2016. Data poisoning attacks on factorization-based collaborative filtering. In NIPS. 1893\u20131901."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","unstructured":"Jia Li Mengzhou Liu Honglei Zhang Pengyun Wang Yong Wen Lujia Pan and Hong Cheng. 2021. Mask-GVAE: Blind Denoising Graphs via Partition. In TheWebConf. 3688\u20133698.","DOI":"10.1145\/3442381.3449899"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"crossref","unstructured":"Liangyue Li Yuan Yao Jie Tang Wei Fan and Hanghang Tong. 2016. QUINT: on query-specific optimal networks. In SIGKDD. 985\u2013994.","DOI":"10.1145\/2939672.2939768"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/1241540.1241551"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467128"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467375"},{"key":"e_1_3_2_1_34_1","unstructured":"Dongsheng Luo Wei Cheng Wenchao Yu Bo Zong Jingchao Ni Haifeng Chen and Xiang Zhang. 2021. Learning to drop: Robust graph neural network via topological denoising. In WSDM."},{"key":"e_1_3_2_1_35_1","unstructured":"Alex Nichol Joshua Achiam and John Schulman. 2018. On first-order meta-learning algorithms. arXiv preprint arXiv:1803.02999(2018)."},{"key":"e_1_3_2_1_37_1","unstructured":"Yu Rong Wenbing Huang Tingyang Xu and Junzhou Huang. 2019. DropEdge: Towards Deep Graph Convolutional Networks on Node Classification. In ICLR."},{"key":"e_1_3_2_1_38_1","unstructured":"Amirreza Shaban Ching-An Cheng Nathan Hatch and Byron Boots. 2019. Truncated back-propagation for bilevel optimization. In AISTATS. PMLR 1723\u20131732."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.868688"},{"key":"e_1_3_2_1_40_1","unstructured":"Susheel Suresh Pan Li Cong Hao and Jennifer Neville. 2021. Adversarial Graph Augmentation to Improve Graph Contrastive Learning. arXiv preprint arXiv:2106.05819(2021)."},{"key":"e_1_3_2_1_41_1","volume-title":"Fast random walk with restart and its applications","author":"Tong Hanghang","unstructured":"Hanghang Tong, Christos Faloutsos, and Jia-Yu Pan. 2006. Fast random walk with restart and its applications. In ICDM. IEEE, 613\u2013622."},{"key":"e_1_3_2_1_42_1","volume-title":"ICML. PMLR","author":"Trouillon Th\u00e9o","year":"2016","unstructured":"Th\u00e9o Trouillon, Johannes Welbl, Sebastian Riedel, \u00c9ric Gaussier, and Guillaume Bouchard. 2016. Complex embeddings for simple link prediction. In ICML. PMLR, 2071\u20132080."},{"key":"e_1_3_2_1_43_1","first-page":"3221","article-title":"Accelerating t-SNE using tree-based algorithms","volume":"15","author":"Der\u00a0Maaten Laurens Van","year":"2014","unstructured":"Laurens Van Der\u00a0Maaten. 2014. Accelerating t-SNE using tree-based algorithms. The Journal of Machine Learning Research 15, 1 (2014), 3221\u20133245.","journal-title":"The Journal of Machine Learning Research"},{"key":"e_1_3_2_1_44_1","unstructured":"Petar Veli\u010dkovi\u0107 Guillem Cucurull Arantxa Casanova Adriana Romero Pietro Li\u00f2 and Yoshua Bengio. 2018. Graph Attention Networks. In ICLR."},{"key":"e_1_3_2_1_45_1","first-page":"577","article-title":"Clustering with instance-level constraints","volume":"1097","author":"Wagstaff Kiri","year":"2000","unstructured":"Kiri Wagstaff and Claire Cardie. 2000. Clustering with instance-level constraints. AAAI\/IAAI 1097(2000), 577\u2013584.","journal-title":"AAAI\/IAAI"},{"key":"e_1_3_2_1_46_1","volume-title":"Network enhancement as a general method to denoise weighted biological networks. Nature communications 9, 1","author":"Wang Bo","year":"2018","unstructured":"Bo Wang, Armin Pourshafeie, Marinka Zitnik, Junjie Zhu, Carlos\u00a0D Bustamante, Serafim Batzoglou, and Jure Leskovec. 2018. Network enhancement as a general method to denoise weighted biological networks. Nature communications 9, 1 (2018), 1\u20138."},{"key":"e_1_3_2_1_47_1","volume-title":"A semi-supervised graph attentive network for financial fraud detection","author":"Wang Daixin","unstructured":"Daixin Wang, Jianbin Lin, Peng Cui, Quanhui Jia, Zhen Wang, Yanming Fang, Quan Yu, Jun Zhou, Shuang Yang, and Yuan Qi. 2019. A semi-supervised graph attentive network for financial fraud detection. In ICDM. IEEE, 598\u2013607."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"crossref","unstructured":"Xiang Wang and Ian Davidson. 2010. Flexible constrained spectral clustering. In SIGKDD. 563\u2013572.","DOI":"10.1145\/1835804.1835877"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403063"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"crossref","unstructured":"Zhen Wang Jianwen Zhang Jianlin Feng and Zheng Chen. 2014. Knowledge graph embedding by translating on hyperplanes. In AAAI Vol.\u00a028.","DOI":"10.1609\/aaai.v28i1.8870"},{"key":"e_1_3_2_1_51_1","unstructured":"Felix Wu Amauri Souza Tianyi Zhang Christopher Fifty Tao Yu and Kilian Weinberger. 2019. Simplifying Graph Convolutional Networks. In ICML. 6861\u20136871."},{"key":"e_1_3_2_1_52_1","volume-title":"Adversarial examples for graph data: deep insights into attack and defense","author":"Wu Huijun","unstructured":"Huijun Wu, Chen Wang, Yuriy Tyshetskiy, Andrew Docherty, Kai Lu, and Liming Zhu. 2019. Adversarial examples for graph data: deep insights into attack and defense. In IJCAI. AAAI Press, 4816\u20134823."},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.3025147"},{"key":"e_1_3_2_1_54_1","unstructured":"Lian Yan Robert Dodier Michael\u00a0C Mozer and Richard Wolniewicz. 2003. Optimizing classifier performance via an approximation to the Wilcoxon-Mann-Whitney statistic. In ICML. 848\u2013855."},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i5.16585"},{"key":"e_1_3_2_1_56_1","unstructured":"Yuning You Tianlong Chen Yang Shen and Zhangyang Wang. 2021. Graph Contrastive Learning Automated. In ICML Marina Meila and Tong Zhang (Eds.)."},{"key":"e_1_3_2_1_57_1","volume-title":"Graph contrastive learning with augmentations. NeurIPS","author":"You Yuning","year":"2020","unstructured":"Yuning You, Tianlong Chen, Yongduo Sui, Ting Chen, Zhangyang Wang, and Yang Shen. 2020. Graph contrastive learning with augmentations. NeurIPS (2020)."},{"key":"e_1_3_2_1_58_1","volume-title":"Social media mining: an introduction","author":"Zafarani Reza","unstructured":"Reza Zafarani, Mohammad\u00a0Ali Abbasi, and Huan Liu. 2014. Social media mining: an introduction. Cambridge University Press."},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i12.17315"},{"key":"e_1_3_2_1_60_1","unstructured":"Cheng Zheng Bo Zong Wei Cheng Dongjin Song Jingchao Ni Wenchao Yu Haifeng Chen and Wei Wang. 2020. Robust graph representation learning via neural sparsification. In ICML."},{"key":"e_1_3_2_1_61_1","unstructured":"Dingyuan Zhu Ziwei Zhang Peng Cui and Wenwu Zhu. 2019. Robust graph convolutional networks against adversarial attacks. In SIGKDD. 1399\u20131407."},{"key":"e_1_3_2_1_62_1","unstructured":"Yanqiao Zhu Weizhi Xu Jinghao Zhang Qiang Liu Shu Wu and Liang Wang. 2021. Deep Graph Structure Learning for Robust Representations: A Survey. arXiv preprint arXiv:2103.03036(2021)."},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449802"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"crossref","unstructured":"Daniel Z\u00fcgner Amir Akbarnejad and Stephan G\u00fcnnemann. 2018. Adversarial attacks on neural networks for graph data. In SIGKDD. 2847\u20132856.","DOI":"10.1145\/3219819.3220078"},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"crossref","unstructured":"Daniel Z\u00fcgner and Stephan G\u00fcnnemann. 2019. Adversarial Attacks on Graph Neural Networks via Meta Learning. In ICLR.","DOI":"10.24963\/ijcai.2019\/872"}],"event":{"name":"WWW '22: The ACM Web Conference 2022","location":"Virtual Event, Lyon France","acronym":"WWW '22","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of the ACM Web Conference 2022"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3485447.3512180","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3485447.3512180","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3485447.3512180","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:31:14Z","timestamp":1750188674000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3485447.3512180"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,25]]},"references-count":64,"alternative-id":["10.1145\/3485447.3512180","10.1145\/3485447"],"URL":"https:\/\/doi.org\/10.1145\/3485447.3512180","relation":{},"subject":[],"published":{"date-parts":[[2022,4,25]]},"assertion":[{"value":"2022-04-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}