HTILDE: scaling up relational decision trees for very large databases

@inproceedings{Lopes2009HTILDESU,
  title={HTILDE: scaling up relational decision trees for very large databases},
  author={Carina Lopes and Gerson Zaverucha},
  booktitle={SAC},
  year={2009}
}
Nowadays, many organizations have relational databases with millions of records and an important question is how to extract information from them. This work proposes HTILDE (Hoeffding TILDE) to handle very large relational databases, based on the Inductive Logic Programming (ILP) system TILDE (Top-down Induction of Logical Decision Trees) and the propositional Very Fast Decision Tree (VFDT) learner. It is an incremental and anytime algorithm that uses the Hoeffding bound to find out the amount… CONTINUE READING
4 Citations
5 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-4 of 4 extracted citations

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…