Multi-view Latent Subspace Clustering based on both Global and Local Structure

Zhou Honghan, Cai Weiling, Xu Le, Yang Ming
Proceedings of The 13th Asian Conference on Machine Learning, PMLR 157:1617-1632, 2021.

Abstract

Most existing multi-view clustering methods focus on the global structure or local structure among samples, and few methods focus on the two structures at the same time. In this paper, we propose a Multi-view Latent subspace Clustering based on both Global and Local structure (MLCGL). In this method, a latent embedding representation is learned by exploring the complementary information from different views. In the latent space, not only the global reconstruction relationship but also the local geometric structure among the latent variables are discovered. In this way, a unified affinity graph matrix is constructed in the latent space for different views, which indicates a clear between-class relationship. Meanwhile, a rank constraint is introduced on the Laplacian graph to facilitate the division of samples into the required clusters. In MLCGL, the affinity graph also provides positive feedback to optimize the learned latent representation and contribute to divided it into reasonable clusters. Moreover, we present an alternating iterative optimization scheme to optimize objective functions. Compared with the state-of-art algorithms, MLCGL has achieved excellent experimental performance on several real-world datasets.

Cite this Paper

BibTeX
@InProceedings{pmlr-v157-honghan21a, title = {Multi-view Latent Subspace Clustering based on both Global and Local Structure}, author = {Honghan, Zhou and Weiling, Cai and Le, Xu and Ming, Yang}, booktitle = {Proceedings of The 13th Asian Conference on Machine Learning}, pages = {1617--1632}, year = {2021}, editor = {Balasubramanian, Vineeth N. and Tsang, Ivor}, volume = {157}, series = {Proceedings of Machine Learning Research}, month = {17--19 Nov}, publisher = {PMLR}, pdf = {https://proceedings.mlr.press/v157/honghan21a/honghan21a.pdf}, url = {https://proceedings.mlr.press/v157/honghan21a.html}, abstract = {Most existing multi-view clustering methods focus on the global structure or local structure among samples, and few methods focus on the two structures at the same time. In this paper, we propose a Multi-view Latent subspace Clustering based on both Global and Local structure (MLCGL). In this method, a latent embedding representation is learned by exploring the complementary information from different views. In the latent space, not only the global reconstruction relationship but also the local geometric structure among the latent variables are discovered. In this way, a unified affinity graph matrix is constructed in the latent space for different views, which indicates a clear between-class relationship. Meanwhile, a rank constraint is introduced on the Laplacian graph to facilitate the division of samples into the required clusters. In MLCGL, the affinity graph also provides positive feedback to optimize the learned latent representation and contribute to divided it into reasonable clusters. Moreover, we present an alternating iterative optimization scheme to optimize objective functions. Compared with the state-of-art algorithms, MLCGL has achieved excellent experimental performance on several real-world datasets.} }
Endnote
%0 Conference Paper %T Multi-view Latent Subspace Clustering based on both Global and Local Structure %A Zhou Honghan %A Cai Weiling %A Xu Le %A Yang Ming %B Proceedings of The 13th Asian Conference on Machine Learning %C Proceedings of Machine Learning Research %D 2021 %E Vineeth N. Balasubramanian %E Ivor Tsang %F pmlr-v157-honghan21a %I PMLR %P 1617--1632 %U https://proceedings.mlr.press/v157/honghan21a.html %V 157 %X Most existing multi-view clustering methods focus on the global structure or local structure among samples, and few methods focus on the two structures at the same time. In this paper, we propose a Multi-view Latent subspace Clustering based on both Global and Local structure (MLCGL). In this method, a latent embedding representation is learned by exploring the complementary information from different views. In the latent space, not only the global reconstruction relationship but also the local geometric structure among the latent variables are discovered. In this way, a unified affinity graph matrix is constructed in the latent space for different views, which indicates a clear between-class relationship. Meanwhile, a rank constraint is introduced on the Laplacian graph to facilitate the division of samples into the required clusters. In MLCGL, the affinity graph also provides positive feedback to optimize the learned latent representation and contribute to divided it into reasonable clusters. Moreover, we present an alternating iterative optimization scheme to optimize objective functions. Compared with the state-of-art algorithms, MLCGL has achieved excellent experimental performance on several real-world datasets.
APA
Honghan, Z., Weiling, C., Le, X. & Ming, Y.. (2021). Multi-view Latent Subspace Clustering based on both Global and Local Structure. Proceedings of The 13th Asian Conference on Machine Learning, in Proceedings of Machine Learning Research 157:1617-1632 Available from https://proceedings.mlr.press/v157/honghan21a.html.

Related Material