Shawn Biesan

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
In this paper, we present an optimized version of the previously developed Block Modularity algorithm (Anthony 2009). The original algorithm was a fast, greedy method that effectively discovered a structured clustering in linked data and scaled very well with the number of nodes and edges. The optimized version is scalable in terms of the model complexity ;(More)
  • 1