ConceptTheory & Algos
W-clipped decision tree
A decision tree is W-clipped if at every internal node, there is a leaf at a distance of at most W.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Connections
3The lectures that define it or assume it, and the concepts next to it.