{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T15:40:14Z","timestamp":1740843614954,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540404989"},{"type":"electronic","value":"9783540450634"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45063-4_9","type":"book-chapter","created":{"date-parts":[[2011,1,8]],"date-time":"2011-01-08T21:56:31Z","timestamp":1294523791000},"page":"130-146","source":"Crossref","is-referenced-by-count":0,"title":["Learning Mixtures of Tree-Unions by Minimizing Description Length"],"prefix":"10.1007","author":[{"given":"Andrea","family":"Torsello","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edwin R.","family":"Hancock","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0020-0190(76)90049-1","volume":"4","author":"H.G. Barrow","year":"1976","unstructured":"Barrow, H.G., Burstall, R.M.: Subgraph isomorphism, matching relational structures and maximal cliques. Inf.Proc. Letters\u00a04, 83\u201384 (1976)","journal-title":"Inf.Proc. Letters"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Dickinson, S.J., Pentlan, A.P., Rosenfeld, A.: 3-D shape recovery using distributed aspect matching. In: PAMI, vol.\u00a014(2), pp. 174\u2013198 (1992)","DOI":"10.1109\/34.121788"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Eshera, M.A., Fu, K.-S.: An image understanding system using attributed symbolic representation and inexact graph-matching. In: PAMI, vol.\u00a08, pp. 604\u2013618 (1986)","DOI":"10.1109\/TPAMI.1986.4767835"},{"key":"9_CR4","unstructured":"Friedman, N., Koller, D.: Being Bayesian about Network Structure, Machine Learning (2002) (to appear)"},{"key":"9_CR5","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":"9_CR6","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":"9_CR7","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":"9_CR8","doi-asserted-by":"crossref","unstructured":"Ioffe, S., Forsyth, D.A.: Human Tracking with Mixtures of Trees. In: ICCV, vol.\u00a0I, pp. 690\u2013695 (2001)","DOI":"10.1109\/ICCV.2001.937589"},{"key":"9_CR9","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":"9_CR10","doi-asserted-by":"crossref","unstructured":"Johnson, S.C.: Hierarchical clustering schemes. Psychometrika\u00a032(3) (1967)","DOI":"10.1007\/BF02289588"},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/BF01451741","volume":"15","author":"B.B. Kimia","year":"1995","unstructured":"Kimia, B.B., Tannenbaum, A.R., Zucker, S.W.: Shapes, shocks, and deformations I. International Journal of Computer Vision\u00a015, 189\u2013224 (1995)","journal-title":"International Journal of Computer Vision"},{"key":"9_CR12","unstructured":"Langley, P., Iba, W., Thompson, K.: An analysis of Bayesian classifiers. In: AAAI, pp. 223\u2013228 (1992)"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Liu, T., Geiger, D.: Approximate Tree Matching and Shape Similarity. In: ICCV-WS, pp. 456\u2013462 (1999)","DOI":"10.1109\/ICCV.1999.791256"},{"key":"9_CR14","unstructured":"Luo, B., et al.: A probabilistic framework for graphclu stering. In: EMMCVPR 2001, pp. 912\u2013919 (2001)"},{"key":"9_CR15","unstructured":"Meil\u0103, M.: Learning with Mixtures of Trees. PhD thesis. MIT (1999)"},{"key":"9_CR16","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":"9_CR17","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1109\/TSMC.1983.6313167","volume":"13","author":"A. Sanfeliu","year":"1983","unstructured":"Sanfeliu, A., Fu, K.S.: A distance measure between attributed relational graphs fro pattern recognition. IEEE Transactions on Systems, Man and Cybernetics\u00a013, 353\u2013362 (1983)","journal-title":"IEEE Transactions on Systems, Man and Cybernetics"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Sclaroff, S., Pentland, A.P.: Modal matching for correspondence and recognition. In: PAMI, vol.\u00a017, pp. 545\u2013661 (1995)","DOI":"10.1109\/34.387502"},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-48432-9_1","volume-title":"Energy Minimization Methods in Computer Vision and Pattern Recognition","author":"A. Shokoufandeh","year":"1999","unstructured":"Shokoufandeh, A., Dickinson, S.J., Siddiqi, K., Zucker, S.W.: Indexing using a spectral encoding of topological structure. In: Hancock, E.R., Pelillo, M. (eds.) EMMCVPR 1999. LNCS, vol.\u00a01654, pp. 1\u201313. Springer, Heidelberg (1999)"},{"key":"9_CR20","unstructured":"Siddiqi, K., et al.: Shock graphs and shape matching. J. of Comp. Vision\u00a035 (1999)"},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"Sebastian, T., Klein, P., Kimia, B.: Recognition of shapes by editing shock graphs. In: ICCV-WS 1999, vol.\u00a0I, pp. 755\u2013762 (2001)","DOI":"10.1109\/ICCV.2001.937602"},{"key":"9_CR22","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":"9_CR23","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)"},{"key":"9_CR24","doi-asserted-by":"crossref","unstructured":"Zhu, S.C., Yuille, A.L.: FORMS: A Flexible Object Recognition and Modelling System. In: IJCV, vol.\u00a020(3), pp. 187\u2013212 (1996)","DOI":"10.1007\/BF00208719"}],"container-title":["Lecture Notes in Computer Science","Energy Minimization Methods in Computer Vision and Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45063-4_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T15:15:35Z","timestamp":1740842135000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45063-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540404989","9783540450634"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45063-4_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}