Search Results for author: Geoffrey Sanders

Found 2 papers, 0 papers with code

Scaling Graph Clustering with Distributed Sketches

no code implementations24 Jul 2020 Benjamin W. Priest, Alec Dunton, Geoffrey Sanders

The unsupervised learning of community structure, in particular the partitioning vertices into clusters or communities, is a canonical and well-studied problem in exploratory graph analysis.

Clustering Graph Clustering +1

An Ensemble Framework for Detecting Community Changes in Dynamic Networks

no code implementations24 Jul 2017 Timothy La Fond, Geoffrey Sanders, Christine Klymko, Van Emden Henson

In order to represent dynamic networks with evolving communities it is essential to use a dynamic model rather than a static one.

Clustering Stochastic Block Model

Cannot find the paper you are looking for? You can Submit a new open access paper.