Poster Proposals
We recently submitted our research to the Tapia conference and to the Southern California Celebration of Women in Computing conference! Here are our proposals: Tapia Poster Proposal SoCal CWIC Talk Proposal
Clusterings on Football Graph
We’ve begun testing Louvain-silhouette and Louvain-performance on a test suite of thirty-six networks from the Stanford Large Network Dataset Collection and The University of Florida Sparse Matrix Collection. One of our initial tests was on the football graph, which models American…
[Update 2] Louvain-Performance and Self-Loops
Since I decided not to modify the performance metric to account for self-loops, we are left with a Louvain-performance algorithm that always arrives at a very unhelpful “best” clustering: put all of the nodes in the same community. Luckily, the nature…
[Update 1] Louvain-Performance and Self-Loops
For background, please see my earlier post. Recall that we sometimes want the presence of self-loops to be stronger than inter-community links. That is, despite the weight of some inter-community edge (e_1, e_2), the presence of heavy self-loops (e_1, e_1) and (e_2,…
Louvain Method Based on the Silhouette Index Metric
Anastasia and I recently finished implementing the Louvain algorithm based on the silhouette index (SI) metric. This post discusses our process. For a full implementation of any metric in the Louvain algorithm, the algorithm must be able to calculate the…
Louvain-Performance and Self-Loops
In phase 2 of each pass, the Louvain algorithm creates a collapsed version G’ of the current clustering G. Nodes in a community C in G are represented as a single vertex V_c in G’. Information about the weights of…