Multistarts-class

Multistarts

An S4 class to represent a greedy algorithm with multiple start (extends <code>Alg-class</code> class).

An ensemble of algorithms that enable the clustering of networks and data matrices (such as counts, categorical or continuous) with different type of generative models. Model selection and clustering is performed in combination by optimizing the Integrated Classification Likelihood (which is equivalent to minimizing the description length). Several models are available such as: Stochastic Block Model, degree corrected Stochastic Block Model, Mixtures of Multinomial, Latent Block Model. The optimization is performed thanks to a combination of greedy local search and a genetic algorithm (see <arXiv:2002:11577> for more details).

Etienne C<c3><b4>me

greed

Clustering and Model Selection with the Integrated
Classification Likelihood

Etienne Côme

Nicolas Jouvin

Multistarts-class function

<dl><dt>nb_start</dt>
<dd>number of random starts (default to 10)</dd></dl>

Arguments

<ul>
<li><code>Multistarts</code>: Multistarts algorithm class constructor</li>
</ul>

Functions

<dl>
<dt><code>nb_start</code></dt>
<dd>number of random starts (default to 10)</dd></dl>

Slots

Greedy algorithm with multiple start class — Multistarts-class

<dl>

<dt>nb_start</dt>
<dd>number of random starts (default to 10)</dd>

</dl>

<dl>
<dt><code>nb_start</code></dt>
<dd>number of random starts (default to 10)</dd>


</dl>

Multistarts-class: Greedy algorithm with multiple start class

Description

Usage

Value

Arguments

Functions

Slots

Examples