{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:52:10Z","timestamp":1725490330283},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642352355"},{"type":"electronic","value":"9783642352362"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-35236-2_27","type":"book-chapter","created":{"date-parts":[[2012,11,20]],"date-time":"2012-11-20T06:36:35Z","timestamp":1353393395000},"page":"268-277","source":"Crossref","is-referenced-by-count":0,"title":["A Message Passing Graph Match Algorithm Based on a Generative Graphical Model"],"prefix":"10.1007","author":[{"given":"Gang","family":"Shen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","unstructured":"Bunke, H.: Graph Matching: Theoretical Foundations, Algorithms and Applications. In: Proceedings Vision Interface (2000)"},{"key":"27_CR2","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1142\/S0218001404003228","volume":"18","author":"D. Conte","year":"2004","unstructured":"Conte, D., Foggia, P., Sansone, C.: Thirty Years of Graph Matching in Pattern Recognition. International Journal of Pattern Recognition and Artificial Intelligence\u00a018, 265\u2013298 (2004)","journal-title":"International Journal of Pattern Recognition and Artificial Intelligence"},{"issue":"1","key":"27_CR3","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/321921.321925","volume":"23","author":"J.R. Ullmann","year":"1976","unstructured":"Ullmann, J.R.: An Algorithm for Subgraph Isomorphism. Journal of ACM\u00a023(1), 31\u201342 (1976)","journal-title":"Journal of ACM"},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"Egozi, A., Keller, Y., Guterman, H.: A Probabilistic Approach to Spectral Graph Matching. IEEE Transactions on Pattern Analysis and Machine Intelligence (2012)","DOI":"10.1109\/TPAMI.2012.51"},{"key":"27_CR5","doi-asserted-by":"publisher","first-page":"2867","DOI":"10.1016\/S0031-3203(01)00232-1","volume":"35","author":"E. Bengoetxea","year":"2002","unstructured":"Bengoetxea, E., Larranaga, P., Bloch, I., et al.: Inexact Graph Matching by Means of Estimation of Distribution Algorithms. Pattern Recognition\u00a035, 2867\u20132880 (2002)","journal-title":"Pattern Recognition"},{"key":"27_CR6","unstructured":"Melnik, S., Garcia-Molina, H., Rahm, E.: Similarity flooding: A versatile graph matching algorithm and its application to schema matching. In: Proceedings of 18th International Conference on Data Engineering, pp. 117\u2013128 (2002)"},{"key":"27_CR7","unstructured":"Murphy, K.P., Weiss, Y., Jordan, M.I.: Loopy belief propagation for approximate inference: an empirical study. In: Proceedings of the 15th Conference on Uncertainty in Artificial Intelligence, pp. 485\u2013492 (1999)"},{"key":"27_CR8","first-page":"1281","volume-title":"Advances in Neural Information Processing Systems","author":"S. Sanghavi","year":"2007","unstructured":"Sanghavi, S., Malioutov, D., Willsky, A.: Linear Programming Analysis of Loopy Belief Propagation for Weighted Matching. In: Advances in Neural Information Processing Systems, pp. 1281\u20131288. MIT Press, Cambridge (2007)"},{"issue":"12","key":"27_CR9","doi-asserted-by":"publisher","first-page":"2227","DOI":"10.1109\/TPAMI.2008.245","volume":"31","author":"M. Zaslavskiy","year":"2009","unstructured":"Zaslavskiy, M., Bach, F., Vert, J.P.: A Path Following Algorithm for the Graph Matching Problem. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a031(12), 2227\u20132242 (2009)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"27_CR10","doi-asserted-by":"publisher","first-page":"1418","DOI":"10.1145\/1189769.1189777","volume":"31","author":"X. Yan","year":"2006","unstructured":"Yan, X., Zhu, F., Yu, P., Han, J.: Feature-Based Similarity Search in Graph Structures. ACM Transactions on Database Systems\u00a031, 1418\u20131453 (2006)","journal-title":"ACM Transactions on Database Systems"},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"Tiakas, E., Papadopoulos, A., Manolopoulos, Y.: Graph Node Clustering via Transitive Node Similarity. In: Proceedings of 14th Panhellenic Conference on Informatics, pp. 72\u201377 (2010)","DOI":"10.1109\/PCI.2010.42"},{"key":"27_CR12","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/j.patrec.2004.10.022","volume":"26","author":"T. Caelli","year":"2005","unstructured":"Caelli, T., Caetano, T.S.: Graphical models for graph matching: Approximate models and optimal algorithms. Pattern Recognition Letters\u00a026, 339\u2013346 (2005)","journal-title":"Pattern Recognition Letters"},{"issue":"6","key":"27_CR13","doi-asserted-by":"publisher","first-page":"1048","DOI":"10.1109\/TPAMI.2009.28","volume":"31","author":"T.S. Caetano","year":"2009","unstructured":"Caetano, T.S., McAuley, J.J., Cheng, L., et al.: Learning Graph Matching. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a031(6), 1048\u20131058 (2009)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"Cour, T., Srinivasan, P., Shi, J.: Balanced graph matching. In: Proc. NIPS, pp. 313\u2013320 (2006)","DOI":"10.7551\/mitpress\/7503.003.0044"},{"issue":"4","key":"27_CR15","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/BF02278710","volume":"38","author":"R. Jonker","year":"1987","unstructured":"Jonker, R., Volgenant, A.: A shortest augmenting path algorithm for dense and sparse linear assignment problems. Computing\u00a038(4), 325\u2013340 (1987)","journal-title":"Computing"},{"issue":"4","key":"27_CR16","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1109\/34.491619","volume":"18","author":"S. Gold","year":"1996","unstructured":"Gold, S., Rangarajan, A.: A graduated assignment algorithm for graph matching. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a018(4), 377\u2013388 (1996)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"27_CR17","doi-asserted-by":"crossref","unstructured":"Bayati, M., Shah, D., Sharma, M.: Max-Product for Maximum Weight Matching: Convergence, Correctness, and LP Duality. IEEE Transactions on Pattern Analysis and Machine Intelligence, 1241\u20131251 (2008)","DOI":"10.1109\/TIT.2007.915695"}],"container-title":["Lecture Notes in Computer Science","Active Media Technology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35236-2_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,26]],"date-time":"2023-06-26T21:51:22Z","timestamp":1687816282000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35236-2_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642352355","9783642352362"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35236-2_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}