Sign inSign in

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.
as Ryan O'Donnell defines itCarnegie Mellon University
Watch it explained

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.

Decision tree2Depth1Internal node1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

1

    Connections

    3

    The lectures that define it or assume it, and the concepts next to it.

    Concepts2

    Lecture1

    1 lecturer. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.