{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,15]],"date-time":"2026-06-15T14:40:28Z","timestamp":1781534428461,"version":"3.54.5"},"reference-count":35,"publisher":"MDPI AG","issue":"5","license":[{"start":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T00:00:00Z","timestamp":1777248000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100016360","name":"Zhongyuan University of Technology","doi-asserted-by":"publisher","award":["GG202417"],"award-info":[{"award-number":["GG202417"]}],"id":[{"id":"10.13039\/501100016360","id-type":"DOI","asserted-by":"publisher"}]},{"award":["GG202417"],"award-info":[{"award-number":["GG202417"]}],"id":[{"id":"https:\/\/ror.org\/0360zcg91","id-type":"ROR","asserted-by":"publisher"}]},{"name":"Key Research and Development Program of Henan","award":["251111212000"],"award-info":[{"award-number":["251111212000"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information"],"abstract":"<jats:p>Due to the capability of graph structures to model complex relationships, graph anomaly detection has significant application value in various domains, including financial fraud detection, network security, and fake account identification. Traditional graph anomaly detection methods follow a specialized paradigm of \u201cone dataset, one model\u201d, which requires retraining or fine-tuning models for each new domain. This approach faces critical challenges in practical applications, namely high deployment costs and limited generalization capability. To address this problem, generalist graph anomaly detection aims to achieve the goal of \u201ctrain once, apply across domains\u201d. However, existing generalist methods primarily rely on graph neural networks to implicitly learn structural information, where the learned structural representations are tightly coupled with specific topology distributions, resulting in limited structural stability under domain shifts. To address this limitation, we propose DualGAD, a generalist graph anomaly detection method via a dual-encoder architecture. In particular, DualGAD introduces explicit structural modeling that characterizes the relative topological deviation of nodes with respect to the overall graph structure, thereby enhancing structural invariance across heterogeneous domains. This method separately models node attribute information and explicit graph structural information via an attribute feature encoder and an explicit structural feature encoder, and adopts an \u201cattribute-dominant, structure-complementary\u201d fusion strategy to achieve collaborative modeling. Experiments on eight real datasets demonstrate that DualGAD achieves an average improvement of 3.12% in AUROC compared to the strongest baseline methods, exhibiting significant cross-domain generalization capability.<\/jats:p>","DOI":"10.3390\/info17050416","type":"journal-article","created":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T11:33:37Z","timestamp":1777376017000},"page":"416","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["DualGAD: A Generalist Graph Anomaly Detection Method via Dual-Encoder Architecture"],"prefix":"10.3390","volume":"17","author":[{"given":"Jizhao","family":"Liu","sequence":"first","affiliation":[{"name":"School of Computer Science, Zhongyuan University of Technology, Zhengzhou 451191, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shuo","family":"Mao","sequence":"additional","affiliation":[{"name":"School of Computer Science, Zhongyuan University of Technology, Zhengzhou 451191, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shuqin","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Computer Science, Zhongyuan University of Technology, Zhengzhou 451191, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fangfang","family":"Shan","sequence":"additional","affiliation":[{"name":"School of Computer Science, Zhongyuan University of Technology, Zhengzhou 451191, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jun","family":"Li","sequence":"additional","affiliation":[{"name":"School of Computer Science, Zhongyuan University of Technology, Zhengzhou 451191, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2026,4,27]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1109\/TNNLS.2020.2978386","article-title":"A comprehensive survey on graph neural networks","volume":"32","author":"Wu","year":"2020","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Qiao, H., Tong, H., An, B., King, I., Aggarwal, C., and Pang, G. (IEEE Trans. Knowl. Data Eng., 2025). Deep graph anomaly detection: A survey and new perspectives, IEEE Trans. Knowl. Data Eng., in press.","DOI":"10.1109\/TKDE.2025.3581578"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Bandyopadhyay, S., N, L., Vivek, S.V., and Murty, M.N. (2020). Outlier resistant unsupervised deep architectures for attributed network embedding. Proceedings of the 13th International Conference on Web Search and Data Mining, Houston, TX, USA, 3\u20137 February 2020, ACM.","DOI":"10.1145\/3336191.3371788"},{"key":"ref_4","first-page":"136120","article-title":"Unigad: Unifying multi-level graph anomaly detection","volume":"37","author":"Lin","year":"2024","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"12012","DOI":"10.1109\/TKDE.2021.3118815","article-title":"A comprehensive survey on graph anomaly detection with deep learning","volume":"35","author":"Ma","year":"2021","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_6","first-page":"4660","article-title":"Generative semi-supervised graph anomaly detection","volume":"37","author":"Qiao","year":"2024","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"ref_7","unstructured":"Ghani, R., Senator, T.E., Bradley, P., Parekh, R., and He, J. (2013). Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"663","DOI":"10.3233\/IDA-2007-11606","article-title":"Anomaly detection in data represented as graphs","volume":"11","author":"Eberle","year":"2007","journal-title":"Intell. Data Anal."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Henderson, K., Gallagher, B., Eliassi-Rad, T., Tong, H., Basu, S., Akoglu, L., and Li, L. (2012). Rolx: Structural role extraction & mining in large graphs. Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Beijing, China, 12\u201316 August 2012, ACM.","DOI":"10.1145\/2339530.2339723"},{"key":"ref_10","unstructured":"Kipf, T.N., and Welling, M. (2016). Semi-supervised classification with graph convolutional networks. arXiv."},{"key":"ref_11","unstructured":"Veli\u010dkovi\u0107, P., Cucurull, G., Casanova, A., Romero, A., Lio, P., and Bengio, Y. (2017). Graph attention networks. arXiv."},{"key":"ref_12","unstructured":"Zhang, Y., Pal, S., Coates, M., and Ustebay, D. (February, January 27). Bayesian graph convolutional neural networks for semi-supervised classification. Proceedings of the AAAI Conference on Artificial Intelligence, Honolulu, HI, USA."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Ding, K., Li, J., Bhanushali, R., and Liu, H. (2019). Deep anomaly detection on attributed networks. Proceedings of the 2019 SIAM International Conference on Data Mining, Calgary, AB, Canada, 2\u20134 May 2019, SIAM.","DOI":"10.1137\/1.9781611975673.67"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"2378","DOI":"10.1109\/TNNLS.2021.3068344","article-title":"Anomaly detection on attributed networks via contrastive self-supervised learning","volume":"33","author":"Liu","year":"2021","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Huang, T., Pei, Y., Menkovski, V., and Pechenizkiy, M. (2022). Hop-count based self-supervised anomaly detection on attributed networks. Proceedings of the Joint European Conference on Machine Learning and Knowledge Discovery in Databases, Grenoble, France, 19\u201323 September 2022, Springer.","DOI":"10.1007\/978-3-031-26387-3_14"},{"key":"ref_16","first-page":"50772","article-title":"Arc: A generalist graph anomaly detector with in-context learning","volume":"37","author":"Liu","year":"2024","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Niu, C., Qiao, H., Chen, C., Chen, L., and Pang, G. (2024). Zero-shot generalist graph anomaly detection with unified neighborhood prompts. arXiv.","DOI":"10.24963\/ijcai.2024\/359"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Hassanzadeh, R., Nayak, R., and Stebila, D. (2012). Analyzing the effectiveness of graph metrics for anomaly detection in online social networks. Proceedings of the International Conference on Web Information Systems Engineering, Paphos, Cyprus, 19\u201321 November 2012, Springer.","DOI":"10.1007\/978-3-642-35063-4_45"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1016\/j.socnet.2007.04.002","article-title":"Some unique properties of eigenvector centrality","volume":"29","author":"Bonacich","year":"2007","journal-title":"Soc. Netw."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Fan, H., Zhang, F., and Li, Z. (2020). Anomalydae: Dual autoencoder for anomaly detection on attributed networks. Proceedings of the ICASSP 2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Barcelona, Spain, 4\u20138 May 2020, IEEE.","DOI":"10.1109\/ICASSP40776.2020.9053387"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"1813","DOI":"10.1109\/TBDATA.2024.3489420","article-title":"Dgnn: Decoupled graph neural networks with structural consistency between attribute and graph embedding representations","volume":"11","author":"Wang","year":"2024","journal-title":"IEEE Trans. Big Data"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/j.patrec.2024.05.004","article-title":"Adversarial regularized attributed network embedding for graph anomaly detection","volume":"183","author":"Tian","year":"2024","journal-title":"Pattern Recognit. Lett."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1137\/1035134","article-title":"On the early history of the singular value decomposition","volume":"35","author":"Stewart","year":"1993","journal-title":"SIAM Rev."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1002\/wics.101","article-title":"Principal component analysis","volume":"2","author":"Abdi","year":"2010","journal-title":"Wiley Interdiscip. Rev. Comput. Stat."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Zhang, Z., Hensley, C., and Chen, Z. (2024). Improving node classification with neural tangent kernel: A graph neural network approach. Proceedings of the International Conference on Machine Learning, Pattern Recognition and Automation Engineering, Singapore, 7\u20139 August 2024, ACM.","DOI":"10.1145\/3696687.3696703"},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Tang, L., and Liu, H. (2009). Relational learning via latent social dimensions. Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Paris, France, 28 June\u20131 July 2009, ACM.","DOI":"10.1145\/1557019.1557109"},{"key":"ref_27","first-page":"93","article-title":"Collective classification in network data","volume":"29","author":"Sen","year":"2008","journal-title":"AI Mag."},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Yuan, X., Zhou, N., Yu, S., Huang, H., Chen, Z., and Xia, F. (2021). Higher-order structure based anomaly detection on attributed networks. Proceedings of the 2021 IEEE International Conference on Big Data (Big Data), Orlando, FL, USA, 15\u201318 December 2021, IEEE.","DOI":"10.1109\/BigData52589.2021.9671990"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1186\/s40537-025-01149-y","article-title":"Graph neural network approach with spatial structure to anomaly detection of network data","volume":"12","author":"Zhang","year":"2025","journal-title":"J. Big Data"},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Xu, Z., Huang, X., Zhao, Y., Dong, Y., and Li, J. (2022). Contrastive attributed network anomaly detection with data augmentation. Proceedings of the Pacific-Asia Conference on Knowledge Discovery and Data Mining, Chengdu, China, 16\u201319 May 2022, Springer.","DOI":"10.1007\/978-3-031-05936-0_35"},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Kumar, S., Zhang, X., and Leskovec, J. (2019). Predicting dynamic embedding trajectory in temporal interaction networks. Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, Anchorage, AK, USA, 4\u20138 August 2019, ACM.","DOI":"10.1145\/3292500.3330895"},{"key":"ref_32","unstructured":"Platonov, O., Kuznedelev, D., Diskin, M., Babenko, A., and Prokhorenkova, L. (2023). A critical look at the evaluation of GNNs under heterophily: Are we really making progress?. arXiv."},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Dou, Y., Liu, Z., Sun, L., Deng, Y., Peng, H., and Yu, P.S. (2020). Enhancing graph neural network-based fraud detectors against camouflaged fraudsters. Proceedings of the 29th ACM International Conference on Information & Knowledge Management, Galway, Ireland, 19\u201323 October 2020, ACM.","DOI":"10.1145\/3340531.3411903"},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Durak, N., Pinar, A., Kolda, T.G., and Seshadhri, C. (2012). Degree relations of triangles in real-world networks and graph models. Proceedings of the 21st ACM International Conference on Information and Knowledge Management, Maui, HI, USA, 29 October\u20132 November 2012, ACM.","DOI":"10.1145\/2396761.2398503"},{"key":"ref_35","doi-asserted-by":"crossref","unstructured":"Meghanathan, N. (2016). A greedy algorithm for neighborhood overlap-based community detection. Algorithms, 9.","DOI":"10.3390\/a9010008"}],"container-title":["Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2078-2489\/17\/5\/416\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T12:12:56Z","timestamp":1777378376000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2078-2489\/17\/5\/416"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4,27]]},"references-count":35,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2026,5]]}},"alternative-id":["info17050416"],"URL":"https:\/\/doi.org\/10.3390\/info17050416","relation":{},"ISSN":["2078-2489"],"issn-type":[{"value":"2078-2489","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,4,27]]}}}