[Update 1] Louvain-Performance: Weights of Nonexistent Edges
Earlier, I wrote a post on how performance on weighted graphs uses a meaningful maximum M to account for the weights of nonexistent edges. At that time, my challenges were (1) figuring out how to calculate M, and (2) changing my…
Louvain Algorithm
At our meeting on 09/18/15, I presented the Louvain Algorithm as outlined in the paper “Fast unfolding of communities in large networks”. This method centers around optimizing modularity, which measures the density of the links inside of the communities as…
CNM Algorithm
At our meeting on 09/18/15, we discussed the two algorithms (Louvain and CNM) that we’ll be investigating this year. I presented on the CNM algorithm, as described in Clauset, Newman, and Moore’s paper “Finding community structure in very large networks.” Just…
Quality Metrics
Community quality metrics are measurements of how well communities are formed. Good metric values generally reflect networks where connections are denser within communities than between communities. We are getting ready to implement various quality metrics in the Louvain method, an…