|
|||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectedu.ksu.cis.bnj.bbn.learning.Learner
edu.ksu.cis.bnj.bbn.learning.ScoreBasedLearner
edu.ksu.cis.bnj.bbn.learning.BDEBasedLearner
edu.ksu.cis.bnj.bbn.learning.scorebased.k2.K2
K2 algorithm
Field Summary | |
protected java.util.List |
ordering
Set the upper bound on parent limits for K2. |
protected java.util.Set[] |
parentTable
|
Fields inherited from class edu.ksu.cis.bnj.bbn.learning.ScoreBasedLearner |
candidateScorer, defaultParentLimit, parentLimit, structureScorer |
Fields inherited from class edu.ksu.cis.bnj.bbn.learning.Learner |
bbnNodes, calculateCPT, data, indexTable, learnerClassName, OPT_CALCULATE_RMSE, options |
Fields inherited from interface edu.ksu.cis.kdd.util.gui.Optionable |
OPT_OUTPUT_FILE |
Constructor Summary | |
K2()
|
|
K2(Data t)
Constructor for K2. |
Method Summary | |
BBNGraph |
getGraph()
Procedure K2
for i:=1 downto n do
pi(v[i]) = emptyset; // parent of v[i]
Pold = g(v[i], pi(v[i]));
while | pi(v[i]) | < limit do
let z be the node in v[0..i-1] - pi(v[i]) that maximizes g(v[i], pi(v[i])
U {z});
Pnew = g(v[i], pi(v[i]) U {z});
if Pnew <= Pold then break;
Pold := Pnew;
pi(v[i]) := pi(v[i]) U {z};
end while
write("Parents of "+v[i]+" are :", pi(v[i]);
end for
end K2
|
java.lang.String |
getName()
|
double |
getNetworkScore()
added by prashanth |
OptionGUI |
getOptionsDialog()
|
java.util.List |
getOrdering()
|
static Table |
getToyExample()
Get the toy example out from paper for testing |
void |
initialize()
This method will be invoked prior to getGraph. |
static void |
main(java.lang.String[] args)
|
void |
processParameters(java.lang.String[] args)
|
void |
setOrdering(java.util.List ordering)
Sets the ordering. |
Methods inherited from class edu.ksu.cis.bnj.bbn.learning.ScoreBasedLearner |
computeCPT, getParentLimit, iterateUniqueInstantiation, setCandidateScorer, setParentLimit, setStructureScorer, setTable |
Methods inherited from class edu.ksu.cis.bnj.bbn.learning.Learner |
getCalculateRMSE, getCurrentOptions, getData, getDefaultOptions, getOutputFile, isCalculateCPT, load, populateNodes, setCalculateCPT, setCalculateRMSE, setData, setOption, setOptions, setOutputFile |
Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Field Detail |
protected java.util.List ordering
protected java.util.Set[] parentTable
Constructor Detail |
public K2()
public K2(Data t)
t
- Method Detail |
public BBNGraph getGraph()
Procedure K2
for i:=1 downto n do
pi(v[i]) = emptyset; // parent of v[i]
Pold = g(v[i], pi(v[i]));
while | pi(v[i]) | < limit do
let z be the node in v[0..i-1] - pi(v[i]) that maximizes g(v[i], pi(v[i])
U {z});
Pnew = g(v[i], pi(v[i]) U {z});
if Pnew <= Pold then break;
Pold := Pnew;
pi(v[i]) := pi(v[i]) U {z};
end while
write("Parents of "+v[i]+" are :", pi(v[i]);
end for
end K2
getGraph
in class BDEBasedLearner
edu.ksu.cis.bnj.bbn.learning.Learning#getGraph()
public java.lang.String getName()
getName
in class Learner
public java.util.List getOrdering()
public void setOrdering(java.util.List ordering)
ordering
- The ordering to setpublic void initialize()
Learner
initialize
in class Learner
edu.ksu.cis.bnj.bbn.learning.Learning#initialize()
public void processParameters(java.lang.String[] args)
processParameters
in class Learner
public static Table getToyExample()
public OptionGUI getOptionsDialog()
getOptionsDialog
in interface Optionable
getOptionsDialog
in class Learner
public double getNetworkScore()
public static void main(java.lang.String[] args)
|
|||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |