Yet Another Representation of Binary Decision Trees: A Mathematical Demonstration. (arXiv:2101.07077v6 [cs.LG] UPDATED)

A decision tree looks like a simple computational graph without cycles, where
only the leaf nodes specify the output values and the non-terminals specify
their tests or split conditions. From the numerical perspective, we express
decision trees in the language of computational graph. We explicitly
parameterize the test phase, traversal phase and prediction phase of decision
trees based on the bitvectors of non-terminal nodes. As shown later, the
decision tree is a shallow binary network in some sense. Especially, we …

arxiv binary decision lg representation trees