Email this article The efficiency of lazy calculations for the search of similarities in a probabilistic combinatorial formal (VKF) system
- Authors: Vinogradov D.V.1,2
-
Affiliations:
- Federal Research Center for Computer Science and Control
- Russian State University for the Humanities
- Issue: Vol 51, No 2 (2017)
- Pages: 84-88
- Section: General Section
- URL: https://journals.rcsi.science/0005-1055/article/view/150162
- DOI: https://doi.org/10.3103/S0005105517020078
- ID: 150162
Cite item
Open Access
Access granted
Subscription Access
Abstract
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.
About the authors
D. V. Vinogradov
Federal Research Center for Computer Science and Control; Russian State University for the Humanities
Author for correspondence.
Email: vinogradov.d.w@qmail.com
Russian Federation, Moscow, 119333; Moscow, 125267
Supplementary files
