基于Lagrange对偶的高效半定谱聚类
Efficient Semidefinite Spectral Clustering via Lagrange Duality
摘要:
提出了一种有效的半定谱聚类(SSC)方法,该方法利用半正定谱(p.s.d.)谱聚类的约束。与原有的基于Frobenius范数近似的算法相比,该算法通过考虑p.s.d.约束。在本文中,SSC制定为一个半定规划(SDP)问题。为了解决SDP的高计算复杂性问题,提出了一种基于Lagrange对偶形式化的对偶算法。提出了两种算法:一种是占用内存少的算法,另一种是收敛速度快的算法。该算法具有较低的时间复杂度比标准的基于邻域点的SDP求解器。在UCI数据集和真实图像数据集上的实验结果表明:1)与现有的谱聚类方法相比,该算法具有更好的聚类性能; 2)与标准的邻域点SDP算法相比,该算法具有更高的效率,可以解决更大规模的SSC问题.
英文摘要:
We propose an efficient approach to semidefinite spectral clustering (SSC), which addresses the Frobenius normalization with the positive semidefinite (p.s.d.) constraint for spectral clustering. Compared with the original Frobenius norm approximation based algorithm, the proposed algorithm can more accurately find the closest doubly stochastic approximation to the affinity matrix by considering the p.s.d. constraint. In this paper, SSC is formulated as a semidefinite programming (SDP) problem. In order to solve the high computational complexity of SDP, we present a dual algorithm based on the Lagrange dual formalization. Two versions of the proposed algorithm are proffered: one with less memory usage and the other with faster convergence rate. The proposed algorithm has much lower time complexity than that of the standard interior-point based SDP solvers. Experimental results on both UCI data sets and real-world image data sets demonstrate that 1) compared with the state-of-the-art spectral clustering methods, the proposed algorithm achieves better clustering performance; and 2) our algorithm is much more efficient and can solve larger-scale SSC problems than those standard interior-point SDP solvers.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。