We prove new theorems which describe a necessary and sufficient condition for linear (strong and non-strong) separability and inseparability of the sets in a finite-dimensional Euclidean space. We propose a universal measure for the thickness of the geometric margin (both the strong separation margin (separator) and the margin of unseparated points (pseudo-separator)) formed between the parallel generalized supporting hyperplanes of the two sets which are separated. The introduced measure allows comparing results of linear separation obtained by different techniques for both linearly separable and inseparable sets. An optimization program whose formulation provides a maximum thickness of the separator for the separable sets is considered. W...
This is a survey on support and separation properties of convex sets in the n-dimensional Euclidean ...
AbstractWe introduce the notion of the width bounded geometric separator and develop the techniques ...
Abstract. A bisector of two sets is the set of points equidistant to them. Bisectors arise naturally...
We prove new theorems which describe a necessary and sufficient condition for linear (strong and non...
We prove new theorems which describe a necessary and sufficient condition for linear (strong and non...
Consider the following fundamental problem: given two sets R and G of objects positioned in d-dimens...
We propose a new approach to the strict separation of convex polyhedra. This approach is based on th...
The paper presents a recursive algorithm for the investigation of a strict, linear separation in the...
A geometric and non parametric procedure for testing if two finite set of points are linearly separa...
We propose a new approach to the strict separation of convex polyhedra. This approach is based on th...
We propose a new approach to the strict separation of convex polyhedra. This approach is based on th...
We propose a new approach to the strict separation of convex polyhedra. This approach is based on th...
AbstractGiven linearly inseparable sets R of red points and B of blue points, we consider several me...
AbstractIn this paper we study the separability of two disjoint sets of objects in the plane accordi...
This is a survey on support and separation properties of convex sets in the n-dimensional Euclidean ...
This is a survey on support and separation properties of convex sets in the n-dimensional Euclidean ...
AbstractWe introduce the notion of the width bounded geometric separator and develop the techniques ...
Abstract. A bisector of two sets is the set of points equidistant to them. Bisectors arise naturally...
We prove new theorems which describe a necessary and sufficient condition for linear (strong and non...
We prove new theorems which describe a necessary and sufficient condition for linear (strong and non...
Consider the following fundamental problem: given two sets R and G of objects positioned in d-dimens...
We propose a new approach to the strict separation of convex polyhedra. This approach is based on th...
The paper presents a recursive algorithm for the investigation of a strict, linear separation in the...
A geometric and non parametric procedure for testing if two finite set of points are linearly separa...
We propose a new approach to the strict separation of convex polyhedra. This approach is based on th...
We propose a new approach to the strict separation of convex polyhedra. This approach is based on th...
We propose a new approach to the strict separation of convex polyhedra. This approach is based on th...
AbstractGiven linearly inseparable sets R of red points and B of blue points, we consider several me...
AbstractIn this paper we study the separability of two disjoint sets of objects in the plane accordi...
This is a survey on support and separation properties of convex sets in the n-dimensional Euclidean ...
This is a survey on support and separation properties of convex sets in the n-dimensional Euclidean ...
AbstractWe introduce the notion of the width bounded geometric separator and develop the techniques ...
Abstract. A bisector of two sets is the set of points equidistant to them. Bisectors arise naturally...