Skip to Main content Skip to Navigation
Conference papers

C4.5 Competence Map: a Phase Transition-inspired Approach

Nicolas Baskiotis 1, 2 Michèle Sebag 1, 2
1 TANC - Algorithmic number theory for cryptology
Inria Saclay - Ile de France, LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau]
Abstract : 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 languages is observed and some interpretations are offered for the experimental results.
Document type :
Conference papers
Complete list of metadata

Cited literature [23 references]  Display  Hide  Download
Contributor : Nicolas Baskiotis Connect in order to contact the contributor
Submitted on : Tuesday, September 11, 2007 - 6:54:09 PM
Last modification on : Friday, February 4, 2022 - 3:33:24 AM
Long-term archiving on: : Friday, April 9, 2010 - 1:55:42 AM


Publisher files allowed on an open archive



Nicolas Baskiotis, Michèle Sebag. C4.5 Competence Map: a Phase Transition-inspired Approach. Twenty-First International Conference on Machine Learning, Jul 2004, Banff, Alberta, Canada. ⟨10.1145/1015330.1015398⟩. ⟨inria-00171190⟩



Record views


Files downloads