Types of Cost in Inductive Concept Learning

Inductive concept learning is the task of learning to assign cases to a discrete set of classes. In real-world applications of concept learning, there are many different types of cost involved. The majority of the machine learning literature ignores all types of cost (unless accuracy is interpreted as a type of cost measure). A few papers have investigated the cost of misclassification errors. Very few papers have examined the many other types of cost. In this paper, we attempt to create a taxonomy of the different types of cost that are involved in inductive concept learning. This taxonomy may help to organize the literature on cost-sensitive learning. We hope that it will inspire researchers to investigate all types of cost in inductive concept learning in more depth.

[1]  J. Habbema,et al.  Cases of doubt in allocation problems , 1974 .

[2]  Marlon Núñez,et al.  Economic Induction: A Case Study , 1988, EWSL.

[3]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

[4]  Ming Tan,et al.  Learning a Cost-Sensitive Internal Representation for Reinforcement Learning , 1991, ML.

[5]  Ruey-Wen Liu.  Testing and Diagnosis of Analog Circuits and Systems , 1991, Springer US.

[6]  Floor Verdenius,et al.  A Method for Inductive Cost Optimization , 1991, EWSL.

[7]  William M. Spears,et al.  An Artificial Intelligence Approach to Analog Systems Diagnosis , 1991 .

[8]  Ming Tan,et al.  Cost-Sensitive Reinforcement Learning for Adaptive Classification and Control , 1991, AAAI.

[9]  Tom Elliott Fawcett.  Feature discovery for problem solving systems , 1993 .

[10]  David A. Cohn,et al.  Active Learning with Statistical Models , 1996, NIPS.

[11]  Anders Krogh,et al.  Neural Network Ensembles, Cross Validation, and Active Learning , 1994, NIPS.

[12]  Peter D. Turney.  Cost-Sensitive Classification: Empirical Evaluation of a Hybrid Genetic Decision Tree Induction Algorithm , 1994, J. Artif. Intell. Res..

[13]  Tom Fawcett,et al.  Combining Data Mining and Machine Learning for Effective User Profiling , 1996, KDD.

[14]  Maarten van Someren,et al.  A Systematic Description of Greedy Optimisation Algorithms for Cost Sensitive Generalisation , 1997, IDA.

[15]  David W. Opitz,et al.  Connectionist Theory Refinement: Genetically Searching the Space of Network Topologies , 1997, J. Artif. Intell. Res..

[16]  Pedro M. Domingos.  Knowledge Discovery Via Multiple Models , 1998, Intell. Data Anal..

[17]  Tim Oates,et al.  Efficient progressive sampling , 1999, KDD '99.

[18]  Tom Fawcett,et al.  Activity monitoring: noticing interesting changes in behavior , 1999, KDD '99.

[19]  Peter D. Turney.  Low Size-Complexity Inductive Logic Programming: The East-West Challenge Considered as a Problem in Cost-Sensitive Classification , 2002, ArXiv.

[20]  Constance de Koning,et al.  Editors , 2003, Annals of Emergency Medicine.

[21]  Peter D. Turney.  Technical note: Bias and the quantification of stability , 1995, Machine Learning.

[22]  Marlon Núñez.  The use of background knowledge in decision tree induction , 2004, Machine Learning.

[23]  Tom Fawcett,et al.  Adaptive Fraud Detection , 1997, Data Mining and Knowledge Discovery.

[24]  Martina Hasenjäger,et al.  Active Learning with Local Models , 1998, Neural Processing Letters.

[25]  John Mingers,et al.  An Empirical Comparison of Pruning Methods for Decision Tree Induction , 1989, Machine Learning.

[26]  Ming Tan,et al.  Cost-sensitive learning of classification knowledge and its applications in robotics , 2004, Machine Learning.