Advances in Artificial Intelligence

We present our experience in applying a rule induction technique to an extremely imbalanced pharmaceutical data set. We focus on using a variety of performance measures to evaluate a number of rule quality measures. We also investigate whether simply changing the distribution skew in the training data can improve predictive performance. Finally, we propose a method for adjusting the learning algorithm for learning in an extremely imbalanced environment. Our experimental results show that this adjustment improves predictive performance for rule quality formulas in which rule coverage makes positive contributions to the rule quality value.

[1]  Matthias Klusch,et al.  Brokering and Matchmaking for Coordination of Agent Societies: A Survey , 2001, Coordination of Internet Agents: Models, Technologies, and Applications.

[2]  Jörg P. Müller,et al.  COOPERATIVE TRANSPORTATION SCHEDULING : AN APPLICATION DOMAIN FOR DAI , 1996 .

[3]  Klaus Fischer,et al.  Decision theory and coordination in multiagent systems , 1998 .

[4]  Yoav Freund,et al.  A decision-theoretic generalization of on-line learning and an application to boosting , 1995, EuroCOLT.

[5]  J. Ross Quinlan,et al.  Bagging, Boosting, and C4.5 , 1996, AAAI/IAAI, Vol. 1.

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

[7]  Christian Gerber.  Flexible Autonomy in Holonic Agent Systems , 2002 .

[8]  Charles L. Lawson,et al.  Solving least squares problems , 1976, Classics in applied mathematics.

[9]  Ian H. Witten,et al.  Stacked generalization: when does it work? , 1997, IJCAI 1997.

[10]  Aiko M. Hormann,et al.  Programs for Machine Learning. Part I , 1962, Inf. Control..

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

[12]  Eleni Stroulia,et al.  A Model-Based Approach to Blame Assignment: Revising the Reasoning Steps of Problem Solvers , 1996, AAAI/IAAI, Vol. 2.

[13]  Ron Kohavi,et al.  The Case against Accuracy Estimation for Comparing Induction Algorithms , 1998, ICML.

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

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

[16]  Richard Fikes,et al.  STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.

[17]  Tom M. Mitchell,et al.  A Personal Learning Apprentice , 1992, AAAI.

[18]  J. William Murdock,et al.  The Role of Reflection in Scientific Exploration , 1998 .

[19]  Pattie Maes,et al.  Learning Interface Agents , 1993, AAAI.

[20]  Ian H. Witten,et al.  Issues in Stacked Generalization , 2011, J. Artif. Intell. Res..

[21]  Kai Ming Ting,et al.  A Comparative Study of Cost-Sensitive Boosting Algorithms , 2000, ICML.