skip to main content
10.1007/978-3-030-60248-2_4guideproceedingsArticle/Chapter ViewAbstractPublication PagesConference Proceedingsacm-pubtype
Article

Content-Aware Anomaly Detection with Network Representation Learning

Published: 02 October 2020 Publication History

Abstract

Given a network with node descriptions or labels, how to identify anomalous nodes and anomalous links in it? Existing methods (e.g., non-negative matrix factorization) mostly focuses on structural anomalies, without taking node descriptions or labels seriously into account. However, such information is obviously valuable for detecting anomalous nodes and links. On the other hand, network representation learning aims to represent the nodes and links in a network as low-dimensional, real-valued and dense vectors, so that the resulting vectors have representation and reasoning ability. It is straightforward that the reconstruction errors between normal node representations are small, while anomaly ones are not. Therefore, we propose a novel Content-Aware Anomaly Detection (CAAD) method based on network representation learning and encoder-decoder. The CAAD method learns structural and content representations with convolutional neural networks. By using the learned low-dimensional node representations, an encoder-decoder model is trained to perform anomaly detection in terms of reconstruction errors. Experiments on two synthetic datasets and one real-world dataset demonstrate that CAAD consistently outperforms the existing baseline methods. For more information and source codes of this study please visit https://github.com/lizhong2613/CAAD.

References

[1]
Yu, W., et al.: Netwalk: a flexible deep embedding approach for anomaly detection in dynamic networks. In: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining (2018)
[2]
Hu, R., et al.: An embedding approach to anomaly detection. In: IEEE 32nd International Conference on Data Engineering (ICDE). IEEE (2016)
[3]
Gao, J., et al.: A spectral framework for detecting inconsistency across multi-source object relationships. In: 2011 IEEE 11th International Conference on Data Mining. IEEE (2011)
[4]
Fischer A et al. Virtual network embedding: a survey IEEE Commun. Surv. Tutorials 2013 15 4 1888-1906
[5]
Akoglu L, McGlohon M, and Faloutsos C Zaki MJ, Yu JX, Ravindran B, and Pudi V Oddball: spotting anomalies in weighted graphs Advances in Knowledge Discovery and Data Mining 2010 Heidelberg Springer 410-421
[6]
Perozzi, B., Al-Rfou, R., Skiena, S.: Deepwalk: online learning of social representations. In: Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM (2014)
[7]
Grover, A., Leskovec, J.: node2vec: scalable feature learning for networks. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM (2016)
[8]
Tang, J., et al.: Line: large-scale information network embedding. In: Proceedings of the 24th International Conference on World Wide Web. International World Wide Web Conferences Steering Committee (2015)
[9]
Chawla NV et al. SMOTE: synthetic minority over-sampling technique J. Artif. Intell. Res. 2002 16 321-357
[10]
Prakash BA, Sridharan A, Seshadri M, Machiraju S, and Faloutsos C Zaki MJ, Yu JX, Ravindran B, and Pudi V EigenSpokes: surprising patterns and scalable community chipping in large graphs Advances in Knowledge Discovery and Data Mining 2010 Heidelberg Springer 435-448
[11]
Jiang, M., et al.: A general suspiciousness metric for dense blocks in multimodal data. In: IEEE International Conference on Data Mining. IEEE (2015)
[12]
Shin K, Hooi B, and Faloutsos C Frasconi P, Landwehr N, Manco G, and Vreeken J M-Zoom: fast dense-block detection in tensors with quality guarantees Machine Learning and Knowledge Discovery in Databases 2016 Cham Springer 264-280
[13]
Shin, K., et al.: D-cube: dense-block detection in terabyte-scale tensors. In: Proceedings of the Tenth ACM International Conference on Web Search and Data Mining. ACM (2017)
[14]
Tong, H., Lin, C.-Y.: Non-negative residual matrix factorization with application to graph anomaly detection. In: Proceedings of the 2011 SIAM International Conference on Data Mining. Society for Industrial and Applied Mathematics (2011)
[15]
Tu, C., et al.: Cane: context-aware network embedding for relation modeling. In: Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) (2017)
[16]
Kagan D, Elovichi Y, and Fire M Generic anomalous vertices detection utilizing a link prediction algorithm Social Netw. Anal. Min. 2018 8 1 27
[17]
Kagan, D., Fire, M., Elovici, Y.: Unsupervised anomalous vertices detection utilizing link prediction algorithms. arXiv preprint arXiv:1610.07525 (2016)
[18]
Liu, F.T., Ting, K.M., Zhou, Z.-H.: Isolation forest. In: Eighth IEEE International Conference on Data Mining. IEEE (2008)

Recommendations

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings
Algorithms and Architectures for Parallel Processing: 20th International Conference, ICA3PP 2020, New York City, NY, USA, October 2–4, 2020, Proceedings, Part III
Oct 2020
721 pages
ISBN:978-3-030-60247-5
DOI:10.1007/978-3-030-60248-2
  • Editor:
  • Meikang Qiu

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 02 October 2020

Author Tags

  1. Data mining
  2. Network embedding
  3. Anomaly detection
  4. Link analysis

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 0
    Total Downloads
  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 25 Jan 2025

Other Metrics

Citations

View Options

View options

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media