twomoons

A famous shape data set containing two clusters with two moons shapes and
outliers

datasets

Provide the 'CrossClustering' algorithm (Tellaroli et al.
(2016) <doi:10.1371/journal.pone.0152333>), which is a partial
clustering algorithm that combines the Ward's minimum variance and
Complete Linkage algorithms, providing automatic estimation of a
suitable number of clusters and identification of outlier elements.

Paola Tellaroli

CrossClustering

A Partial Clustering Algorithm

Marco Bazzi

Michele Donato

Livio Finos

Philippe Courcoux

Corrado Lanera

twomoons function

A data frame with 52 rows and 3 variables:
<dl>
<dt><code>x</code></dt>
<dd>num</dd>
 x coordinates
<dt><code>y</code></dt>
<dd>num</dd>
 y coordinates.
<dt><code>clusters</code></dt>
<dd>integer</dd>
 cluster membership (outliers
classified as 3rd cluster).</dl>

Format

A famous shape data set containing two clusters with two moons shapes and
outliers — twomoons

A data frame with 52 rows and 3 variables:
<dl>
<dt><code>x</code></dt>
<dd>num</dd>
 x coordinates
<dt><code>y</code></dt>
<dd>num</dd>
 y coordinates.
<dt><code>clusters</code></dt>
<dd>integer</dd>
 cluster membership (outliers
classified as 3rd cluster).

</dl>

twomoons: A famous shape data set containing two clusters with two moons shapes and outliers

Description

Usage

Arguments

Format