The efficiency of lazy calculations for the search of similarities in a probabilistic combinatorial formal (VKF) system

Resumo

We investigate acceleration of computation of similarities by means of the lazy scheme of computing. The main result states that speed increases in the correspondence to difference between the numbers of training examples and features. The least acceleration corresponds to equal the numbers, when it is equal to 2.