K-ANMI: A Mutual Information Based Clustering Algorithm for Categorical Data

Details K-ANMI: A Mutual Information Based Clustering Algorithm for Categorical Data K-ANMI: A Mutual Information Based Clustering Algorithm for Categorical Data

2005-11-03

arxiv.org/abs/cs/0511013v1

Computer Science

Artificial Intelligence

18 pages

Scientific paper

Clustering categorical data is an integral part of data mining and has attracted much attention recently. In this paper, we present k-ANMI, a new efficient algorithm for clustering categorical data. The k-ANMI algorithm works in a way that is similar to the popular k-means algorithm, and the goodness of clustering in each step is evaluated using a mutual information based criterion (namely, Average Normalized Mutual Information-ANMI) borrowed from cluster ensemble. Experimental results on real datasets show that k-ANMI algorithm is competitive with those state-of-art categorical data clustering algorithms with respect to clustering accuracy.

Affiliated with

Also associated with

No associations

Rating

K-ANMI: A Mutual Information Based Clustering Algorithm for Categorical Data 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 K-ANMI: A Mutual Information Based Clustering Algorithm for Categorical Data, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and K-ANMI: A Mutual Information Based Clustering Algorithm for Categorical Data will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-482681