Rough set based information theoretic approach for clustering uncertain categorical data

• Published in: PloS one 2022-05, Vol.17 (5), p.e0265190-e0265190
• Main Authors: Uddin, Jamal, Ghazali, Rozaida, H Abawajy, Jemal, Shah, Habib, Husaini, Noor Aida, Zeb, Asim
• Format: Article
• Language: English
• Subjects: Accuracy; Algorithms; Approximation; Archives & records; Biology and Life Sciences; Cluster Analysis; Clustering; Complexity; Computer and Information Sciences; Computer applications; Data analysis; Data mining; Datasets; Decision making; Entropy; Fuzzy sets; Information management; Information systems; Information theory; Methods; Physical Sciences; Purity; Research and Analysis Methods; Set theory; Uncertainty
• ISSN: 1932-6203; 1932-6203
• DOI: 10.1371/journal.pone.0265190

Many real applications such as businesses and health generate large categorical datasets with uncertainty. A fundamental task is to efficiently discover hidden and non-trivial patterns from such large uncertain categorical datasets. Since the exact value of an attribute is often unknown in uncertain categorical datasets, conventional clustering analysis algorithms do not provide a suitable means for dealing with categorical data, uncertainty, and stability. The ability of decision making in the presence of vagueness and uncertainty in data can be handled using Rough Set Theory. Though, recent categorical clustering techniques based on Rough Set Theory help but they suffer from low accuracy, high computational complexity, and generalizability especially on data sets where they sometimes fail or hardly select their best clustering attribute. The main objective of this research is to propose a new information theoretic based Rough Purity Approach (RPA). Another objective of this work is to handle the problems of traditional Rough Set Theory based categorical clustering techniques. Hence, the ultimate goal is to cluster uncertain categorical datasets efficiently in terms of the performance, generalizability and computational complexity. The RPA takes into consideration information-theoretic attribute purity of the categorical-valued information systems. Several extensive experiments are conducted to evaluate the efficiency of RPA using a real Supplier Base Management (SBM) and six benchmark UCI datasets. The proposed RPA is also compared with several recent categorical data clustering techniques. The experimental results show that RPA outperforms the baseline algorithms. The significant percentage improvement with respect to time (66.70%), iterations (83.13%), purity (10.53%), entropy (14%), and accuracy (12.15%) as well as Rough Accuracy of clusters show that RPA is suitable for practical usage. We conclude that as compared to other techniques, the attribute purity of categorical-valued information systems can better cluster the data. Hence, RPA technique can be recommended for large scale clustering in multiple domains and its performance can be enhanced for further research.