Skip to main content

DNEA: Dynamic Network Embedding Method for Anomaly Detection

  • Conference paper
  • First Online:
Book cover Knowledge Science, Engineering and Management (KSEM 2021)

Abstract

Network embedding is a basic method for dynamic network analysis. Diverse dynamic network embedding methods have emerged in recent years, however, most existing works regard all observed information as true information, ignoring the anomalous edges in the dynamic networks. When the observed information is mixed with anomalous edges, the learned node embeddings cannot depict precise network properties effectively. Therefore, network embedding that can identify anomalous edges is a promising research topic. Inspired by this, we propose a novel end-to-end dynamic network embedding method called Dynamic Network Embedding for Anomaly Detection (DNEA), which can learn the robust node embeddings based on the neighborhood information and community structure in the dynamic networks. DNEA captures the dynamic characteristics of the network to reconstruct the network topology structure based on Stochastic Block Model (SBM), and detects anomalous edges from the perspective of reconstruction probability. In addition, DNEA utilizes negative sampling to handle the challenge of scarce anomaly labels. Experimental results on real-world datasets demonstrate DNEA can outperform the state-of-the-arts.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 79.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 99.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    The terms block and community mentioned in this paper are interchangeable.

  2. 2.

    http://snap.stanford.edu/data/CollegeMsg.html.

  3. 3.

    http://networkrepository.com/fb-forum.php.

  4. 4.

    http://networkrepository.com/email-dnc.php.

References

  1. 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, pp. 701–710 (2014)

    Google Scholar 

  2. 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, pp. 855–864 (2016)

    Google Scholar 

  3. Kipf, T.N., Welling, M.: Semi-supervised classification with graph convolutional networks. In: 5th International Conference on Learning Representations (2017)

    Google Scholar 

  4. Noble, C.C., Cook, D.J.: Graph-based anomaly detection. In: Proceedings of the ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 631–636 (2003)

    Google Scholar 

  5. Li, J., Dani, H., Hu, X., Tang, J., Chang, Y., Liu, H.: Attributed network embedding for learning in a dynamic environment. In: Proceedings of the 2017 ACM on Conference on Information and Knowledge Management, pp. 387–396 (2017)

    Google Scholar 

  6. Zhu, D., Cui, P., Zhang, Z., Pei, J., Zhu, W.: High-order proximity preserved embedding for dynamic networks. IEEE Trans. Knowl. Data Eng. 30(11), 2134–2144 (2018)

    Google Scholar 

  7. Goyal, P., Chhetri, S.R., Canedo, A.: dyngraph2vec: capturing network dynamics using dynamic graph representation learning. Knowl.-Based Syst. 187, 104816 (2020)

    Article  Google Scholar 

  8. Pareja, A., et al.: EvolveGCN: evolving graph convolutional networks for dynamic graphs. Proceedings of the AAAI Conference on Artificial Intelligence, vol. 34, pp. 5363–5370 (2020)

    Google Scholar 

  9. Sankar, A., Wu, Y., Gou, L., Zhang, W., Yang, H.: DySAT: deep neural representation learning on dynamic graphs via self-attention networks. In: Proceedings of the 13th International Conference on Web Search and Data Mining, pp. 519–527 (2020)

    Google Scholar 

  10. Aggarwal, C.C., Zhao, Y., Philip, S.Y.: Outlier detection in graph streams. In: 2011 IEEE 27th International Conference on Data Engineering, pp. 399–409. IEEE (2011)

    Google Scholar 

  11. Ranshous, S., Harenberg, S., Sharma, K., Samatova, N.F.: A scalable approach for outlier detection in edge streams using sketch-based approximations. In: Proceedings of the 2016 SIAM International Conference on Data Mining, pp. 189–197. SIAM (2016)

    Google Scholar 

  12. Sricharan, K., Das, K.: Localizing anomalous changes in time-evolving graphs. In: Proceedings of the 2014 ACM SIGMOD International conference on Management of Data, pp. 1347–1358 (2014)

    Google Scholar 

  13. Yu, W., Cheng, W., Aggarwal, C.C., Zhang, K., Chen, H., Wang, W.: 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, pp. 2672–2681 (2018)

    Google Scholar 

  14. Zheng, L., Li, Z., Li, J., Li, Z., Gao, J.: AddGraph: anomaly detection in dynamic graph using attention-based temporal GCN. In: IJCAI, pp. 4419–4425 (2019)

    Google Scholar 

  15. Zhu, D., Ma, Y., Liu, Y.: A flexible attentive temporal graph networks for anomaly detection in dynamic networks. In: 2020 IEEE 19th International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom), pp. 870–875. IEEE (2020)

    Google Scholar 

  16. Wang, B., Hayashi, T., Ohsawa, Y.: Hierarchical graph convolutional network for data evaluation of dynamic graphs. In: 2020 IEEE International Conference on Big Data (Big Data), pp. 4475–4481. IEEE (2020)

    Google Scholar 

  17. Holland, P.W., Laskey, K.B., Leinhardt, S.: Stochastic blockmodels: first steps. Social Netw. 5(2), 109–137 (1983)

    Article  MathSciNet  Google Scholar 

  18. Chi, Y., Song, X., Zhou, D., Hino, K., Tseng, B.L.: Evolutionary spectral clustering by incorporating temporal smoothness. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 153–162 (2007)

    Google Scholar 

  19. Wang, Z., Zhang, J., Feng, J., Chen, Z.: Knowledge graph embedding by translating on hyperplanes. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 28 (2014)

    Google Scholar 

  20. Lin, Y., Liu, Z., Sun, M., Liu, Y., Zhu, X.: Learning entity and relation embeddings for knowledge graph completion. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 29 (2015)

    Google Scholar 

Download references

Acknowledgment

This research was funded by the National Natural Science Foundation of China under grant number 61876069; Jilin Province Key Scientific and Technological Research and Development project under grant numbers 20180201067GX, 20180201044GX; Jilin Province Natural Science Foundation under grant No. 20200201036JC.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Bo Yang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Zang, X., Yang, B., Liu, X., Li, A. (2021). DNEA: Dynamic Network Embedding Method for Anomaly Detection. In: Qiu, H., Zhang, C., Fei, Z., Qiu, M., Kung, SY. (eds) Knowledge Science, Engineering and Management. KSEM 2021. Lecture Notes in Computer Science(), vol 12817. Springer, Cham. https://doi.org/10.1007/978-3-030-82153-1_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-82153-1_20

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-82152-4

  • Online ISBN: 978-3-030-82153-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics