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

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

2006-10-09

arxiv.org/abs/cs/0610043v1

Computer Science

Artificial Intelligence

7 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Farthest-Point Heuristic based Initialization Methods for K-Modes Clustering does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Farthest-Point Heuristic based Initialization Methods for K-Modes Clustering, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Farthest-Point Heuristic based Initialization Methods for K-Modes Clustering will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-342893