In:
PLOS ONE, Public Library of Science (PLoS), Vol. 17, No. 5 ( 2022-5-13), p. e0265190-
Abstract:
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. Problem statement 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. Objectives 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. Methods 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. Results 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. Conclusion 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.
Type of Medium:
Online Resource
ISSN:
1932-6203
DOI:
10.1371/journal.pone.0265190
DOI:
10.1371/journal.pone.0265190.g001
DOI:
10.1371/journal.pone.0265190.g002
DOI:
10.1371/journal.pone.0265190.t001
DOI:
10.1371/journal.pone.0265190.t002
DOI:
10.1371/journal.pone.0265190.t003
DOI:
10.1371/journal.pone.0265190.t004
DOI:
10.1371/journal.pone.0265190.t005
DOI:
10.1371/journal.pone.0265190.t006
DOI:
10.1371/journal.pone.0265190.t007
DOI:
10.1371/journal.pone.0265190.t008
DOI:
10.1371/journal.pone.0265190.t009
DOI:
10.1371/journal.pone.0265190.t010
DOI:
10.1371/journal.pone.0265190.t011
DOI:
10.1371/journal.pone.0265190.t012
DOI:
10.1371/journal.pone.0265190.t013
DOI:
10.1371/journal.pone.0265190.t014
DOI:
10.1371/journal.pone.0265190.t015
DOI:
10.1371/journal.pone.0265190.t016
DOI:
10.1371/journal.pone.0265190.t017
DOI:
10.1371/journal.pone.0265190.t018
DOI:
10.1371/journal.pone.0265190.t019
DOI:
10.1371/journal.pone.0265190.s001
DOI:
10.1371/journal.pone.0265190.r001
DOI:
10.1371/journal.pone.0265190.r002
DOI:
10.1371/journal.pone.0265190.r003
DOI:
10.1371/journal.pone.0265190.r004
Language:
English
Publisher:
Public Library of Science (PLoS)
Publication Date:
2022
detail.hit.zdb_id:
2267670-3
Permalink