Non-convex low-rank representation combined with rank-one matrix sum for subspace clustering

DOI10.1007/s00500-020-04865-0zbMath1491.62049OpenAlexW3016869662MaRDI QIDQ2156581

Yong-Qiang Zhang, Daming Shi, Dansong Cheng, Jun Wang, Xiaofang Liu

Publication date: 18 July 2022

Published in: Soft Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00500-020-04865-0

zbMATH Keywords

block coordinate descentrank-one matrixsubspace clusteringnon-convex low-rank representation

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Cites Work

• Unnamed Item
• Unnamed Item
• On the construction of the relevance vector machine based on Bayesian Ying-Yang harmony learning
• A Nyström spectral clustering algorithm based on probability incremental sampling
• Dealer using a new trapezoidal cubic hesitant fuzzy TOPSIS method and application to group decision-making program
• Trapezoidal cubic fuzzy number Einstein hybrid weighted averaging operators and its application to decision making
• Methods for MADM with picture fuzzy Muirhead mean operators and their application for evaluating the financial investment risk
• Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
• Local minima and convergence in low-rank semidefinite programming
• Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization

This page was built for publication: Non-convex low-rank representation combined with rank-one matrix sum for subspace clustering