A multicluster approach to selecting initial sets for clustering of categorical data

Aim/Purpose This article proposes a methodology for selecting the initial sets for clustering categorical data. The main idea is to combine all the different values of every single criterion or attribute, to form the first proposal of the so-called multiclus-ters, obtaining in this way the maximum number of clusters for the whole da-taset. The multiclusters thus obtained, are themselves clustered in a second step, according to the desired final number of clusters. Background Popular cluster methods for categorical data, such as the well-known K-Modes, usually select the initial sets by means of some random process. This fact intro-duces some randomness in the final results of the algorithms. We explore a dif-ferent application of the clustering methodology for categorical data that over-comes the instability problems and ultimately provides a greater clustering effi-ciency. Methodology For assessing the performance of the proposed algorithm and its comparison with K-Modes, we apply both of them to categorical databases where the re-sponse variable is known but not used in the analysis. In our examples, that re-sponse variable can be identified to the real clusters or classes to which the ob-servations belong. With every data set, we perform a two-step analysis. In the first step we perform the clustering analysis on data where the response variable (the real clusters) has been omitted, and in the second step we use that omitted information to check the efficiency of the clustering algorithm (by comparing the real clusters to those given by the algorithm). Contribution Simplicity, efficiency and stability are the main advantages of the multicluster method. Findings The experimental results attained with real databases show that the multicluster algorithm has greater precision and a better grouping effect than the classical K-modes algorithm. Recommendations for Practitioners The method can be useful for those researchers working with small and me-dium size datasets, allowing them to detect the underlying structure of the data in an intuitive and reasonable way. Recommendations for Researchers The proposed algorithm is slower than K-Modes, since it devotes a lot of time to the calculation of the initial combinations of attributes. The reduction of the computing time is therefore an important research topic. Future Research We are concerned with the scalability of the algorithm to large and complex data sets, as well as the application to mixed data sets with both quantitative and qualitative attributes. © 2020 Informing Science Institute. All rights reserved.