Abstract
Graphs provide an efficient tool for object representation in various machine learning applications. Once graph-based representations are constructed, an important question is how to compare graphs. This problem is often formulated as a graph matching problem where one seeks a mapping between vertices of two graphs which optimally aligns their structure. In the classical formulation of graph matching, only one-to-one correspondences between vertices are considered. However, in many applications, graphs cannot be matched perfectly and it is more interesting to consider many-to-many correspondences where clusters of vertices in one graph are matched to clusters of vertices in the other graph. In this paper, we formulate the many-to-many graph matching problem as a discrete optimization problem and propose two approximate algorithms based on alternative continuous relaxations of the combinatorial problem. We compare new methods with other existing methods on several benchmark datasets.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Download to read the full chapter text
Chapter PDF
References
Belongie, S., Malik, J., Puzicha, J.: Shape matching and object recognition using shape contexts. IEEE Trans. Pattern Anal. Mach. Intell. 24(4), 509–522 (2002)
Neuhaus, M., Riesen, K., Bunke, H.: Fast suboptimal algorithms for the computation of graph edit distance. In: Yeung, D.-Y., Kwok, J.T., Fred, A.L.N., Roli, F., de Ridder, D. (eds.) SSPR 2006 and SPR 2006. LNCS, vol. 4109, pp. 163–172. Springer, Heidelberg (2006)
Almohamad, H.A., Duffuaa, S.O.: A linear programming approach for the weighted graph matching problem. IEEE Trans. Pattern Anal. Mach. Intell. 15(5), 522–525 (1993)
Zaslavskiy, M., Bach, F., Vert, J.-P.: A path following algorithm for the graph matching problem. IEEE Trans. Pattern Anal. Mach. Intell. 31(12), 2227–2242 (2009)
Umeyama, S.: An eigendecomposition approach to weighted graph matching problems. IEEE Trans. Pattern Anal. Mach. Intell. 10(5), 695–703 (1988)
Caelli, T., Kosinov, S.: An eigenspace projection clustering method for inexact graph matching. IEEE Trans. Pattern Anal. Mach. Intell. 26(4), 515–519 (2004)
Carcassoni, M., Hancock, E.: Spectral correspondence for point pattern matching. Pattern Recogn. 36(1), 193–204 (2003)
Cour, T., Srinivasan, P., Shi, J.: Balanced graph matching. In: Advanced in Neural Information Processing Systems (2006)
Leordeanu, M., Hebert, M.: A spectral technique for correspondence problems using pairwise constraints. In: International Conference of Computer Vision (ICCV), vol. 2, pp. 1482–1489 (October 2005)
Duchenne, O., Bach, F., Kweon, I., Ponce, J.: A tensor-based algorithm for high-order graph matching. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition CVPR 2009, June 20-25, pp. 1980–1987 (2009)
Berretti, S., Del Bimbo, A., Pala, P.: A graph edit distance based on node merging. In: Proc. of ACM International Conference on Image and Video Retrieval (CIVR), Dublin, Ireland, July 2004, pp. 464–472 (2004)
Ambauen, R., Fischer, S., Bunke, H.: Graph edit distance with node splitting and merging, and its application to diatom idenfication. In: GbRPR, pp. 95–106 (2003)
Keselman, Y., Shokoufandeh, A., Demirci, M.F., Dickinson, S.: Many-to-many graph matching via metric embedding. In: CVPR, pp. 850–857 (2003)
Bertsekas, D.: Nonlinear programming. Athena Scientific (1999)
Kuhn, H.W.: The Hungarian method for the assignment problem. Naval Research 2, 83–97 (1955)
Nesterov, Y., Nemirovsky, A.: Interior point polynomial methods in convex programming: Theory and applications. SIAM, Philadelphia (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zaslavskiy, M., Bach, F., Vert, JP. (2010). Many-to-Many Graph Matching: A Continuous Relaxation Approach. In: Balcázar, J.L., Bonchi, F., Gionis, A., Sebag, M. (eds) Machine Learning and Knowledge Discovery in Databases. ECML PKDD 2010. Lecture Notes in Computer Science(), vol 6323. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15939-8_33
Download citation
DOI: https://doi.org/10.1007/978-3-642-15939-8_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15938-1
Online ISBN: 978-3-642-15939-8
eBook Packages: Computer ScienceComputer Science (R0)