BOAT—optimistic decision tree construction
Johannes E. Gehrke, Venkatesh Ganti, Raghu Ramakrishnan et al. · Proceedings - ACM-SIGMOD International Conference on Management of Data · 1999
Classification is an important data mining problem. Given a training database of records, each tagged with a class label, the goal of classification is to build a concise model that can be used to predict the class label of future, unlabeled records. A very popular class of classifiers are decision trees. All current algorithms to construct decision trees, including all main-memory algorithms, make one scan over the training database per level of the tree.
Cited by 149 works. doi:10.1145/304182.304197
Authors
References
- Induction of Decision Trees
- An Introduction to the Bootstrap
- Nonlinear Programming
- Database mining: a performance perspective
- Bootstrap Methods and their Application
- Incremental Induction of Decision Trees
- Decision Tree Induction Based on Efficient Tree Restructuring
- Data mining using two-dimensional optimized association rules
- Construction and Assessment of Classification Rules.
- Mining optimized association rules for numeric attributes