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.
- Version1.1.0
- R versionunknown
- LicenseGPL-2
- LicenseGPL-3
- Needs compilation?No
- kpeaks citation info
- Last release02/08/2020
Documentation
Team
Zeynel Cebeci
Cagatay Cebeci
Show author detailsRolesAuthor
Insights
Last 30 days
Last 365 days
The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.
Data provided by CRAN
Binaries
Dependencies
- Reverse Imports1 package