Concept dissimilarity based on tree edit distance and morphological edition
نویسندگان
چکیده
Several researchers have developed properties that ensure compatibility of a concept similarity or dissimilarity measure with the formal semantics of Description Logics. While these authors have highlighted the relevance of the triangle inequality, none of their proposed dissimilarity measures satisfy it. In this work we present several dissimilarity measures with this property: first, a simple dissimilarity measure, based on description trees for the lightweight Description Logic EL; second, a general framework based on concept relaxations; third, an instantiation of the general framework using dilation operators from mathematical morphology, exploiting the link between Hausdorff distance and dilations using balls of the ground distance as structuring elements. A comparison between these definitions and their properties is provided as well. Résumé Plusieurs chercheurs se sont intéressés aux propriétés qui garantissent la compatibilité entre une mesure de similarité ou dissimilarité entre concepts et la sémantique des logiques de description. Alors que l’intérêt de l’inégalité triangulaire a été souligné, aucune mesure de dissimilarité existante ne la satisfait. Dans ce rapport, nous présentons plusieurs mesures de dissimilarité ayant cette propriété : nous proposons d’abord une mesure de dissimilarité simple, reposant sur les arbres de description pour la logique de description EL ; puis nous construisons un cadre général utilisant des opérateurs de dilatation morphologique, en exploitant le lien entre distance de Hausdorff et dilatation avec des éléments structurants définis comme des boules de la distance de base. Enfin, nous comparons ces définitions, ainsi que leurs propriétés.
منابع مشابه
A New Dissimilarity Measure Between Trees by Decomposition of Unit-Cost Edit Distance
Tree edit distance is a conventional dissimilarity measure between labeled trees. However, tree edit distance including unit-cost edit distance contains the similarity of label and that of tree structure simultaneously. Therefore, even if the label similarity between two trees that share many nodes with the same label is high, the high label similarity is hard to be recognized from their tree e...
متن کاملDissimilarity between two skeletal trees in a context
Skeletal trees are commonly used in order to express geometric properties of the shape. Accordingly, tree edit distance is used to compute a dissimilarity between two given shapes. We present a new tree edit based shape matching method which uses a recent coarse skeleton representation. The coarse skeleton representation allows us to represent both shapes and shape categories in the form of dep...
متن کاملConcept Dissimilarity Based on Tree Edit Distances and Morphological Dilations
A number of similarity measures for comparing description logic concepts have been proposed. Criteria have been developed to evaluate a measure’s fitness for an application. These criteria include on the one hand those that ensure compatibility with the semantics, such as equivalence soundness, and on the other hand the properties of a metric, such as the triangle inequality. In this work we pr...
متن کاملTop-Down Tree Edit-Distance of Regular Tree Languages
We study the edit-distance of regular tree languages. The edit-distance is a metric for measuring the similarity or dissimilarity between two objects, and a regular tree language is a set of trees accepted by a finite-state tree automaton or described by a regular tree grammar. Given two regular tree languages L and R, we define the editdistance d(L,R) between L and R to be the minimum edit-dis...
متن کاملB-Tree: An All-Purpose Index Structure for String Similarity Search Based on Edit Distance
Strings are ubiquitous in computer systems and hence string processing has attracted extensive research effort from computer scientists in diverse areas. One of the most important problems in string processing is to efficiently evaluate the similarity between two strings based on a specified similarity measure. String similarity search is a fundamental problem in information retrieval, database...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014