An iterative initial-points refinement algorithm for categorical data clustering
From MaRDI portal
Publication:4537331
DOI10.1016/S0167-8655(01)00163-5zbMATH Open1015.68155OpenAlexW2043317715MaRDI QIDQ4537331FDOQ4537331
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
Recommendations
- scientific article; zbMATH DE number 2170297
- scientific article
- 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)
- A tandem clustering process for multimodal datasets
- Title not available (Why is that?)
- Title not available (Why is that?)
- A PROBABILISTIC SELF-ORGANIZING MAP FOR BINARY DATA TOPOGRAPHIC CLUSTERING
- Initialization of \(K\)-modes clustering using outlier detection techniques
- An extended study of the K-means algorithm for data clustering and its applications
- A hierarchical hesitant fuzzy K-means clustering algorithm
- A \(k\)-populations algorithm for clustering categorical data
- Initial points chosen in mixture data clustering algorithm improvement based on genetic
- Software cost estimation based on modified \(K\)-modes 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)