Package teamwork :: Package math :: Module ProbabilityTree :: Class ProbabilityTree

Class ProbabilityTree

matrices.DecisionTree --+    
                        |    
      KeyedTree.KeyedTree --+
                            |
                           ProbabilityTree

A decision tree that supports probabilistic branches

If this node is not a probabilistic branch, then identical to a KeyedTree object.

Nested Classes

[hide private]

Inherited from KeyedTree.KeyedTree: planeClass

Instance Methods

[hide private]

fill(self, keys, value=0.0)
Fills in any missing slots with a default value

source code

freeze(self)
Locks in the dimensions and keys of all leaves

source code

unfreeze(self)
Unocks in the dimensions and keys of all leaves

source code

boolean

isProbabilistic(self)
Returns: true iff there's a probabilistic branch at this node

source code

ProbabilityTree[]

children(self)
Returns: all child nodes of this node

source code

branch(self, plane, falseTree=None, trueTree=None, pruneF=True, pruneT=True, prune=True, debug=False)
Same as KeyedTree.branch, except that plane can be a Distribution source code

a new DecisionTree instance

_merge(self, other, op, comparisons=None, conditions=[])
Helper method that merges the two trees together using the given operator to combine leaf values, without pruning source code

prune(self, comparisons=None, debug=False)

source code

marginalize(self, key)
Marginalizes any distributions to remove the given key (not in place! returns the new tree)

source code

condition(self, observation)

source code

instantiate(self, values)

source code

instantiateKeys(self, values)
Replaces any key references by the values in the table

source code

generateAlternatives(self, index, value, test=None)

source code

str

simpleText(self, printLeaves=True, numbers=True, all=False)
Returns a more readable string version of this tree

source code

updateKeys(self)
Updates the record of contained keys in self.keys source code

__getitem__(self, index)
Returns: the distribution over leaf nodes for this value

source code

_multiply(self, other, comparisons=None, conditions=[]) source code

__str__(self)

source code

__xml__(self)

source code

parse(self, element, valueClass=None, debug=False)
Extracts the tree from the given XML element

source code

Inherited from KeyedTree.KeyedTree: getKeys, pruneIdentities, scale, toNumeric

Inherited from KeyedTree.KeyedTree (private): _instantiate, _keys

Inherited from matrices.DecisionTree: __add__, __copy__, __eq__, __hash__, __init__, __mul__, __neg__, __sub__, branches, count, createIndex, depth, fromRules, getPath, getValue, isLeaf, leafNodes, leaves, makeLeaf, makeRules, merge, rebalance, removeTautologies, replace

Inherited from matrices.DecisionTree (private): _extractTree

Class Variables

[hide private]

Inherited from matrices.DecisionTree: checkPrune, checkTautology

Instance Variables

[hide private]

Inherited from KeyedTree.KeyedTree: keys

Method Details

Class ProbabilityTree

fill(self, keys, value=0.0)

freeze(self)

unfreeze(self)

isProbabilistic(self)

children(self)

branch(self, plane, falseTree=None, trueTree=None, pruneF=True, pruneT=True, prune=True, debug=False)

_merge(self, other, op, comparisons=None, conditions=[])

prune(self, comparisons=None, debug=False)

marginalize(self, key)

instantiate(self, values)

instantiateKeys(self, values)

generateAlternatives(self, index, value, test=None)

simpleText(self, printLeaves=True, numbers=True, all=False)

updateKeys(self)

__getitem__(self, index) (Indexing operator)

_multiply(self, other, comparisons=None, conditions=[])

__str__(self) (Informal representation operator)

__xml__(self)

parse(self, element, valueClass=None, debug=False)

_merge(self, other, op, comparisons=None, conditions=`[]`)

getitem(self, index)
(Indexing operator)

_multiply(self, other, comparisons=None, conditions=`[]`)

str(self)
(Informal representation operator)

xml(self)