NetSpot: Spotting significant anomalous regions on dynamic networks

Proceedings of the 2013 SIAM International Conference on Data Mining, SDM 2013

Volumn , Issue , 2013, Pages 28-36

  Mongiovì, Misael ^a   Bogdanov, Petko ^a   Ranca, Razvan ^a   Papalexakisy, Evangelos E ^b   Faloutsos, Christos ^b   Singh, Ambuj K ^a  

^a University of California   (United States)

^b Carnegie Mellon University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; CHEMICAL ATTACK; DATA MINING; DENIAL-OF-SERVICE ATTACK; LARGE DATASET; OIL SPILLS; ROADS AND STREETS; SYNTHETIC APERTURE RADAR; ACCIDENTS; ALGORITHMS; TELECOMMUNICATION NETWORKS;

ANOMALOUS EVENTS; ANOMALOUS REGIONS; AVERAGE RELATIVE ERROR; DYNAMIC NETWORK; EVOLVING NETWORKS; NOVEL ALGORITHM; PROBLEM FORMULATION; SYNTHETIC DATASETS;

SPACE DIVISION MULTIPLE ACCESS; DENIAL-OF-SERVICE ATTACK;

EID: 84960496443     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972832.4     Document Type: Conference Paper

References (33)

1. Afgh. News Cntr. http://www.afghanistannewscenter.com/news/2009/november/nov212009.html.
2. J. Abello, T. Eliassirad, and N. Devanur, Detecting Novel Discrepancies in Communication Networks, ICDM, (2010).
3. R. K. Ahuja, O. Ergun, J. B. Orlin, and A. P. Punnen, A survey of very large-scale neighborhood search techniques, Discr. Appl. Math., 123 (2002), pp. 75-102.
4. L. Akoglu and C. Faloutsos, Event detection in time series of mobile communication graphs, in Army Sc. Conf., 2010.
5. L. Akoglu, M. McGlohon, and C. Faloutsos, OddBall: Spotting Anomalies in Weighted Graphs, in PAKDD, 2010.
6. Z. Baig, On the use of pattern matching for rapid anomaly detection in smart grid infrastructures, in SmartGrid-Comm, oct. 2011, pp. 214 -219.
7. P. Bogdanov, M. Mongiovi, and A. K. Singh, Mining heavy subgraphs in time-evolving networks, in ICDM, 2011.
8. Y. Chen, S. Nyemba, W. Zhang, and B. Malin, Leveraging social networks to detect anomalous insider actions in collaborative environments, in ISI, 2011.
9. M. Davis, W. Liu, P. Miller, and G. Redpath, Detecting anomalies in graphs with numeric labels, in CIKM, 2011.
10. M. T. Dittrich, G. W. Klau, A. Rosenwald, T. Dandekar, and T. Mller, Identifying functional modules in protein-protein interaction networks: an integrated exact approach, J. of Bioinformatics, (2008).
11. W. Eberle and L. Holder, Discovering structural anomalies in graph-based data, in ICDMW, 2007.
12. W. Eberle and L. Holder, Graph-based approaches to insider threat detection, in CSIIRW, 2009.
13. W. Eberle, L. Holder, and D. Cook, Identifying threats using graph-based anomaly detection, in Mach. Learn. in Cyber Trust, 2009.
14. W. He, G. Hu, and Y. Zhou, Large-scale IP network behavior anomaly detection and identification using substructure-based approach and multivariate time series mining, Telecom. Syst., (2012).
15. K. Henderson, T. Eliassi-Rad, S. Papadimitriou, and C. Faloutsos, HCDF: A hybrid community discovery algorithm, in SDM,2010.
16. Y. Jia, J. Zhang, and J. Huan, An efficient graph-mining method for complicated and noisy data with realworld applications, Knowledge and Information Systems, 28 (2011), pp. 423-447.
17. D. Q. Le, T. Jeong, H. E. Roman, and J. W.K. Hong, Trafic dispersion graph based anomaly detection, in SoICT, 2011.
18. S. Lin and H. Chalupsky, Unsupervised link discovery in multi-relational data via rarity analysis, in ICDM, 2003.
19. X. Ma, H. Xiao, S. Xie, Q. Li, Q. Luo, and C. Tian, Continuous, online monitoring and analysis in large water distribution networks, in ICDE, 2011.
20. J. Neil, Scan Statistics for the Online Detection of Locally Anomalous Subgraphs, PhD thesis, U. of New Mexico, 2011.
21. D. Neill and G. Cooper, A multivariate bayesian scan statistic for early event detection and characterization, Machine Learning, 79 (2010), pp. 261-282. 10.1007/s10994-009-5144-4.
22. D. B. Neill and A. W. Moore, Rapid detection of significant spatial clusters, in KDD, 2004.
23. D. B. Neill, A. W. Moore, M. Sabhnani, and K. Daniel, Detection of emerging space-time clusters, in KDD, 2005.
24. C. C. Noble and D. J. Cook, Graph-based anomaly detection, in KDD, 2003.
25. C. E. Priebe, J. M. Conroy, D. J. Marchette, and Y. Park, Scan statistics on enron graphs, Comput. Math. Organ. Theory, 11 (2005).
26. R. Rossi, B. Gallagher, J. Neville, and K. Henderson, Role-dynamics: fast mining of large dynamic networks, in Proceedings of the 21st international conference companion on World Wide Web, ACM, 2012, pp. 997-1006.
27. J. Sun, H. Qu, D. Chakrabarti, and C. Faloutsos, Relevance search and anomaly detection in bipartite graphs, KDD Explor. Newsl., (2005).
28. X. Wan, E. Milios, N. Kalyaniwalla, and J. Janssen, Link-based event detection in email communication networks, in SAC, 2009.
29. J. Wang, B.-H. Chou, and E. Suzuki, Finding the k-Most Abnormal Subgraphs from a Single Graph, in Discovery Science, LNCS, 2009.
30. M. Wu, C. Jermaine, S. Ranka, X. Song, and J. Gums, A model-agnostic framework for fast spatial anomaly detection, ACM Trans. Knowl. Discov. Data, 4 (2010), pp. 20:1-20:30.
31. H. R. Zeidanloo and A. B. A. Manaf, Botnet detection by monitoring similar communication patterns, CoRR, abs/1004.1232 (2010).
32. Y. Zhou, G. Hu, and W. He, Using graph to detect network trafic anomaly, in ICCCAS, 2009.
33. Supplemental material. http://www.cs.ucsb.edu/~dbl/papers/mongiovi-sdm-2013-supplement.pdf.