Lattice-based similarity measures between ordered trees
نویسندگان
چکیده
منابع مشابه
Lattice-based Similarity Measures between Ordered Trees
A clustering algorithm has recently been developed by Reitman and Rueter to express both the structure of chunking in multi-trial free recall and the order of chunk production. The resulting ordered trees differ from ordinary rooted trees in that the elements of a chunk, at any level, may be restricted to a specific ordering. In order to make comparisons of long-term memory structures between s...
متن کاملLocal similarity between quotiented ordered trees
In this paper we propose a dynamic programming algorithm to evaluate local similarity between ordered quotiented trees using a constrained edit scoring scheme. A quotiented tree is a tree defined with an additional equivalent relation on vertices and such that the quotient graph is also a tree. The core of the method relies on two adaptations of an algorithm proposed by Zhang et al. [1] for com...
متن کاملOn Similarity Measures Based on a Refinement Lattice
Retrieval of structured cases using similarity has been studied in CBR but there has been less activity on defining similarity on description logics (DL). In this paper we present an approach that allows us to present two similarity measures for feature logics, a subfamily of DLs, based on the concept of refinement lattice. The first one is based on computing the anti-unification (AU) of two ca...
متن کاملSimilarity Measures between Rough Sets
In this paper, two similarity measures are proposed: one for the similarity between rough sets in the classical rough set theory based on indiscernibility relation and the other between rough sets in the extended rough set theory based on limited tolerance relation. The proposed measures can provide a useful way for measuring the degree of similarity between rough sets. Key-words: Rough set; In...
متن کاملEdit distance between unlabeled ordered trees
There exists a bijection between one stack sortable permutations –permutations which avoid the pattern 231– and planar trees. We define an edit distance between permutations which is coherent with the standard edit distance between trees. This one-to-one correspondence yields a polynomial algorithm for the subpermutation problem for (231) avoiding permutations. Moreover, we obtain the generatin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Psychology
سال: 1982
ISSN: 0022-2496
DOI: 10.1016/0022-2496(82)90049-9