See this document in CiteSeerX!

A Heuristic for Learning Decision Trees and Pruning Them into Classification Rules  (Make Corrections)  
Jose Ranilla, Oscar Luaces, Antonio Bahamonde



  Home/Search   Context   Related

 
View or download:
aic.uniovi.es/MLgro...ilrulesaicom.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  aic.uniovi.es/MLgr...publications (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Let us consider a set of training examples described by continuous or symbolic attributes with categorical classes. In this paper we present a measure of the potential quality of a region of the attribute space to be represented as a rule condition to classify unseen cases. The aim is to take into account the distribution of the classes of the examples. The resulting measure, called impurity level, is inspired by a similar measure used in the instance-based algorithm IB3 for selecting suitable... (Update)

Similar documents based on text:   More   All
0.6:   A Heuristic for Learning Decision Trees and Pruning.. - Ranilla, Luaces..   (Correct)
0.4:   Self-Organizing Cases to Find Paradigms - Coz, Luaces, Quevedo, Alonso.. (1999)   (Correct)
0.4:   Inflating Examples to Obtain Rules - Luaces, Bahamonde (2002)   (Correct)

BibTeX entry:   (Update)

@misc{ ranilla-heuristic,
  author = "Jose Ranilla and Oscar Luaces and Antonio Bahamonde",
  title = "A Heuristic for Learning Decision Trees and Pruning Them into Classification
    Rules",
  url = "citeseer.ist.psu.edu/731660.html" }
Citations (may not include all citations):
2177   Programs for Machine Learning (context) - Quinlan - 1993
1447   A mathematical theory of communication (context) - Shannon - 1948
696   UCI repository of machine learning databases (context) - Blake, Merz
503   Instancebased learning algorithms (context) - Aha, Kibler et al. - 1991
216   A universal prior for integers and estimation by minimum des.. (context) - Rissanen - 1983
164   A study of cross-validation and bootstrap for accuracy estim.. - Kohavi - 1995
94   Constructing optimal binary decision trees is NP-complete (context) - Hya, Rivest - 1976
87   ective rule induction (context) - Cohen - 1995
74   Improved heterogeneous distance functions - Wilson, Mart - 1997
73   Experiments in Induction (context) - Hunt, Marin et al. - 1966
65   A Study of Instance-based Algorithms for Supervised Learning.. (context) - Aha - 1990
63   Mersenne twister: A 623-dimensionally equidistributed unifor.. (context) - Matsumoto, Nishimura - 1998
52   Improved use of continuous attributes in C - Quinlan - 1996
49   Unifying instance-based and rule-based induction - Domingos - 1996
45   An experimental comparison of the nearest-neighbor and neare.. - Wettschereck, Dietterich - 1995

[Article contains additional citations not shown here]

Documents on the same site (http://www.aic.uniovi.es/MLgroup/publications.html):   More
Learning to Assess From Pair-Wise Comparisons - Díez, Coz, Luaces, Goyache.. (2002)   (Correct)
Inductive Properties of Lattices - Bahamonde (1994)   (Correct)
Inductive Properties of Lattices - Bahamonde (1994)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC