Bisecting K-Modes initializes K-Modes clustering via hierarchical splitting and shows promising speed and quality on large categorical datasets, but the experimental validation is limited.
Farthest-Point Heuristic based Initialization Methods for K-Modes Clustering
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
The k-modes algorithm has become a popular technique in solving categorical data clustering problems in different application domains. However, the algorithm requires random selection of initial points for the clusters. Different initial points often lead to considerable distinct clustering results. In this paper we present an experimental study on applying a farthest-point heuristic based initialization method to k-modes clustering to improve its performance. Experiments show that new initialization method leads to better clustering accuracy than random selection initialization method for k-modes clustering.
citation-role summary
background 1
citation-polarity summary
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Fast Clustering of Categorical Big Data
Bisecting K-Modes initializes K-Modes clustering via hierarchical splitting and shows promising speed and quality on large categorical datasets, but the experimental validation is limited.