computes the AGNES coefficient of a graph structure.
1 2 
agnesCoef(A)

A 

The input of the AGNES hierarchical algorithm is the dissimilarity matrix of the graph structure A
computed by graphCorr
. Then the R function agnes
is used to calculate the coefficient.
AGNES coefficient magnitude for the given graph structure.
Caballe, Adria <a.caballe@sms.ed.ac.uk>, Natalia Bochkina and Claus Mayer.
Rousseeuw, P., A. Struyf, and M. Hubert (2013). cluster: Cluster Analysis Basics and Extensions.
lambdaSelection
for lambda selection approaches.
1 2 3 4 5 6 7 8  EX1 < pcorSimulator(nobs = 50, nclusters = 2, nnodesxcluster = c(40,30),
pattern = "powerLaw")
y < EX1$y
out3 < huge(y, method = "mb", lambda = 0.4)
PATH < out3$path[[1]]
hm < agnesCoef(PATH)

Questions? Problems? Suggestions? Tweet to @rdrrHQ or email at ian@mutexlabs.com.
All documentation is copyright its authors; we didn't write any of that.