On fuzzy neighborhood based clustering algorithm with low complexity
Makaleler > Tam Makale · 2013
Yazarlar: Gözde ULUTAGAY, Efendi Nasibov
Iranian Journal of Fuzzy Systems, SCI Expanded İndekslerine Giren Dergi, Uluslararası, Scopus, 2013, cilt 10, ss 1-20
Özet
The main purpose of this paper is to achieve improvement in the speed of Fuzzy Joint Points (FJP) algorithm. Since FJP approach is a basis for fuzzy neighborhood based clustering algorithms such as Noise-Robust FJP (NRFJP) and Fuzzy Neighborhood DBSCAN (FN-DBSCAN), improving FJP algorithm would an important achievement in terms of these FJP-based methods. Although FJP has many advantages such as robustness, auto detection of the optimal number of clusters by using cluster validity, independency from scale, etc., it is a little bit slow. In order to eliminate this disadvantage, by improving the FJP algorithm, we propose a novel Modified FJP algorithm, which theoretically runs approximately n/ log2 n times faster and which is less complex than the FJP algorithm. We evaluated the performance of the Modified FJP algorithm both analytically and experimentally.