Temel, Turgay2021-03-202021-03-2020140013-51941350-911Xhttp://doi.org/10.1049/el.2013.3362https://hdl.handle.net/20.500.12885/1219A 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.eninfo:eu-repo/semantics/closedAccesscomputational complexityentropypattern clusteringprobabilitystatistical analysissingle-step algorithmtwo-valued functioncluster-boundary indicatorprobability descriptionsintercluster boundarycluster availabilitysynthetic data setsreal data setsstatistical analysistime complexitysimilarity-based information-theoretic sample entropyArticle10.1049/el.2013.336250129U34WOS:000328703900012Q3Q3