The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Deep Anomaly Detection on Attributed Networks
Abstract
Attributed networks are ubiquitous and form a critical component of modern information infrastructure, where additional node attributes complement the raw network structure in knowledge discovery. Recently, detecting anomalous nodes on attributed networks has attracted an increasing amount of research attention, with broad applications in various high-impact domains, such as cybersecurity, finance, and healthcare. Most of the existing attempts, however, tackle the problem with shallow learning mechanisms by ego-network or community analysis, or through subspace selection. Undoubtedly, these models cannot fully address the computational challenges on attributed networks. For example, they often suffer from the network sparsity and data nonlinearity issues, and fail to capture the complex interactions between different information modalities, thus negatively impact the performance of anomaly detection. To tackle the aforementioned problems, in this paper, we study the anomaly detection problem on attributed networks by developing a novel deep model. In particular, our proposed deep model: (1) explicitly models the topological structure and nodal attributes seamlessly for node embedding learning with the prevalent graph convolutional network (GCN); and (2) is customized to address the anomaly detection problem by virtue of deep autoencoder that leverages the learned embeddings to reconstruct the original data. The synergy between GCN and autoencoder enables us to spot anomalies by measuring the reconstruction errors of nodes from both the structure and the attribute perspectives. Extensive experiments on real-world attributed network datasets demonstrate the efficacy of our proposed algorithm.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Birds of a Feather: Homophily in Social Networks
McPherson, M., Smith-Lovin, L., & Cook, J. M. (2001) · Annual Review of Sociology · doi:10.1146/annurev.soc.27.1.415 · Cited by 18,567
Inductive Representation Learning on Large Graphs
Hamilton, W. L., Ying, R., & Leskovec, J. (2017) · arXiv · doi:10.48550/arxiv.1706.02216 · Cited by 10,639
Structural Deep Network Embedding
Wang, D., Cui, P., & Zhu, W. (2016) · Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2939672.2939753 · Cited by 2,845
Anomaly Detection with Robust Deep Autoencoders
Zhou, C., & Paffenroth, R. C. (2017) · Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/3097983.3098052 · Cited by 1,436
Deep Neural Networks for Learning Graph Representations
Cao, S., Lu, W., & Xu, Q. (2016) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v30i1.10179 · Cited by 1,014
Homophily and contagion are generically confounded in observational social network studies
Shalizi, C. R., & Thomas, A. C. (2011) · Sociological Methods & Research · doi:10.1177/0049124111404820 · Cited by 994 · cited 1×
“Studies from social science have shown that data often exhibits correlation among the attributes of connected individuals [20, 29], and such insights are helpful in distilling actionable knowledge from such networks.”
BackgroundSCAN: a structural clustering algorithm for networks
Xu, X., Yuruk, N., Feng, Z., & Schweiger, T. A. J. (2007) · Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1281192.1281280 · Cited by 842
Heterogeneous Network Embedding via Deep Architectures
Chang, S., Han, W., Tang, J., Qi, G.-J., Aggarwal, C. C., & Huang, T. S. (2015) · Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2783258.2783296 · Cited by 590
Label Informed Attributed Network Embedding
Huang, X., Li, J., & Hu, X. (2017) · Proceedings of the Tenth ACM International Conference on Web Search and Data Mining · doi:10.1145/3018661.3018667 · Cited by 487
Self-citationTri-party deep network representation
Pan, S., Wu, J. X., Xingquan Zhu, A., Chengqi Zhang, B., & Wang, Y. (2016) · Griffith Research Online · Cited by 479
Cited by
Deep Learning for Anomaly Detection: A Review
Pang, G., Shen, C., Cao, L., & Hengel, A. V. D. (2022) · ACM Computing Surveys · doi:10.1145/3439950 · Cited by 2,837
A Comprehensive Survey on Graph Anomaly Detection With Deep Learning
Ma, X., Wu, J., Xue, S., Yang, J., Zhou, C., Sheng, Q. Z., Xiong, H., & Akoglu, L. (2023) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2021.3118815 · Cited by 835
Graph Self-Supervised Learning: A Survey
Liu, Y., Jin, M., Pan, S., Zhou, C., Zheng, Y., Xia, F., & Yu, P. (2022) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2022.3172903 · Cited by 510
Anomaly Detection on Attributed Networks via Contrastive Self-Supervised Learning
Liu, Y., Li, Z., Pan, S., Gong, C., Zhou, C., & Karypis, G. (2022) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2021.3068344 · Cited by 492
A Survey of Learning Causality with Data: Problems and Methods
Guo, R., Cheng, L., Li, J., Hahn, P. R., & Liu, H. (2021) · ACM Computing Surveys · doi:10.1145/3397269 · Cited by 362
Self-citationNext-item Recommendation with Sequential Hypergraphs
Wang, J., Ding, K., Hong, L., Liu, H., & Caverlee, J. (2020) · Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval · doi:10.1145/3397271.3401133 · Cited by 277
Self-citationCombating disinformation in a social media age
Shu, K., Bhattacharjee, A., Alatawi, F., Nazer, T. H., Ding, K., Karami, M., & Liu, H. (2020) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.1385 · Cited by 198
Self-citationeFraudCom: An E-commerce Fraud Detection System via Competitive Graph Neural Networks
Zhang, G., Li, Z., Huang, J., Wu, J., Zhou, C., Yang, J., & Gao, J. (2022) · ACM Transactions on Information Systems · doi:10.1145/3474379 · Cited by 177
Higher-order Structure Based Anomaly Detection on Attributed Networks
Yuan, X., Zhou, N., Yu, S., Huang, H., Chen, Z., & Xia, F. (2021) · 2021 IEEE International Conference on Big Data (Big Data) · doi:10.1109/bigdata52589.2021.9671990 · Cited by 69
PREM: A Simple Yet Effective Approach for Node-Level Graph Anomaly Detection
Pan, J., Liu, Y., Zheng, Y., & Pan, S. (2023) · 2023 IEEE International Conference on Data Mining (ICDM) · doi:10.1109/icdm58522.2023.00157 · Cited by 32
Detecting malicious IoT network communication through Graph Neural Networks in real-world conditions
Carletti, V., Foggia, P., Rosa, F., & Vento, M. (2025) · Pattern Recognition Letters · doi:10.1016/j.patrec.2025.01.010 · Cited by 12
Embedding Learning with Heterogeneous Event Sequence for Insider Threat Detection
Wang, J., Cai, L., Yu, A., & Meng, D. (2019) · 2019 IEEE 31st International Conference on Tools with Artificial Intelligence (ICTAI) · doi:10.1109/ictai.2019.00134 · Cited by 7
Temporal subgraph contrastive learning for anomaly detection on dynamic attributed graphs
Yu, Y., Li, X., Shao, M., Sun, Y., & Wang, W. (2025) · Applied Intelligence · doi:10.1007/s10489-025-06402-8 · Cited by 2
A Survey of Heterogeneous Graph Neural Networks for Cybersecurity Anomaly Detection
Jiang, L., Ryan, R., Li, Q., & Ferdosian, N. (2025) · arXiv · doi:10.48550/arxiv.2510.26307 · Cited by 13
“Following recent surveys [6], [7], [25], this paper instead adopts a graph-centric taxonomy that categorizes anomalies according to the type of graph element affected.”
Influential
Metadata
- Authors
- Ding, K., Li, J., Bhanushali, R., & Liu, H.
- Venue
- Proceedings of the 2019 SIAM International Conference on Data Mining
- Published
- 2019-05-06
- Pages
- 594-602
- OpenAlex
- W2944250323
- Cited by
- 548
- References
- 24
- FWCI
- 14.72
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.