Loading...

A fuzzy clustering algorithm for finding arbitrary shaped clusters

Soleymani Baghshah, M ; Sharif University of Technology | 2008

314 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/AICCSA.2008.4493587
  3. Publisher: 2008
  4. Abstract:
  5. Until now, many algorithms have been introduced for finding arbitrary shaped clusters, but none of these algorithms is able to identify all sorts of cluster shapes and structures that are encountered in practice. Furthermore, the time complexity of the existing algorithms is usually high and applying them on large dataseis is time-consuming. In this paper, a novel fast clustering algorithm is proposed. This algorithm distinguishes clusters of different shapes using a twostage clustering approach. In the first stage, the data points are grouped into a relatively large number of fuzzy ellipsoidal sub-clusters. Then, connections between sub-clusters are established according to the Bhatiacharya distances and final clusters are formed from the resulted graph of sub-clusters in the second stage. Experimental results show the ability of the proposed algorithm for finding clusters of different shapes. ©2008 IEEE
  6. Keywords:
  7. Algorithms ; Chlorine compounds ; Cluster analysis ; Computer applications ; Computer systems ; Flow of solids ; Fuzzy clustering ; Optimal control systems ; Clustering approach ; Data points ; Fuzzy clustering algorithms ; International conferences ; Sub-clusters ; Time complexities ; Clustering algorithms
  8. Source: 6th IEEE/ACS International Conference on Computer Systems and Applications, AICCSA 2008, Doha, 31 March 2008 through 4 April 2008 ; 2008 , Pages 559-566 ; 9781424419685 (ISBN)
  9. URL: https://ieeexplore.ieee.org/document/4493587