\(k\)-means, Ward and probabilistic distance-based clustering methods with contiguity constraint

DOI10.1007/s00357-020-09370-5OpenAlexW3080267864MaRDI QIDQ2236773

Andrzej Młodak

Publication date: 26 October 2021

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

Full work available at URL: https://doi.org/10.1007/s00357-020-09370-5

zbMATH Keywords

Ward methodRand index\(k\)-means methodcontiguity constraintcorrectness of clusteringPeirce indexprobabilistic \(d\)-clusteringsilhouette indexSneath indexSokal index

Mathematics Subject Classification ID

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

Uses Software

• Arc_Mat
• clusfind
• Apache Spark

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On similarity indices and correction for chance agreement
• Probabilistic d-clustering
• A generalized Weiszfeld method for the multi-facility location problem
• Means and variances for a family of similarity indices used in cluster analysis
• Small area estimation: the EBLUP estimator based on spatially correlated random area effects
• Clustering with relational constraint
• Correcting Jaccard and other similarity indices for chance agreement in cluster analysis
• Neighbourhood of spatial areas in the physical and socio-economical context
• On the construction of an aggregated measure of the development of interval data
• Machine learning and data mining in pattern recognition. 5th international conference, MLDM 2007, Leipzig, Germany, July 18-20, 2007. Proceedings
• Cluster Analysis
• Finding Groups in Data
• Well-Separated Clusters and Optimal Fuzzy Partitions
• Hierarchical grouping methods and stopping rules: an evaluation
• A note on Fermat's problem
• A Fuzzy Relative of the ISODATA Process and Its Use in Detecting Compact Well-Separated Clusters

This page was built for publication: \(k\)-means, Ward and probabilistic distance-based clustering methods with contiguity constraint