Message-passing algorithms for sparse network alignment

ACM Transactions on Knowledge Discovery from Data

Volumn 7, Issue 1, 2013, Pages

  Bayati, Mohsen ^a   Gleich, David F ^b   Saberi, Amin ^c   Wang, Ying ^d  

^a STANFORD UNIVERSITY   (United States)

^b Purdue University   (United States)

^c Stanford University   (United States)

^d GOOGLE INC   (United States)

Author keywords

Belief propagation; Graph matching; Message passing; Network alignment

Indexed keywords

APPROXIMATE SOLUTION; BELIEF PROPAGATION; EXTENSIVE SIMULATIONS; GRAPH MATCHINGS; MATCHING PROBLEMS; MESSAGE PASSING ALGORITHM; NETWORK ALIGNMENTS; ONTOLOGY ALIGNMENT;

ALGORITHMS; BIOINFORMATICS; COMPUTER SIMULATION; MATHEMATICAL PROGRAMMING; MESSAGE PASSING; PATTERN MATCHING;

GRAPH THEORY;

EID: 84878595437     PISSN: 15564681     EISSN: 1556472X     Source Type: Journal    
DOI: 10.1145/2435209.2435212     Document Type: Article

References (46)

1. Adams, W. P. and Johnson, T. A. 1994. Improved linear programming based lower bounds for the quadratica ssignment problem. In Quadratic Assignment and Related Problems, P. Pardalos and H. Wolkowicz Eds., DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 16., AMS, Providence, R. I. 43-77.
2. Bayati, M., Shah, D., and Sharma, M. 2005. Maximum weight-matching via max-product belief propagation. In Proceedings of the International Symposium on Information Theory. 1763-1767.
3. Bayati, M., Borgs, C., Chayes, J., and Zecchina, R. 2007a. Belief-propagation for weighted b-matchings on arbitrary graphs and its relation to linear programs with integer solutions. arxiv.org/abs/0709.1190.
4. Bayati, M., Kim, J. H., and Saberi, A. 2007b. A sequential algorithm for generating random graphs. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, vol. abs/cs/0702124. Springer Berlin, 326-340.
5. Bayati, M., Gerritsen, M., Gleich, D. F., Saberi, A., and Wang, Y. 2009. Algorithms for large, sparse network alignment problems. In Proceedings of the IEEE International Conference on Data Mining. 705-710. DOI: 10.1109/ICDM.2009. 135.
6. Berg, J. and Lässig, M. 2006. Cross-species analysis of biological networks by bayesian alignment. Proc. Nat. Acad. Sci. 103, 29, 10967-10972.
7. Blondel, V. D., Gajardo, A., Heymans, M., Senellart, P., and Dooren, P. V. 2004. A measure of similarity between graph vertices: Applications to synonym extraction and web searching. SIAM Rev. 46, 4, 647-666.
8. Bradde, S., Braunstein, A., Mohoudi, H., Tria, F., Weigt, M., and Zecchina, R. 2010. Aligning graphs and finding substructures by a cavity approach. Europhys. Lett. 89 37009. DOI: 10.1209/0295-5075/89/37009.
9. Braunstein, A. and Zecchina, R. 2006. Learning by message passing in networks of discrete synapses. Phys. Rev. Lett.
10. Burkard, R., Dell'Amico, M., and Martello, S. 2012. Assignment Problems Revised Ed. SIAM.
11. Caetano, T., McAuley, J., Cheng, L., Le, Q., and Smola, A. 2009. Learning graph matching. IEEE Trans. Patt. Anal. Mach. Intell. 31, 6, 1048-1058.
12. Cohen, W. W., Ravikumar, P., and Fienberg, S. 2003. A comparison of string metrics for matching names and records. In Proceedings of the KDD Workshop on Data Cleaning and Object Consolidation. ACM, New York.
13. Conte, D., P. Foggia, P., Sansone, C., and Vento, M. 2004. Thirty years of graph matching in pattern recognition. Int. J. Patt. Recog. Artif. Intell. 18, 3, 265-298.
14. Donoho, D. L., Maleki, A., and Montanari, A. 2009. Message Passing Algorithms for Compressed Sensing. Proc. Nat. Acad. Sci. 106, 18914-18919.
15. Ehrig, M. and Staab, S. 2004. QOM - quick ontology mapping. In Proceedings of the 3rd International Semantic Web Conference. Lecture Notes in Computer Science, vol. 3298. Springer, Berlin, 683-697.
16. El-Kebir, M., Heringa, J., and Klau, G. W. 2011. Lagrangian relaxation applied to sparse global network alignment. In Proceedings of the 6th IAPR International Conference on Pattern Recognition in Bioinformatics (PRIB'11). Lecture Notes in Computer Science, vol. 7036. Springer, 225-236.
17. Flannick, J., Novak, A., Do, C. B., Srinivasan, B. S., and Batzoglou, S. 2008. Automatic parameter learning for multiple network alignment. In Proceedings of the 12th Annual International Conference on Computational Molecular Biology (RECOMB'08). 214-231.
18. Flannick, J., Novak, A., Srinivasan, B. S., McAdams, H. H., and Batzoglou, S. 2006. Græmlin: General and robust alignment of multiple large interaction networks. Genome Res. 16, 1169-1181.
19. Frey, B. J. and Dueck, D. 2007. Clustering by passing messages between data points. Science 315, 5814, 972-976.
20. Frieze, A. M. and Yadegar, J. 1983. On the quadratic assignment problem. Disc. Appl. Math. 5, 1, 89-98.
21. Gallager, R. G. 1963. Low Density Parity Check Codes. MIT Press, Cambridge MA.
22. Hatcher, E. and Gospodnetic, O. 2004. Lucene in Action. Manning Publications.
23. Hu, W., Jian, N., Qu, Y., and Wang, Y. 2005. GMO: A graph matching for ontologies. In Proceedings of K-CAP Workshop on Integrating Ontologies. 41-48.
24. Hu, W., Qu, Y., and Cheng, G. 2008. Matching large ontologies: A divide-and-conquer approach. Data Knowl. Eng. 67, 1, 140-160.
25. Huang, B. and Jebara, T. 2007. Loopy belief propagation for bipartite maximum weight b-matching. In Proceedings of the Artificial Intelligence and Statistics (AISTATS).
26. Klau, G. 2009. A new graph-based method for pairwise global network alignment. BMC Bioinformatics 10, Suppl 1, S59.
27. Koyutürk, M., Kim, Y., Topkara, U., Subramaniam, S., Szpankowski, W., and Grama, A. 2006. Pairwise alignment of protein interaction networks. J Comput. Biol. 13, 182-199.
28. Kuchaiev, O., Milenkovic, T., Memisevic, V., Hayes, W., and Przulj, N. 2009. Topological network alignment uncovers biological function and phylogeny. arXiv 0810.3280.
29. Kuchaiev, O., Milenkovic, T., Memisevic, V., Hayes, W., and Przulj, N. 2010. Topological network alignment uncovers biological function and phylogeny. J R Soc. Interface. 7, 1341-1354.
30. Lacoste-Julien, S., Taskar, B., Klein, D., and Jordan, M. I. 2006. Word alignment via quadratic assignment. In Proceedings of the Main Conference on Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics (HLT-NAACL'06). Association for Computational Linguistics, Stroudsburg, PA, 112-119.
31. Lawler, E. L. 1963. The quadratic assignment problem. Manage. Sci. 9, 4, 586-599.
32. Liang, Z., Xu, M., Teng, M., and Niu, L. 2006. Netalign: A web-based tool for comparison of protein interaction networks. Bioinformatics 22, 17, 2175-2177.
33. Melnik, S., Garcia-Molina, H., and Rahm, E. 2002. Similarity flooding: A versatile graph matching algorithm and its application to schema matching. In Proceedings of the 18th International Conference on Data Engineering. IEEE Computer Society, Los Alamitos, CA, 117.
34. Mezard, M. and Montanari, A. 2009. Information, Physics, and Computation (Oxford Graduate Texts). Oxford University Press.
35. Mezard, M. and Zecchina, R. 2002. Random k-satisfiability: From an analytic solution to a new efficient algorithm. Phys. Rev. E 66.
36. Murphy, K., Weiss, Y., and Jordan., M. 1999. Loopy belief propagation for approximate inference: An empirical study. In Proceedings of Uncertainty in Artificial Intelligence (UAI).
37. Pearl, J. 1988. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, San Francisco, CA.
38. Sanghavi, S., Malioutov, D., andWillsky, A. 2011. Belief propagation and LP relxation for weighted matching in general graphs. IEEE Trans. Inf. Theory 57, 4.
39. Schellewald, C. and Schnörr, C. 2005. Probabilistic subgraph matching based on convex relaxation. In Energy Minimization Methods in Computer Vision and Pattern Recognition, Springer, Berlin, 171-186.
40. Sharan, R., Ideker, T., Kelley, B., Shamir, R., and Karp, R. M. 2005. Identification of protein complexes by comparative analysis of yeast and bacterial protein interaction data. J. Comput. Biol. 12, 835-846.
41. Singh, R., Xu, J., and Berger, B. 2007. Pairwise global alignment of protein interaction networks by matching neighborhood topology. In Proceedings of the 11th Annual International Conference on Research in Computational Molecular Biology (RECOMB). Lecture Notes in Computer Science, vol. 4453, Springer, Berlin, 16-31.
42. Singh, R., Xu, J., and Berger, B. 2008. Global alignment of multiple protein interaction networks with application to functional orthology detection. Proc. Nat. Acad. Sci. 105, 35, 12763-12768.
43. ? Sváb, O. 2007. Exploiting patterns in ontology mapping. In Proceedings of the 6th International Semantic Web Conference and 2nd Asian Semantic Web Conference (ISWC/ASWC2007), Busan, South Korea, K. Aberer, K.-S. Choi, N. Noy, D. Allemang, K.-I. Lee, and L. J. B. Nixon Eds., Lecture Notes in Computer Science, vol. 4825, Springer Verlag, Berlin, 950-954.
44. Tappen, M. and Freemand, W. 2003. Graph cuts and belief propagation for stereo, using identical mrf parameters. In Proceedings of the ICCV. Wikipedia. 2007. Wikipedia XML database dump from April 2, 2007.
45. http://en.wikipedia.org/wiki/Wikipedia:Databasedownload.
46. Yanover, C. andWeiss, Y. 2002. Approximate inference and protein folding. In Advances in Neural Processing Systems.