arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2108.06734cs.LG
收藏

有效且高效的多视图聚类图学习方法

Effective and Efficient Graph Learning for Multi-view Clustering

Xidian University(西安电子科技大学);Shenzhen Institute of Information Technology(深圳信息职业技术学院);Chongqing University of Posts and Telecommunications(重庆邮电大学);University of Sydney(悉尼大学)

Quanxue Gao, Wei Xia, Xinbo Gao, Xiangdong Zhang, Qin Li, Dacheng Tao

AI总结:

针对现有基于图的多视图聚类方法在时间开销、后处理及秩近似方面的不足,提出一种基于二部图和张量Schatten p-范数的图学习模型,实现高效且直接聚类,实验优于现有方法。

摘要:

尽管现有的基于图的多视图聚类方法在表征数据与簇结构之间的关系方面具有令人印象深刻的聚类性能和效率,但它们仍存在以下缺点。由于图的构建和拉普拉斯矩阵的特征分解,它们承受着昂贵的时间负担,并且无法探索大规模数据的簇结构。此外,它们需要后处理才能获得最终聚类,导致性能次优。此外,学习到的视图共识图的秩无法逼近目标秩。在本文中,受二部图的启发,我们提出了一种有效且高效的多视图聚类图学习模型。具体而言,我们的方法通过最小化张量Schatten p-范数来利用不同视图图之间的视图相似性,该范数很好地表征了不同视图图中嵌入的空间结构和互补信息。我们通过自适应加权策略和连通性约束学习视图共识图,使得连通分量直接指示聚类。我们提出的算法节省时间,获得稳定的结果,并且随数据规模良好扩展。大量实验结果表明,我们的方法优于最先进的方法。

英文摘要:

Despite the impressive clustering performance and efficiency in characterizing both the relationship between data and cluster structure, existing graph-based multi-view clustering methods still have the following drawbacks. They suffer from the expensive time burden due to both the construction of graphs and eigen-decomposition of Laplacian matrix, and fail to explore the cluster structure of large-scale data. Moreover, they require a post-processing to get the final clustering, resulting in suboptimal performance. Furthermore, rank of the learned view-consensus graph cannot approximate the target rank. In this paper, drawing the inspiration from the bipartite graph, we propose an effective and efficient graph learning model for multi-view clustering. Specifically, our method exploits the view-similar between graphs of different views by the minimization of tensor Schatten p-norm, which well characterizes both the spatial structure and complementary information embedded in graphs of different views. We learn view-consensus graph with adaptively weighted strategy and connectivity constraint such that the connected components indicates clusters directly. Our proposed algorithm is time-economical and obtains the stable results and scales well with the data size. Extensive experimental results indicate that our method is superior to state-of-the-art methods.

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

↑