Author:
Tasnádi Zoltán,Gaskó Noémi
Publisher
Springer International Publishing
Reference16 articles.
1. 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)
2. Akoglu, L., Tong, H., Koutra, D.: Graph based anomaly detection and description: a survey. Data Min. Knowl. Disc. 29(3), 626–688 (2015)
3. Billionnet, A.: Different formulations for solving the heaviest k-subgraph problem. INFOR: Inf. Syst. Oper. Res. 43(3), 171–186 (2005)
4. 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)
5. Fortunato, S.: Community detection in graphs. Phys. Rep. 486(3–5), 75–174 (2010)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. MAD: Multi-Scale Anomaly Detection in Link Streams;Proceedings of the 17th ACM International Conference on Web Search and Data Mining;2024-03-04
2. Heaviest and Densest Subgraph Computation for Binary Classification. A Case Study;Lecture Notes in Computer Science;2024
3. An Ant Colony Optimisation Approach to the Densest k-Subgraph Problem*;2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC);2022-09