5 search results - page 1 / 1 » A New Dissimilarity Measure Between Trees by Decomposition o... |
IDEAL
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. Tree edit distance is a conventional dissimilarity measure between labeled trees. However, tree edit distance including unit-cost edit distance contains the similarity of...
ICALP
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. The edit distance between two ordered rooted trees with vertex labels is the minimum cost of transforming one tree into the other by a sequence of elementary operations c...
EGC
2009
Springer
13 years 2 months ago
2009
Springer
Abstract. In this article we consider objects for which we have a matrix of dissimilarities and we are interested in their links with covariates. We focus on state sequences for wh...
SEMWEB
2007
Springer
13 years 10 months ago
2007
Springer
Abstract The most common matching applications, e.g., ontology matching, focus on the computation of the correspondences holding between the nodes of graph structures (e.g., concep...
ECAI
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. Typical ontology matching applications, such as ontology integration, focus on the computation of correspondences holding between the nodes of two graph-like structures, ...