View source: R/ADPclustering.R
ADPclustering | R Documentation |
The algorithm was introduced in [Rodriguez/Laio, 2014] and here implemented by [Wang/Xu, 2017]. The algorithm is adaptive in the sense that only ClusterNo
has to be set instead of the paramters of [Rodriguez/Laio, 2014] implemented in ADPclustering
.
ADPclustering(Data,ClusterNo=NULL,PlotIt=FALSE,...)
Data |
[1:n,1:d] matrix of dataset to be clustered. It consists of n cases of d-dimensional data points. Every case has d attributes, variables or features. |
ClusterNo |
Optional, either: A number k which defines k different Clusters to be build by the algorithm, or a range of |
PlotIt |
default: FALSE, If TRUE plots the first three dimensions of the dataset with colored three-dimensional data points defined by the clustering stored in |
... |
Further arguments to be set for the clustering algorithm, if not set, default arguments are used. |
The ADP algorithm decides the k number of clusters. This is contrary to the other version of the algorithm from another package which can be called with DensityPeakClustering
.
List of
Cls |
[1:n] numerical vector with n numbers defining the classification as the main output of the clustering algorithm. It has k unique numbers representing the arbitrary labels of the clustering. |
Object |
Object defined by clustering algorithm as the other output of this algorithm |
Michael Thrun
[Rodriguez/Laio, 2014] Rodriguez, A., & Laio, A.: Clustering by fast search and find of density peaks, Science, Vol. 344(6191), pp. 1492-1496. 2014.
[Wang/Xu, 2017] Wang, X.-F., & Xu, Y.: Fast clustering using adaptive density peak detection, Statistical methods in medical research, Vol. 26(6), pp. 2800-2811. 2017.
DensityPeakClustering
adpclust
data('Hepta')
out=ADPclustering(Hepta$Data,PlotIt=FALSE)
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.