REVIEW 1 cited by
Farthest-Point Heuristic based Initialization Methods for K-Modes Clustering
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original 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.
Forward citations
Cited by 1 Pith paper
-
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.
Discussion (0). Continue with ORCID to comment.