| Trees | Indices | Help |
|
|---|
|
|
Tree.TreeNode --+
|
DecTree.DecTreeNode --+
|
SigTreeNode
|
|||
|
|||
|
|||
|
|||
|
Inherited from Inherited from |
|||
|
|||
Set the names of each node in the tree from a list of variable names.
**Arguments**
- varNames: a list of names to be assigned
**Notes**
1) this works its magic by recursively traversing all children
2) The assumption is made here that the varNames list can be indexed
by the labels of tree nodes
|
Recursively classify an example by running it through the tree
**Arguments**
- example: the example to be classified, a sequence at least
2 long:
( id, sig )
where sig is a BitVector (or something supporting __getitem__)
additional fields will be ignored.
- appendExamples: if this is nonzero then this node (and all children)
will store the example
**Returns**
the classification of _example_
|
constructor
**Arguments**
- parent: the parent of this node in the tree
- name: the name of the node
- label: the node's label (should be an integer)
- data: an optional data field
- level: an integer indicating the level of this node in the hierarchy
(used for printing)
- isTerminal: flags a node as being terminal. This is useful for those
times when it's useful to know such things.
|
| Trees | Indices | Help |
|
|---|
| Generated by Epydoc 3.0.1 on Thu Feb 1 16:13:01 2018 | http://epydoc.sourceforge.net |