public void CanGrowTreeForMovement()
{
var input = new[]
{
new[] { "left wall", "right wall", "move right" },
new[] { "left wall", "right empty", "move right" },
new[] { "left empty", "right wall", "move right" },
new[] { "left empty", "right empty", "move right" },
new[] { "left wall", "right wall", "move left" },
new[] { "left wall", "right empty", "move left" },
new[] { "left empty", "right wall", "move left" },
new[] { "left empty", "right empty", "move left" },
new[] { "left wall", "right wall", "no move" },
new[] { "left wall", "right empty", "no move" },
new[] { "left empty", "right wall", "no move" },
new[] { "left empty", "right empty", "no move" },
};
var output = new[]
{
"stop", "move", "stop", "move",
"stop", "stop", "move", "move",
"stop", "stop", "stop", "stop",
};
var learner = new ID3Learner <string>(input, output);
Console.WriteLine(learner);
}
public void CanGrowTree()
{
var input = new[]
{
new[] { "b", "a", "c", "f" },
new[] { "b", "a", "d" },
new[] { "d", "a", "e" },
new[] { "d", "b" },
new[] { "d", "c" },
};
var output = new[] { "has a", "has a", "has a", "no a", "no a" };
var learner = new ID3Learner <string>(input, output);
Console.WriteLine(learner);
Assert.IsFalse(learner.Root.IsLeaf);
Assert.AreEqual("a", learner.InputFactors[learner.Root.Factor]);
var aPresent = learner.Root.Present;
Assert.IsTrue(aPresent.IsLeaf);
Assert.AreEqual("has a", learner.OutputFactors[aPresent.Factor]);
var aAbsent = learner.Root.Absent;
Assert.IsTrue(aAbsent.IsLeaf);
Assert.AreEqual("no a", learner.OutputFactors[aAbsent.Factor]);
}
void RunSingleTest(List <Record> trainingSet, ReferenceTable table, List <Record> testSet, int ensembleCount, int depth)
{
Console.WriteLine($"\n[{GetTimeStamp()}] Runing test with Ensemble = {ensembleCount} and MaxDepth = {depth}\n");
Ensemble ensemble = new Ensemble();
Random picker = new Random();
for (int i = 0; i < ensembleCount; i++)
{
ID3Learner learner = LoadDecisionTree(SampledData(trainingSet, picker), table, depth);
ensemble.AddVoter(learner.Predict);
}
ConfusionMatrix testResults = RunTest(ensemble.Test, testSet);
PrintResults(testResults);
}
public void CanGrowTrivialTreeNotPresent()
{
var input = new[]
{
new[] { "a", "a", "a" },
new[] { "a", "b", "b" },
new[] { "d", "c", "c" },
};
var output = new[] { "e", "e", "e" };
var learner = new ID3Learner <string>(input, output);
Console.WriteLine(learner);
Assert.IsTrue(learner.Root.IsLeaf);
Assert.AreEqual("e", learner.OutputFactors[learner.Root.Factor]);
}
public void CanGrowTreeNoLogic()
{
var input = new[]
{
new[] { "a", "a" },
new[] { "a", "b" },
new[] { "b", "a" },
new[] { "b", "b" },
new[] { "a", "a" },
new[] { "a", "b" },
new[] { "b", "a" },
new[] { "b", "b" },
};
var output = new[] { "x", "x", "x", "x", "y", "y", "y", "y" };
var learner = new ID3Learner <string>(input, output);
Console.WriteLine(learner);
}
public void CanGrowComplexTree()
{
var input = new[]
{
new[] { "b", "a", "c", "f" },
new[] { "b", "a", "d" },
new[] { "d", "a", "e" },
new[] { "d", "b" },
new[] { "d", "c" },
new[] { "d", "a", "c", "f" },
};
var output = new[] { "has ab", "has ab", "has ad", "no a", "no a", "has ad" };
var learner = new ID3Learner <string>(input, output);
Console.WriteLine(learner);
Assert.AreEqual("has ab", learner.Predict(new [] { "a", "b" }));
Assert.AreEqual("has ab", learner.Predict(new [] { "a", "b", "c", "f" }));
Assert.AreEqual("has ad", learner.Predict(new [] { "a", "d", "f" }));
Assert.AreEqual("no a", learner.Predict(new [] { "b", "d", "f" }));
}