\(k\)-plane clustering
From MaRDI portal
Publication:1579945
DOI10.1023/A:1008324625522zbMath0990.90135OpenAlexW1533128638MaRDI QIDQ1579945
P. S. Bradley, Olvi 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
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Approximation methods and heuristics in mathematical programming (90C59) Pattern recognition, speech recognition (68T10)
Related Items
The hierarchy of block models ⋮ Robust sparse component analysis based on a generalized Hough transform ⋮ An inexact splitting method for the subspace segmentation from incomplete and noisy observations ⋮ The MIN PFS problem and piecewise linear model estimation ⋮ A two-phase heuristic for the bottleneck \(k\)-hyperplane clustering problem ⋮ Weighted sparse simplex representation: a unified framework for subspace clustering, constrained clustering, and active learning ⋮ Constrained clustering problems: new optimization algorithms ⋮ Unnamed Item ⋮ A hierarchical approach for sparse source blind signal separation problem ⋮ Locating hyperplanes to fitting set of points: a general framework ⋮ Discrete optimization methods to fit piecewise affine models to data points ⋮ Optimization approach for clustering datasets with weights ⋮ Robust subspace segmentation via nonconvex low rank representation ⋮ Beyond linear subspace clustering: a comparative study of nonlinear manifold clustering algorithms ⋮ Semi-explicit MPC based on subspace clustering ⋮ A geometric analysis of subspace clustering with outliers ⋮ Hybrid linear modeling via local best-fit flats ⋮ A new approach to two-view motion segmentation using global dimension minimization ⋮ An efficient algorithm for maximal margin clustering ⋮ Robust recovery of multiple subspaces by geometric \(l_{p}\) minimization ⋮ Hypergraph Clustering Using a New Laplacian Tensor with Applications in Image Processing ⋮ A spatially constrained fuzzy hyper-prototype clustering algorithm ⋮ The equivalence between principal component analysis and nearest flat in the least square sense ⋮ Operations research and data mining ⋮ Unnamed Item ⋮ A bilinear algorithm for sparse representations ⋮ Robust subspace clustering ⋮ On the existence of optimal unions of subspaces for data modeling and clustering ⋮ Testing the manifold hypothesis ⋮ Least squares projection twin support vector clustering (LSPTSVC) ⋮ Optimization models and algorithms for the hyperplane clustering problem ⋮ On the multisource hyperplanes location problem to fitting set of points ⋮ Identifiability Conditions and Subspace Clustering in Sparse BSS ⋮ Identification of hybrid systems. A tutorial ⋮ Foundations of a multi-way spectral clustering framework for hybrid linear modeling ⋮ Subspace clustering of high-dimensional data: a predictive approach ⋮ Mathematical Programming Formulations for the Bottleneck Hyperplane Clustering Problem ⋮ Nearest \(q\)-flat to \(m\) points ⋮ Newton's method for nonparallel plane proximal classifier with unity norm hyperplanes ⋮ Local optimization method with global multidimensional search ⋮ Filtrated Algebraic Subspace Clustering ⋮ On the exact separation of cover inequalities of maximum-depth
This page was built for publication: \(k\)-plane clustering
