public void FeedForward(double[] input)
{
output = MyMath.Multiply(input, weights);
for (int i = 0; i < output.Length; i++)
{
output[i] += bias[i];
}
double max = 0;
if (function == TransferFunction.Competitive)
{
max = MyMath.GetMax(output);
}
for (int i = 0; i < cellCount; i++)
{
double n = output[i];
double a = 0;
switch (function)
{
case TransferFunction.Hard_Limit:
{
a = (n >= 0) ? 1 : 0;
}
break;
case TransferFunction.Symmetrical_Hard_Limit:
{
a = (n >= 0) ? 1 : -1;
}
break;
case TransferFunction.Linear:
{
a = n;
}
break;
case TransferFunction.Saturating_Linear:
{
if (n > 1)
{
a = 1;
}
else if (n < 0)
{
a = 0;
}
else
{
a = n;
}
}
break;
case TransferFunction.Symmetric_Saturating_Linear:
{
if (n > 1)
{
a = 1;
}
else if (n < -1)
{
a = 0;
}
else
{
a = n;
}
}
break;
case TransferFunction.Log_Sigmoid:
{
double e = Math.Exp(-n);
a = 1.0 / (1 + e);
}
break;
case TransferFunction.Hyperbolic_Tangent_Sigmoid:
{
double e1 = Math.Exp(n);
double e2 = Math.Exp(-n);
a = (e1 - e2) / (e1 + e2);
}
break;
case TransferFunction.Positive_Linear:
{
a = (n < 0) ? 0 : n;
}
break;
case TransferFunction.Competitive:
{
a = (n == max) ? 1 : 0;
}
break;
}
output[i] = a;
}
}
