Estimating the Optimal Number of Clusters in Categorical Data Clustering by Silhouette Coefficient
The problem of estimating the number of clusters (say k) is one of the major challenges for the partitional clustering. This paper proposes an algorithm named k-SCC to estimate the optimal k in categorical data clustering. For the clustering step, the algorithm uses the kernel density estimation approach to define cluster centers. In addition, it uses an information-theoretic based dissimilarity to measure the distance between centers and objects in each cluster. The silhouette analysis based approach is then used to evaluate the quality of different clustering obtained in the former step to choose the best k. Comparative experiments were conducted on both synthetic and real datasets to compare the performance of k-SCC with three other algorithms. Experimental results show that k-SCC outperforms the compared algorithms in determining the number of clusters for each dataset.
Code (0)
등록된 구현이 없습니다.
Tasks
Categorical data clusteringClusteringDensity EstimationSimilar Papers 제목 키워드 기반
Significance-Based Categorical Data Clustering
Although numerous algorithms have been proposed to solve the categorical data clustering problem, how to access the statistical significance of a set of categorical clusters remains unaddressed. To fulfill this void, we …
Categorical data clusteringClusteringGALILEO: A Generalized Low-Entropy Mixture Model
We present a new method of generating mixture models for data with categorical attributes. The keys to this approach are an entropy-based density metric in categorical space and annealing of high-entropy/low-density comp…
ClusteringmodelRobust Categorical Data Clustering Guided by Multi-Granular Competitive Learning
Data set composed of categorical features is very common in big data analysis tasks. Since categorical features are usually with a limited number of qualitative possible values, the nested granular cluster effect is prev…
A Visual Quality Index for Fuzzy C-Means
Cluster analysis is widely used in the areas of machine learning and data mining. Fuzzy clustering is a particular method that considers that a data point can belong to more than one cluster. Fuzzy clustering helps obtai…
ClusteringText CategorizationA Hash-based Co-Clustering Algorithm for Categorical Data
Many real-life data are described by categorical attributes without a pre-classification. A common data mining method used to extract information from this type of data is clustering. This method group together the sampl…
Clusteringfeature selection