william(_at_)completewhois(_dot_)com wrote:
The algorithms I thus intend to try are:
MA(n)*n + S(n+1)
MA(n+1)= ---------------- Where MA(x) is arithmetic mean at step x
n+1 with S(x) being actual score at step x
That's just the normal MA.
I also think that some kind of multiplier should be applied
so that latest data has highier weight then previous one, so
this endup being:
MA(n,w)*n + S(n+1)*w Where MA(x,w) is arithmetic mean
MA(n+1,w)= ------=------------- at step x with weight w (w>1)
n + w
You could get a similar effect for e.g. n > 99 with
M99(n)*99 + S(n+1)
M99(n+1)= ------------------
100
--
Frank
_______________________________________________
Asrg mailing list
Asrg(_at_)ietf(_dot_)org
https://www1.ietf.org/mailman/listinfo/asrg