kpeaks: Determination of K Using Peak Counts of Features for Clustering

The number of clusters (k) is needed to start all the partitioning clustering algorithms. An optimal value of this input argument is widely determined by using some internal validity indices. Since most of the existing internal indices suggest a k value which is computed from the clustering results after several runs of a clustering algorithm they are computationally expensive. On the contrary, the package 'kpeaks' enables to estimate k before running any clustering algorithm. It is based on a simple novel technique using the descriptive statistics of peak counts of the features in a data set.

Version: 1.1.0
Depends: R (≥ 3.3.0)
Imports: graphics, stats, utils, methods
Published: 2020-02-08
Author: Zeynel Cebeci [aut, cre], Cagatay Cebeci [aut]
Maintainer: Zeynel Cebeci <zcebeci at cukurova.edu.tr>
License: GPL-2 | GPL-3 [expanded from: GPL (≥ 2)]
NeedsCompilation: no
Citation: kpeaks citation info
Materials: NEWS
CRAN checks: kpeaks results

Downloads:

Reference manual: kpeaks.pdf
Package source: kpeaks_1.1.0.tar.gz
Windows binaries: r-devel: kpeaks_1.1.0.zip, r-devel-gcc8: kpeaks_1.1.0.zip, r-release: kpeaks_1.1.0.zip, r-oldrel: kpeaks_1.1.0.zip
OS X binaries: r-release: kpeaks_1.1.0.tgz, r-oldrel: kpeaks_1.1.0.tgz
Old sources: kpeaks archive

Reverse dependencies:

Reverse imports: inaparc

Linking:

Please use the canonical form https://CRAN.R-project.org/package=kpeaks to link to this page.