{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T16:48:28Z","timestamp":1755794908378,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":40,"publisher":"ACM","funder":[{"DOI":"10.13039\/https:\/\/doi.org\/10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62272338"],"award-info":[{"award-number":["62272338"]}],"id":[{"id":"10.13039\/https:\/\/doi.org\/10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,8,3]]},"DOI":"10.1145\/3711896.3737031","type":"proceedings-article","created":{"date-parts":[[2025,8,3]],"date-time":"2025-08-03T21:03:27Z","timestamp":1754255007000},"page":"3180-3191","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Local Homophily-Aware Graph Neural Network with Adaptive Polynomial Filters for Scalable Graph Anomaly Detection"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-6939-0042","authenticated-orcid":false,"given":"Zengyi","family":"Wo","sequence":"first","affiliation":[{"name":"School of New Media and Communication, Tianjin University, Tianjin, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1830-9797","authenticated-orcid":false,"given":"Minglai","family":"Shao","sequence":"additional","affiliation":[{"name":"School of New Media and Communications, Tianjin University, Tianjin, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-2684-338X","authenticated-orcid":false,"given":"Shiyu","family":"Zhang","sequence":"additional","affiliation":[{"name":"College of Intelligence and Computing, Tianjin University, Tianjin, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1368-1688","authenticated-orcid":false,"given":"Ruijie","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Beihang Univerisity, Beijing, China"}]}],"member":"320","published-online":{"date-parts":[[2025,8,3]]},"reference":[{"key":"e_1_3_2_2_1_1","first-page":"1945","article-title":"Can abnormality be detected by graph neural networks?","author":"Chai Ziwei","year":"2022","unstructured":"Ziwei Chai, Siqi You, Yang Yang, Shiliang Pu, Jiarong Xu, Haoyang Cai, and Weihao Jiang. 2022. Can abnormality be detected by graph neural networks?. In IJCAI. 1945-1951.","journal-title":"IJCAI."},{"key":"e_1_3_2_2_2_1","volume-title":"Consistency Training with Learnable Data Augmentation for Graph Anomaly Detection with Limited Supervision. In The Twelfth International Conference on Learning Representations.","author":"Chen Nan","year":"2024","unstructured":"Nan Chen, Zemin Liu, Bryan Hooi, Bingsheng He, Rizal Fathony, Jun Hu, and Jia Chen. 2024. Consistency Training with Learnable Data Augmentation for Graph Anomaly Detection with Limited Supervision. In The Twelfth International Conference on Learning Representations."},{"key":"e_1_3_2_2_3_1","volume-title":"Masked contrastive learning for anomaly detection. arXiv preprint arXiv:2105.08793","author":"Cho Hyunsoo","year":"2021","unstructured":"Hyunsoo Cho, Jinseok Seol, and Sang-goo Lee. 2021. Masked contrastive learning for anomaly detection. arXiv preprint arXiv:2105.08793 (2021)."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403092"},{"key":"e_1_3_2_2_5_1","volume-title":"Markov-driven graph convolutional networksfor social spammer detection","author":"Deng Leyan","year":"2022","unstructured":"Leyan Deng, Chenwang Wu, Defu Lian, Yongji Wu, and Enhong Chen. 2022. Markov-driven graph convolutional networksfor social spammer detection. IEEE Transactions on Knowledge and Data Engineering (2022)."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3411903"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583268"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3539597.3570377"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"crossref","unstructured":"Walter Gautschi. 2004. Orthogonal polynomials: computation and approximation. OUP Oxford.","DOI":"10.1093\/oso\/9780198506720.001.0001"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3627673.3679785"},{"key":"e_1_3_2_2_11_1","first-page":"12077","article-title":"Graph Neural Networks with Learnable and Optimal Polynomial Bases","author":"Guo Yuhe","year":"2023","unstructured":"Yuhe Guo and Zhewei Wei. 2023. Graph Neural Networks with Learnable and Optimal Polynomial Bases. In ICML. 12077-12097.","journal-title":"ICML."},{"key":"e_1_3_2_2_12_1","volume-title":"Inductive representation learning on large graphs. Advances in neural information processing systems","author":"Hamilton Will","year":"2017","unstructured":"Will Hamilton, Zhitao Ying, and Jure Leskovec. 2017. Inductive representation learning on large graphs. Advances in neural information processing systems, Vol. 30 (2017)."},{"key":"e_1_3_2_2_13_1","volume-title":"Ming Li, et al.","author":"Huang Keke","year":"2024","unstructured":"Keke Huang, Yu Guang Wang, Ming Li, et al. 2024. How Universal Polynomial Bases Enhance Spectral Graph Neural Networks: Heterophily, Over-smoothing, and Over-squashing. arXiv preprint arXiv:2405.12474 (2024)."},{"key":"e_1_3_2_2_14_1","first-page":"22765","article-title":"Dgraph: A large-scale financial dataset for graph anomaly detection","volume":"35","author":"Huang Xuanwen","year":"2022","unstructured":"Xuanwen Huang, Yang Yang, Yang Wang, Chunping Wang, Zhisheng Zhang, Jiarong Xu, Lei Chen, and Michalis Vazirgiannis. 2022. Dgraph: A large-scale financial dataset for graph anomaly detection. Advances in Neural Information Processing Systems, Vol. 35 (2022), 22765-22777.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3437963.3441735"},{"key":"e_1_3_2_2_16_1","volume-title":"Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907","author":"Kipf Thomas N","year":"2016","unstructured":"Thomas N Kipf and Max Welling. 2016. Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907 (2016)."},{"volume-title":"Krylov subspace methods: principles and analysis","author":"Liesen J\u00f6rg","key":"e_1_3_2_2_17_1","unstructured":"J\u00f6rg Liesen and Zdenek Strakos. 2013. Krylov subspace methods: principles and analysis. Oxford University Press."},{"key":"e_1_3_2_2_18_1","first-page":"20887","article-title":"Large scale learning on non-homophilous graphs: New benchmarks and strong simple methods","author":"Lim Derek","year":"2021","unstructured":"Derek Lim, Felix Hohne, Xiuyu Li, Sijia Linda Huang, Vaishnavi Gupta, Omkar Bhalerao, and Ser Nam Lim. 2021. Large scale learning on non-homophilous graphs: New benchmarks and strong simple methods. In NeurIPS. 20887-20902.","journal-title":"NeurIPS."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467142"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449989"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3272010"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401253"},{"key":"e_1_3_2_2_23_1","volume-title":"Learning on Graphs Conference. PMLR, 6-1.","author":"Loveland Donald","year":"2024","unstructured":"Donald Loveland, Jiong Zhu, Mark Heimann, Benjamin Fish, Michael T Schaub, and Danai Koutra. 2024. On performance discrepancies across local homophily levels in graph neural networks. In Learning on Graphs Conference. PMLR, 6-1."},{"key":"e_1_3_2_2_24_1","volume-title":"Revisiting heterophily for graph neural networks. Advances in neural information processing systems","author":"Luan Sitao","year":"2022","unstructured":"Sitao Luan, Chenqing Hua, Qincheng Lu, Jiaqi Zhu, Mingde Zhao, Shuyuan Zhang, Xiao-Wen Chang, and Doina Precup. 2022. Revisiting heterophily for graph neural networks. Advances in neural information processing systems, Vol. 35 (2022), 1362-1375."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488388.2488466"},{"key":"e_1_3_2_2_26_1","volume-title":"Yu Lei, and Bo Yang.","author":"Pei Hongbin","year":"2020","unstructured":"Hongbin Pei, Bingzhe Wei, Kevin Chen-Chuan Chang, Yu Lei, and Bo Yang. 2020. Geom-gcn: Geometric graph convolutional networks. arXiv preprint arXiv:2002.05287 (2020)."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783370"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512195"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i4.20385"},{"key":"e_1_3_2_2_30_1","volume-title":"International Conference on Machine Learning. PMLR, 21076-21089","author":"Tang Jianheng","year":"2022","unstructured":"Jianheng Tang, Jiajin Li, Ziqi Gao, and Jia Li. 2022. Rethinking graph neural networks for anomaly detection. In International Conference on Machine Learning. PMLR, 21076-21089."},{"key":"e_1_3_2_2_31_1","unstructured":"Petar Velickovic Guillem Cucurull Arantxa Casanova Adriana Romero Pietro Lio Yoshua Bengio et al. 2017. Graph attention networks. stat Vol. 1050 20 (2017) 10-48550."},{"key":"e_1_3_2_2_32_1","unstructured":"Minjie Wang Da Zheng Zihao Ye Quan Gan Mufei Li Xiang Song Jinjing Zhou Chao Ma Lingfan Yu Yu Gai et al. 2019. Deep graph library: A graph-centric highly-performant package for graph neural networks. arXiv preprint arXiv:1909.01315 (2019)."},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583373"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3589334.3645687"},{"key":"e_1_3_2_2_35_1","unstructured":"Yue Xin Jiarui Zhang Ziyang Zheng Yaoming Wang Wenrui Dai Chenglin Li Junni Zou and Hongkai Xiong. [n. d.]. ChebyNet: Boosting Neural Network Fitting and Efficiency through Chebyshev Polynomial Layer Connections. ( [n. d.])."},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v38i8.28773"},{"key":"e_1_3_2_2_37_1","volume-title":"How powerful are graph neural networks? arXiv preprint arXiv:1810.00826","author":"Xu Keyulu","year":"2018","unstructured":"Keyulu Xu, Weihua Hu, Jure Leskovec, and Stefanie Jegelka. 2018. How powerful are graph neural networks? arXiv preprint arXiv:1810.00826 (2018)."},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3474379"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2021.3102609"},{"key":"e_1_3_2_2_40_1","unstructured":"Wei Zhuo Zemin Liu Bryan Hooi Bingsheng He Guang Tan Rizal Fathony and Jia Chen. 2024. Partitioning Message Passing for Graph Fraud Detection. In ICLR."}],"event":{"name":"KDD '25: The 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"],"location":"Toronto ON Canada","acronym":"KDD '25"},"container-title":["Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.2"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3711896.3737031","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T14:40:58Z","timestamp":1755355258000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3711896.3737031"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,3]]},"references-count":40,"alternative-id":["10.1145\/3711896.3737031","10.1145\/3711896"],"URL":"https:\/\/doi.org\/10.1145\/3711896.3737031","relation":{},"subject":[],"published":{"date-parts":[[2025,8,3]]},"assertion":[{"value":"2025-08-03","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}