PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

C4.5 Competence Map: A Phase Transition-inspired Approach
Nicolas Baskiotis and Michele Sebag
In: ICML 2004, 4-8 Jul 2004, Banff, Canada.


How to determine a priori whether a learning algorithm is suited to a learning problem instance is a major scientific and technological challenge. A first step toward this goal, inspired by the Phase Transition (PT) paradigm developed in the Constraint Satisfaction domain, is presented in this paper. Based on the PT paradigm, extensive and principled experiments allow for constructing the Competence Map associated to a learning algorithm, describing the regions where this algorithm on average fails or succeeds. The approach is illustrated on the long and widely used C4.5 algorithm. A non trivial failure region in the landscape of k-term DNF languagesis observed and some interpretations are offered for the experimental results.

EPrint Type:Conference or Workshop Item (Paper)
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Theory & Algorithms
ID Code:766
Deposited By:Nicolas Baskiotis
Deposited On:30 December 2004