prune_zero_tail

Given a diagonal matrix which is supposed to have no non-zero entry in
the diagonal after the first one (if any) the function returns the
diagonal (sub-)matrix without the columns and the row corresponding to
the zero-entries in the diagonal (if any).

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

prune_zero_tail function

<dl><dt>diag_mat</dt>
<dd>a diagonal matrix which must satisfy the following
property: in the diagonal, every element after a zero is a zero.</dd></dl>

Arguments

Prune tail made of zeros — prune_zero_tail

<dl>

<dt>diag_mat</dt>
<dd>a diagonal matrix which must satisfy the following
property: in the diagonal, every element after a zero is a zero.</dd>

</dl>

prune_zero_tail: Prune tail made of zeros

Description

Usage

Value

Arguments

Examples