Skip to content
naulon

Not checkedNot checked for notices yet.

ABARC: An agent-based rough sets clustering algorithm

Radu D. Găceanu, Arnold Szederjesi-Dragomir, Horia F. Pop and 1 more

Intelligent Systems with Applications · 2022

doi:10.1016/j.iswa.2022.200117 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

Clustering is an important task in pattern recognition with many applications in natural sciences and healthcare. However, in practical scenarios, it is often the case that the data cannot be easily separated into well distinguished groups for several reasons like: the shape of clusters, the presence of outliers, or the overlapping clusters problem (instances that may belong to more than one cluster). In order to handle such issues, we propose an agglomerative clustering approach which identifies instances that may belong to more than one cluster and clearly separates the outliers form the rest of the instances by integrating concepts from rough sets theory. The whole grouping and regrouping process is driven by software agents executing in parallel. Our approach is computational friendly and experiments on standard data sets indicate its advantages.

Abstract licence: CC BY-NC

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.