Output details
11 - Computer Science and Informatics
University of Strathclyde
Return to search
Output 0 of 0 in the submission
Article title
A bounded distance metric for comparing tree structure
Type
D - Journal article
Title of journal
Information Systems
Article number
-
Volume number
36
Issue number
4
First page of article
748
ISSN of journal
0306-4379
Year of publication
2011
URL
-
Number of additional authors
3
Additional information
<17>This paper defines the first published proper distance metric over unordered labelled trees (i.e. semi-structured data) which is both computable and tractable. Previous approaches based on information theory were approximations, while the new metric described here is accurately calculated based the entropy derived from random walks of the data structure. All other known distance functions, including those subsequently published, are either not computable, are not proper metrics, or are approximations. A pre-journal version of the paper was chosen by the organisers as a "best paper" at the 2009 SISAP workshop (http://www.sisap.org/2009/).
Interdisciplinary
-
Cross-referral requested
-
Research group
B - Information Systems
Citation count
4
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
