By Topic

Study of Two Error Functions to Approximate the Neyman–Pearson Detector Using Supervised Learning Machines

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Jarabo-Amores, M.-P. ; Signal Theor. & Commun. Dept., Univ. of Alcala, Alcala de Henares, Spain ; Rosa-Zurera, M. ; Gil-Pita, R. ; Lopez-Ferreras, F.

A study of the possibility of approximating the Neyman-Pearson detector using supervised learning machines is presented. Two error functions are considered for training: the sum-of-squares error and the Minkowski error with R = 1. The study is based on the calculation of the function the learning machine approximates to during training, and the application of a sufficient condition previously formulated. Some experiments about signal detection using neural networks are also presented to test the validity of the study. Theoretical and experimental results demonstrate, on one hand, that only the sum-of-squares error is suitable to approximate the Neyman-Pearson detector and, on the other hand, that the Minkowski error with R = 1 is suitable to approximate the minimum probability of error classifier.

Published in:

Signal Processing, IEEE Transactions on  (Volume:57 ,  Issue: 11 )