The higher-order correlation clustering problem is an expressive model, and recently, local search heuristics have been proposed for several applications. Certifying optimality, however, is NP-hard and practically hampered already by the complexity of the problem statement. Here, we focus on establishing partial optimality conditions for the special case of complete graphs and cubic objective functions. In addition, we define and implement algorithms for testing these conditions and examine their effect numerically, on two datasets.

翻译：高阶相关聚类问题是一种表达力丰富的模型，近期已有针对若干应用提出的局部搜索启发式算法。然而，验证最优性属于NP难问题，且实际上受到问题陈述本身复杂性的阻碍。本文聚焦于完全图与三次（cubic）目标函数这一特殊情形，建立了部分最优性条件。此外，我们定义并实现了用于检验这些条件的算法，并在两个数据集上对其效果进行了数值验证。