Comparing resemblance measures

In the paper some types of equivalences over resemblance measures and some basic results about them are given. Based on induced partial orderings on the set of unordered pairs of units a dissimilarity between two resemblance measures over finite sets of units can be defined. As an example, using this dissimilarity standard association coefficients between binary vectors are compared both theoretically and computationally.

[1]  P. Sneath,et al.  Numerical Taxonomy , 1962, Nature.

[2]  J. Dieudonne.  Foundations of Modern Analysis , 1969 .

[3]  A. Friedman.  Foundations of modern analysis , 1970 .

[4]  J. Gower.  A General Coefficient of Similarity and Some of Its Properties , 1971 .

[5]  Michael R. Anderberg,et al.  Cluster Analysis for Applications , 1973 .

[6]  H. Spaeth.  Cluster-Analyse-Algorithmen zur Objektklassifizierung und Datenreduktion , 1975 .

[7]  Z. Hubálek.  COEFFICIENTS OF ASSOCIATION AND SIMILARITY, BASED ON BINARY (PRESENCE‐ABSENCE) DATA: AN EVALUATION , 1982 .

[8]  M. Jambu,et al.  Cluster analysis and data analysis , 1985 .

[9]  J. Kruskal.  An Overview of Sequence Comparison: Time Warps, String Edits, and Macromolecules , 1983 .

[10]  A. Liebetrau.  Measures of association , 1983 .

[11]  Jaap Van Brakel,et al.  Foundations of measurement , 1983 .

[12]  J. Gower,et al.  Metric and Euclidean properties of dissimilarity coefficients , 1986 .

[13]  S. Joly,et al.  Étude des puissances d'une distance , 1986 .

[14]  Problemes de representations spheriques des tableaux de dissimilarite , 1987 .

[15]  Vladimir Batagelj,et al.  Similarity measures between structured objects , 1989 .

[16]  F. B. Baulieu.  A classification of presence/absence based dissimilarity coefficients , 1989 .

[17]  Vladimir Batagelj,et al.  An algorithm for tree-realizability of distance matrices , 1990, Int. J. Comput. Math..

[18]  Hans-Jürgen Bandelt.  Recognition of Tree Metrics , 1990, SIAM J. Discret. Math..