Farthest-Point Heuristic based Initialization Methods for K-Modes Clustering

Simple item page
dc.creatorHe, Zengyou
dc.date2006-10-09
dc.date.accessioned2026-07-07T07:27:50Z
dc.date.available2026-07-07T07:27:50Z
dc.descriptionThe 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.
dc.description7 pages
dc.identifierhttps://arxiv.org/abs/cs/0610043
dc.identifierhttp://arxiv.org/abs/cs/0610043
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/117515
dc.subjectArtificial Intelligence
dc.titleFarthest-Point Heuristic based Initialization Methods for K-Modes Clustering
dc.typetext

Files

Collections

arXiv