Sciweavers

    ICML
    1998
    IEEE
    264views Machine Learning» more  ICML 1998»
    A Fast, Bottom-Up Decision Tree Pruning Algorithm with Near-Optimal Generalization
    16 years 3 months ago
    A Fast, Bottom-Up Decision Tree Pruning Algorithm with Near-Optimal Generalization
    Download  www.cis.upenn.edu
    In this work, we present a new bottom-up algorithmfor decision tree pruning that is very e cient requiring only a single pass through the given tree, and prove a strong performanc...
    Michael J. Kearns, Yishay Mansour
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.