Fast Parameter-Free Multi-View Subspace Clustering With Consensus Anchor Guidance

Multi-view subspace clustering has attracted intensive attention to effectively fuse multi-view information by exploring appropriate graph structures. Although existing works have made impressive progress in clustering performance, most of them suffer from the cubic time complexity which could preve...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on image processing Jg. 31; S. 556 - 568
Hauptverfasser:	Wang, Siwei, Liu, Xinwang, Zhu, Xinzhong, Zhang, Pei, Zhang, Yi, Gao, Feng, Zhu, En
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	United States IEEE 2022 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	Algorithms Clustering Clustering algorithms Complexity Convergence Large-scale clustering Machine learning algorithms Matrix decomposition multiple subspace clustering multiple view clustering Optimization Parameters Sampling Subspace methods Subspaces Symmetric matrices Time complexity
ISSN:	1057-7149, 1941-0042, 1941-0042
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!