Matched filtering for subgraph detection in dynamic networks

IEEE Workshop on Statistical Signal Processing Proceedings

Volumn , Issue , 2011, Pages 509-512

  Miller, Benjamin A ^a   Beard, Michelle S ^a   Bliss, Nadya T ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

community detection; dynamic graphs; graph algorithms; matched filtering; signal detection theory

Indexed keywords

COMMUNITY DETECTION; DYNAMIC GRAPHS; GRAPH ALGORITHMS; MATCHED FILTERING; SIGNAL DETECTION THEORY;

MATCHED FILTERS;

SIGNAL DETECTION;

EID: 80052258226     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SSP.2011.5967745     Document Type: Conference Paper

References (13)

1. J. Sun, S. Papadimitriou, P. S. Yu, and C. Faloutsos, "Graph-Scope: Parameter-free mining of large time-evolving graphs," in Proc. KDD'07, pp. 687-696, 2007.
2. C. C. Noble and D. J. Cook, "Graph-based anomaly detection," in Proc. KDD'03, pp. 631-636, 2003.
3. W. Eberle and L. Holder, "Anomaly detection in data represented as graphs," Intelligent Data Analysis, vol. 11, pp. 663-689, December 2007.
4. S. Hirose, K. Yamanishi, T. Nakata, and R. Fujimaki, "Network anomaly detection based on eigen equation compression," in Proc. KDD '09, pp. 1185-1193, 2009.
5. T. Idé and H. Kashima, "Eigenspace-based anomaly detection in computer systems," in Proc. KDD '04, pp. 440-449, 2004.
6. C. E. Priebe, J. M. Conroy, D. J. Marchette, and Y. Park, "Scan statistics on Enron graphs," Computational & Mathematical Organization Theory, vol. 11, no. 3, pp. 229-247, 2005.
7. T. Mifflin, "Detection theory on random graphs," in Proc. Int. Conf. Inform. Fusion, pp. 954-959, 2009.
8. B. A. Miller, N. T. Bliss, and P. J. Wolfe, "Toward signal processing theory for graphs and non-Euclidean data," in Proc. ICASSP, pp. 5414-5417, 2010.
9. B. A. Miller, N. T. Bliss, and P. J. Wolfe, "Subgraph detection using eigenvector L1 norms," in Advances in Neural Inform. Process. Syst. 23 (J. Lafferty, C. K. I. Williams, J. Shawe-Taylor, R. Zemel, and A. Culotta, eds.), pp. 1633-1641, 2010.
10. M. E. J. Newman, "Finding community structure in networks using the eigenvectors of matrices," Phys. Rev. E, vol. 74, no. 3, 2006.
11. D. Chakrabarti, Y. Zhan, and C. Faloutsos, "R-MAT: A recursive model for graph mining," in Proc. SIAM Int. Conf. Data Mining, vol. 6, pp. 442-446, 2004.
12. J. Leskovec, "Stanford network analysis package." http://snap.stanford.edu.
13. J. Leskovec, J. Kleinberg, and C. Faloutsos, "Graphs over time: Densification laws, shinking diameters and possible explanations," in Proc. KDD '05, 2005.