Hi igraph community, I'm trying to identify a good distance (similarity / dissimilarity) measure for discovered VertexDendrogram and VertexClustering communities
I have a few guesses / ideas: In the case of hierarchical detection, i'm imagining i can use the hierarchy to ID similarity, how far up the Dendrogram do i have to go to merge two communities, something like that ? In the case of VertexClustering, i'm imagine something like the cluster_graph method, examine inter-community connections, but return a weighted graph instead ... Curious if someone can point me in the right direction Thanks much.. Timmy Wilson _______________________________________________ igraph-help mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/igraph-help
