English(EN) Double-Bounded Nonlinear Optimal Transport for Size Constrained Min Cut Clusterin

新的传输方法提高了最小割聚类的性能

作者 PulseAugur 编辑部 · [1 个来源] · 2026-09-03 04:00

研究人员通过将其重新表述为双有界非线性最优传输问题，引入了一种新的最小割聚类方法。这种新方法称为 DNF，利用 Frank-Wolfe 算法，并证明了对于具有 Lipschitz 光滑性的凸问题，其收敛速度为 O(1/t)。当应用于尺寸约束最小割聚类时，DNF 在多个基准数据集和指标上取得了与现有方法相当甚至更优的性能。 AI

影响引入了一种新颖的算法方法，可以提高各种机器学习聚类任务的性能。

排序理由关于聚类新算法的学术论文。[lever_c_demoted from research: ic=1 ai=1.0]

在 arXiv cs.LG 阅读 →

AI 生成摘要 · Google Gemini · 来自 1 个来源。我们如何撰写摘要 →

本文如何被排名

Signal score: 22 / 100; Composite score across the factors below. Higher = stronger signal that this story matters right now.
Newsworthiness bucket: Tool; 关于聚类新算法的学术论文。[lever_c_demoted from research: ic=1 ai=1.0]
Source corroboration: Single-source cluster; Only one publisher covered this so far. Single-source stories can still rank when the publisher is high-authority, but they lack cross-source corroboration.
Topics: paper, other; Editorial topic classification. Feeds into how the story surfaces on /topic/<slug> hub pages and into the per-entity coverage mix.
AI-industry relevance: High; Clearly on-topic for AI-industry coverage.
Story freshness: Breaking (< 6h); Fresh story with cross-source coverage still developing. Ranking may shift as more sources report.

完整方法见我们的编辑标准。

报道来源 [1]

arXiv cs.LG TIER_1 English(EN) · Fangyuan Xie, Jinghui Yuan, Feiping Nie, Xuelong Li · 2026-09-03 04:00

双边界非线性最优输运用于尺寸约束最小割聚类

arXiv:2501.18143v2 Announce Type: replace Abstract: Min cut is an important graph partitioning method. However, current solutions to the min cut problem suffer from slow speeds, difficulty in solving, and often converge to simple solutions. To address these issues, we relax the m…

本文如何被排名

报道来源 [1]

双边界非线性最优输运用于尺寸约束最小割聚类

相关实体

相关话题