arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1605.08490cs.SIcs.DS
收藏

一种简单的强局部流切割改进方法

A Simple and Strongly-Local Flow-Based Method for Cut Improvement

Nate Veldt, David F. Gleich, Michael W. Mahoney

摘要:

许多基于图的学习问题可以被转换为在种子集附近找到一组好的顶点,并且这些问题的强大方法是基于最大流的。我们介绍和分析了一种新的方法,局部偏置的基于图的学习称为SimpleLocal,它发现了良好的电导切割附近的一组种子顶点。我们算法的一个重要特征是它是强局部的,这意味着它不需要探索整个图来找到局部最优的切割。该方法解决了与现有的基于强局部流的方法相同的目标,但它实现了简单的实现。我们还展示了它是如何通过一个隐式的L1-范数惩罚项实现本地化的。作为一种基于流的方法,我们的算法在切割最优性和准确识别图中的目标区域方面具有几个优势。我们通过基于MRI扫描的4.67亿边缘图解决问题来展示SimpleLocal的强大功能。

英文摘要:

Many graph-based learning problems can be cast as finding a good set of vertices nearby a seed set, and a powerful methodology for these problems is based on maximum flows. We introduce and analyze a new method for locally-biased graph-based learning called SimpleLocal, which finds good conductance cuts near a set of seed vertices. An important feature of our algorithm is that it is strongly-local, meaning it does not need to explore the entire graph to find cuts that are locally 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 L1-norm penalty term. As a flow-based method, our algorithm exhibits several ad- vantages 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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑