Description Usage Arguments Value Examples
Node clustering and multiple change points detection on a dynamic graph.
1 2 3 |
Gnu |
A (3 x Nb.events) matrix. The first row contains the ordered interaction times, the second row the source nodes, the third row the destination nodes. Currently, only undirected interactions are taken into account. Thus, for each interaction time, the source node is stricly smaller than the destination node. No self loops allowed. |
kmin |
A positive integer. The minimum number of clusters the BIC criterion will look for. |
kmax |
A positive integer. The maximum number of clusters the BIC criterion will look for. |
eps |
A small double. When the difference between two consecutive values of the variational lower bound is smaller than eps, the VEM algorithm stops. |
iter.vem |
An integer. The maximum number of iterations the VEM algorithm will perform. |
N_initializations |
An Integer. The number of different k-means initialisations to adopt. |
MinimalPartition |
A Boolean. If TRUE (the default), the algorithm will look for change points among the time points in the first row of Gnu. |
custom_partition |
A regular user defined partition. It is ignored if MinimalPartition is TRUE. |
verbose |
A Boolean. |
est_K |
An integer representing the detected number of clusters. |
est_z |
An integer vector of length N (the number of nodes). The i-th entry of est_z is the estimated cluster of node i. |
est_D |
An integer representing the detected number of segments. |
est_cp |
A vector of doubles containing the D estimated change points (the last entry is equal to the last point of the partition). |
est_Lbd |
A (K x K x D) tensor. Its entries are the estimated non-homogeneous Poisson intensities. |
est_pi |
A vector of length K containing the estimated mixing proportions. |
1 2 3 4 5 6 7 |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.