Document Type
Article
Publication Date
Spring 2016
First Advisor
John K. McSweeney
Abstract
Graphs that represent data often have structures or characteristics that can represent some relationships in the data. One of these structures is clusters or community structures. Most clustering algorithms for graphs are deterministic, which means they will output the same clustering each time. We investigated a few stochastic algorithms, and look into the consistency of their clusterings.
Recommended Citation
Mulc, Thomas Vlado, "Variance of Clusterings on Graphs" (2016). Mathematical Sciences Technical Reports (MSTR). 164.
https://scholar.rose-hulman.edu/math_mstr/164