Graph Coarsening

A Fast Normalized Cut with Automated Constraints via Graph Coarsening

Prof. Young Ju Lee, Department of Mathematics, Texas State University

Oct 11, 15:30 - 17:00

B1 L3 R3119

Normalized Cut Graph Coarsening

We present a new constrained K-way data clustering algorithm based on Normalized Cut by Shi and Malik. A novelty in our algorithm lies in selecting constraints automatically from the data by using a multiscale coarsening algorithm.