| java.lang.Object
 weka.classifiers.bayes.net.ADNode
| ADNode | | public class ADNode implements Serializable,TechnicalInformationHandler(Code) | | The ADNode class implements the ADTree datastructure which increases
the speed with which sub-contingency tables can be constructed from
a data set in an Instances object. For details, see:
Andrew W. Moore, Mary S. Lee (1998). Cached Sufficient Statistics for Efficient Machine Learning with Large Datasets. Journal of Artificial Intelligence Research. 8:67-91.
BibTeX:
@article{Moore1998,
author = {Andrew W. Moore and Mary S. Lee},
journal = {Journal of Artificial Intelligence Research},
pages = {67-91},
title = {Cached Sufficient Statistics for Efficient Machine Learning with Large Datasets},
volume = {8},
year = {1998}
}
author:
Remco Bouckaert (rrb@xm.co.nz)
version:
$Revision: 1.6 $ |
| Constructor Summary | |
| public | ADNode()
|
| Method Summary | |
| public void | getCounts(int[] nCounts, int[] nNodes, int[] nOffsets, int iNode, int iOffset, boolean bSubstract)
| | public TechnicalInformation | getTechnicalInformation()
Returns an instance of a TechnicalInformation object, containing
detailed information about the technical background of this class,
e.g., paper reference or book this class is based on. | | public static void | main(String[] argv)
| | public static ADNode | makeADTree(int iNode, FastVector nRecords, Instances instances)
| | public static ADNode | makeADTree(Instances instances)
| | public static VaryNode | makeVaryNode(int iNode, FastVector nRecords, Instances instances)
| | public void | print()
|
| MIN_RECORD_SIZE | | final static int MIN_RECORD_SIZE(Code) | | |
| m_Instances | | public Instance[] m_Instances(Code) | | list of Instance children (either m_Instances or m_VaryNodes is instantiated) *
|
| m_VaryNodes | | public VaryNode[] m_VaryNodes(Code) | | list of VaryNode children *
|
| m_nCount | | public int m_nCount(Code) | | count *
|
| m_nStartNode | | public int m_nStartNode(Code) | | first node in VaryNode array *
|
| serialVersionUID | | final static long serialVersionUID(Code) | | for serialization
|
| ADNode | | public ADNode()(Code) | | Creates new ADNode
|
| getCounts | | public void getCounts(int[] nCounts, int[] nNodes, int[] nOffsets, int iNode, int iOffset, boolean bSubstract)(Code) | | get counts for specific instantiation of a set of nodes
Parameters:
nCounts - - array for storing counts
Parameters:
nNodes - - array of node indexes
Parameters:
nOffsets - - offset for nodes in nNodes in nCounts
Parameters:
iNode - - index into nNode indicating current node
Parameters:
iOffset - - Offset into nCounts due to nodes below iNode
Parameters:
bSubstract - - indicate whether counts should be added or substracted |
| getTechnicalInformation | | public TechnicalInformation getTechnicalInformation()(Code) | | Returns an instance of a TechnicalInformation object, containing
detailed information about the technical background of this class,
e.g., paper reference or book this class is based on.
the technical information about this class |
| main | | public static void main(String[] argv)(Code) | | for testing only
Parameters:
argv - the commandline options |
| makeADTree | | public static ADNode makeADTree(int iNode, FastVector nRecords, Instances instances)(Code) | | create sub tree
Parameters:
iNode - index of the lowest node in the tree
Parameters:
nRecords - set of records in instances to be considered
Parameters:
instances - data set ADNode representing an ADTree |
| makeADTree | | public static ADNode makeADTree(Instances instances)(Code) | | create AD tree from set of instances
Parameters:
instances - data set ADNode representing an ADTree |
| makeVaryNode | | public static VaryNode makeVaryNode(int iNode, FastVector nRecords, Instances instances)(Code) | | create sub tree
Parameters:
iNode - index of the lowest node in the tree
Parameters:
nRecords - set of records in instances to be considered
Parameters:
instances - data set VaryNode representing part of an ADTree |
| print | | public void print()(Code) | | print is used for debugging only and shows the ADTree in ASCII graphics
|
|
|