BriefGPT.xyz
Feb, 2024
通过最优输运实现任意尺寸约束的图割
Graph Cuts with Arbitrary Size Constraints Through Optimal Transport
HTML
PDF
Chakib Fettal, Lazhar Labiod, Mohamed Nadif
TL;DR
通过提出一种基于正则化Gromov-Wasserstein问题的加速近端梯度下降算法,我们解决了图切割问题,并实现了稀疏解,相较于经典谱聚类算法,额外的复杂度仅为O(log(n)),但效率更高。
Abstract
A common way of partitioning graphs is through
minimum cuts
. One drawback of classical minimum cut methods is that they tend to produce small groups, which is why more
balanced variants
such as normalized and rat
→