k-Means, Ward and Probabilistic Distance-Based Clustering Methods with Contiguity Constraint

We analyze some possibilities of using contiguity (neighbourhood) matrix as a constraint in the clustering made by the k -means and Ward methods as well as by an approach based on distances and probabilistic assignments aimed at obtaining a solution of the multi-facility location problem (MFLP). Tha...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of classification Vol. 38; no. 2; pp. 313 - 352
Main Author:	Młodak, Andrzej
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.07.2021 Springer Nature B.V
Subjects:	Algorithms Bioinformatics Clustering Constraints Empirical analysis Heterogeneity Homogeneity Indexes Marketing Mathematics and Statistics Neighborhoods Operations research Original Research Pattern Recognition Psychometrics Quality assessment Signal,Image and Speech Processing Simulation Site selection Statistical Theory and Methods Statistics Peirce index Probabilistic Contiguity constraint Sokal and Sneath index Means method clustering Silhouette index Ward method Rand index Correctness of clustering
ISSN:	0176-4268, 1432-1343
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!