cc_test_ari_permutation

A permutation test for testing the null hypothesis of
random agreement (i.e., adjusted Rand Index equal to 0) between
two partitions.

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

cc_test_ari_permutation function

<dl><dt>ground_truth</dt>
<dd>(int) A vector of the actual membership of elements
in clusters</dd>
<dt>partition</dt>
<dd>The partition coming from a clustering algorithm</dd></dl>

Arguments

Paola Tellaroli, &lt;paola <code>dot</code> tellaroli <code>at</code> unipd <code>dot</code> it&gt;;
Livio Finos, &lt;livio <code>dot</code> finos <code>at</code> unipd <code>dot</code> it&gt;

Author

A permutation test for testing the null hypothesis of
random agreement (i.e., adjusted Rand Index equal to 0) between
two partitions. — cc_test_ari_permutation

<dl>

<dt>ground_truth</dt>
<dd>(int) A vector of the actual membership of elements
in clusters</dd>


<dt>partition</dt>
<dd>The partition coming from a clustering algorithm</dd>

</dl>

cc_test_ari_permutation: A permutation test for testing the null hypothesis of random agreement (i.e., adjusted Rand Index equal to 0) between two partitions.

Description

Usage

Value

Arguments

Author

References

Examples