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{bwmeta1.element.bwnjournal-article-amcv15i2p295bwm,
author = {Cendrowska, Dorota},
title = {Strict maximum separability of two finite sets: an algorithmic approach},
journal = {International Journal of Applied Mathematics and Computer Science},
volume = {15},
year = {2005},
pages = {295-304},
zbl = {1085.68146},
language = {en},
url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-amcv15i2p295bwm}
}
Cendrowska, Dorota. Strict maximum separability of two finite sets: an algorithmic approach. International Journal of Applied Mathematics and Computer Science, Tome 15 (2005) pp. 295-304. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-amcv15i2p295bwm/
[000] Cristianini N. and Shawe-Taylor J. (2000): An Introduction to Support Vector Machines and Other Kernel-Based Learning Methods. - Cambridge: Cambridge University Press. | Zbl 0994.68074
[001] Duda R.O., Hart P.E. and Stork D.G. (1995): Pattern Classification. - New York: Wiley. | Zbl 0968.68140
[002] Franc V. and Hlavač V. (2003): An iterative algorithm learning the maximal margin classifier. - Pattern Recogn., Vol. 36, No. 9, pp. 1985-1996. | Zbl 1045.68115
[003] Jankowski N. (2003): Ontogenic Neural Networks. - Warsaw: EXIT, (in Polish).
[004] Jóźwik A. (1975): Method of investigaton of separability of two finite sets in n-dimensional space. - Scientific Works of the Institute of Organization and Manegement, Series: Applied Cybernetics and Computer Science, Vol. 18, (in Polish).
[005] Jóźwik A. (1983): A recursive method for the investigation of the linear separability of two sets. - Pattern Recogn., Vol. 16, No. 4, pp. 429-431. | Zbl 0521.68094
[006] Jóźwik A. (1998): Algorithm of investigaton of separability of two sets, prospects of reusing this algorithm to construct the binary classifier. - Proc. 6-th Conf., Networks and Information Systems-Theory, Projects and Applications, Łódź, Poland, pp. 311-316, (in Polish).
[007] Kozinec B.N. (1973): Recurrent algorithm separating convex hulls of two sets, In: Learning Algorithms in Pattern Recognition (V.N. Vapnik, Ed.). -Moscow: Soviet Radio, pp. 43-50, (in Russian).
[008] Mangasarian O.L. (2000): Generalized Support Vector Machines, Advances in Large Margin classifiers, pp. 135-146, MIT Press, available at ftp://ftp.cs.wisc.edu/math-prog/tech-reports/98-14.ps
[009] Vapnik V.N. (2000): The Nature of Statistical Learning Theory. - New York: Springer. | Zbl 0934.62009