Louvain-Performance: Weights of Nonexistent Edges
One of the tricky things about calculating performance is that it factors in nonexistent edges between vertices in different communities. The more of these edges exist, the higher the overall performance score, because they count as correctly-interpreted edges. That is, since the two…
10/26/15 Meeting
In today’s meeting, we went over our progress over the last couple weeks: Those of us who did not know C++ before this semester have now learned the language. We have all studied and understood our individual metrics (Anastasia – silhouette;…
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…