
Autoassociation
29
The above code is straightforward. It starts by zeroing the
output array, where the sum of all window presentations will be
cumulated to form the filtered output. Then, the presentations are
done with a sliding window. The last step is to divide each sum in the
filtered output array by the number of presentations that went into
that sum, to get a mean. The maximum possible number in each sum
is the lesser of the total number of presentations and the width of the
window. The first and last filtered points will each have only one
presentation. The next points in will each have two components in
their sum. The next will hav