public void multiclass_new_usage_method_linear()
{
double[][] inputs =
{
new double[] { 1, 4, 2, 0, 1 },
new double[] { 1, 3, 2, 0, 1 },
new double[] { 3, 0, 1, 1, 1 },
new double[] { 3, 0, 1, 0, 1 },
new double[] { 0, 5, 5, 5, 5 },
new double[] { 1, 5, 5, 5, 5 },
new double[] { 1, 0, 0, 0, 0 },
new double[] { 1, 0, 0, 0, 0 },
};
int[] outputs =
{
0, 0,
1, 1,
2, 2,
3, 3,
};
var learner = new MulticlassSupportVectorLearning<Linear>();
learner.Learner = (_) => new LinearCoordinateDescent()
{
Complexity = 1
};
learner.ParallelOptions.MaxDegreeOfParallelism = 1;
MulticlassSupportVectorMachine<Linear> msvm = learner.Learn(inputs, outputs);
// Linear machines in compact form do not require kernel evaluations
Assert.AreEqual(0, msvm.GetLastKernelEvaluations());
for (int i = 0; i < inputs.Length; i++)
{
double expected = outputs[i];
msvm.Method = MulticlassComputeMethod.Elimination;
double actual = msvm.Decide(inputs[i]);
Assert.AreEqual(expected, actual);
Assert.AreEqual(0, msvm.GetLastKernelEvaluations());
}
for (int i = 0; i < inputs.Length; i++)
{
double expected = outputs[i];
msvm.Method = MulticlassComputeMethod.Voting;
double actual = msvm.Decide(inputs[i]);
Assert.AreEqual(expected, actual);
Assert.AreEqual(0, msvm.GetLastKernelEvaluations());
}
}