-
I need to implement new graph algorithms like HITS or Louvain method for community detection.
1. According to you, would such features fit inside the graph model, or should they rather stay out in plu…
-
given the embedded graph, cluster the vertices, possibly hooking in to a scalable clustering code, such as kmeans++ or kmeans||
eventually, we will want to consider hooking in to something like mclus…
jovo updated
10 years ago
-
However, it is not clear to me how much is gained with this approach. Poisot only uses one method to detect the module configuration (Louvain 2008) and one method to calculate the modularity (Newman &…
-
The louvaine community detection algorithm
https://sites.google.com/site/findcommunities/
scales better than the fast/greedy and avoids supercommunities
---
Imported from Launchpad using lp2gh.
- da…
-
If someone feels inclined, there are a _lot_ of journals published by "frontiers in" all using the same citation style that we have as "frontiers":
they're all here
http://www.frontiersin.org/about/j…
-
I have some doubts about the modularity optimisation algorithm that is currently used.
In the wiki, it is stated to be the Louvain algorithm, but the results provided by Gephi often produce lower qua…