arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1709.01212cs.CV
收藏

基于结构化低秩矩阵分解的多视图谱聚类

Multi-View Spectral Clustering via Structured Low-Rank Matrix Factorization

The University of New South Wales(新南威尔士大学);The University of Queensland(昆士兰大学)

Yang Wang, Lin Wu

摘要:

多视图数据聚类比单视图数据聚类更受关注,因为多视图特征空间中的多个独立和互补信息的利用优于单视图。多视图谱聚类的目的是通过寻求特征值-特征向量分解,在局部流形结构上得到数据划分一致性。然而,正如我们所观察到的,这种经典范式仍然存在以下问题:(1)忽略了灵活的局部流形结构,这是由(2)在所有视图之间强制执行低秩数据相关性协议引起的;更糟糕的是,(3)LRR在捕捉潜在数据聚类结构方面并不直观灵活。在本文中,我们提出了结构化LRR分解成潜在的低维数据集群表示,其特征在于每个视图的数据聚类结构。在这种表示上,(b)拉普拉斯正则化子被施加为能够为每个视图保持灵活的局部流形结构。(c)我们提出了一种迭代多视图一致性策略,通过在优化过程的每次迭代期间最小化所有因子化潜在数据集群表示之间的分歧目标,其中来自每个视图的这种潜在表示用于调节来自其他视图的潜在表示,这种直观的过程迭代协调所有视图都是令人满意的。(d)我们注意到,这样的数据聚类表示可以灵活地编码的数据聚类结构,从任何角度与自适应的输入聚类数。为此,(e)通过有效的交替最小化策略,提出了一种新的非凸目标函数。最后给出了算法的复杂性分析。对真实世界的多视图数据集进行了大量的实验,证明了其优越性。

英文摘要:

Multi-view data clustering attracts more attention than their single view counterparts due to the fact that leveraging multiple independent and complementary information from multi-view feature spaces outperforms the single one. Multi-view Spectral Clustering aims at yielding the data partition agreement over their local manifold structures by seeking eigenvalue-eigenvector decompositions. However, as we observed, such classical paradigm still suffers from (1) overlooking the flexible local manifold structure, caused by (2) enforcing the low-rank data correlation agreement among all views; worse still, (3) LRR is not intuitively flexible to capture the latent data clustering structures. In this paper, we present the structured LRR by factorizing into the latent low-dimensional data-cluster representations, which characterize the data clustering structure for each view. Upon such representation, (b) the laplacian regularizer is imposed to be capable of preserving the flexible local manifold structure for each view. (c) We present an iterative multi-view agreement strategy by minimizing the divergence objective among all factorized latent data-cluster representations during each iteration of optimization process, where such latent representation from each view serves to regulate those from other views, such intuitive process iteratively coordinates all views to be agreeable. (d) We remark that such data-cluster representation can flexibly encode the data clustering structure from any view with adaptive input cluster number. To this end, (e) a novel non-convex objective function is proposed via the efficient alternating minimization strategy. The complexity analysis are also presented. The extensive experiments conducted against the real-world multi-view datasets demonstrate the superiority over state-of-the-arts.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑