Recommendations
- k plane clustering algorithm based on L1 norm
- Some clustering algorithms in normed planes
- \(K\)-expectiles clustering
- Geometric clustering in normed planes
- scientific article; zbMATH DE number 26490
- scientific article; zbMATH DE number 1500683
- Planarity-preserving clustering and embedding for large planar graphs
- A cutting plane algorithm for a clustering problem
- On approximate geometric \(k\)-clustering
Cited in
(47)- Newton's method for nonparallel plane proximal classifier with unity norm hyperplanes
- The MIN PFS problem and piecewise linear model estimation
- Nearest \(q\)-flat to \(m\) points
- Locating hyperplanes to fitting set of points: a general framework
- Robust subspace segmentation via nonconvex low rank representation
- Semi-explicit MPC based on subspace clustering
- A geometric analysis of subspace clustering with outliers
- Hybrid linear modeling via local best-fit flats
- Least squares projection twin support vector clustering (LSPTSVC)
- On the multisource hyperplanes location problem to fitting set of points
- On the exact separation of cover inequalities of maximum-depth
- The hierarchy of block models
- Weighted sparse simplex representation: a unified framework for subspace clustering, constrained clustering, and active learning
- Constrained clustering problems: new optimization algorithms
- Robust subspace clustering
- A distance-based point-reassignment heuristic for the k-hyperplane clustering problem
- Operations research and data mining
- A bilinear algorithm for sparse representations
- Identification of hybrid systems. A tutorial
- Local optimization method with global multidimensional search
- An inexact splitting method for the subspace segmentation from incomplete and noisy observations
- A two-phase heuristic for the bottleneck \(k\)-hyperplane clustering problem
- Beyond linear subspace clustering: a comparative study of nonlinear manifold clustering algorithms
- k plane clustering algorithm based on L1 norm
- A hierarchical approach for sparse source blind signal separation problem
- Discrete optimization methods to fit piecewise affine models to data points
- Identifiability Conditions and Subspace Clustering in Sparse BSS
- Mathematical Programming Formulations for the Bottleneck Hyperplane Clustering Problem
- A Novel Piecewise Linear Clustering Technique Based on Hyper Plane Adjustment
- The equivalence between principal component analysis and nearest flat in the least square sense
- scientific article; zbMATH DE number 7626708 (Why is no real title available?)
- Hypergraph clustering using a new Laplacian tensor with applications in image processing
- scientific article; zbMATH DE number 7164743 (Why is no real title available?)
- Filtrated algebraic subspace clustering
- Optimization approach for clustering datasets with weights
- On the existence of optimal unions of subspaces for data modeling and clustering
- Testing the manifold hypothesis
- Double structure scaled simplex representation for multi-view subspace clustering
- Locally finite distance clustering with discriminative information
- An efficient algorithm for maximal margin clustering
- Robust recovery of multiple subspaces by geometric \(l_{p}\) minimization
- A spatially constrained fuzzy hyper-prototype clustering algorithm
- Foundations of a multi-way spectral clustering framework for hybrid linear modeling
- Subspace clustering of high-dimensional data: a predictive approach
- Robust sparse component analysis based on a generalized Hough transform
- A new approach to two-view motion segmentation using global dimension minimization
- Optimization models and algorithms for the hyperplane clustering problem
This page was built for publication: \(k\)-plane clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1579945)
