Efficient Multi-View Clustering via Unified and Discrete Bipartite Graph Learning

Although previous graph-based multi-view clustering (MVC) algorithms have gained significant progress, most of them are still faced with three limitations. First, they often suffer from high computational complexity, which restricts their applications in large-scale scenarios. Second, they usually p...

Full description

Bibliographic Details

Published in:	IEEE transaction on neural networks and learning systems Vol. 35; no. 8; pp. 11436 - 11447
Main Authors:	Fang, Si-Guo, Huang, Dong, Cai, Xiao-Sha, Wang, Chang-Dong, He, Chaobo, Tang, Yong
Format:	Journal Article
Language:	English
Published:	United States IEEE 01.08.2024
Subjects:	Bipartite graph Bipartite graph learning Clustering algorithms data clustering Fuses Laplace equations large-scale clustering Linear programming linear time multi-view clustering (MVC) Optimization Partitioning algorithms
ISSN:	2162-237X, 2162-2388, 2162-2388
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!