BENEFIT MAXIMIZING CLASSIFICATION USING FEATURE INTERVALS

[1]  Peter D. Turney.  Types of Cost in Inductive Concept Learning , 2002, ArXiv.

[2]  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.

[3]  Pedro M. Domingos.  MetaCost: a general method for making classifiers cost-sensitive , 1999, KDD '99.

[4]  J. Ross Quinlan,et al.  C4.5: Programs for Machine Learning , 1992 .

[5]  Salvatore J. Stolfo,et al.  AdaCost: Misclassification Cost-Sensitive Boosting , 1999, ICML.

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

[7]  Kai Ming Ting,et al.  Boosting Trees for Cost-Sensitive Classifications , 1998, ECML.

[8]  H. Altay Güvenir,et al.  Learning differential diagnosis of erythemato-squamous diseases using voting feature intervals , 1998, Artif. Intell. Medicine.

[9]  Ian H. Witten,et al.  Data mining: practical machine learning tools and techniques with Java implementations , 2002, SGMD.

[10]  Leo Breiman,et al.  Bagging Predictors , 1996, Machine Learning.

[11]  Ralph Bergmann,et al.  Considering Decision Cost During Learning of Feature Weights , 1996, EWCBR.

[12]  Thomas G. Dietterich,et al.  Pruning Improves Heuristic Search for Cost-Sensitive Learning , 2002, ICML.

[13]  Carla E. Brodley,et al.  Pruning Decision Trees with Misclassification Costs , 1998, ECML.

[14]  Pedro M. Domingos,et al.  How to Get a Free Lunch: A Simple Cost Model for Machine Learning Applications , 1998 .

[15]  Geoffrey I. Webb.  Cost-Sensitive Specialization , 1996, PRICAI.

[16]  Leo Breiman,et al.  Classification and Regression Trees , 1984 .

[17]  Foster Provost,et al.  The effect of class distribution on classifier learning , 2001 .

[18]  Kai Ming Ting,et al.  An Instance-weighting Method to Induce Cost-sensitive Trees , 2001 .

[19]  Ralf Herbrich,et al.  Learning Kernel Classifiers , 2001 .

[20]  Catherine Blake,et al.  UCI Repository of machine learning databases , 1998 .

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

[22]  Masanobu Taniguchi,et al.  Input dependent misclassification costs for cost-sensitive classifiers , 2000 .

[23]  Thomas G. Dietterich,et al.  Methods for cost-sensitive learning , 2002 .

[24]  H. Altay Güvenir,et al.  Concept Representation with Overlapping Feature Intervals , 1998, Cybern. Syst..

[25]  Robert C. Holte,et al.  Exploiting the Cost (In)sensitivity of Decision Tree Splitting Criteria , 2000, ICML.

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

[27]  H. Altay Güvenir,et al.  Classification by Voting Feature Intervals , 1997, ECML.

[28]  Alex Alves Freitas,et al.  On rule interestingness measures , 1999, Knowl. Based Syst..

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