One-Stage Partition-Fusion Multi-view Subspace Clustering Algorithm

doi:10.3778/j.issn.1673-9418.2009070

Abstract

Abstract:

Multi-view subspace clustering has attracted increasing attention for revealing the inherent low-dimension structure of the data. Nevertheless, most existing methods directly fuse the multiple noisy affinity matrices from the original data, and commonly conduct clustering after obtaining a unified multi-view representation. Separating the representation learning from the clustering process can result in a suboptimal clustering result. To this end, this paper proposes a one-stage partition-fusion multi-view subspace clustering algorithm. Instead of directly fusing the noisy and redundant affinity matrices, this paper fuses the more discriminative partition-level information extracted from the affinity matrices. Moreover, this paper proposes a new framework, integrating representation learning, multiple information fusion and final clustering process. The three sub-processes promote each other to serve clustering best. The promising clustering results can lead to better representations and therefore better clustering performance. Consequently, this paper solves the resultant optimization problem through an alternative algorithm. Experiment results on four real-world benchmark datasets show the effectiveness and superior performance of the proposed method over the state-of-the-art approaches.

Key words: multi-view clustering, subspace clustering, data fusion, partition fusion

摘要：

多视图子空间聚类方法因其可以揭示数据内在的低维结构而被广泛关注，但大多数现有的多视图子空间聚类算法直接将多个来自原始数据的充满噪声的相似度矩阵进行融合，并且通常是在得到一致的多视图表示之后再使用[K]均值算法聚类得到最终的结果，这种将表示的学习过程和后续的聚类过程分离的两阶段算法会导致无法得到最优的聚类结果。为了解决这些问题，提出一种单步划分融合多视图子空间聚类算法。该算法不是直接融合具有噪声和冗余信息的相似度矩阵，而是从相似度矩阵中提取出更具有判别性信息的划分级信息进行融合。提出一个新的框架，将表示学习、多视图信息融合以及最后的聚类过程整合在同一框架中。这三个过程彼此促进，好的聚类结果可以引导生成更好的多视图表示，从而得到更好的聚类效果。提出一种有效的轮替优化算法来解决由此得到的优化问题。最后，在四个真实的基准数据集上得到的实验结果可以证明提出方法的有效性以及先进性。

关键词: 多视图聚类, 子空间聚类, 数据融合, 划分融合

ZHANG Pei, ZHU En, CAI Zhiping. One-Stage Partition-Fusion Multi-view Subspace Clustering Algorithm[J]. Journal of Frontiers of Computer Science and Technology, 2021, 15(12): 2413-2420.

张培, 祝恩, 蔡志平. 单步划分融合多视图子空间聚类算法[J]. 计算机科学与探索, 2021, 15(12): 2413-2420.

References

[1] YANG Y, WANG H. Multi-view clustering: a survey[J]. Big Data Mining and Analytics, 2018, 1(2): 83-107.
[2] HE X M. A survey of multi-view clustering algorithms[J]. Software Guide, 2019, 18(4): 79-81.
何雪梅. 多视图聚类算法综述[J]. 软件导刊, 2019, 18(4): 79-81.
[3] GÖNEN M, ALPAYDINl E. Multiple kernel learning algorithms[J]. Journal of Machine Learning Research, 2011, 64(12): 2211-2268.
[4] WANG H, YANG Y, LIU B. GMC: graph-based multi-view clustering[J]. IEEE Transactions on Knowledge and Data Engineering, 2020, 32(6): 1116-1129.
[5] GAO H C, NIE F P, LI X L, et al. Multi-view subspace clustering[C]//Proceedings of the 2015 IEEE International Conference on Computer Vision, Santiago, Dec 7-13, 2015. Washington: IEEE Computer Society, 2015: 4238-4246.
[6] HE M J. Research on the multi-view clustering algorithms based on NMF[D]. Chengdu: Southwest Jiaotong University, 2017.
何梦娇. 基于非负矩阵分解的多视图聚类研究[D]. 成都: 西南交通大学, 2017.
[7] HUANH S D. Research and application of matrix factorization algorithms for multi-source heterogeneous data[D]. Chengdu: University of Electronic Science and Technology of China, 2019.
黄树东. 面向多源异构数据的矩阵分解算法研究及应用[D]. 成都: 电子科技大学, 2019.
[8] FAN R D, HOU C P. Robust auto-weighted multi-view subspace clustering[J]. Journal of Frontiers of Computer Science and Technology, 2021, 15(6): 1062-1073.
范瑞东, 侯臣平. 鲁棒自加权的多视图子空间聚类[J]. 计算机科学与探索, 2021, 15(6): 1062-1073.
[9] LIU J H, WANG Y, HE X L. Improved multi-view subspace clustering with diversify driven[J]. Computer Era, 2020(9): 91-94.
刘金花, 王洋, 贺潇磊. 改进的多样性驱动的多视图子空间聚类算法[J]. 计算机时代, 2020(9): 91-94.
[10] GUO Y H. Convex subspace representation learning from multi-view data[C]//Proceedings of the 27th AAAI Conference on Artificial Intelligence, Bellevue, Jul 14-18, 2013. Menlo Park: AAAI, 2013: 387-393.
[11] BRBIC M, KOPRIVA I. Multi-view low-rank sparse subspace clustering[J]. Pattern Recognition, 2018, 73: 247-258.
[12] LI R H, ZHANG C Q, HU Q H, et al. Flexible multi-view representation learning for subspace clustering[C]//Proceedings of the 28th International Joint Conference on Artificial Intelligence, Macao, China, Aug 10-16, 2019: 2916-2922.
[13] ZHANG C Q, HU Q H, FU H Z, et al. Latent multi-view subspace clustering[C]//Proceedings of the 2017 IEEE Con-ference on Computer Vision and Pattern Recognition, Honolulu, Jul 21-26, 2017. Washington: IEEE Computer Society, 2017: 4333-4341.
[14] ELHAMIFAR E, VIDAL R. Sparse subspace clustering: algorithm, theory, and applications[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2013, 35(11): 2765-2781.
[15] MOHAR B. The Laplacian spectrum of graphs[M]//ALAVI Y, CHARTRAND G, OELLERMANN O R, eds. Graph Theory, Combinatorics and Applications. New York: John Wiley & Sons, Inc., 1991.
[16] FAN K. On a theorem of Weyl concerning eigenvalues of linear transformations I[J]. Proceedings of the National Academy of Sciences of the United States of America, 1949, 35(11): 652-655.
[17] NIE F P, WANG X Q, HUANG H, Clustering and projected clustering with adaptive neighbors[C]//Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, New York, Aug 24-27, 2014. New York: ACM, 2014: 977-986.
[18] KUMAR A, RAI P, DAUME H. Co-regularized multi-view spectral clustering[C]//Proceedings of the 25th Annual Con-ference on Neural Information Processing Systems, Granada, Dec 12-14, 2011. Red Hook: Curran Associates, 2011: 1413- 1421.
[19] CAI X, NIE F P, HUANG H. Multi-view K-means clustering on big data[C]//Proceedings of the 23rd International Joint Conference on Artificial Intelligence, Beijing, Aug 3-9, 2013. Menlo Park: AAAI, 2013: 2598-2604.
[20] KANG Z, GUO Z P, HUANG S D, et al. Multiple partitions aligned clustering[C]//Proceedings of the 28th International Joint Conference on Artificial Intelligence, Macao, China, Aug 10-16, 2019: 2701-2707.