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
topAbstract
topHow to cite
topReferences
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