DELTACON: A principled massive-graph similarity function

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

Volumn , Issue , 2013, Pages 162-170

  Koutra, Danai ^a   Vogelsteiny, Joshua T ^b   Faloutsos, Christos ^a  

^a Carnegie Mellon University ^*  (United States)

^b DUKE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA MINING; GRAPHIC METHODS; SPACE DIVISION MULTIPLE ACCESS;

ANOMALY DETECTION; BRAIN CONNECTIVITY; DETECTION OF CHANGES; GRAPH SIMILARITY; REAL APPLICATIONS; SCALABLE ALGORITHMS; SIMILARITY MEASURE; STATE-OF-THE-ART METHODS;

GRAPH THEORY;

EID: 84943557865     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (30)

1. R. S. Caceres, T. Y. Berger-Wolf, and R. Grossman, "Temporal scale of processes in dynamic networks," in ICDM Workshop, 2011, pp. 925-932.
2. C. C. Noble and D. J. Cook, "Graph-based anomaly detection," in KDD, 2003, pp. 631-636.
3. Y. Wang, S. Parthasarathy, and S. Tatikonda, "Locality sensitive outlier detection: A ranking driven approach," in ICDE, 2011, pp. 410-421.
4. H. Bunke, P. J. Dickinson, M. Kraetzl, and W. D. Wallis, A Graph-Theoretic Approach to Enterprise Network Dynamics (PCS). Birkhauser, 2006.
5. P. Papadimitriou, A. Dasdan, and H. Garcia-Molina, "Web graph similarity for anomaly detection," JISA, vol. 1, no. 1, p. 1167, 2008. [Online]. Available: http://www.cs.cmu.edu/~dkoutra/papers/DeltaCon-KoutraVF-withAppendix.pdf
6. B. Klimt and Y. Yang, "Introducing the enron corpus." 2004.
7. R. Guha, R. Kumar, P. Raghavan, and A. Tomkins, "Propagation of trust and distrust." ACM, 2004, pp. 403-412.
8. J. Leskovec, J. Kleinberg, and C. Faloutsos, "Graph evolution: Densification and shrinking diameters," IEEE TKDE, vol. 1, March 2007.
9. SNAP. [Online]. Available: http://snap.stanford.edu/data/index.html
10. M. Peabody, "Finding groups of graphs in databases," Master's thesis, Drexel University, 2003.
11. R. C. Wilson and P. Zhu, "A study of graph spectra for comparing graphs and trees," Journal of Pattern Recognition, vol. 41, no. 9, pp. 2833-2841, 2008.
12. J. Leskovec, D. Chakrabarti, J. M. Kleinberg, and C. Faloutsos, "Realistic, mathematically tractable graph generation and evolution, using kronecker multiplication," in PKDD, 2005, pp. 133-145.
13. W. Gray, J. Bogovic, J. Vogelstein, B. Landman, J. Prince, and R. Vogelstein, "Magnetic resonance connectome automated pipeline: An overview," Pulse, IEEE, vol. 3, no. 2, pp. 42-48, 2012.
14. J. T. Vogelstein and C. E. Priebe, "Shuffled graph classification: Theory and connectome applications," 2011.
15. S. V. N. Vishwanathan, N. N. Schraudolph, R. I. Kondor, and K. M. Borgwardt, "Graph kernels," JMLR, vol. 11, pp. 1201- 1242, 2010.
16. M. Fiedler, "Algebraic connectivity of graphs," Czechoslovak Mathematical Journal, vol. 23, no. 98, pp. 298-305, 1973.
17. G. Li, M. Semerci, B. Yener, and M. Zaki, "Graph classification via topological and label attributes," in MLG, Aug 2011.
18. O. Macindoe andW. Richards, "Graph comparison using fine structure analysis," in SocialCom/PASSAT, 2010, pp. 193- 200.
19. H. Elghawalby and E. R. Hancock, "Measuring graph similarity using spectral geometry," in ICIAR, 2008, pp. 517-526.
20. A. Kelmans, "Comparison of graphs by their number of spanning trees," Discrete Mathematics, vol. 16, no. 3, pp. 241 - 261, 1976.
21. U. Kang, H. Tong, and J. Sun, "Fast random walk graph kernel," in SDM, 2012.
22. S. Brin and L. Page, "The anatomy of a large-scale hypertextual web search engine," Computer Networks, vol. 30, no. 1-7, pp. 107-117, 1998.
23. T. H. Haveliwala, "Topic-sensitive pagerank: A contextsensitive ranking algorithm for web search." IEEE TKDE, vol. 15, no. 4, pp. 784-796, 2003.
24. P. G. Doyle and J. L. Snell, Random Walks and Electric Networks. Mathematical Association of America, 1984.
25. G. Jeh and J. Widom, "Simrank: a measure of structuralcontext similarity," in KDD. ACM, 2002, pp. 538-543.
26. J. S. Yedidia, W. T. Freeman, and Y. Weiss, Understanding belief propagation and its generalizations. Morgan Kaufmann Publishers Inc., 2003, pp. 239-269.
27. D. Koutra, T.-Y. Ke, U. Kang, D. H. Chau, H.-K. K. Pao, and C. Faloutsos, "Unifying guilt-by-association approaches: Theorems and fast algorithms," in ECML PKDD, 2011.
28. D. H. Chau, C. Nachenberg, J. Wilhelm, A. Wright, and C. Faloutsos, "Large scale graph mining and inference for malware detection," in SDM, 2011, pp. 131-142.
29. M. McGlohon, S. Bay, M. G. Anderle, D. M. Steier, and C. Faloutsos, "Snare: a link analytic system for graph labeling and risk detection," in KDD, 2009, pp. 1265-1274.
30. H.-N. Kim and A. El Saddik, "Personalized pagerank vectors for tag recommendations: inside folkrank," in RecSys, 2011, pp. 45-52.