Finding number of clusters in single-step with similarity-based information-theoretic algorithm
Küçük Resim Yok
Tarih
2014
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Inst Engineering Technology-Iet
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
A single-step algorithm is presented to find the number of clusters in a dataset. An almost two-valued function called cluster-boundary indicator is introduced with the use of similarity-based information-theoretic sample entropy and probability descriptions. This function finds inter-cluster boundary samples for cluster availability in a single iteration. Experiments with synthetic and anonymous real datasets show that the new algorithm outperforms its major counterparts statistically in terms of time complexity and the number of clusters found successfully.
Açıklama
Anahtar Kelimeler
computational complexity, entropy, pattern clustering, probability, statistical analysis, single-step algorithm, two-valued function, cluster-boundary indicator, probability descriptions, intercluster boundary, cluster availability, synthetic data sets, real data sets, statistical analysis, time complexity, similarity-based information-theoretic sample entropy
Kaynak
Electronics Letters
WoS Q Değeri
Q3
Scopus Q Değeri
Q3
Cilt
50
Sayı
1
