Subtree

A subtree of the graph G is a subgraph that is a tree.
A spanning tree is a spanning subgraph that is a tree. Every graph has a spanning forest. But only a connected graph has a spanning tree.

Removes a subtree from a single parent program and another tree is grown in its place through a random growth process.
Reproduction Operation
A single program is copied into the next generation.

retrieve a subtree of management values using SNMP GETNEXT requests.
snmpbulkwalk
retrieve a subtree of management values using SNMP GETBULK requests.

When this happens, an alternate subtree will be grown, with the new best splitting attribute at the root. As new examples stream in, the alternate subtree will continue to develop, without yet being used for classification.

The value for node A is 3, and the first found value for the subtree starting at node B is 2. So since the B node is at a MIN level, we know that the selected value for the B node must be less or equal than 2.

A REFERENCE node functions to refer to another tree or subtree.
A tree may also contain intermediate or minor nodes between the Goal node and the Leaf node. An intermediate node can represent logical operations like And or Or.

For a neural network we should be able to interrupt it and examine individual weights at any step in the modeling process. Likewise for a tree-based model we should be able to see subtrees at will.

See also: Branch, Pruning, Knowledge, Attribute, Artificial intelligence