Abstract
The Support Vector Machine, introduced in [1] as a practical implementation of the principle of structural risk minimization, constitutes one of the most promising methods for constructing a mathematical model only on the base of a limited amount of measured data. In this paper, we consider the application of this method to the problem of nonparametric binary hypothesis testing (bayesian setting); the main contribution of this paper is the derivation of the Support Vector algorithm in the case of a generic convex approximation of the binary risk function.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
C. Cortes and V.N. Vapnik, The Support Vector Machines for Pattern Recognition, Machine Learning, Vol. 20, n. 5, pp. 273–290, 1995.
R. Fletcher, Practical Methods of Optimization, J. Wiley and Sons, II edn., 1987.
K. Fukunaga, Introduction to Statistical Pattern Recognition, II edn., Academic Press, 1990.
E. Osuna, R. Freund and F. Girosi, Support Vector Machines: Training and Applications, MIT Technical Report, AI-Memo no. 1602, 1997.
B. Scholkopf, K. Sung, C. Burges, F. Girosi, P. Niyogi, T. Poggio and V. Vapnik, Comparing Support Vector Machines with Gaussian Kernels to Radial Basis Function Classifiers, IEEE Trans. on Signal Processing, Vol. 45, pp. 2758–2765, 1997.
V. N. Vapnik, The Nature of the Statistical Learning Theory, Springer-Verlag, 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag London Limited
About this paper
Cite this paper
Mattera, D., Palmieri, F. (1999). Support Vector Machine for Nonparametric Binary Hypothesis Testing. In: Marinaro, M., Tagliaferri, R. (eds) Neural Nets WIRN VIETRI-98. Perspectives in Neural Computing. Springer, London. https://doi.org/10.1007/978-1-4471-0811-5_11
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0811-5_11
Publisher Name: Springer, London
Print ISBN: 978-1-4471-1208-2
Online ISBN: 978-1-4471-0811-5
eBook Packages: Springer Book Archive