A possibilistic fuzzy Gath-Geva clustering algorithm using the exponential distance
| Autor: | Tingfei Zhang, Wu Bin, Haoxiang Zhou, Xiaohong Wu |
|---|---|
| Rok vydání: | 2021 |
| Předmět: |
Covariance matrix
business.industry Computer science General Engineering Probabilistic logic Pattern recognition Fuzzy logic Computer Science Applications Exponential function Constraint (information theory) Euclidean distance Artificial Intelligence Artificial intelligence Noise (video) Cluster analysis business |
| Zdroj: | Expert Systems with Applications. 184:115550 |
| ISSN: | 0957-4174 |
| DOI: | 10.1016/j.eswa.2021.115550 |
| Popis: | As a famous clustering algorithm, Gath-Geva (GG) clustering has been widely applied in many fields. Unlike fuzzy c-means (FCM) clustering, GG clustering uses the exponential distance with the fuzzy covariance matrix instead of Euclidean distance to cluster hyperellipsoidal data accurately. Due to the existence of probabilistic constraint, GG clustering is sensitive to noise data. For possibilistic fuzzy c-means (PFCM), the type of clustering data limits its application. To solve the noise sensitivity problem of GG clustering and extend PFCM for clustering hyperellipsoidal data, a possibilistic fuzzy Gath-Geva (PFGG) clustering algorithm is proposed. The PFGG clustering is derived from GG clustering in combination with PFCM clustering. FCM, GG, PFCM and PFGG are run on the several datasets to compare their clustering results. The experimental results show that the performance of PFGG is significantly better than the other clustering algorithms. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect