no code implementations • 24 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.
no code implementations • 24 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.