An Introduction to Tree-Based Algorithms

by eric colburn

The tree has one (1) node that's called its "root."

The tree originates from this, and hence

it—that is, the root—has no parent.

Each node, with only one parent, can have multiple shoots,

known as "children," and "leaves"–or shall we say, "fruit"?

No. The extremity at the end of an "edge"

is a "leaf"--containing no seeds, no spores, no eggs–

nothing that could become another "root."

A "random forest," then, is planted by hand?

No. We use meta-learning–or in plain

English, Hyper-Heuristics–for algo recs.

Decision trees will march across the land

like Birnam Wood coming to Dunsinane—

dooming us to death–or robot sex.