public class ADNode extends java.lang.Object implements java.io.Serializable, TechnicalInformationHandler, RevisionHandler
@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} }
Modifier and Type | Field and Description |
---|---|
Instance[] |
m_Instances
list of Instance children (either m_Instances or m_VaryNodes is
instantiated)
|
int |
m_nCount
count
|
int |
m_nStartNode
first node in VaryNode array
|
VaryNode[] |
m_VaryNodes
list of VaryNode children
|
Constructor and Description |
---|
ADNode()
Creates new ADNode
|
Modifier and Type | Method and Description |
---|---|
void |
getCounts(int[] nCounts,
int[] nNodes,
int[] nOffsets,
int iNode,
int iOffset,
boolean bSubstract)
get counts for specific instantiation of a set of nodes
|
java.lang.String |
getRevision()
Returns the revision string.
|
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.
|
static void |
main(java.lang.String[] argv)
for testing only
|
static ADNode |
makeADTree(Instances instances)
create AD tree from set of instances
|
static ADNode |
makeADTree(int iNode,
java.util.ArrayList<java.lang.Integer> nRecords,
Instances instances)
create sub tree
|
static VaryNode |
makeVaryNode(int iNode,
java.util.ArrayList<java.lang.Integer> nRecords,
Instances instances)
create sub tree
|
void |
print()
print is used for debugging only and shows the ADTree in ASCII graphics
|
public VaryNode[] m_VaryNodes
public Instance[] m_Instances
public int m_nCount
public int m_nStartNode
public TechnicalInformation getTechnicalInformation()
getTechnicalInformation
in interface TechnicalInformationHandler
public static VaryNode makeVaryNode(int iNode, java.util.ArrayList<java.lang.Integer> nRecords, Instances instances)
iNode
- index of the lowest node in the treenRecords
- set of records in instances to be consideredinstances
- data setpublic static ADNode makeADTree(int iNode, java.util.ArrayList<java.lang.Integer> nRecords, Instances instances)
iNode
- index of the lowest node in the treenRecords
- set of records in instances to be consideredinstances
- data setpublic static ADNode makeADTree(Instances instances)
instances
- data setpublic void getCounts(int[] nCounts, int[] nNodes, int[] nOffsets, int iNode, int iOffset, boolean bSubstract)
nCounts
- - array for storing countsnNodes
- - array of node indexesnOffsets
- - offset for nodes in nNodes in nCountsiNode
- - index into nNode indicating current nodeiOffset
- - Offset into nCounts due to nodes below iNodebSubstract
- - indicate whether counts should be added or substractedpublic void print()
public static void main(java.lang.String[] argv)
argv
- the commandline optionspublic java.lang.String getRevision()
getRevision
in interface RevisionHandler