Non-negative sparse Laplacian regularized latent multi-view subspace clustering. (July 2021)

• Record Type: Journal Article
• Authors: You, Cong-Zhe; Shu, Zhen-Qiu; Fan, Hong-Hui
• Is Part Of: Journal of algorithms & computational technology. Volume 15(2021)
• Publication Date: 2021-07
• Subjects: Multi-view subspace clustering -- latent representation -- graph regularization -- Laplacian matrix; Computer algorithms -- Periodicals; Numerical calculations -- Periodicals; Computer algorithms; Numerical calculations; Periodicals; 518.1
• DOI: 10.1177/17483026211024904
• Languages: English
• ISSNs: 1748-3018

Abstract

Recently, in the area of artificial intelligence and machine learning, subspace clustering of multi-view data is a research hotspot. The goal is to divide data samples from different sources into different groups. We proposed a new subspace clustering method for multi-view data which termed as Non-negative Sparse Laplacian regularized Latent Multi-view Subspace Clustering (NSL2MSC) in this paper. The method proposed in this paper learns the latent space representation of multi view data samples, and performs the data reconstruction on the latent space. The algorithm can cluster data in the latent representation space and use the relationship of different views. However, the traditional representation-based method does not consider the non-linear geometry inside the data, and may lose the local and similar information between the data in the learning process. By using the graph regularization method, we can not only capture the global low dimensional structural features of data, but also fully capture the nonlinear geometric structure information of data. The experimental results show that the proposed method is effective and its performance is better than most of the existing alternatives.