An iterative initial-points refinement algorithm for categorical data clustering

DOI10.1016/S0167-8655(01)00163-5MaRDI QIDQ4537331zbMATH OpenOpenAlexFDO

Authors Ying Sun, Qiuming Zhu, Zhengxin Chen

Publication date 27 June 2002

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

Full work available at URL https://doi.org/10.1016/s0167-8655(01)00163-5

zbMATH Keywords

\(k\)-means clustering algorithm

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Recommendations

• scientific article; zbMATH DE number 2170297
• scientific article; zbMATH DE number 5762682
• Initial points chosen in mixture data clustering algorithm improvement based on genetic
• A weighted \(k\)-modes clustering using new weighting method based on within-cluster and between-cluster impurity measures
• A k-Means-Like Algorithm for Clustering Categorical Data Using an Information Theoretic-Based Dissimilarity Measure

Cited in

(10)

• An extended study of the K-means algorithm for data clustering and its applications
• A PROBABILISTIC SELF-ORGANIZING MAP FOR BINARY DATA TOPOGRAPHIC CLUSTERING
• A tandem clustering process for multimodal datasets
• scientific article; zbMATH DE number 5235996 (Why is no real title available?)
• Initial points chosen in mixture data clustering algorithm improvement based on genetic
• scientific article; zbMATH DE number 2170297 (Why is no real title available?)
• A \(k\)-populations algorithm for clustering categorical data
• Software cost estimation based on modified \(K\)-modes clustering algorithm
• Initialization of \(K\)-modes clustering using outlier detection techniques
• A hierarchical hesitant fuzzy K-means clustering algorithm

This page was built for publication: An iterative initial-points refinement algorithm for categorical data clustering

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