GANC: Greedy Agglomerative Normalized Cut

@article{Tabatabaei2011GANCGA,
  title={GANC: Greedy Agglomerative Normalized Cut},
  author={Seyed Salim Tabatabaei and Mark Coates and Michael G. Rabbat},
  journal={CoRR},
  year={2011},
  volume={abs/1105.0974}
}
This paper describes a graph clustering algorithm that aims to minimize the normalized cut criterion and has a model order selection procedure. The performance of the proposed algorithm is comparable to spectral approaches in terms of minimizing normalized cut. However, unlike spectral approaches, the proposed algorithm scales to graphs with millions of nodes and edges. The algorithm consists of three components that are processed sequentially: a greedy agglomerative hierarchical clustering… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-9 OF 9 CITATIONS

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…