Kunchenko’s polynomials for pattern recognition

Chertov O.R

This paper concerns the task of pattern recognition by using Kunchenko’s approximating polynomials. We take a stereotyped behavior template matching of intruder during click fraud as an example. New approach for clicks’ time series analyzing is proposed. It has been shown, that with the help of proposed techniques it is possible to define some invalid clicks. The prospects for further research in area of statistics and sociology are confirmed.


Full text (pdf)