smile.base.cart

Class LeafNode

java.lang.Object

smile.base.cart.LeafNode

All Implemented Interfaces:

java.io.Serializable, Node

Direct Known Subclasses:

DecisionNode, RegressionNode

public abstract class LeafNode
extends java.lang.Object
implements Node

A leaf node in decision tree.

See Also:

Serialized Form

Field Summary

Fields

Modifier and Type	Field and Description
protected int	size The number of samples in the node.

Constructor Summary

Constructors

Constructor and Description
LeafNode(int size) Constructor.

Method Summary

Modifier and Type	Method and Description
int	depth() Returns the maximum depth of the tree -- the number of nodes along the longest path from this node down to the farthest leaf node.
int	leafs() Returns the number of leaf nodes in the subtree.
Node	merge() Try to merge the children nodes and return a leaf node.
LeafNode	predict(smile.data.Tuple x) Evaluate the tree over an instance.
int	size() Returns the number of samples in the node.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Methods inherited from interface smile.base.cart.Node

deviance, dot, toString

Field Detail

size

protected int size

The number of samples in the node.

Constructor Detail

LeafNode

public LeafNode(int size)

Constructor.

Parameters:

size - the number of samples in the node

Method Detail

size

public int size()

Description copied from interface: Node

Returns the number of samples in the node.

Specified by:

size in interface Node

leafs

public int leafs()

Description copied from interface: Node

Returns the number of leaf nodes in the subtree.

Specified by:

leafs in interface Node

predict

public LeafNode predict(smile.data.Tuple x)

Description copied from interface: Node

Evaluate the tree over an instance.

Specified by:

predict in interface Node

depth

public int depth()

Description copied from interface: Node

Returns the maximum depth of the tree -- the number of nodes along the longest path from this node down to the farthest leaf node.

Specified by:

depth in interface Node

merge

public Node merge()

Description copied from interface: Node

Try to merge the children nodes and return a leaf node. If not able to merge, return this node itself.

Specified by:

merge in interface Node