|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectweka.classifiers.bayes.net.ADNode
public class ADNode
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 Cached Sufficient Statistics for Efficient Machine Learning with Large Datasets Andrew Moore, and Mary Soon Lee Journal of Artificial Intelligence Research 8 (1998) 67-91
| Field Summary | |
|---|---|
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 Summary | |
|---|---|
ADNode()
Creates new ADNode |
|
| Method Summary | |
|---|---|
void |
getCounts(int[] nCounts,
int[] nNodes,
int[] nOffsets,
int iNode,
int iOffset,
boolean bSubstract)
get counts for specific instantiation of a set of nodes |
static void |
main(java.lang.String[] argv)
|
static ADNode |
makeADTree(Instances instances)
create AD tree from set of instances |
static ADNode |
makeADTree(int iNode,
FastVector nRecords,
Instances instances)
create sub tree |
static VaryNode |
makeVaryNode(int iNode,
FastVector nRecords,
Instances instances)
create sub tree |
void |
print()
|
| Methods inherited from class java.lang.Object |
|---|
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Field Detail |
|---|
public VaryNode[] m_VaryNodes
public Instance[] m_Instances
public int m_nCount
public int m_nStartNode
| Constructor Detail |
|---|
public ADNode()
| Method Detail |
|---|
public static VaryNode makeVaryNode(int iNode,
FastVector nRecords,
Instances instances)
iNode: - index of the lowest node in the treenRecords: - set of records in instances to be consideredinstances: - data set
public static ADNode makeADTree(int iNode,
FastVector nRecords,
Instances instances)
iNode: - index of the lowest node in the treenRecords: - set of records in instances to be consideredinstances: - data set
public static ADNode makeADTree(Instances instances)
instances: - data set
public 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)
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||