Efficient algorithms for decision tree cross-validation

Details Efficient algorithms for decision tree cross-validation Efficient algorithms for decision tree cross-validation

2001-10-17

arxiv.org/abs/cs/0110036v1

H. Blockeel and J. Struyf. Efficient algorithms for decision tree cross-validation. Proceedings of the Eighteenth Internationa

Computer Science

Learning

9 pages, 6 figures. http://www.cs.kuleuven.ac.be/cgi-bin-dtai/publ_info.pl?id=34784

Scientific paper

Cross-validation is a useful and generally applicable technique often employed in machine learning, including decision tree induction. An important disadvantage of straightforward implementation of the technique is its computational overhead. In this paper we show that, for decision trees, the computational overhead of cross-validation can be reduced significantly by integrating the cross-validation with the normal decision tree induction process. We discuss how existing decision tree algorithms can be adapted to this aim, and provide an analysis of the speedups these adaptations may yield. The analysis is supported by experimental results.

Affiliated with

Also associated with

No associations

Rating

Efficient algorithms for decision tree cross-validation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Efficient algorithms for decision tree cross-validation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient algorithms for decision tree cross-validation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-347492