TY - GEN
A1 - Cendrowska, Dorota
A2 - Korbicz, Józef - red.
A2 - Uciński, Dariusz - red.
PB - Zielona Góra: Uniwersytet Zielonogórski
N2 - 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.
L1 - http://zbc.uz.zgora.pl/Content/57516/AMCS_2005_15_2_12.pdf
L2 - http://zbc.uz.zgora.pl/Content/57516
KW - binary classifiers
KW - recursive methods
KW - optimal separability
T1 - Strict maximum separability of two finite sets: An algorithmic approach
UR - http://zbc.uz.zgora.pl/dlibra/docmetadata?id=57516
ER -