Joint correntropy metric weighting and block diagonal regularizer for robust multiple kernel subspace clustering

DOI10.1016/J.INS.2019.05.063MaRDI QIDQ2215094zbMATH OpenOpenAlexWikidataFDO

Authors Chao Yang, Zhenwen Ren, Mingna Wu, Maowei Yin, Quansen Sun, Yu-An Sun

Publication date 10 December 2020

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ins.2019.05.063

zbMATH Keywords

block diagonal regularizercorrentropymultiple kernel learningself-expressivenesssubspace clustering

Mathematics Subject Classification ID

Statistical aspects of information-theoretic topics (62B10) Estimation in multivariate analysis (62H12) Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Recommendations

• Robust low-rank kernel multi-view subspace clustering based on the Schatten \(p\)-norm and correntropy
• Multiple kernel low-rank representation-based robust multi-view subspace clustering
• Robust subspace clustering based on non-convex low-rank approximation and adaptive kernel
• Kernel truncated regression representation for robust subspace clustering
• Block diagonal representation learning for robust subspace clustering

Cites work

• A low complexity robust detector in impulsive noise
• A survey on soft subspace clustering
• Correntropy: Properties and Applications in Non-Gaussian Signal Processing
• scientific article; zbMATH DE number 1391397 (Why is no real title available?)
• On the orthogonal distance to class subspaces for high-dimensional data classification
• Probabilistic Diffusion for Interactive Image Segmentation
• Robust and Discriminative Labeling for Multi-Label Active Learning Based on Maximum Correntropy Criterion
• Robust low-rank kernel multi-view subspace clustering based on the Schatten \(p\)-norm and correntropy
• YoTube: Searching Action Proposal Via Recurrent and Static Regression Networks

Cited in

(12)

• Low-rank local tangent space embedding for subspace clustering
• Simultaneous learning coefficient matrix and affinity graph for multiple kernel clustering
• Multiple kernel low-rank representation-based robust multi-view subspace clustering
• Robust low-rank kernel multi-view subspace clustering based on the Schatten \(p\)-norm and correntropy
• Robust subspace clustering based on non-convex low-rank approximation and adaptive kernel
• Block diagonal representation learning for robust subspace clustering
• Beyond linear subspace clustering: a comparative study of nonlinear manifold clustering algorithms
• Multi-objective soft subspace clustering in the composite kernel space
• Robust subspace clustering based on automatic weighted multiple kernel learning
• Robust multi-view graph clustering in latent energy-preserving embedding space
• One-step multi-view spectral clustering with cluster label correlation graph
• Scalable incomplete multi-view clustering with adaptive data completion

This page was built for publication: Joint correntropy metric weighting and block diagonal regularizer for robust multiple kernel subspace clustering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2215094)