CoNMI {bikm1}

CoNMI function for agreement between co-clustering partitions

Description

Produce a measure of agreement between two pairs of partitions for co-clustering. A value of 1 means a perfect match.

Usage

CoNMI(v,w,vprime,wprime)

Arguments

v

numeric vector specifying the class of rows.

w

numeric vector specifying the class of columns.

vprime

numeric vector specifying another partition of rows.

wprime

numeric vector specifying another partition of columns.

Value

the value of the index.

References

Robert, Vasseur and Brault. Comparing high dimensional partitions with the Co-clustering Adjusted Rand Index, Journal of Classification (2021).

Examples

require(bikm1)
J=200
K=120
h=3
l=2
theta=list()
theta$rho_h=1/h *matrix(1,h,1)
theta$tau_l=1/l *matrix(1,l,1)
theta$gamma_hl=matrix(c(1, 6,4, 1, 7, 1),ncol=2)
data=PoissonBlocRnd(J,K,theta)
res=BIKM1_LBM_Poisson(data$x,4,4,4,init_choice='smallVBayes')
me=CoNMI(res@model_max$v,res@model_max$w, data$xrow,data$xcol)
me