|
44 | 44 | #
|
45 | 45 | # The decision classifier has an attribute called ``tree_`` which allows access
|
46 | 46 | # to low level attributes such as ``node_count``, the total number of nodes,
|
47 |
| -# and ``max_depth``, the maximal depth of the tree. The tree_.compute_node_depths() |
48 |
| -# method computes the depth of each node in the tree. `tree_` also stores the |
49 |
| -# entire binary tree structure, represented as a number of parallel arrays. The |
50 |
| -# i-th element of each array holds information about the node ``i``. Node 0 is |
51 |
| -# the tree's root. Some of the arrays only apply to either leaves or split |
52 |
| -# nodes. In this case the values of the nodes of the other type is arbitrary. |
53 |
| -# For example, the arrays ``feature`` and ``threshold`` only apply to split |
54 |
| -# nodes. The values for leaf nodes in these arrays are therefore arbitrary. |
| 47 | +# and ``max_depth``, the maximal depth of the tree. The |
| 48 | +# ``tree_.compute_node_depths()`` method computes the depth of each node in the |
| 49 | +# tree. `tree_` also stores the entire binary tree structure, represented as a |
| 50 | +# number of parallel arrays. The i-th element of each array holds information |
| 51 | +# about the node ``i``. Node 0 is the tree's root. Some of the arrays only |
| 52 | +# apply to either leaves or split nodes. In this case the values of the nodes |
| 53 | +# of the other type is arbitrary. For example, the arrays ``feature`` and |
| 54 | +# ``threshold`` only apply to split nodes. The values for leaf nodes in these |
| 55 | +# arrays are therefore arbitrary. |
55 | 56 | #
|
56 | 57 | # Among these arrays, we have:
|
57 | 58 | #
|
|
0 commit comments