Adaptive low-rank kernel block diagonal representation subspace clustering

The kernel subspace clustering algorithm aims to tackle the nonlinear subspace model. The block diagonal representation subspace clustering has a more promising capability in pursuing the k -block diagonal matrix. Therefore, the low-rankness and the adaptivity of the kernel subspace clustering can b...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Applied intelligence (Dordrecht, Netherlands) Netherlands), 2022, Vol.52 (2), p.2301-2316
Hauptverfasser:	Liu, Maoshan, Wang, Yan, Sun, Jun, Ji, Zhicheng
Format:	Artikel
Sprache:	eng
Schlagworte:	Adaptive algorithms Algorithms Artificial Intelligence Clustering Computer Science Hilbert space Kernels Machines Manufacturing Mechanical Engineering Processes Representations Subspaces
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!