# Anil Damle : Robust and efficient multi-way spectral clustering

A common question arising in the study of graphs is how to partition nodes into well-connected clusters. One standard methodology is known as spectral clustering and utilizes an eigenvector embedding as a staring point for clustering the nodes. Given that embedding, we present a new algorithm for spectral clustering based on a column-pivoted QR factorization. Our method is simple to implement, direct, scalable, and requires no initial guess. We also provide theoretical justification for our algorithm and experimentally demonstrate that its performance tracks recent information theoretic bounds for exact recovery in the stochastic block model. Algorithmically, the origins of this work are in methods for building a localized basis for Kohn-Sham orbitals, and we briefly discuss those connections.

**Category**: Applied Math and Analysis**Duration**: 01:34:38**Date**: October 31, 2016 at 4:25 PM**Views**: 119-
**Tags:**seminar, Applied Math And Analysis Seminar

## 0 Comments