BriefGPT.xyz
Aug, 2013
图的极小狄利克雷能分割
Minimal Dirichlet energy partitions for graphs
HTML
PDF
Braxton Osting, Chris D. White, Edouard Oudet
TL;DR
本论文提出了一种基于Dirichlet特征值的非凸图划分目标函数， 并设计了一种新颖的重排算法来达到最优， 可应用于几个聚类问题并拓展至半监督， 在合成数据、MNIST手写数字和流形离散化图上都取得了有效结果。
Abstract
Motivated by a geometric problem, we introduce a new
non-convex graph partitioning
objective where the optimality criterion is given by the sum of the
dirichlet eigenvalues
of the partition components. A relaxed
→