-Means: A new generalized k-means clustering algorithm

DOI10.1016/S0167-8655(03)00146-6zbMATH Open1073.68734OpenAlexW2107303832MaRDI QIDQ4458907FDOQ4458907

Authors: 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

Recommendations

• scientific article; zbMATH DE number 1927172
• \(k\)-means algorithm
• An extension of the \(K\)-means algorithm to clustering skewed data
• An improved K-means clustering algorithm
• \(K\)-means cloning: adaptive spherical \(K\)-means clustering

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cited In (12)

• A new clustering preserving transformation for \(k\)-means algorithm output
• An iterated greedy heuristic for a market segmentation problem with multiple attributes
• Cluster-based sliced inverse regression
• A comparative study of the \(K\)-means algorithm and the normal mixture model for clustering: bivariate homoscedastic case
• Analysing microarray expression data through effective clustering
• A Pitman measure of similarity in k-means for clustering heavy-tailed data
• \(K\)-means cloning: adaptive spherical \(K\)-means clustering
• Title not available (Why is that?)
• Title not available (Why is that?)
• Clustering via minimum volume ellipsoids
• Clustering: a neural network approach
• Integrating model predictive control and deep learning for the management of an EV charging station

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

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