Subtree replacement in decision tree simplication (Contributo in atti di convegno)

Type
Label
  • Subtree replacement in decision tree simplication (Contributo in atti di convegno) (literal)
Anno
  • 2012-01-01T00:00:00+01:00 (literal)
Alternative label
  • Ruggieri S. (2012)
    Subtree replacement in decision tree simplication
    in 12th SIAM Conference on Data Mining, Anaheim, California USA, 26,28 April 2012
    (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori
  • Ruggieri S. (literal)
Pagina inizio
  • 379 (literal)
Pagina fine
  • 390 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#url
  • http://siam.omnibooksonline.com/2012datamining/data/papers/115.pdf (literal)
Note
  • Scopu (literal)
  • PuMa (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni
  • CNR-ISTI, Pisa, Italy; (literal)
Titolo
  • Subtree replacement in decision tree simplication (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#isbn
  • 978-1-61197-232-0 (literal)
Abstract
  • The current availability of efficient algorithms for decision tree induction makes intricate post-processing tech- niques worth to be investigated both for eciency and effectiveness. We study the simplification operator of subtree replacement, also known as grafting, originally implemented in the C4.5 system. We present a parametric bottom-up algorithm integrating grafting with the standard pruning operator, and analyze its complexity in terms of the number of nodes visited. Immediate instances of the parametric algorithm include extensions of error based, reduced error, minimum error, and pessimistic error pruning. Experimental results show that the computational cost of grafting is paid of by statis- tically significant smaller trees without accuracy loss. (literal)
Prodotto di
Autore CNR
Insieme di parole chiave

Incoming links:


Prodotto
Autore CNR di
Insieme di parole chiave di
data.CNR.it