Please use this identifier to cite or link to this item: http://hdl.handle.net/1893/27712
Full metadata record
DC FieldValueLanguage
dc.contributor.authorConnor, Richarden_UK
dc.contributor.authorSimeoni, Fabioen_UK
dc.contributor.authorIakovos, Michaelen_UK
dc.contributor.authorMoss, Roberten_UK
dc.date.accessioned2018-09-05T13:55:35Z-
dc.date.available2018-09-05T13:55:35Z-
dc.date.issued2011-06-30en_UK
dc.identifier.urihttp://hdl.handle.net/1893/27712-
dc.description.abstractComparing tree-structured data for structural similarity is a recurring theme and one on which much effort has been spent. Most approaches so far are grounded, implicitly or explicitly, in algorithmic information theory, being approximations to an information distance derived from Kolmogorov complexity. In this paper we propose a novel complexity metric, also grounded in information theory, but calculated via Shannon's entropy equations. This is used to formulate a directly and efficiently computable metric for the structural difference between unordered trees. The paper explains the derivation of the metric in terms of information theory, and proves the essential property that it is a distance metric. The property of boundedness means that the metric can be used in contexts such as clustering, where second-order comparisons are required. The distance metric property means that the metric can be used in the context of similarity search and metric spaces in general, allowing trees to be indexed and stored within this domain. We are not aware of any other tree similarity metric with these properties.en_UK
dc.language.isoenen_UK
dc.publisherElsevieren_UK
dc.relationConnor R, Simeoni F, Iakovos M & Moss R (2011) A bounded distance metric for comparing tree structure. Information Systems, 36 (4), pp. 748-764. https://doi.org/10.1016/j.is.2010.12.003.en_UK
dc.rightsThe publisher does not allow this work to be made publicly available in this Repository. Please use the Request a Copy feature at the foot of the Repository record to request a copy directly from the author. You can only request a copy if you wish to use this work for your own research or private study.en_UK
dc.subjectUnordered treeen_UK
dc.subjecttree comparisonen_UK
dc.subjectdistance metricen_UK
dc.subjectalgorithmic information theoryen_UK
dc.subjectinformation contenten_UK
dc.subjectinformation distanceen_UK
dc.subjectentropyen_UK
dc.titleA bounded distance metric for comparing tree structureen_UK
dc.typeJournal Articleen_UK
dc.rights.embargodate2999-12-31en_UK
dc.rights.embargoreason[Connor et al 2011.pdf] The publisher does not allow this work to be made publicly available in this Repository therefore there is an embargo on the full text of the work.en_UK
dc.identifier.doi10.1016/j.is.2010.12.003en_UK
dc.citation.jtitleInformation Systemsen_UK
dc.citation.issn0306-4379en_UK
dc.citation.volume36en_UK
dc.citation.issue4en_UK
dc.citation.spage748en_UK
dc.citation.epage764en_UK
dc.citation.publicationstatusPublisheden_UK
dc.citation.peerreviewedRefereeden_UK
dc.type.statusVoR - Version of Recorden_UK
dc.contributor.funderEngineering and Physical Sciences Research Councilen_UK
dc.author.emailrichard.connor@stir.ac.uken_UK
dc.citation.date21/12/2010en_UK
dc.contributor.affiliationUniversity of Strathclydeen_UK
dc.contributor.affiliationUniversity of Strathclydeen_UK
dc.contributor.affiliationUniversity of Strathclydeen_UK
dc.contributor.affiliationUniversity of Strathclydeen_UK
dc.identifier.isi000289395000005en_UK
dc.identifier.scopusid2-s2.0-79952623879en_UK
dc.identifier.wtid956106en_UK
dc.contributor.orcid0000-0003-4734-8103en_UK
Appears in Collections:Computing Science and Mathematics Journal Articles

Files in This Item:
File Description SizeFormat 
Connor et al 2011.pdfFulltext - Published Version416 kBAdobe PDFUnder Permanent Embargo    Request a copy


This item is protected by original copyright



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

If you believe that any material held in STORRE infringes copyright, please contact library@stir.ac.uk providing details and we will remove the Work from public display in STORRE and investigate your claim.