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

大规模多视图谱聚类的引导式协同训练

Guided Co-training for Large-Scale Multi-View Spectral Clustering

Institute of Information Science, Academia Sinica(中央研究院资讯科学研究所)

Tyng-Luh Liu

摘要:

在许多现实世界的应用程序中,我们可以访问数据的多个视图,每个视图都从不同的方面表征数据。几个以前的算法已经证明,一个可以实现更好的聚类准确性,适当地整合信息,从所有的意见,而不是只使用一个单独的视图。由于谱聚类的有效性,许多多视图聚类方法都是基于谱聚类的,但由于谱聚类的高计算复杂性,这些方法对大规模数据的适用性有限。在这项工作中,我们提出了一种新的大规模数据的多视图谱聚类方法。我们的方法是在指导共同训练计划下构建的,以融合不同的视图,并使用采样技术来加速谱聚类。更具体地,我们首先选择$p$($\ll n$)标志点,然后相应地近似特征分解。增强视图,这是必不可少的指导共同训练过程,然后可以快速确定我们的方法。所提出的算法与给定数据的数量呈线性关系。大量的实验已经进行,结果支持我们的方法处理大规模的多视图的情况下的优势。

英文摘要:

In many real-world applications, we have access to multiple views of the data, each of which characterizes the data from a distinct aspect. Several previous algorithms have demonstrated that one can achieve better clustering accuracy by integrating information from all views appropriately than using only an individual view. Owing to the effectiveness of spectral clustering, many multi-view clustering methods are based on it. Unfortunately, they have limited applicability to large-scale data due to the high computational complexity of spectral clustering. In this work, we propose a novel multi-view spectral clustering method for large-scale data. Our approach is structured under the guided co-training scheme to fuse distinct views, and uses the sampling technique to accelerate spectral clustering. More specifically, we first select $p$ ($\ll n$) landmark points and then approximate the eigen-decomposition accordingly. The augmented view, which is essential to guided co-training process, can then be quickly determined by our method. The proposed algorithm scales linearly with the number of given data. Extensive experiments have been performed and the results support the advantage of our method for handling the large-scale multi-view situation.

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

↑