clustered

clustered.densityCluster

This function checks whether <code>findClusters()</code> has been performed on
the given object and returns a boolean depending on the outcome

An improved implementation (based on k-nearest neighbors) of
the density peak clustering algorithm, originally described by Alex
Rodriguez and Alessandro Laio (Science, 2014 vol. 344). It can handle large
datasets (> 100,000 samples) very efficiently. It was initially implemented
by Thomas Lin Pedersen, with inputs from Sean Hughes and later improved by
Xiaojie Qiu to handle large datasets with kNNs.

Thomas Pedersen

densityClust

Clustering by Fast Search and Find of Density Peaks

Thomas Lin Pedersen

Sean Hughes

Xiaojie Qiu

clustered function

<dl><dt>x</dt>
<dd>A densityCluster object</dd></dl>

Arguments

Check whether a densityCluster object have been clustered — clustered

<dl>

<dt>x</dt>
<dd>A densityCluster object</dd>

</dl>

clustered: Check whether a densityCluster object have been clustered

Description

Usage

Value

Arguments