Metric forensics: A multi-level approach for mining volatile graphs

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2010, Pages 163-172

  Henderson, Keith ^a   Eliassi Rad, Tina ^a   Faloutsos, Christos ^b   Akoglu, Leman ^b   Li, Lei ^a   Maruhashi, Koji ^c   Prakash, B Aditya ^b   Tong, Hanghang ^b  

^a LAWRENCE LIVERMORE NATIONAL LABORATORY   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c FUJITSU LABORATORIES LTD   (Japan)

Author keywords

Graph mining; Temporal analysis; Volatile graphs

Indexed keywords

ANALYSIS TECHNIQUES; COARSER RESOLUTION; CYBER SECURITY; DATA COLLECTION; DRILL-DOWN; GRAPH ANALYSIS; GRAPH DATA; GRAPH MINING; INTERNET COMMUNICATION; MULTI-LEVEL; NEAR-REAL TIME; NETWORK TRAFFIC; REAL-WORLD GRAPHS; REALITY MININGS; RESEARCH INSTITUTIONS; STORAGE CAPACITY; TEMPORAL ANALYSIS; TEMPORAL RESOLUTION; VOLATILE GRAPHS;

INTERNET PROTOCOLS; SECURITY OF DATA;

GRAPHIC METHODS;

EID: 77956201937     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1835804.1835828     Document Type: Conference Paper

References (35)

1. D. Agarwal, A. Z. Broder, D. Chakrabarti, D. Diklic, V. Josifovski, and M. Sayyadian. Estimating rates of rare events at multiple resolutions. In KDD, pages 16-25, 2007.
2. L. Akoglu, M. McGlohon, and C. Faloutsos. OddBall: Spotting anomalies in weighted graphs. In PAKDD, 2010.
3. R. Albert, H. Jeong, and A.-L. Barabasi. Diameter of the world wide web. Nature, (401):130-131, 1999.
4. L. Backstrom, D. P. Huttenlocher, J. M. Kleinberg, and X. Lan. Group formation in large social networks: membership, growth, and evolution. In KDD, pages 44-54, 2006.
5. A.-L. Barabasi. The origin of bursts and heavy tails in human dynamics. Nature, 435:207-211, 2005.
6. A. Belussi and C. Faloutsos. Estimating the selectivity of spatial queries using the 'correlation' fractal dimension. In VLDB, pages 299-310, 1995.
7. M. M. Breunig, H.-P. Kriegel, R. T. Ng, and J. Sander. LOF: Identifying density-based local outliers. In SIGMOD, pages 93-104, 2000.
8. A. Z. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins, and J. L. Wiener. Graph structure in the web. Computer Networks, 33(1-6):309-320, 2000.
9. H. Bunke, P. J. Dickinson, A. Humm, C. Irniger, and M. Kraetzl. Graph sequence visualisation and its application to computer network monitoring and abnormal event detection. In A. Kandel, H. Bunke, and M. Last, editors, Applied Graph Theory in Computer Vision and Pattern Recognition, volume 52 of Studies in Computational Intelligence, pages 227-245. Springer, 2007.
10. D. Chakrabarti. Autopart: Parameter-free graph partitioning and outlier detection. In PKDD, pages 112-124, 2004.
11. D. Chakrabarti, S. Papadimitriou, D. Modha, and C. Faloutsos. Fully automatic cross-associations. In KDD, pages 79-88, 2004.
12. V. Chandola, A. Banerjee, and V. Kumar. Anomaly detection: A survey. ACM Comput. Surv., 41(3), 2009.
13. Y. Chi, X. Song, D. Zhou, K. Hino, and B. L. Tseng. Evolutionary spectral clustering by incorporating temporal smoothness. In KDD, pages 153-162, 2007.
14. W. Eberle and L. B. Holder. Mining for structural anomalies in graph-based data. In DMIN, 2007.
15. M. Faloutsos, P. Faloutsos, and C. Faloutsos. On power-law relationships of the internet topology. In SIGCOMM, pages 251-262, 1999.
16. G. Flake, S. Lawrence, C. L. Giles, and F. Coetzee. Self-organization and identification of web communities. IEEE Computer, 35(3):66-71, 2002.
17. F. Geerts, H. Mannila, and E. Terzi. Relational link-based ranking. In VLDB, pages 552-563, 2004.
18. P. B. Gibbons and Y. Matias. New sampling-based summary statistics for improving approximate query answers. In SIGMOD, pages 331-342, 1998.
19. K. Henderson, T. Eliassi-Rad, S. Papdimitriou, and C. Faloutsos. HCDF: A hybrid community discovery framework. In SDM, 2010.
20. S. Hirose, K. Yamanishi, T. Nakata, and R. Fujimaki. Network anomaly detection based on eigen equation compression. In KDD, pages 1185-1194, 2009.
21. T. Idé and H. Kashima. Eigenspace-based anomaly detection in computer systems. In KDD, pages 440-449, 2004.
22. B. Karrer, E. Levina, and M. E. J. Newman. Robustness of community structure in networks. Phys. Rev. E, 77(046119), 2008.
23. J. M. Kleinberg. Bursty and hierarchical structure in streams. In KDD, pages 91-101, 2002.
24. A. Lakhina, M. Crovella, and C. Diot. Mining anomalies using traffic feature distributions. In SIGCOMM, pages 217-228, 2005.
25. J.-G. Lee, J. Han, and X. Li. Trajectory outlier detection: A partition-and-detect framework. In ICDE, pages 140-149, 2008.
26. D. Liben-Nowell and J. Kleinberg. The link prediction problem for social networks. In CIKM, pages 556-559, 2003.
27. C. Liu, X. Yan, H. Yu, J. Han, and P. S. Yu. Mining behavior graphs for "backtrace" of noncrashing bugs. In SDM, 2005.
28. M. E. J. Newman. The structure and function of complex networks. SIAM Review, 45:167-256, 2003.
29. C. C. Noble and D. J. Cook. Graph-based anomaly detection. In KDD, pages 631-636, 2003.
30. B. A. Prakash, N. Valler, D. Andersen, M. Faloutsos, and C. Faloutsos. BGP-lens: Patterns and anomalies in internet routing updates. In KDD, pages 1315-1324, 2009.
31. J. Sun, D. Tao, and C. Faloutsos. Beyond streams and graphs: dynamic tensor analysis. In KDD, pages 374-383, 2006.
32. V. Syrotiuk, K. Shaukat, Y. Kwon, M. Kraetzl, and J. Arnold. Application of a network dynamics analysis tool to mobile ad hoc networks. In MSWiM, pages 36-43, 2006.
33. H. Tong, C. Faloutsos, and J.-Y. Pan. Random walk with restart: Fast solutions and applications. Knowledge and Information Systems: An International Journal (KAIS), 14(3):327-346, 2008.
34. M. Wang, N. H. Chan, S. Papadimitriou, C. Faloutsos, and T. Madhyastha. Data mining meets performance evaluation: Fast algorithms for modeling bursty traffic. In ICDE, pages 507-516, 2002.
35. D. Xin, J. Han, X. Yan, and H. Cheng. Mining compressed frequent-pattern sets. In VLDB, pages 709-720, 2005.