Learning task-driving affinity matrix for accurate multi-view clustering through tensor subspace learning

DOI10.1016/j.ins.2021.02.054zbMath1527.68197MaRDI QIDQ6086267

No author found.

Publication date: 9 November 2023

Published in: Information Sciences (Search for Journal in Brave)

zbMATH Keywords

graph learningmulti-view clusteringsubspace mergingself-expressive tensor learningsubspace representation

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (1)

A structure noise-aware tensor dictionary learning method for high-dimensional data clustering

Cites Work

• Unnamed Item
• Unnamed Item
• Alternating direction augmented Lagrangian methods for semidefinite programming
• Robust low-rank kernel multi-view subspace clustering based on the Schatten \(p\)-norm and correntropy
• Multi-view cluster analysis with incomplete data to understand treatment effects
• A Singular Value Thresholding Algorithm for Matrix Completion
• Split Multiplicative Multi-View Subspace Clustering
• Essential Tensor Learning for Multi-View Spectral Clustering
• Third-Order Tensors as Operators on Matrices: A Theoretical and Computational Framework with Applications in Imaging

This page was built for publication: Learning task-driving affinity matrix for accurate multi-view clustering through tensor subspace learning