Big-Align: Fast bipartite graph alignment

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2013, Pages 389-398

  Koutra, Danai ^a,c   Tong, Hanghang ^b   Lubensky, David ^c  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b CITY COLLEGE OF NEW YORK   (United States)

^c IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84894681116     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2013.152     Document Type: Conference Paper

References (29)

1. R. Albert and A.-L. Barabási. Statistical mechanics of complex networks. CoRR, cond-mat/0106096, 2001.
2. H. A. Almohamad and S. O. Duffuaa. A linear programming approach for the weighted graph matching problem. IEEE TPAMI, 15(5):522-525, 1993.
3. M. Bayati, M. Gerritsen, D. Gleich, A. Saberi, and Y. Wang. Algorithms for large, sparse network alignment problems. In ICDM09, pages 705-710, 2009.
4. J. Berg and M. Lässig. Local graph alignment and motif search in biological networks. PNAS, 101(41):14689-14694, Oct. 2004.
5. V. D. Blondel, A. Gajardo, M. Heymans, p. Senellart, and p. V. Dooren. A measure of similarity between graph vertices. CoRR, 2004.
6. S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press, New York, NY, USA, 2004.
7. S. Bradde, A. Braunstein, H. Mahmoudi, F. Tria, M. Weigt, and R. Zecchina. Aligning graphs and finding substructures by a cavity approach. Europhysics Letters, 89, 2010.
8. A. Broder, R. Kumar, F. Maghoul, p. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins, and J. Wiener. Graph structure in the web. Comput. Netw., 33(1-6):309-320, June 2000.
9. D. Conte, p. Foggia, C. Sansone, and M. Vento. Thirty years of graph matching in pattern recognition. IJPRAI, 18(3):265-298, 2004.
10. C. H. Q. Ding, T. Li, and M. I. Jordan. Nonnegative matrix factorization for combinatorial optimization: Spectral clustering, graph matching, and clique finding. In ICDM, pages 183-192, 2008.
11. M. Faloutsos, p. Faloutsos, and C. Faloutsos. On power-law relationships of the internet topology. SIGCOMM Comput. Commun. Rev., 29(4):251-262, Aug. 1999.
12. S. Gold and A. Rangarajan. A graduated assignment algorithm for graph matching. IEEE TPAMI, 18(4):377-388, 1996.
13. K. Henderson, B. Gallagher, L. Li, L. Akoglu, T. Eliassi-Rad, H. Tong, and C. Faloutsos. It's who you know: graph mining using recursive structural features. In KDD, KDD, pages 663-671, 2011.
14. U. Kang and C. Faloutsos. Beyond 'caveman communities': Hubs and spokes for graph compression and mining. In ICDM, pages 300-309, 2011.
15. G. W. Klau. A new graph-based method for pairwise global network alignment. BMC, 10(S-1), 2009.
16. B. Luo and E. R. Hancock. Iterative procrustes alignment with the em algorithm. Image Vision Comput., 20(5-6):377-396, 2002.
17. S. Melnik, H. Garcia-Molina, and E. Rahm. Similarity flooding: A versatile graph matching algorithm and its application to schema matching. In ICDE, 2002.
18. A. Narayanan and V. Shmatikov. De-anonymizing social networks. In SSP, pages 173-187, may 2009.
19. C. H. Papadimitriou and K. Steiglitz. Combinatorial optimization: algorithms and complexity. Prentice-Hall, Inc., Upper Saddle River, NJ, USA, 1982.
20. H. Qiu and E. R. Hancock. Graph matching and clustering using spectral partitions. IEEE TPAMI, 39(1):22-34, 2006.
21. K. Riesen and H. Bunke. Approximate graph edit distance computation by means of bipartite graph matching. Image and Vision Computing, 27(7):950-959, 2009.
22. R. Singh, J. Xu, and B. Berger. Pairwise global alignment of protein interaction networks by matching neighborhood topology. In RECOMB07, pages 16-31, 2007.
23. A. Smalter, J. Huan, and G. Lushington. GPM: A Graph Pattern Matching Kernel with Diffusion for Chemical Compound Classification. In ICBBE, 2008.
24. S. Umeyama. An eigendecomposition approach to weighted graph matching problems. IEEE TPAMI, 10(5):695-703, 1988.
25. B. Viswanath, A. Mislove, M. Cha, and K. p. Gummadi. On the evolution of user interaction in facebook. In WOSN09, August 2009.
26. J. T. Vogelstein, J. M. Conroy, L. J. Podrazik, S. G. Kratzer, D. E. Fishkind, R. J. Vogelstein, and C. E. Priebe. Fast inexact graph matching with applications in statistical connectomics. CoRR, abs/1112.5507, 2011.
27. J. S. Yedidia, W. T. Freeman, and Y. Weiss. Understanding belief propagation and its generalizations, pages 239-269. Morgan Kaufmann Publishers Inc., 2003.
28. L. Zager and G. Verghese. Graph similarity scoring and matching. Applied Mathematics Letters, 21(1):86-94, 2008.
29. M. Zaslavskiy, F. Bach, and J.-p. Vert. A path following algorithm for the graph matching problem. IEEE TPAMI, 31(12):2227-2242, Dec. 2009.