Yet Another Representation of Binary Decision Trees: A Mathematical Demonstration
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2021
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929577774809088 |
|---|---|
| author | Zhang, Jinxiong |
| author_facet | Zhang, Jinxiong |
| contents | A decision tree looks like a simple directed acyclic computational graph, 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, the decision tree is a shallow binary network in some sense. Especially, we introduce the bitvector matrix to implement the tree traversal in numerical approach, where the core is to convert the logical `AND' operation to arithmetic operations. And we apply this numerical representation to extend and unify diverse decision trees in concept. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2101_07077 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | Yet Another Representation of Binary Decision Trees: A Mathematical Demonstration Zhang, Jinxiong Machine Learning 15A03, 62B99, 62G86 G.1.3; E.4; A.m A decision tree looks like a simple directed acyclic computational graph, 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, the decision tree is a shallow binary network in some sense. Especially, we introduce the bitvector matrix to implement the tree traversal in numerical approach, where the core is to convert the logical `AND' operation to arithmetic operations. And we apply this numerical representation to extend and unify diverse decision trees in concept. |
| title | Yet Another Representation of Binary Decision Trees: A Mathematical Demonstration |
| topic | Machine Learning 15A03, 62B99, 62G86 G.1.3; E.4; A.m |
| url | https://arxiv.org/abs/2101.07077 |