Multi-view subspace clustering with adaptive locally consistent graph regularization

Graph regularization has shown its effectiveness in multi-view subspace clustering methods. Many multi-view subspace clustering methods based on graph regularization build the adjacency matrix directly based on a simple similarity measure between data points for each view. However, these simply cons...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Neural computing & applications 2021-11, Vol.33 (22), p.15397-15412
Hauptverfasser:	Liu, Xiaolan, Pan, Gan, Xie, Mengying
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Artificial Intelligence Clustering Computational Biology/Bioinformatics Computational Science and Engineering Computer Science Data Mining and Knowledge Discovery Data points Image Processing and Computer Vision Original Article Probability and Statistics in Computer Science Regularization Subspace methods Subspaces
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!