Anomaly Detection in Time-Evolving Attributed Networks

3Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Recently, there is a surge of research interests in finding anomalous nodes upon attributed networks. However, a vast majority of existing methods fail to capture the evolution of the networks properly, as they regard them as static. Meanwhile, they treat all the attributes and the instances equally, ignoring the existence of noisy. To tackle these problems, we propose a novel dynamic anomaly detection framework based on residual analysis, namely AMAD. It leverages the small smooth disturbance between time stamps to characterize the evolution of networks for incrementally update. Experiments conducted on several datasets show the superiority of AMAD in detecting anomalies.

Cite

CITATION STYLE

APA

Xue, L., Luo, M., Peng, Z., Li, J., Chen, Y., & Liu, J. (2019). Anomaly Detection in Time-Evolving Attributed Networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11448 LNCS, pp. 235–239). Springer Verlag. https://doi.org/10.1007/978-3-030-18590-9_19

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free