The following pages link to \(k\)-plane clustering (Q1579945):
Displaying 46 items.
- A hierarchical approach for sparse source blind signal separation problem (Q336833) (← links)
- Discrete optimization methods to fit piecewise affine models to data points (Q342537) (← links)
- The equivalence between principal component analysis and nearest flat in the least square sense (Q493252) (← links)
- On the existence of optimal unions of subspaces for data modeling and clustering (Q544805) (← links)
- An efficient algorithm for maximal margin clustering (Q656840) (← links)
- Robust recovery of multiple subspaces by geometric \(l_{p}\) minimization (Q661178) (← links)
- A spatially constrained fuzzy hyper-prototype clustering algorithm (Q663403) (← links)
- Foundations of a multi-way spectral clustering framework for hybrid linear modeling (Q734135) (← links)
- Subspace clustering of high-dimensional data: a predictive approach (Q740601) (← links)
- Robust sparse component analysis based on a generalized Hough transform (Q838872) (← links)
- A new approach to two-view motion segmentation using global dimension minimization (Q903520) (← links)
- Optimization models and algorithms for the hyperplane clustering problem (Q989832) (← links)
- Newton's method for nonparallel plane proximal classifier with unity norm hyperplanes (Q1048779) (← links)
- The MIN PFS problem and piecewise linear model estimation (Q1348259) (← links)
- Nearest \(q\)-flat to \(m\) points (Q1579644) (← links)
- Locating hyperplanes to fitting set of points: a general framework (Q1652646) (← links)
- Robust subspace segmentation via nonconvex low rank representation (Q1671711) (← links)
- Semi-explicit MPC based on subspace clustering (Q1679122) (← links)
- A geometric analysis of subspace clustering with outliers (Q1940771) (← links)
- Hybrid linear modeling via local best-fit flats (Q1943402) (← links)
- Least squares projection twin support vector clustering (LSPTSVC) (Q2023172) (← links)
- On the multisource hyperplanes location problem to fitting set of points (Q2027036) (← links)
- On the exact separation of cover inequalities of maximum-depth (Q2115307) (← links)
- The hierarchy of block models (Q2121701) (← links)
- Weighted sparse simplex representation: a unified framework for subspace clustering, constrained clustering, and active learning (Q2147403) (← links)
- Constrained clustering problems: new optimization algorithms (Q2148742) (← links)
- Robust subspace clustering (Q2249846) (← links)
- A distance-based point-reassignment heuristic for the \(k\)-hyperplane clustering problem (Q2253617) (← links)
- Operations research and data mining (Q2467295) (← links)
- A bilinear algorithm for sparse representations (Q2475611) (← links)
- Identification of hybrid systems. A tutorial (Q2512104) (← links)
- Local optimization method with global multidimensional search (Q2576444) (← links)
- An inexact splitting method for the subspace segmentation from incomplete and noisy observations (Q2633544) (← links)
- A two-phase heuristic for the bottleneck \(k\)-hyperplane clustering problem (Q2636610) (← links)
- Beyond linear subspace clustering: a comparative study of nonlinear manifold clustering algorithms (Q2668410) (← links)
- \(k\) plane clustering algorithm based on \(L1\) norm (Q3306705) (← links)
- Identifiability Conditions and Subspace Clustering in Sparse BSS (Q3608571) (← links)
- Mathematical Programming Formulations for the Bottleneck Hyperplane Clustering Problem (Q3627678) (← links)
- (Q5053173) (← links)
- Hypergraph Clustering Using a New Laplacian Tensor with Applications in Image Processing (Q5143288) (← links)
- (Q5214235) (← links)
- Filtrated Algebraic Subspace Clustering (Q5266379) (← links)
- Optimization approach for clustering datasets with weights (Q5317753) (← links)
- Testing the manifold hypothesis (Q5741444) (← links)
- Double structure scaled simplex representation for multi-view subspace clustering (Q6488692) (← links)
- Locally finite distance clustering with discriminative information (Q6492605) (← links)
