{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T05:11:16Z","timestamp":1740287476946,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540407300"},{"type":"electronic","value":"9783540451792"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45179-2_56","type":"book-chapter","created":{"date-parts":[[2010,6,26]],"date-time":"2010-06-26T00:43:43Z","timestamp":1277513023000},"page":"451-459","source":"Crossref","is-referenced-by-count":2,"title":["Graph Clustering with Tree-Unions"],"prefix":"10.1007","author":[{"given":"Andrea","family":"Torsello","sequence":"first","affiliation":[]},{"given":"Edwin R.","family":"Hancock","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"56_CR1","unstructured":"Friedman, N., Koller, D.: Being Bayesian about Network Structure. Machine Learning (2002) (to appear)"},{"key":"56_CR2","doi-asserted-by":"crossref","unstructured":"Getoor, L., et al.: Learning Probabilistic models of relational structure. In: 8th Int. Conf. on Machine Learning (2001)","DOI":"10.1007\/978-3-662-04599-2_13"},{"issue":"3","key":"56_CR3","first-page":"197","volume":"20","author":"D. Heckerman","year":"1995","unstructured":"Heckerman, D., Geiger, D., Chickering, D.M.: Learning Bayesian networks: the combination of knowledge and statistical data. Machine Learning\u00a020(3), 197\u2013243 (1995)","journal-title":"Machine Learning"},{"key":"56_CR4","doi-asserted-by":"crossref","unstructured":"Heap, T., Hogg, D.: Wormholes in shape space: tracking through discontinuous changes in shape. In: ICCV, pp. 344\u2013349 (1998)","DOI":"10.1109\/ICCV.1998.710741"},{"key":"56_CR5","unstructured":"Jiang, X., Muenger, A., Bunke, H.: Computing the generalized mean of a set of graphs. In: Workshop on Graph-based Representations, GbR 1999, pp. 115\u2013124 (2000)"},{"key":"56_CR6","unstructured":"Langley, P., Iba, W., Thompson, K.: An analysis of Bayesian classifiers. In: AAAI, pp. 223\u2013228 (1992)"},{"key":"56_CR7","unstructured":"Luo, B., et al.: Clustering shock trees. In: CVPR, pp. 912\u2013919 (2001)"},{"key":"56_CR8","unstructured":"Meil\u0103, M.: Learning with Mixtures of Trees. PhD thesis, MIT (1999)"},{"key":"56_CR9","doi-asserted-by":"publisher","first-page":"1080","DOI":"10.1214\/aos\/1176350051","volume":"14","author":"J. Riassen","year":"1986","unstructured":"Riassen, J.: Stochastic complexity and modeling. Annals of Statistics\u00a014, 1080\u20131100 (1986)","journal-title":"Annals of Statistics"},{"key":"56_CR10","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1109\/34.387502","volume":"17","author":"S. Sclaroff","year":"1995","unstructured":"Sclaroff, S., Pentland, A.P.: Modal matching for correspondence and recognition. PAMI\u00a017, 545\u2013661 (1995)","journal-title":"PAMI"},{"key":"56_CR11","unstructured":"Siddiqi, K., et al.: Shock graphs and shape matching. Int. J. of Comp. Vision\u00a035 (1999)"},{"key":"56_CR12","doi-asserted-by":"crossref","unstructured":"Sebastian, T., Klein, P., Kimia, B.: Recognition of shapes by editing shock graphs. In: ICCV, vol.\u00a0I, pp. 755\u2013762 (2001)","DOI":"10.1109\/ICCV.2001.937602"},{"key":"56_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/3-540-44745-8_29","volume-title":"Energy Minimization Methods in Computer Vision and Pattern Recognition","author":"A. Torsello","year":"2001","unstructured":"Torsello, A., Hancock, E.R.: Efficiently computing weighted tree edit distance using relaxation labeling. In: Figueiredo, M., Zerubia, J., Jain, A.K. (eds.) EMMCVPR 2001. LNCS, vol.\u00a02134, pp. 438\u2013453. Springer, Heidelberg (2001)"},{"key":"56_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"822","DOI":"10.1007\/3-540-47977-5_54","volume-title":"Computer Vision - ECCV 2002","author":"A. Torsello","year":"2002","unstructured":"Torsello, A., Hancock, E.R.: Matching and embedding through edit-union of trees. In: Heyden, A., Sparr, G., Nielsen, M., Johansen, P. (eds.) ECCV 2002. LNCS, vol.\u00a02352, pp. 822\u2013836. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Computer Analysis of Images and Patterns"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45179-2_56","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T08:03:11Z","timestamp":1740211391000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45179-2_56"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540407300","9783540451792"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45179-2_56","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}