Skip to main content
Presentation
The "Best K" for Entropy-based Categorical Data Clustering
Kno.e.sis Publications
  • Keke Chen, Wright State University - Main Campus
  • Ling Liu
Document Type
Presentation
Publication Date
1-1-2005
Abstract
With the growing demand on cluster analysis for categorical data, a handful of categorical clustering algorithms have been developed. Surprisingly, to our knowledge, none has satisfactorily addressed the important problem for categorical clustering – how can we determine the best K number of clusters for a categorical dataset? Since categorical data does not have the inherent distance function as the similarity measure, traditional cluster validation techniques based on the geometry shape and density distribution cannot be applied to answer this question. In this paper, we investigate the entropy property of the categorical data and propose a BkPlot method for determining a set of candidate “best Ks”. This method is implemented with a hierarchical clustering algorithm ACE. The experimental results show that our approach can effectively identify the significant clustering structures.
Comments

This paper was presented at the Scientific and Statistical Database Management Conference (SSDBM05), Santa Barbara, CA, June 2005.

Citation Information
Keke Chen and Ling Liu. "The "Best K" for Entropy-based Categorical Data Clustering" (2005)
Available at: http://works.bepress.com/keke_chen/16/