private void Calculate(ContingencyTableNode ct, ulong currentBase, ulong index, Dictionary<ulong, int> paCounts, int variable, Varset variables, int previousVariable, ref double score)
{
// if this is a leaf
if (ct.IsLeaf())
{
// update the instantiation count of this set of parents
int count = paCounts.ContainsKey(index) ? paCounts[index] : 0;
count += ct.Value;
paCounts[index] = count;
// update the score for this variable, parent instantiation
score += ilogi[ct.Value];
return;
}
// which actual variable are we looking at
int thisVariable = previousVariable + 1;
for (; thisVariable < network.Size(); thisVariable++)
{
if (variables.Get(thisVariable))
{
break;
}
}
// update the base and index if this is part of the parent set
ulong nextBase = currentBase;
if (thisVariable != variable)
{
nextBase *= (ulong)network.GetCardinality(thisVariable);
}
// recurse
for (int k = 0; k < network.GetCardinality(thisVariable); k++)
{
ContingencyTableNode child = ct.GetChild(k);
if (child != null)
{
ulong newIndex = index;
if (thisVariable != variable)
{
newIndex += currentBase * (ulong)k;
}
Calculate(child, nextBase, newIndex, paCounts, variable, variables, thisVariable, ref score);
}
}
}
private ContingencyTableNode MakeContab(Varset remainingVariables, ADNode node, int nodeIndex)
{
// check base case
if (remainingVariables.Equals(zero))
{
ContingencyTableNode ctn = new ContingencyTableNode(node.Count, 0, 1);
return ctn;
}
int firstIndex = remainingVariables.FindFirst();
int n = network.GetCardinality(firstIndex);
VaryNode vn = node.GetChild(firstIndex - nodeIndex - 1);
ContingencyTableNode ct = new ContingencyTableNode(0, n, 0);
Varset newVariables = Varset.ClearCopy(remainingVariables, firstIndex);
ContingencyTableNode ctMcv = MakeContab(newVariables, node, nodeIndex);
for (int k = 0; k < n; k++)
{
if (vn.GetChild(k) == null)
{
continue;
}
ADNode adn = vn.GetChild(k);
ContingencyTableNode child = null;
if (adn.LeafList.Count == 0) // これ注意
{
child = MakeContab(newVariables, adn, firstIndex);
}
else
{
child = MakeContabLeafList(newVariables, adn.LeafList);
}
ct.SetChild(k, child);
ct.LeafCount += child.LeafCount;
ctMcv.Subtract(ct.GetChild(k));
}
ct.SetChild(vn.Mcv, ctMcv);
ct.LeafCount += ctMcv.LeafCount;
return ct;
}
private void Calculate(ContingencyTableNode ct, ulong currentBase, ulong index, Dictionary<ulong, int> paCounts, Varset variables, int previousVariable, ref Scratch s)
{
Varset variablesCp = new Varset(variables);
// if this is a leaf in the AD-tree
if (ct.IsLeaf())
{
// update the instantiation count of this set of parents
int count = paCounts.ContainsKey(index) ? paCounts[index] : 0;
count += ct.Value;
if (count > 0)
{
paCounts[index] = count;
// update the score for this variable, parent instantiation
double temp = ScoreCalculator.GammaLn(s.Aijk + ct.Value);
s.Score -= s.Lgijk;
s.Score += temp;
}
return;
}
// which actual variable are we looking at
int thisVariable = previousVariable + 1;
for (; thisVariable < network.Size(); thisVariable++)
{
if (variables.Get(thisVariable))
{
break;
}
}
// update the base and index if this is part of the parent set
ulong nextBase = currentBase;
if (thisVariable != s.Variable)
{
nextBase *= (ulong)network.GetCardinality(thisVariable);
}
// recurse
for (int k = 0; k < network.GetCardinality(thisVariable); k++)
{
ContingencyTableNode child = ct.GetChild(k);
if (child != null)
{
ulong newIndex = index;
if (thisVariable != s.Variable)
{
newIndex += currentBase * (ulong)k;
}
Calculate(child, nextBase, newIndex, paCounts, variables, thisVariable, ref s);
}
}
}
