k-Means, Ward and Probabilistic Distance-Based Clustering Methods with Contiguity Constraint
Journal of Classification · 2021-07 · 38 (2) · 313-352
DOI: 10.1007/s00357-020-09370-5 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Classification, online erschienen am 26.08.2020. Verfasst von Andrzej Młodak. Die Arbeit wurde bisher 18-mal zitiert (Crossref) und nennt 45 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: The President Stanislaw Wojciechowski State University of Applied Sciences.
Abstract (Originalsprache)
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). That is, some special two-stage algorithms being the kinds of clustering with relational constraint are proposed. They optimize division of set of objects into clusters respecting the requirement that neighbours have to belong to the same cluster. In the case of the probabilistic d -clustering, relevant modification of its target function is suggested and studied. Versatile simulation study and empirical analysis verify the practical efficiency of these methods. The quality of clustering is assessed on the basis of indices of homogeneity, heterogeneity and correctness of clusters as well as the silhouette index. Using these tools and similarity indices (Rand, Peirce and Sokal and Sneath), it was shown that the probabilistic d -clustering can produce better results than Ward’s algorithm. In comparison with the k -means approach, the probabilistic d -clustering—although gives rather similar results—is more robust to creation of trivial (of which empty) clusters and produces less diversified (in replications, in terms of correctness) results than k -means approach, i.e. is more predictable from the point of view of the clustering quality.
Förderung
- The President Stanislaw Wojciechowski State University of Applied Sciences
Zitieren
APA
Młodak, A. (2021). k-Means, Ward and Probabilistic Distance-Based Clustering Methods with Contiguity Constraint. Journal of Classification, 38(2), 313-352. https://doi.org/10.1007/s00357-020-09370-5
Vancouver
Młodak A. k-Means, Ward and Probabilistic Distance-Based Clustering Methods with Contiguity Constraint. Journal of Classification. 2021;38(2):313-352. doi:10.1007/s00357-020-09370-5
BibTeX
@article{Modak2021,
author = {Młodak, Andrzej},
title = {k-Means, Ward and Probabilistic Distance-Based Clustering Methods with Contiguity Constraint},
journal = {Journal of Classification},
year = {2021},
volume = {38},
number = {2},
pages = {313--352},
doi = {10.1007/s00357-020-09370-5}
}
EUVIMED