Package | Description |
---|---|
marytts.cart | |
marytts.cart.io |
Modifier and Type | Class and Description |
---|---|
class |
NodeIterator<T extends Node> |
Modifier and Type | Class and Description |
---|---|
class |
DecisionNode
A decision node that determines the next Node to go to in the CART.
|
static class |
DecisionNode.BinaryByteDecisionNode
A binary decision Node that compares two byte values.
|
static class |
DecisionNode.BinaryFloatDecisionNode
A binary decision Node that compares two float values.
|
static class |
DecisionNode.BinaryShortDecisionNode
A binary decision Node that compares two short values.
|
static class |
DecisionNode.ByteDecisionNode
An decision Node with an arbitrary number of daughters.
|
static class |
DecisionNode.ShortDecisionNode
An decision Node with an arbitrary number of daughters.
|
class |
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.
|
class |
LeafNode
The leaf of a CART.
|
static class |
LeafNode.FeatureVectorLeafNode |
static class |
LeafNode.FloatLeafNode
A leaf class that is suitable for regression trees.
|
static class |
LeafNode.IntAndFloatArrayLeafNode |
static class |
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.
|
static class |
LeafNode.PdfLeafNode
A leaf class that is suitable for regression trees.
|
static class |
LeafNode.StringAndFloatLeafNode |
Modifier and Type | Field and Description |
---|---|
protected Node[] |
DecisionNode.daughters |
protected Node |
Node.mother |
protected Node |
DirectedGraph.rootNode |
Modifier and Type | Method and Description |
---|---|
Node |
DecisionNode.getDaughter(int index)
Get the daughter at the specified index
|
Node |
DirectedGraphNode.getLeafNode() |
Node |
Node.getMother()
Get the mother node of this node
|
Node |
DirectedGraphNode.getMother()
Get a mother node of this node.
|
Node |
DirectedGraphNode.getNextNode(FeatureVector fv) |
abstract Node |
DecisionNode.getNextNode(FeatureVector featureVector)
Select a daughter node according to the value in the given target
|
Node |
DecisionNode.BinaryByteDecisionNode.getNextNode(FeatureVector featureVector)
Select a daughter node according to the value in the given target
|
Node |
DecisionNode.BinaryShortDecisionNode.getNextNode(FeatureVector featureVector)
Select a daughter node according to the value in the given target
|
Node |
DecisionNode.BinaryFloatDecisionNode.getNextNode(FeatureVector featureVector)
Select a daughter node according to the value in the given target
|
Node |
DecisionNode.ByteDecisionNode.getNextNode(FeatureVector featureVector)
Select a daughter node according to the value in the given target
|
Node |
DecisionNode.ShortDecisionNode.getNextNode(FeatureVector featureVector)
Select a daughter node according to the value in the given target
|
Node |
Node.getRootNode() |
Node |
DirectedGraph.getRootNode()
Get the root node of this CART
|
Node |
StringPredictionTree.interpretToNode(FeatureVector featureVector,
int minNumberOfData)
TODO: copied from CART, does not work as expected with minNumberOfData = 0
Passes the given item through this CART and returns the leaf Node, or the Node it stopped walking down.
|
Node |
CART.interpretToNode(FeatureVector featureVector,
int minNumberOfData)
Passes the given item through this CART and returns the leaf Node, or the Node it stopped walking down.
|
Node |
CART.interpretToNode(Target target,
int minNumberOfData)
Passes the given item through this CART and returns the leaf Node, or the Node it stopped walking down.
|
static Node |
CART.replaceLeafByCart(CART cart,
LeafNode leaf)
In this tree, replace the given leaf with the given CART
|
Modifier and Type | Method and Description |
---|---|
List<Node> |
DirectedGraphNode.getMothers() |
Iterator<Node> |
DirectedGraph.getNodeIterator()
Return an iterator which returns all nodes in the tree exactly once.
|
Iterable<Node> |
DirectedGraph.getNodes()
A representation of the corresponding node iterator that can be used in extended for() statements.
|
Modifier and Type | Method and Description |
---|---|
void |
DecisionNode.addDaughter(Node daughter)
Add a daughter to the node
|
int |
DirectedGraphNode.getNodeIndex(Node aMother)
Return this node's index in the given mother's array of daughters.
|
protected Object |
DirectedGraph.interpret(Node n,
FeatureVector fv)
Follow the directed graph down to the most specific leaf with data, starting from node n.
|
void |
DirectedGraphNode.removeMother(Node aMother)
Remove the given node from the list of mothers.
|
void |
DecisionNode.replaceDaughter(Node newDaughter,
int index)
Replace daughter at given index with another daughter
|
void |
DirectedGraphNode.setLeafNode(Node newNode) |
void |
Node.setMother(Node node,
int nodeIndex)
set the mother node of this node, and remember this node's index in mother.
|
void |
DirectedGraphNode.setMother(Node node,
int nodeIndex) |
void |
DirectedGraph.setRootNode(Node rNode)
Set the root node of this CART
|
Constructor and Description |
---|
CART(Node rootNode,
FeatureDefinition featDef)
Build a new cart with the given node as the root node
|
CART(Node rootNode,
FeatureDefinition featDef,
Properties properties)
Build a new cart with the given node as the root node
|
DirectedGraph(Node rootNode,
FeatureDefinition featDef)
Build a new graph with the given node as the root node
|
DirectedGraph(Node rootNode,
FeatureDefinition featDef,
Properties properties)
Build a new graph with the given node as the root node
|
DirectedGraphNode(DecisionNode decisionNode,
Node leafNode) |
NodeIterator(Node rootNode,
boolean showLeafNodes,
boolean showDecisionNodes,
boolean showDirectedGraphNodes)
Iterate over the subtree below rootNode.
|
StringPredictionTree(Node aRootNode,
FeatureDefinition aFeatDef,
String[] aTargetDecoding) |
Modifier and Type | Method and Description |
---|---|
Node |
WagonCARTReader.load(BufferedReader reader,
FeatureDefinition featDefinition)
This loads a cart from a wagon tree in textual format, from a reader.
|
Node |
WagonCARTReader.load(String fileName,
FeatureDefinition featDefinition,
String[] dummy)
Load the cart from the given file
|
Modifier and Type | Method and Description |
---|---|
void |
WagonCARTReader.fillLeafs(Node root,
FeatureVector[] featureVectors)
Fill the FeatureVector leafs of a tree with the given feature vectors.
|
Copyright © 2000–2016 DFKI GmbH. All rights reserved.