Searching for "On the Boosting Pruning Problem." – sorted by Relevance.
-
On the Boosting Pruning problem
- On the Boosting Pruning problem Christino Tamon 1 and Jie Xiang 2 1 Clarkson University
- Cited by 7 (0 self) – Add To MetaCart
-
Selective Ensemble of Decision Trees
- that the boosting pruning problem is NP-complete and is even hard to approximate [22], and the pruning may sacrifice
- Cited by 5 (1 self) – Add To MetaCart

