permuteZEst: Optimal matching between 2 clusterings

In ppsbm: Clustering in Longitudinal Networks

Description

Compute the permutation of the rows of hat.z that has to be applied to obtain the "same order" as z. Compute optimal matching between 2 clusterings using Hungarian algorithm

Usage

permuteZEst(z, hat.z)

Arguments

z	Matrice of size Q \times n
hat.z	Matrice of size Q \times n

References

HUBERT, L. & ARABIE, P. (1985). Comparing partitions. J. Classif. 2, 193<e2><80><93>218.

MATIAS, C., REBAFKA, T. & VILLERS, F. (2018). A semiparametric extension of the stochastic block model for longitudinal networks. Biometrika.

Examples

z <- matrix(c(1,1,0,0,0,0, 0,0,1,1,0,0, 0,0,0,0,1,1), nrow = 3, byrow = TRUE)
hat.z <- matrix(c(0,0,1,1,0,0, 1,1,0,0,0,0, 0,0,0,0,1,1), nrow = 3, byrow = TRUE)

perm <- permuteZEst(z,hat.z)

ppsbm documentation built on May 1, 2019, 11:26 p.m.