-Means: A new generalized k-means clustering algorithm

DOI10.1016/S0167-8655(03)00146-6zbMath1073.68734OpenAlexW2107303832MaRDI QIDQ4458907

Yiu-ming Cheung

Publication date: 14 March 2004

Published in: Pattern Recognition Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-8655(03)00146-6

zbMATH Keywords

Clustering analysis\(k\)-Means algorithmCluster numberRival penalization

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Pattern recognition, speech recognition (68T10)

Related Items (6)

A Pitman measure of similarity in k-means for clustering heavy-tailed data ⋮ Analysing microarray expression data through effective clustering ⋮ An iterated greedy heuristic for a market segmentation problem with multiple attributes ⋮ A comparative study of the \(K\)-means algorithm and the normal mixture model for clustering: bivariate homoscedastic case ⋮ Clustering: a neural network approach ⋮ Cluster-based sliced inverse regression

This page was built for publication: -Means: A new generalized k-means clustering algorithm