Perceptron Based Learning with Example Dependent and Noisy Costs

Proceedings, Twentieth International Conference on Machine Learning

Volumn 1, Issue , 2003, Pages 218-225

  Geibel, Peter ^a   Wysotzki, Fritz ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; CLASSIFIERS; COST ACCOUNTING; LEARNING SYSTEMS; MATRIX ALGEBRA; NEURAL NETWORKS; PREDICTIVE CONTROL SYSTEMS; PROBABILITY DISTRIBUTIONS; REGRESSION ANALYSIS;

COST MATRIX; COST-SENSITIVE LEARNING ALGORITHM; CREDIT RISK ASSIGNMENT; MISCLASSIFICATION COSTS; NOISY COSTS;

LEARNING ALGORITHMS;

EID: 1942517291     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. Chan, P. K., & Stolfo, S. J. (1998). Toward scalable learning with non-uniform class and cost distributions: A case study in credit card fraud detection. Knowledge Discovery and Data Mining (Proc. KDD98) (pp. 164-168).
2. Clarke, F. H. (1983). Optimization and nonsmooth analysis. Canadian Math. Soc. Series of Monographs and Advanced Texts. John Wiley & Sons.
3. Devroye, L., Györfi, L., & Gabor, L. (1996). A probabilistic theory of pattern recognition. Springer-Verlag.
4. Duda, R. O., & Hart, P. E. (1973). Pattern classification and scene analysis. New York: John Wiley & Sons.
5. Elkan, C. (2001). The foundations of Cost-Sensitive learning. Proceedings of the seventeenth International Conference on Artificial Intelligence (IJCAI-01) (pp. 973-978). San Francisco, CA: Morgan Kaufmann Publishers, Inc.
6. Geibel, P., & Wysotzki, F. (2002). Using costs varying from object to object to construct linear and piecewise linear classifiers (Technical Report 2002-5). TU Berlin, Fak. IV (WWW http://ki.cs.tuberlin.de/~geibel/publications. html).
7. Kukar, M., & Kononenko, I. (1998). Cost-sensitive learning with neural networks. Proceedings of the 13th European Conference on Artificial Intelligence (ECAI-98) (pp. 445-449). Chichester: John Wiley & Sons.
8. Lenarcik, A., & Piasta, Z. (1998). Rough classifiers sensitive to costs varying from object to object. Proceedings of the 1st International Conference on Rough Sets and Current Trends in Computing (RSCTC-98) (pp. 222-230). Berlin: Springer.
9. Margineantu, D. D., & Dietterich, T. G. (2000). Bootstrap methods for the cost-sensitive evaluation of classifiers. Proc. 17th International Conf. on Machine Learning (pp. 583-590). Morgan Kaufmann, San Francisco, CA.
10. Michie, D., Spiegelhalter, D. H., & Taylor, C. C. (1994). Machine learning, neural and statistical classification. Series in Artificial Intelligence. Ellis Horwood.
11. Nedic, A., & Bertsekas, D. (2001). Incremental sub-gradient methods for nondifferentiable optimization. SIAM Journal on Optimization, 109-138.
12. Schulmeister, B., & Wysotzki, F. (1997). Dipol - a hybrid piecewise linear classifier. In R. Nakeiazadeh and C. C. Taylor (Eds.), Machine learning and statistics: The interface, 133-151. Wiley.
13. Unger, S., & Wysotzki, F. (1981). Lernfähige Klassifizierungssysteme (Classifier Systems that are able to Learn). Berlin: Akademie-Verlag.
14. Vapnik, V. N. (1995). The nature of statistical learning theory. New York: Springer.
15. Wysotzki, F., Müller, W., & Schulmeister, B. (1997). Automatic construction of decision trees and neural nets for classification using statistical considerations. In G. DellaRiccia, H.-J. Lenz and R. Kruse (Eds.), Learning, networks and statistics, no. 382 in CISM Courses and Lectures. Springer.
16. Yang, J., Parekh, R., & Honavar, V. (2000). Comparison of performance of variants of single-layer perceptron algorithms on non-separable data. Neural, Parallel and Scientific Computation, 8, 415-438.
17. Zadrozny, B., & Elkan, C. (2001). Learning and making decisions when costs and probabilities are both unknown. Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-01) (pp. 204-214). New York: ACM Press.