compare(comm1, comm2, method = c("vi", "nmi", "split.join", "rand",
"adjusted.rand"))
communities
object containing a community
structure; or a numeric vector, the membership vector of the first community
structure. The membership vector should contain the community id of each
vertex, communities
object containing a community
structure; or a numeric vector, the membership vector of the second
community structure, in the same format as for the previous argument.Danon L, Diaz-Guilera A, Duch J, Arenas A: Comparing community structure identification. J Stat Mech P09008, 2005.
van Dongen S: Performance criteria for graph clustering and Markov cluster experiments. Technical Report INS-R0012, National Research Institute for Mathematics and Computer Science in the Netherlands, Amsterdam, May 2000.
Rand WM: Objective criteria for the evaluation of clustering methods. J Am Stat Assoc 66(336):846-850, 1971.
Hubert L and Arabie P: Comparing partitions. Journal of Classification 2:193-218, 1985.
cluster_walktrap
,
cluster_edge_betweenness
,
cluster_fast_greedy
, cluster_spinglass
for
various community detection methods.g <- make_graph("Zachary")
sg <- cluster_spinglass(g)
le <- cluster_leading_eigen(g)
compare(sg, le, method="rand")
compare(membership(sg), membership(le))
Run the code above in your browser using DataLab