k-plane clustering
From MaRDI portal
Publication:1579945
DOI10.1023/A:1008324625522zbMATH Open0990.90135OpenAlexW1533128638MaRDI QIDQ1579945FDOQ1579945
Authors: P. S. Bradley, O. L. Mangasarian 
Publication date: 14 September 2000
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1008324625522
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
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Pattern recognition, speech recognition (68T10) Approximation methods and heuristics in mathematical programming (90C59)
Cited In (47)
- Double structure scaled simplex representation for multi-view subspace clustering
- Testing the manifold hypothesis
- A bilinear algorithm for sparse representations
- Robust subspace clustering
- A distance-based point-reassignment heuristic for the \(k\)-hyperplane clustering problem
- Robust sparse component analysis based on a generalized Hough transform
- On the exact separation of cover inequalities of maximum-depth
- Title not available (Why is that?)
- Optimization approach for clustering datasets with weights
- A two-phase heuristic for the bottleneck \(k\)-hyperplane clustering problem
- On the multisource hyperplanes location problem to fitting set of points
- Least squares projection twin support vector clustering (LSPTSVC)
- An inexact splitting method for the subspace segmentation from incomplete and noisy observations
- Locating hyperplanes to fitting set of points: a general framework
- Subspace clustering of high-dimensional data: a predictive approach
- Weighted sparse simplex representation: a unified framework for subspace clustering, constrained clustering, and active learning
- Robust subspace segmentation via nonconvex low rank representation
- Hypergraph clustering using a new Laplacian tensor with applications in image processing
- Mathematical Programming Formulations for the Bottleneck Hyperplane Clustering Problem
- Identification of hybrid systems. A tutorial
- Filtrated algebraic subspace clustering
- A hierarchical approach for sparse source blind signal separation problem
- Beyond linear subspace clustering: a comparative study of nonlinear manifold clustering algorithms
- A new approach to two-view motion segmentation using global dimension minimization
- Discrete optimization methods to fit piecewise affine models to data points
- Local optimization method with global multidimensional search
- Locally finite distance clustering with discriminative information
- Semi-explicit MPC based on subspace clustering
- On the existence of optimal unions of subspaces for data modeling and clustering
- Newton's method for nonparallel plane proximal classifier with unity norm hyperplanes
- Robust recovery of multiple subspaces by geometric \(l_{p}\) minimization
- Optimization models and algorithms for the hyperplane clustering problem
- The equivalence between principal component analysis and nearest flat in the least square sense
- The MIN PFS problem and piecewise linear model estimation
- Foundations of a multi-way spectral clustering framework for hybrid linear modeling
- An efficient algorithm for maximal margin clustering
- A Novel Piecewise Linear Clustering Technique Based on Hyper Plane Adjustment
- Operations research and data mining
- A spatially constrained fuzzy hyper-prototype clustering algorithm
- The hierarchy of block models
- Title not available (Why is that?)
- Nearest \(q\)-flat to \(m\) points
- Constrained clustering problems: new optimization algorithms
- Identifiability Conditions and Subspace Clustering in Sparse BSS
- A geometric analysis of subspace clustering with outliers
- Hybrid linear modeling via local best-fit flats
- \(k\) plane clustering algorithm based on \(L1\) norm
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)
