Package marytts.cart

Class Summary

Class	Description
CART	A tree is a specific kind of directed graph in which each node can have only a single parent node.
DecisionNode	A decision node that determines the next Node to go to in the CART.
DecisionNode.BinaryByteDecisionNode	A binary decision Node that compares two byte values.
DecisionNode.BinaryFloatDecisionNode	A binary decision Node that compares two float values.
DecisionNode.BinaryShortDecisionNode	A binary decision Node that compares two short values.
DecisionNode.ByteDecisionNode	An decision Node with an arbitrary number of daughters.
DecisionNode.ShortDecisionNode	An decision Node with an arbitrary number of daughters.
DirectedGraph	A directed graph is a layered structure of nodes, in which there are mother-daughter relationships between the node.
DirectedGraphNode	A type of node that can be at the same time a decision node and a leaf node, and that can have more than one mother.
FeatureVectorCART
LeafNode	The leaf of a CART.
LeafNode.FeatureVectorLeafNode
LeafNode.FloatLeafNode	A leaf class that is suitable for regression trees.
LeafNode.IntAndFloatArrayLeafNode
LeafNode.IntArrayLeafNode	An LeafNode class suitable for representing the leaves of classification trees -- the leaf is a collection of items identified by an index number.
LeafNode.PdfLeafNode	A leaf class that is suitable for regression trees.
LeafNode.StringAndFloatLeafNode
Node	A node for the CART or DirectedGraph.
NodeIterator<T extends Node>
StringPredictionTree

Enum Summary

Enum	Description
DecisionNode.Type
LeafNode.LeafType