Convex Sparse Spectral Clustering: Single-View to Multi-View

DOI10.1109/TIP.2016.2553459zbMath1408.94438DBLPjournals/tip/LuYL16arXiv1511.06860WikidataQ39839435 ScholiaQ39839435MaRDI QIDQ4616493

Canyi Lu, Shuicheng Yan, Zhouchen Lin

Publication date: 4 February 2019

Published in: IEEE Transactions on Image Processing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1511.06860

Mathematics Subject Classification ID

Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Related Items (14)

Multiple kernel low-rank representation-based robust multi-view subspace clustering ⋮ Accelerated low-rank representation for subspace clustering and semi-supervised classification on large-scale data ⋮ Multi-view clustering on unmapped data via constrained non-negative matrix factorization ⋮ Nonlinear subspace clustering using non-convex Schatten-p norm regularization ⋮ On unifying multi-view self-representations for clustering by tensor multi-rank minimization ⋮ Exact \(k\)-component graph learning for image clustering ⋮ A Riemannian Proximal Newton Method ⋮ Robust low-rank kernel multi-view subspace clustering based on the Schatten \(p\)-norm and correntropy ⋮ Sparse eigenbasis approximation: multiple feature extraction across spatiotemporal scales with application to coherent set identification ⋮ Enhanced balanced min cut ⋮ Learning a consensus affinity matrix for multi-view clustering via subspaces merging on Grassmann manifold ⋮ Multi-view spectral clustering for uncertain objects ⋮ Integrating Multidimensional Data for Clustering Analysis With Applications to Cancer Patient Data ⋮ Nonconvex multi-view subspace clustering via simultaneously learning the representation tensor and affinity matrix*

This page was built for publication: Convex Sparse Spectral Clustering: Single-View to Multi-View