具有可操作约束的对称子模块聚类
Symmetric Submodular Clustering with Actionable Constraint
摘要：
在过去的几年里，子模块函数的聚类一直很受关注。对称子模函数是特别感兴趣的，因为最小化它们是显著更有效的，并且它们包括许多在实践中常用的函数，即图切割，互信息。在本文中，我们提出了一种新的约束，使集群可操作的动机是跨多个领域的应用程序，并提出了执行对称子模块聚类受此约束的问题。我们看到，获得近似保证的$k$分区是一个重要的任务，需要进一步的工作。
英文摘要：
Clustering with submodular functions has been of interest over the last few years. Symmetric submodular functions are of particular interest as minimizing them is significantly more efficient and they include many commonly used functions in practice viz. graph cuts, mutual information. In this paper, we propose a novel constraint to make clustering actionable which is motivated by applications across multiple domains, and pose the problem of performing symmetric submodular clustering subject to this constraint. We see that obtaining a $k$ partition with approximation guarantees is a non-trivial task requiring further work.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
