Strict maximum separability of two finite sets: an algorithmic approach
International Journal of Applied Mathematics and Computer Science, Tome 15 (2005) no. 2, p. 295.
Voir la notice de l'article dans European Digital Mathematics Library
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.
@article{IJAMCS_2005__15_2_207744, author = {Dorota Cendrowska}, title = {Strict maximum separability of two finite sets: an algorithmic approach}, journal = {International Journal of Applied Mathematics and Computer Science}, pages = {295}, publisher = {mathdoc}, volume = {15}, number = {2}, year = {2005}, zbl = {1085.68146}, language = {en}, url = {https://geodesic-test.mathdoc.fr/item/IJAMCS_2005__15_2_207744/} }
TY - JOUR AU - Dorota Cendrowska TI - Strict maximum separability of two finite sets: an algorithmic approach JO - International Journal of Applied Mathematics and Computer Science PY - 2005 SP - 295 VL - 15 IS - 2 PB - mathdoc UR - https://geodesic-test.mathdoc.fr/item/IJAMCS_2005__15_2_207744/ LA - en ID - IJAMCS_2005__15_2_207744 ER -
%0 Journal Article %A Dorota Cendrowska %T Strict maximum separability of two finite sets: an algorithmic approach %J International Journal of Applied Mathematics and Computer Science %D 2005 %P 295 %V 15 %N 2 %I mathdoc %U https://geodesic-test.mathdoc.fr/item/IJAMCS_2005__15_2_207744/ %G en %F IJAMCS_2005__15_2_207744
Dorota Cendrowska. Strict maximum separability of two finite sets: an algorithmic approach. International Journal of Applied Mathematics and Computer Science, Tome 15 (2005) no. 2, p. 295. https://geodesic-test.mathdoc.fr/item/IJAMCS_2005__15_2_207744/