A linear separability criterion for sets of Euclidean space
DOI10.1007/S10957-012-0155-XzbMATH Open1272.90088DBLPjournals/jota/Gabidullina13OpenAlexW2072784147WikidataQ58336427 ScholiaQ58336427MaRDI QIDQ368616FDOQ368616
Authors: Z. R. Gabidullina 
Publication date: 23 September 2013
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-012-0155-x
Recommendations
- scientific article; zbMATH DE number 4092239
- Regularity conditions for the linear separation of sets
- Structure of homothetic linearly separable sets in \(n\)-dimensional Euclidean space. I
- Theorems on the separability of \(\alpha\)-sets in Euclidean space
- Structure of homothetic linearly separable sets in \(n\)-dimensional euclidean space. II
- Structure of homothetic linearly separable sets in \(n\)-dimensional Euclidean space. III
- scientific article; zbMATH DE number 4124484
- The geometry of linear separability in data sets
- scientific article; zbMATH DE number 1200176
- Separability and Tight Enclosure of Point Sets
projectioncone of support vectorsdistance between the setsgeneralized support vectorgeneralized supporting hyperplanepseudo-separatorseparatorthickness of the separator (pseudo-separator)
Cites Work
- Constrained optimization and image space analysis. Vol. 1: Separation of sets and optimality conditions
- Title not available (Why is that?)
- Advances in large-margin classifiers
- Linear and Nonlinear Separation of Patterns by Linear Programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A theorem on strict separability of convex polyhedra and its applications in optimization
Cited In (16)
- Necessary and sufficient conditions for emptiness of the cones of generalized support vectors
- The problem of projecting the origin of Euclidean space onto the convex polyhedron
- Title not available (Why is that?)
- Structure of homothetic linearly separable sets in \(n\)-dimensional Euclidean space. III
- Using \(\varepsilon\)-nets for linear separation of two sets in a Euclidean space \(\mathbb R^d\)
- The extremal separation of two sets: I. General results
- The geometry of linear separability in data sets
- Proximal gradient/semismooth Newton methods for projection onto a polyhedron via the duality-gap-active-set strategy
- Title not available (Why is that?)
- Monotonicity of Linear Separability Under Translation
- Linear disjointness of coverings of affine spaces
- On the optimal separating hyperplane for arbitrary sets: a generalization of the SVM formulation and a convex hull approach
- Support and separation properties of convex sets in finite dimension
- Stochastic separation theorems
- Design of the best linear classifier for box-constrained data sets
- Title not available (Why is that?)
This page was built for publication: A linear separability criterion for sets of Euclidean space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q368616)
