ALGORITHM

algorithm

Algorithm

An algorithm mainly defines how vertices and/or communities are processed,
when criterion is applyed (quality measurements occur) and what happens 
to the communities depending on the value of the quality obtained.

datasets

Used for evolving network analysis regarding
community detection. Implements several algorithms that calculate communities
for graphs whose nodes and edges change over time.
Edges, which can have new nodes, can be added or deleted. Changes in the
communities are calculated without recalculating communities for the entire
graph.
REFERENCE: M. Cordeiro et al. (2016) <DOI:10.1007/s13278-016-0325-1>
G. Rossetti et al. (2017) <DOI:10.1007/s10994-016-5582-8>
G. Rossetti (2017) <DOI:10.1093/comnet/cnx016>
R. Sarmento (2019) <arXiv:1904.12593>.

Rui Sarmento

DynComm

Dynamic Network Communities Detection and Generation

Rui P. Sarmento

Lu<c3><ad>s Lemos

M<c3><a1>rio Cordeiro

Giulio Rossetti

ALGORITHM function

A named list with the names of the available algorithms:<dl class="dl-horizontal">
 <dt>LOUVAIN</dt><dd>is a greedy optimization method to extract communities from large networks 
 by optimizing the density of edges inside communities to edges outside 
 communities. 
 See <code><a rd-options="" href="/link/ALGORITHM_LOUVAIN?package=DynComm&version=2020.1.6" data-mini-rdoc="DynComm::ALGORITHM_LOUVAIN">ALGORITHM_LOUVAIN</a></code>
 @references cordeiro2016dynamicDynComm</dd>
 </dl>

Format

List of available algorithms. — ALGORITHM

A named list with the names of the available algorithms:<dl class='dl-horizontal'>
 <dt>LOUVAIN</dt><dd>is a greedy optimization method to extract communities from large networks 
 by optimizing the density of edges inside communities to edges outside 
 communities. 
 See <code><a rd-options='' href='ALGORITHM_LOUVAIN'>ALGORITHM_LOUVAIN</a></code>
 @references cordeiro2016dynamicDynComm</dd>
 </dl>

ALGORITHM: List of available algorithms.

Description

Usage

Arguments

Format

See Also

Examples