A splitting method for the locality regularized semi-supervised subspace clustering
From MaRDI portal
Publication:5110316
DOI10.1080/02331934.2019.1671841zbMath1443.90272OpenAlexW2979989333MaRDI QIDQ5110316
Hai-Xiang Lin, Renli Liang, Yan-Qin Bai
Publication date: 18 May 2020
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2019.1671841
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Convex programming (90C25) Applications of mathematical programming (90C90)
Cites Work
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Graph dual regularization non-negative matrix factorization for co-clustering
- Exact worst-case convergence rates of the proximal gradient method for composite convex minimization
- Linearized alternating direction method of multipliers with Gaussian back substitution for separable convex programming
- An inexact splitting method for the subspace segmentation from incomplete and noisy observations
- Splitting augmented Lagrangian method for optimization problems with a cardinality constraint and semicontinuous variables
- New SDP models for protein homology detection with semi-supervised SVM
- Data preprocessing in semi-supervised SVM classification
- A Singular Value Thresholding Algorithm for Matrix Completion
- A Fast Algorithm for Edge-Preserving Variational Multichannel Image Restoration
- Learning a Nonnegative Sparse Graph for Linear Regression
- A splitting method for separable convex programming
- Flexible Manifold Embedding: A Framework for Semi-Supervised and Unsupervised Dimension Reduction
- Graph Regularized Sparse Coding for Image Representation
- Manifold Regularized Discriminative Nonnegative Matrix Factorization With Fast Gradient Descent
This page was built for publication: A splitting method for the locality regularized semi-supervised subspace clustering
