A distance for partially labeled trees

Please use this identifier to cite or link to this item: http://hdl.handle.net/10045/18321
Full metadata record
Full metadata record
DC FieldValueLanguage
dc.contributorReconocimiento de Formas e Inteligencia Artificialen
dc.contributor.authorCalvo-Zaragoza, Jorge-
dc.contributor.authorRizo, David-
dc.contributor.authorIñesta, José M.-
dc.contributor.otherUniversidad de Alicante. Departamento de Lenguajes y Sistemas Informáticosen
dc.date.accessioned2011-07-27T06:50:15Z-
dc.date.available2011-07-27T06:50:15Z-
dc.date.issued2011-
dc.identifier.citationCALVO ZARAGOZA, Jorge; RIZO VALERO, David; IÑESTA QUEREDA, José Manuel. "A distance for partially labeled trees". En: Pattern Recognition and Image Analysis: 5th Iberian Conference, IbPRIA 2011, Las Palmas de Gran Canaria, Spain, June 8-10, 2011: Proceedings / Jordi Vitria, João Miguel Sanches, Mario Hernández (Eds.). Berlin : Springer Berlin Heidelberg, 2011. (Lecture Notes in Computer Science; 6669). ISBN 978-3-642-21256-7, pp. 492-499en
dc.identifier.isbn978-3-642-21256-7-
dc.identifier.issn0302-9743 (Print)-
dc.identifier.issn1611-3349 (Online)-
dc.identifier.urihttp://hdl.handle.net/10045/18321-
dc.description.abstractIn a number of practical situations, data have structure and the relations among its component parts need to be coded with suitable data models. Trees are usually utilized for representing data for which hierarchical relations can be defined. This is the case in a number of fields like image analysis, natural language processing, protein structure, or music retrieval, to name a few. In those cases, procedures for comparing trees are very relevant. An approximate tree edit distance algorithm has been introduced for working with trees labeled only at the leaves. In this paper, it has been applied to handwritten character recognition, providing accuracies comparable to those by the most comprehensive search method, being as efficient as the fastest.en
dc.description.sponsorshipThis work is supported by the Spanish Ministry projects DRIMS (TIN2009-14247-C02), and Consolider Ingenio 2010 (MIPRCV, CSD2007-00018), partially supported by EU ERDF and the Pascal Network of Excellence.en
dc.languageengen
dc.publisherSpringer Berlin / Heidelbergen
dc.rightsThe original publication is available at www.springerlink.comen
dc.subjectTree edit distanceen
dc.subjectApproximate distancesen
dc.subjectQtreesen
dc.subject.otherLenguajes y Sistemas Informáticosen
dc.titleA distance for partially labeled treesen
dc.typeinfo:eu-repo/semantics/bookParten
dc.peerreviewedsien
dc.identifier.doi10.1007/978-3-642-21257-4_61-
dc.relation.publisherversionhttp://dx.doi.org/10.1007/978-3-642-21257-4_61en
dc.rights.accessRightsinfo:eu-repo/semantics/restrictedAccessen
dc.relation.projectIDinfo:eu-repo/grantAgreement/EC/FP7/216886en
Appears in Collections:INV - GRFIA - Capítulos de Libros
Research funded by the EU

Files in This Item:
Files in This Item:
File Description SizeFormat 
Thumbnailibpria11-calvo.pdfVersión revisada (acceso libre)164,23 kBAdobe PDFOpen Preview
Thumbnailibpria11-calvo_final.pdfVersión final (acceso restringido)331,07 kBAdobe PDFOpen    Request a copy


Items in RUA are protected by copyright, with all rights reserved, unless otherwise indicated.