contingency_to_membership_vectors

Given a contingency table, obtains a possible pair of corresponding labelings.
That is, element M[i,j] is the number of elements that belong to community i
in the first labeling and j in the second.

Evaluates the stability and significance of clusters on 'igraph' graphs.
Supports weighted and unweighted graphs. Implements the cluster evaluation methods
defined by Arratia A, Renedo M (2021) <doi:10.7717/peerj-cs.600>. Also includes an
implementation of the Reduced Mutual Information introduced by Newman et al. (2020)
<doi:10.1103/PhysRevE.101.042304>.

Martc3<ad> Mirambell

clustAnalytics

Cluster Evaluation on Graphs

contingency_to_membership_vectors function

<dl><dt>M</dt>
<dd>the contingency table</dd></dl>

Arguments

Computes possible membership vectors from contingency table — contingency_to_membership_vectors

<dl>

<dt>M</dt>
<dd>the contingency table</dd>

</dl>

contingency_to_membership_vectors: Computes possible membership vectors from contingency table

Description

Usage

Value

Arguments