2009 Ninth IEEE International Conference on Data Mining (2009)
Dec. 6, 2009 to Dec. 9, 2009
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDM.2009.118
Clustering categorical data faces two challenges, one is lacking of inherent similarity measure, and the other is that the clusters are prone to being embedded in different subspace. In this paper, we propose the first divisive hierarchical clustering algorithm for categorical data. The algorithm, which is based on Multiple Correspondence Analysis (MCA), is systematic, efficient and effective. In our algorithm, MCA plays an important role in analyzing the data globally. The proposed algorithm has five merits. First, our algorithm yields a dendrogram representing nested groupings of patterns and similarity levels at different granularities. Second, it is parameter-free, fully automatic and, most importantly, requires no assumption regarding the number of clusters. Third, it is independent of the order in which the data are processed. Forth, it is scalable to large data sets; and finally, using the novel data representation and Chi-square distance measures makes our algorithm capable of seamlessly discovering the clusters embedded in the subspaces. Experiments on both synthetic and real data demonstrate the superior performance of our algorithm.
Clustering, Categorical Data, MCA, Divisive Hierarchical
E. Monga, S. Wang, A. Mayers and T. Xiong, "A New MCA-Based Divisive Hierarchical Algorithm for Clustering Categorical Data," 2009 Ninth IEEE International Conference on Data Mining(ICDM), Miami, Florida, 2009, pp. 1058-1063.