این سایت در حال حاضر پشتیبانی نمی شود و امکان دارد داده های نشریات بروز نباشند
Iranian Journal of Fuzzy Systems، جلد ۱۰، شماره ۳، صفحات ۱-۲۰
عنوان فارسی ON FUZZY NEIGHBORHOOD BASED CLUSTERING ALGORITHM WITH LOW COMPLEXITY
چکیده فارسی مقاله 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 meth-
ods. 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 im-
proving the FJP algorithm, we propose a novel Modi ed FJP algorithm, which
theoretically runs approximately n= log2 n times faster and which is less com-
plex than the FJP algorithm. We evaluated the performance of the Modi ed
FJP algorithm both analytically and experimentally.
کلیدواژه‌های فارسی مقاله Clustering، Fuzzy neighborhood relation، Complexity، Modi ed FJP،
عنوان انگلیسی ON FUZZY NEIGHBORHOOD BASED CLUSTERING ALGORITHM WITH LOW COMPLEXITY
چکیده انگلیسی مقاله 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 meth-
ods. 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 im-
proving the FJP algorithm, we propose a novel Modi ed FJP algorithm, which
theoretically runs approximately n= log2 n times faster and which is less com-
plex than the FJP algorithm. We evaluated the performance of the Modi ed
FJP algorithm both analytically and experimentally.
کلیدواژه‌های انگلیسی مقاله Clustering, Fuzzy neighborhood relation, Complexity, Modi ed FJP
نویسندگان مقاله Gozde Ulutagay |
Department of Industrial Engineering, Izmir University, Gursel Aksel Blv 14, Uckuyular, Izmir, Turkey

Efendi Nasibov |
Department of Computer Science, Dokuz Eylul University, Izmir, 35160, Turkey, Institute of Cybernetics, Azerbaijan National Academy of Sciences, Azerbaijan

نشانی اینترنتی http://ijfs.usb.ac.ir/article_806_29d29dbb033397c08126e891f30d1646.pdf
فایل مقاله فایلی برای مقاله ذخیره نشده است
کد مقاله (doi)
زبان مقاله منتشر شده en
موضوعات مقاله منتشر شده
نوع مقاله منتشر شده
برگشت به: صفحه اول پایگاه   |   نسخه مرتبط   |   نشریه مرتبط   |   فهرست نشریات