A Comprehensive Evaluation of Rough Sets Clustering in Uncertainty Driven Contexts
-
Published:2024-06-10
Issue:1
Volume:69
Page:41-56
-
ISSN:2065-9601
-
Container-title:Studia Universitatis Babeș-Bolyai Informatica
-
language:
-
Short-container-title:Studia UBB Informatica
Author:
, Szederjesi-Dragomir ArnoldORCID
Abstract
This paper presents a comprehensive evaluation of the Agent BAsed Rough sets Clustering (ABARC) algorithm, an approach using rough sets theory for clustering in environments characterized by uncertainty. Several experiments utilizing standard datasets are performed in order to compare ABARC against a range of supervised and unsupervised learning algorithms. This comparison considers various internal and external performance measures to evaluate the quality of clustering. The results highlight the ABARC algorithm’s capability to effectively manage vague data and outliers, showcasing its advantage in handling uncertainty in data. Furthermore, they also emphasize the importance of choosing appropriate performance metrics, especially when evaluating clustering algorithms in scenarios with unclear or inconsistent data.
Keywords: rough sets, clustering, metrics.
Publisher
Babes-Bolyai University Cluj-Napoca
Reference38 articles.
1. "1. Bachem, O., Lucic, M., Hassani, H., and Krause, A. Fast and provably good seedings for k-means. In Advances in Neural Information Processing Systems 29, D. D. Lee, M. Sugiyama, U. V. Luxburg, I. Guyon, and R. Garnett, Eds. Curran Associates, Inc., 2016, pp. 55-63. 2. 2. Bera, S., Giri, P. K., Jana, D. K., Basu, K., and Maiti, M. Multi-item 4d-tps under budget constraint using rough interval. Applied Soft Computing 71 (2018), 364 - 385. 3. 3. Bezdek, J. C., Ehrlich, R., and Full, W. FCM: The fuzzy c-means clustering algorithm. Computers & Geosciences 10, 2-3 (Jan. 1984), 191-203. 4. 4. Bharadwaj, A., and Ramanna, S. Categorizing relational facts from the web with fuzzy rough sets. Knowledge and Information Systems 61, 3 (Dec 2019), 1695-1713. 5. 5. Coy, S., Czumaj, A., and Mishra, G. On parallel k-center clustering. In Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures (New York, NY, USA, 2023), SPAA '23, Association for Computing Machinery, p. 65-75.
|
|