Korbicz, Józef - red. ; Uciński, Dariusz - red.
The paper presents a recursive algorithm for the investigation of a strict, linear separation in the Euclidean space. In the case when sets are linearly separable, it allows us to determine the coefficients of the hyperplanes. An example of using this algorithm as well as its drawbacks are shown. Then the algorithm of determining an optimal separation (in the sense of maximizing the distance between the two sets) is presented.
Zielona Góra: Uniwersytet Zielonogórski
AMCS, volume 15, number 2 (2005) ; click here to follow the link
Biblioteka Uniwersytetu Zielonogórskiego
Sep 7, 2021
Aug 20, 2020
|Strict maximum separability of two finite sets: An algorithmic approach||Sep 7, 2021|