# Strict maximum separability of two finite sets: an algorithmic approach

International Journal of Applied Mathematics and Computer Science (2005)

- Volume: 15, Issue: 2, page 295-304
- ISSN: 1641-876X

## Access Full Article

top## Abstract

top## How to cite

topCendrowska, Dorota. "Strict maximum separability of two finite sets: an algorithmic approach." International Journal of Applied Mathematics and Computer Science 15.2 (2005): 295-304. <http://eudml.org/doc/207744>.

@article{Cendrowska2005,

abstract = {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.},

author = {Cendrowska, Dorota},

journal = {International Journal of Applied Mathematics and Computer Science},

keywords = {binary classifiers; optimal separability; recursive methods},

language = {eng},

number = {2},

pages = {295-304},

title = {Strict maximum separability of two finite sets: an algorithmic approach},

url = {http://eudml.org/doc/207744},

volume = {15},

year = {2005},

}

TY - JOUR

AU - Cendrowska, Dorota

TI - Strict maximum separability of two finite sets: an algorithmic approach

JO - International Journal of Applied Mathematics and Computer Science

PY - 2005

VL - 15

IS - 2

SP - 295

EP - 304

AB - 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.

LA - eng

KW - binary classifiers; optimal separability; recursive methods

UR - http://eudml.org/doc/207744

ER -

## References

top- Cristianini N. and Shawe-Taylor J. (2000): An Introduction to Support Vector Machines and Other Kernel-Based Learning Methods. - Cambridge: Cambridge University Press. Zbl0994.68074
- Duda R.O., Hart P.E. and Stork D.G. (1995): Pattern Classification. - New York: Wiley. Zbl0968.68140
- Franc V. and Hlavač V. (2003): An iterative algorithm learning the maximal margin classifier. - Pattern Recogn., Vol. 36, No. 9, pp. 1985-1996. Zbl1045.68115
- Jankowski N. (2003): Ontogenic Neural Networks. - Warsaw: EXIT, (in Polish).
- 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).
- 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. Zbl0521.68094
- 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).
- 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).
- 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
- Vapnik V.N. (2000): The Nature of Statistical Learning Theory. - New York: Springer. Zbl0934.62009

## NotesEmbed ?

topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.