Comparison of four initialization techniques for the k-medians clustering algorithm

DOI10.1007/3-540-44522-6_87MaRDI QIDQ4536577zbMATH OpenFDO

Authors Alfons Juan, Enrique Vidal

Publication date 5 November 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44522-6_87

zbMATH Keywords

clusteringgreedy-interchange algorithmk-medians algorithmk-medians initializationmaxmin algorithmmetric spaces

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Computing methodologies and applications (68U99)

Recommendations

• A survey on the initialization methods for the $k$-means algorithm
• Initializing \(K\)-means batch clustering: A critical evaluation of several techniques
• K-medoids clustering algorithm based on distance inequality
• A robust algorithm for cluster initialization using uniform effect of k-means
• A new initialization and performance measure for the rough k-means clustering

Cited in

(3)

• On the use of Bernoulli mixture models for text classification
• A distance based clustering method for arbitrary shaped clusters in large datasets
• Criterion in selecting the clustering algorithm in radial basis functional link nets

This page was built for publication: Comparison of four initialization techniques for the \(k\)-medians clustering algorithm

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