Categorical Data Clustering with Automatic Selection of Cluster Number

  • Liao H
  • Ng M
N/ACitations
Citations of this article
15Readers
Mendeley users who have this article in their library.

Abstract

In this paper, we investigate the problem of determining the number of clusters in the k-modes based categorical data clustering process. We propose a new categorical data clustering algorithm with automatic selection of k. The new algorithm extends the k-modes clustering algorithm by introducing a penalty term to the objective function to make more clusters compete for objects. In the new objective function, we employ a regularization parameter to control the number of clusters in a clustering process. Instead of finding k directly, we choose a suitable value of regularization parameter such that the corresponding clustering result is the most stable one among all the generated clustering results. Experimental results on synthetic data sets and the real data sets are used to demonstrate the effectiveness of the proposed algorithm.

Cite

CITATION STYLE

APA

Liao, H., & Ng, M. K. (2009). Categorical Data Clustering with Automatic Selection of Cluster Number. Fuzzy Information and Engineering, 1(1), 5–25. https://doi.org/10.1007/s12543-009-0001-5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free