Advertisement

A Community-Aware Approach for Identifying Node Anomalies in Complex Networks

  • Thomas J. Helling
  • Johannes C. Scholtes
  • Frank W. Takes
Conference paper
Part of the Studies in Computational Intelligence book series (SCI, volume 812)

Abstract

The overwhelming amount of network data that is nowadays available, leads to an increased demand for techniques that automatically identify anomalous nodes. Examples are network intruders in physical networks or spammers spreading unwanted advertisements in online social networks. Existing methods typically identify network anomalies from a local perspective, only considering metrics related to a node and connections in its direct neighborhood. However, such methods often miss anomalies as they overlook crucial distortions of the network structure that are only visible at the macro level. To solve these problems, in this paper, the CADA algorithm is proposed, which identifies irregular nodes from a global perspective. It does so by measuring the extent to which a node connects to man y different communities while not obviously belonging to one community itself. Results on synthetic and real-world data show that the incorporation of the community aspect is of critical importance, as our algorithm significantly outperforms previously suggested techniques. In addition, it scales well to larger networks of hundreds of thousands of nodes and millions of links. Moreover, the proposed method is parameter-free, enabling the hassle-free identification of anomalies in a wide variety of application domains.

Keywords

Anomaly detection in networks Node anomalies LFR benchmark Community detection 

References

  1. 1.
    Akoglu, L., Mcglohon, M., Faloutsos, C.: Anomaly detection in large graphs. In: CMU-CS-09-173 Technical Report (2009)Google Scholar
  2. 2.
    Akoglu, L., Tong, H., Koutra, D.: Graph based anomaly detection and description: a survey. Data Min. Knowl. Discov. 29(3), 626–688 (2015)Google Scholar
  3. 3.
    Barabási, A.L.: Network Science. Cambridge University Press (2016)Google Scholar
  4. 4.
    Bindu, P.V., Thilagam, P.S.: Mining social networks for anomalies: methods and challenges. J. Netw. Comput. Appl. 68, 213–229 (2016)Google Scholar
  5. 5.
    Blondel, V.D., Guillaume, J.L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. J. Stat. Mech. Theory Exp. 10008(10), 6 (2008)Google Scholar
  6. 6.
    Chandola, V., Banerjee, A., Kumar, V.: Anomaly detection: a survey. ACM Comput. Surv. 41(September), 1–58 (2009)Google Scholar
  7. 7.
    Denning, D.E.: An intrusion-detection model. In: Proceedings of IEEE Symposium on Security and Privacy, pp. 118–131 (2012)Google Scholar
  8. 8.
    Fortunato, S.: Community detection in graphs (2010)Google Scholar
  9. 9.
    Hassanzadeh, R., Nayak, R., Stebila, D.: Analyzing the effectiveness of graph metrics for anomaly detection in online social networks. In: Lecture Notes in Computer Science, vol. 7651, pp. 624–630 (2012)Google Scholar
  10. 10.
    Haveliwala, T.H.: Topic-sensitive PageRank. In: Proceedings of 11th International Conference on World Wide Web, pp. 517–526 (2002)Google Scholar
  11. 11.
    Henderson, K., et al.: It’s who you know: graph mining using recursive structural features. In: Proceedings of 17th ACM International Conference on Knowledge Discovery and Data Mining, p. 663 (2011)Google Scholar
  12. 12.
    Hu, R., Aggarwal, C.C., Ma, S., Huai, J.: An embedding approach to anomaly detection. In: Proceedings of 32nd IEEE International Conference on Data Engineering, pp. 385–396 (2016)Google Scholar
  13. 13.
    Janssens, J.: Outlier Selection and One-Class Classification. Maastricht University (2013)Google Scholar
  14. 14.
    Kaur, R., Singh, S.: A comparative analysis of structural graph metrics to identify anomalies in online social networks. Comput. Electr. Eng. 57, 294–310 (2017)Google Scholar
  15. 15.
    Krishnan, V., Raj, R.: Web spam detection with anti-trust rank. AIRWeb 6, 37–40 (2006)Google Scholar
  16. 16.
    Lancichinetti, A., Fortunato, S., Radicchi, F.: Benchmark graphs for testing community detection algorithms. Phys. Rev. E 78(4) (2008)Google Scholar
  17. 17.
    Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank Citation Ranking: Bringing Order to the Web. World Wide Web Internet Web Inf. Syst. 54(1999–66), 1–17 (1998)Google Scholar
  18. 18.
    Rosvall, M., Bergstrom, C.: Maps of random walks on complex networks reveal community structure. Proc. Natl. Acad. Sci. 105(4), 1118–1123 (2008)Google Scholar
  19. 19.
    Rosvall, M., Bergstrom, C.T.: Multilevel compression of random walks on networks reveals hierarchical organization in large integrated systems. PLoS ONE 6(4) (2011)Google Scholar
  20. 20.
    Sun, J., Qu, H., Chakr, D., Faloutsos, C.: Neighorhood formation and anomaly detection in bipartite graphs. In: Proceedings of SIAM Conference on Data Mining, pp. 1–8 (2008)Google Scholar
  21. 21.
    Tong, H., Lin, C.: Non-negative residual matrix factorization with application to graph anomaly detection. In: Proceedings of SIAM Conference on Data Mining, pp. 143–153 (2011)Google Scholar
  22. 22.
    Travers, J., Milgram, S.: An experimental study of the small world problem. Sociometry 32(4), 425 (1969)Google Scholar
  23. 23.
    Watts, D.J., Strogatz, S.H.: Collective dynamics of ‘small-world’ networks. Nature 393(6684), 440–442 (1998)Google Scholar
  24. 24.
    Xu, X., Yuruk, N., Feng, Z., Schweiger, T.A.J.: SCAN: a structural clustering algorithm for networks. In: Proceedings of 13th ACM International Conference on Knowledge Discovery and Data Mining, pp. 824–833 (2007)Google Scholar
  25. 25.
    Kou, Y., Lu, C.-T., Sirwongwattana, S., Huang, Y.-P.: Survey of fraud detection techniques. In: Proceedings of IEEE International Conference on Networking, Sensing and Control, 2004, pp. 749–754 (2004)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Thomas J. Helling
    • 1
  • Johannes C. Scholtes
    • 2
  • Frank W. Takes
    • 1
    • 3
  1. 1.Department of Computer Science (LIACS)Leiden UniversityLeidenThe Netherlands
  2. 2.Department of Data Science and Knowledge EngineeringMaastricht UniversityMaastrichtThe Netherlands
  3. 3.CORPNETUniversity of AmsterdamAmsterdamThe Netherlands

Personalised recommendations