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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEEE transaction on neural networks and learning systems Jg. 35; H. 8; S. 11436 - 11447
Hauptverfasser:	Fang, Si-Guo, Huang, Dong, Cai, Xiao-Sha, Wang, Chang-Dong, He, Chaobo, Tang, Yong
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	United States IEEE 01.08.2024
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!