Perceptron Based Learning with Example Dependent and Noisy Costs

Learning algorithms from the fields of artificial neural networks and machine learning, typically, do not take any costs into account or allow only costs depending on the classes of the examples that are used for learning. As an extension of class dependent costs, we consider costs that are example, i.e. feature and class dependent. We derive a cost-sensitive perceptron learning rule for nonseparable classes, that can be extended to multi-modal classes (DIPOL). We also derive aa approach for including example dependent costs into an arbitrary cost-insensitive learning algorithm by sampling according to modified probability distributions.

[1]  Vladimir N. Vapnik,et al.  The Nature of Statistical Learning Theory , 2000, Statistics for Engineering and Information Science.

[2]  Gholamreza Nakhaeizadeh,et al.  Machine learning and statistics: the interface , 1996 .

[3]  D. Bertsekas,et al.  Incremental subgradient methods for nondifferentiable optimization , 1999, Proceedings of the 38th IEEE Conference on Decision and Control (Cat. No.99CH36304).

[4]  Fritz Wysotzki,et al.  Automatic Construction of Decision Trees and Neural Nets for Classification Using Statistical Considerations , 1997 .

[5]  F. Clarke Optimization And Nonsmooth Analysis , 1983 .

[6]  Dimitri P. Bertsekas,et al.  Incremental Subgradient Methods for Nondifferentiable Optimization , 2001, SIAM J. Optim..

[7]  Zdzislaw Piasta,et al.  Rough Classifiers Sensitive to Costs Varying from Object to Object , 1998, Rough Sets and Current Trends in Computing.

[8]  Charles Elkan,et al.  The Foundations of Cost-Sensitive Learning , 2001, IJCAI.

[9]  David J. Spiegelhalter,et al.  Machine Learning, Neural and Statistical Classification , 2009 .

[10]  Rajesh Parekh,et al.  Comparison of performance of variants of single-layer perceptron algorithms on nonseparable data , 2000 .

[11]  Salvatore J. Stolfo,et al.  Toward Scalable Learning with Non-Uniform Class and Cost Distributions: A Case Study in Credit Card Fraud Detection , 1998, KDD.

[12]  Richard O. Duda,et al.  Pattern classification and scene analysis , 1974, A Wiley-Interscience publication.

[13]  Thomas G. Dietterich,et al.  Bootstrap Methods for the Cost-Sensitive Evaluation of Classifiers , 2000, ICML.

[14]  Peter Geibel,et al.  Using costs varying from object to object to construct linear and piecewise linear classi ers , 2002 .

[15]  Bianca Zadrozny,et al.  Learning and making decisions when costs and probabilities are both unknown , 2001, KDD '01.

[16]  László Györfi,et al.  A Probabilistic Theory of Pattern Recognition , 1996, Stochastic Modelling and Applied Probability.

[17]  Igor Kononenko,et al.  Cost-Sensitive Learning with Neural Networks , 1998, ECAI.