Abstract
In this article, a new data-driven autonomous fuzzy clustering (AFC) algorithm is proposed for static data clustering. Employing a Gaussian-type membership function, AFC first uses all the data samples as microcluster medoids to assign memberships to each other and obtains the membership matrix. Based on this, AFC chooses these data samples that represent local models of data distribution as cluster medoids for initial partition. It then continues to optimize the cluster medoids iteratively to obtain a locally optimal partition as the algorithm output. Moreover, an online extension is introduced to AFC enabling the algorithm to cluster streaming data chunk-by-chunk in a 'one pass' manner. Numerical examples based on a variety of benchmark problems demonstrate the efficacy of the AFC algorithm in both offline and online application scenarios, proving the effectiveness and validity of the proposed concept and general principles.
Original language | English |
---|---|
Pages (from-to) | 2073-2085 |
Number of pages | 13 |
Journal | IEEE Transactions on Fuzzy Systems |
Volume | 30 |
Issue number | 6 |
Early online date | 20 Apr 2021 |
DOIs | |
Publication status | Published - 01 Jun 2022 |
Externally published | Yes |
Keywords
- Clustering algorithms
- Partitioning algorithms
- Kernel
- Linear programming
- Data models
- Nickel
- Data mining
- Data driven
- fuzzy clustering
- locally optimal partition
- medoids
- pattern recognition
- ALGORITHM
- SELECTION