A fixed-point algorithm to minimax learning with neural networks

IEEE Transactions on Systems, Man and Cybernetics Part C: Applications and Reviews

Volumn 34, Issue 4, 2004, Pages 383-392

  Guerrero Curieses, Alicia ^a   Alaiz Rodríguez, Rocío ^b   Cid Sueiro, Jesús ^a  

^a UNIVERSIDAD CARLOS III DE MADRID   (Spain)

^b UNIVERSITY OF LEÓN   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SYSTEMS; ESTIMATION; LEARNING ALGORITHMS; PATTERN RECOGNITION; PROBABILITY;

LOSS FUNCTIONS; MINIMAX LEARNING STRATEGY; UNCERTAINTY-IN-A-PRIORI PROBABILITIES;

NEURAL NETWORKS;

EID: 7744240194     PISSN: 10946977     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSMCC.2004.833284     Document Type: Article

References (17)

1. H. L. V. Trees, [i Detection, Estimation and Modulation Theory i]. New York: Wiley, 1968.
2. M. Kubat and S. Matwin, "Addressing the curse of imbalanced training sets: one-sided selection," in [i Proc. 14th Int. Conf. Machine Learning i]. San Mateo, CA, 1997, pp. 179-186.
3. S. Lawrence, I. Burns, A. Back, A. Tsoi, and C. L. Giles, "Neural network classification and unequal prior class probabilities," in [i Tricks of the Trade i]. ser. Lecture Notes in Computer Science State-of-the-Art Surveys, G. Orr, K.-R. Müller, and R. Caruana, Eds. New York: Springer-Verlag, 1998, pp. 299-314.
4. N. V. Chawla, K. W. Bowyer, L. Hall, and W. P. Kegelmeyer, "Smote: synthetic minority over-sampling technique," [i J. Artif. Intell. Res. i], vol. 16, pp. 321-357, 2002.
5. M. Saerens, P. Latinne, and C. Decaestecker, "Adjusting the outputs of a classifier to new a priori probabilities: A simple procedure," [i Neural Comput. i], vol. 14, no. 1, pp. 21-41, Jan. 2002.
6. F. J. Provost and T. Fawcett, "Robust classification systems for imprecise environments," [i Mach. Learn. i], vol. 42, no. 3, pp. 203-231, Mar. 2001.
7. M. G. Kelly, D. J. Hand, and N. M. Adams, "The impact of changing populations on classifier performance," in [i Proc. 5th Int. Conf. SIG Knowledge Discovery and Data Mining (SIGKDD) i], 1999, pp. 367-371.
8. M. Kubat, R. Holte, and S. Matwin, "Machine learning for the detection of oil spills in satellite radar images," [i Mach. Learn. i], vol. 30, no. 2, 3, pp. 195-215, 1998.
9. C. Elkan, "The foundations of cost-sensitive learning," in [i Proc. 17th Int. Joint Conf. Artif. Intell. i], 2001, pp. 973-978.
10. C. Elkan, "Adacost: misclassification cost-sensitive boosting," in [i Proc. 16th Int. Conf. Mach. Learn. i], 1999, pp. 97-105.
11. T. K. Moon and W. C. Stirling, [i Mathematical Methods and Algorithms for Signal Processing i]. Englewood Cliffs, NJ: Prentice-Hall, 2000.
12. R. O. Duda, P. E. Hart, and D. Stork, [i Pattern Classification i]. New York: Wiley, 2001.
13. E. Takimoto and M. Warmuth, "The minimax strategy for Gaussian density estimation," in [i Proc. 13th Annu. Conf. Comput. Learning Theory i]. San Mateo, CA, 2000, pp. 100-106.
14. E. Polak, [i Optimization: Algorithms and Consistent Approximations i]. New York: Springer-Verlag, 1997.
15. J. Cid-Sueiro and A. Figueiras-Vidal, "On the structure of strict sense Bayesian cost functions and its applications," [i IEEE Trans. Neural Networks i], vol. 12, pp. 445-455, May 2001.
16. J. Cid-Sueiro, J. Arribas, S. Urbán-Munoz, and A. Figueiras-Vidal, "Cost functions to estimate a posteriori probabilities in multi-class problems," [i IEEE Trans. Neural Networks i], vol. 10, pp. 645-656, May 1999.
17. C. Blake and C. Merz. (1998) UCI Repository of Machine Learning Databases. Tech. Rep.. [Online] Available: