On similarity indices and correction for chance agreement

DOI10.1007/S00357-006-0017-ZzbMATH Open1336.62168OpenAlexW1979813476MaRDI QIDQ265257FDOQ265257

Authors: Ahmed N. Albatineh, Magdalena Niewiadomska-Bugaj', Daniel P. Mihalko 

Publication date: 1 April 2016

Published in: Journal of Classification (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00357-006-0017-z

Recommendations

• Correcting Jaccard and other similarity indices for chance agreement in cluster analysis
• On similarity coefficients for \(2\times2\) tables and correction for chance
• On the equivalence of some indices of similarity: implication for binary presence/absence data
• Rough Sets and Current Trends in Computing
• On confidence estimation based on quantitative similarity coefficients
• scientific article; zbMATH DE number 3104830
• Statistical properties of similarity score functions
• On the indeterminacy of resemblance measures for binary (presence/absence) data

zbMATH Keywords

agreementCohen's kappacomparison of clusteringscorrection for chanceequivalence of similarity indicessimilarity indices

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Cited In (40)

• A new class of weighted similarity indices using polytomous variables
• \(k\)-adic similarity coefficients for binary (presence/absence) data
• Learning with mitigating random consistency from the accuracy measure
• On similarity coefficients for \(2\times2\) tables and correction for chance
• Dissimilarity and similarity measures for comparing dendrograms and their applications
• Model similarity and rank-order based classification of Bayesian networks
• On the equivalence of Cohen's kappa and the Hubert-Arabie adjusted Rand index
• Ordering properties of the first eigenvector of certain similarity matrices
• On association measures for continuous variables and correction for chance
• \(k\)-means, Ward and probabilistic distance-based clustering methods with contiguity constraint
• Explicit agreement extremes for a \(2 \times 2\) table with given marginals
• On association coefficients for \(2\times 2\) tables and properties that do not depend on the marginal distributions
• A binary integer program to maximize the agreement between partitions
• Cross-study replicability in cluster analysis
• Multi-objective selection for collecting cluster alternatives
• Correcting Jaccard and other similarity indices for chance agreement in cluster analysis
• Chance-corrected measures for \(2 \times 2\) tables that coincide with weighted kappa
• Category-Based Inductive Reasoning: Rough Set Theoretic Approach
• The exact distribution of an index of agreement between partitions
• Inequalities between similarities for numerical data
• The impact of random models on clustering similarity
• Adjusted concordance index: an extensionl of the adjusted rand index to fuzzy partitions
• Comparing high-dimensional partitions with the Co-clustering adjusted rand index
• On Robinsonian dissimilarities, the consecutive ones property and latent variable models
• On assessments of agreement between fuzzy partitions
• On the equivalence of some indices of similarity: implication for binary presence/absence data
• Understanding the adjusted Rand index and other partition comparison indices based on counting object pairs
• Suboptimal comparison of partitions
• SEP/COP: an efficient method to find the best partition in hierarchical clustering based on a new cluster validity index
• MCS: A method for finding the number of clusters
• On Certain Rough Inclusion Functions
• Adjusting the Adjusted Rand Index. A multinomial story
• Means and variances for a family of similarity indices used in cluster analysis
• Minimum adjusted Rand index for two clusterings of a given size
• Over-optimistic evaluation and reporting of novel cluster algorithms: an illustrative study
• APPROXIMATELY INDEPENDENT FEATURES OF LANGUAGES
• Similarity/diversity indices on incidence matrices containing missing values
• Bisecting K-means and 1D projection divisive clustering: a unified framework and experimental comparison
• A note on maximizing the agreement between partitions: a stepwise optimal algorithm and some properties
• Generalization of clustering agreements and distances for overlapping clusters and network communities

This page was built for publication: On similarity indices and correction for chance agreement

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q265257)