CRAN
kpeaks 0.1.0
Determination of K Using Peak Counts of Features for Clustering
Released Sep 19, 2017 by Zeynel Cebeci
The input argument k which is the number of clusters is needed to start all of the partitioning clustering algorithms. In unsupervised learning applications, an optimal value of this argument is widely determined by using the internal validity indexes. Since these indexes suggest a k value which is computed on the clustering results after several runs of a clustering algorithm they are computationally expensive. On the contrary, '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.
Installation
Maven
This package can be included as a dependency from a Java or Scala project by including
the following your project's pom.xml file.
Read more
about embedding Renjin in JVM-based projects.
<dependencies>
<dependency>
<groupId>org.renjin.cran</groupId>
<artifactId>kpeaks</artifactId>
<version>0.1.0-b10</version>
</dependency>
</dependencies>
<repositories>
<repository>
<id>bedatadriven</id>
<name>bedatadriven public repo</name>
<url>https://nexus.bedatadriven.com/content/groups/public/</url>
</repository>
</repositories>
Renjin CLI
If you're using Renjin from the command line, you load this library by invoking:
library('org.renjin.cran:kpeaks')
Test Results
This package was last tested against Renjin 0.9.2644 on Jun 1, 2018.