Corpus ID: 14860223

Anytime Induction of Decision Trees: An Iterative Improvement Approach

@inproceedings{Esmeir2006AnytimeIO,
  title={Anytime Induction of Decision Trees: An Iterative Improvement Approach},
  author={Saher Esmeir and Shaul Markovitch},
  booktitle={AAAI},
  year={2006}
}
  • Saher Esmeir, Shaul Markovitch
  • Published in AAAI 2006
  • Computer Science
  • Most existing decision tree inducers are very fast due to their greedy approach. In many real-life applications, however, we are willing to allocate more time to get better decision trees. Our recently introduced LSID3 contract anytime algorithm allows computation speed to be traded for better tree quality. As a contract algorithm, LSID3 must be allocated its resources a priori, which is not always possible. In this work, we present IIDT, a general framework for interruptible induction of… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Citations

    Publications citing this paper.
    SHOWING 1-6 OF 6 CITATIONS

    Efficient and Progressive Group Steiner Tree Search

    VIEW 2 EXCERPTS
    CITES BACKGROUND

    Density-based algorithms for active and anytime clustering

    VIEW 1 EXCERPT
    CITES METHODS

    A Taxonomy of Similarity Mechanisms for Case-Based Reasoning

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Using Index Structures for Anytime Stream Mining

    VIEW 1 EXCERPT
    CITES METHODS

    References

    Publications referenced by this paper.