Abstract

Many graph-based learning problems can be cast as finding a good set of vertices nearby a seed se and a powerful methodology for these problems is based on maximum flows. We introduce and analyze a new method for locally-biased graphbased learning called SimpleLocal, which finds good conductance cuts near a set of seed vertices. An important feature of our algorithm is that it i strongly-local, meaning it does not need to explore the entire graph to find cuts that are local optimal. This method solves the same objective as existing strongly-local flow-based methods, but it enables a simple implementation. We also show how it achieves localization through an implicit -norm penalty term. As a flowbased method, our algorithm exhibits several advantages in terms of cut optimality and accurate identification of target regions in a graph. We demonstrate the power of SimpleLocal by solving problems on a 467 million edge graph based on an MRI scan.