PL
 |
EN
Preferencje help
Polish version English version Język
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 5

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  rank distance
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available remote Spearman Permutation Distances and Shannon's Distinguishability
Bortolussi L., Dinu L.P., Sgarro A.
Fundamenta Informaticae
|
2012
|
Vol. 118, nr 3
245-252
EN
Spearman distance is a permutation distance which might be used for codes in permutations beside Kendall distance. However, Spearman distance gives rise to a geometry of strings, which is rather unruly from the point of view of error correction and error detection. Special care has to be taken to discriminate between the two notions of codeword distance and codeword distinguishability. This stresses the importance of rejuvenating the latter notion, extending it from Shannon's zero-error information theory to the more general setting of metric string distances.
2
Content available remote A Multi-Criteria Decision Method Based on Rank Distance
Dinu L.P., Popescu M.
Fundamenta Informaticae
|
2008
|
Vol. 86, nr 1-2
79-91
EN
The multi-criteria decision making process can be summarized as follows. Given a pattern d and a set C = {c_1, c_2, .., c_m} of allmpossible categories of d, we are interested in predicting its class by using a set of n classifiers l_1, l_2, .., l_n. Each classifier produces a ranking of categories. In this paper we propose and test a decision method which combines the rankings by using a particular method, called rank distance categorization. This method is actually based on the rank distance, a metric which was successfully used in computational linguistics and bioinformatics. We define the method, present some of its mathematical and computational properties and we test it on the digit dataset consisting of handwritten numerals ('0', .., '9') extracted from a collection of Dutch utility maps. We compare our experimental results with other reported experiments which used the same dataset but different combining methods
3
Content available remote A Low-complexity Distance for DNA Strings
Dinu L.P., Sgarro A.
Fundamenta Informaticae
|
2006
|
Vol. 73, nr 3
361-372
EN
We exhibit a low-complexity but non-trivial distance between strings to be used in biology. The experimental results we provide were obtained on a standard laptop and, even if preliminary, are quite encouraging.
4
Content available remote Rank Distance with Applications in Similarity of Natural Languages
Dinu L. P.
Fundamenta Informaticae
|
2005
|
Vol. 64, nr 1-4
135-149
EN
In this paper we introduce a metric for measuring the similarity between two classifications which differ by their constitutive elements. Our measure is inspired from natural language and genomics where the most important information is carried by the first part of the unit. We extend the measure to words and to rooted (un)labelled general trees. We use this metric to analyze the syllabic similarity of Romance languages.
5
Content available remote On the Classification and Aggregation of Hierarchies with Different Constitutive Elements
Dinu L.P.
Fundamenta Informaticae
|
2003
|
Vol. 55, nr 1
39-50
EN
In this paper we present an aggregation method which can be applied to classifications having different vocabularies. The method uses the rank distance (Dinu, 2003), a metric which measures the similarity between two hierarchies based on the ranks of objects. We define the aggregation of n hierarchies as the classification for which the sum of distances from it to each of the n hierarchies is minimal. We study some of his rationality properties and propose some open problems.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.