Abstract
Anomaly detection has gained great attention in complex network analysis. Every unusual behavior in a complex system can be viewed as an anomaly. In this article, we propose a new anomaly type in dynamic graphs, an existing community-based anomaly detection problem combined with the heaviest k-subgraph problem. Searching the heaviest subgraphs in dynamic graphs viewed as an anomaly problem can give new insights into the studied dynamic networks. An ant colony optimization algorithm is proposed for the heaviest k-subgraph problem and used for the community detection problem. Numerical experiments on real-world dynamic networks are conducted, and the results show the importance of the proposed problem and the potential of the solution method.
This work was supported by a grant of the Ministry of Research, Innovation and Digitization, CNCS/CCCDI - UEFISCDI, project number 194/2021 within PNCDI III.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Ahmed, M., Mahmood, A.N.: Novel approach for network traffic pattern analysis using clustering-based collective anomaly detection. Ann. Data Sci. 2(1), 111–130 (2015)
Akoglu, L., Tong, H., Koutra, D.: Graph based anomaly detection and description: a survey. Data Min. Knowl. Disc. 29(3), 626–688 (2015)
Billionnet, A.: Different formulations for solving the heaviest k-subgraph problem. INFOR: Inf. Syst. Oper. Res. 43(3), 171–186 (2005)
Dorigo, M., Di Caro, G.: Ant colony optimization: a new meta-heuristic. In: Proceedings of the 1999 congress on evolutionary computation-CEC99 (Cat. No. 99TH8406), vol. 2, pp. 1470–1477. IEEE (1999)
Fortunato, S.: Community detection in graphs. Phys. Rep. 486(3–5), 75–174 (2010)
Honghao, C., Zuren, F., Zhigang, R.: Community detection using ant colony optimization. In: 2013 IEEE Congress on Evolutionary Computation, pp. 3072–3078 (2013). https://doi.org/10.1109/CEC.2013.6557944
Lancichinetti, A., Fortunato, S.: Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities. Phys. Rev. E 80(1), 016118 (2009)
Lancichinetti, A., Fortunato, S., Kertész, J.: Detecting the overlapping and hierarchical community structure in complex networks. J. Phys. 11(3), 033015 (2009)
Mall, R., Cerulo, L., Bensmail, H., Iavarone, A., Ceccarelli, M.: Detection of statistically significant network changes in complex biological networks. BMC Syst. Biol. 11(1), 1–17 (2017)
Mersch, D.P., Crespi, A., Keller, L.: Tracking individuals shows spatial fidelity is a key regulator of ant social organization. Science 340(6136), 1090–1093 (2013)
Newman, M.E.: Modularity and community structure in networks. Proc. Natl. Acad. Sci. 103(23), 8577–8582 (2006)
Pourhabibi, T., Ong, K.L., Kam, B.H., Boo, Y.L.: Fraud detection: a systematic literature review of graph-based anomaly detection approaches. Decis. Support Syst. 133, 113303 (2020)
Ranshous, S., Shen, S., Koutra, D., Harenberg, S., Faloutsos, C., Samatova, N.F.: Anomaly detection in dynamic networks: a survey. Wiley Interdisc. Rev. Comput. Stat. 7(3), 223–247 (2015)
Reynolds, J.J., Hirsch, B.T., Gehrt, S.D., Craft, M.E.: Raccoon contact networks predict seasonal susceptibility to rabies outbreaks and limitations of vaccination. J. Anim. Ecol. 84(6), 1720–1731 (2015)
Rossi, R.A., Ahmed, N.K.: The network data repository with interactive graph analytics and visualization. In: AAAI (2015). https://networkrepository.com
Savage, D., Zhang, X., Yu, X., Chou, P., Wang, Q.: Anomaly detection in online social networks. Soc. Netw. 39, 62–70 (2014)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Tasnádi, Z., Gaskó, N. (2022). A New Type of Anomaly Detection Problem in Dynamic Graphs: An Ant Colony Optimization Approach. In: Mernik, M., Eftimov, T., Črepinšek, M. (eds) Bioinspired Optimization Methods and Their Applications. BIOMA 2022. Lecture Notes in Computer Science, vol 13627. Springer, Cham. https://doi.org/10.1007/978-3-031-21094-5_4
Download citation
DOI: https://doi.org/10.1007/978-3-031-21094-5_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-21093-8
Online ISBN: 978-3-031-21094-5
eBook Packages: Computer ScienceComputer Science (R0)