电邮这篇文章 The efficiency of lazy calculations for the search of similarities in a probabilistic combinatorial formal (VKF) system
- 作者: Vinogradov D.V.1,2
-
隶属关系:
- Federal Research Center for Computer Science and Control
- Russian State University for the Humanities
- 期: 卷 51, 编号 2 (2017)
- 页面: 84-88
- 栏目: General Section
- URL: https://journal-vniispk.ru/0005-1055/article/view/150162
- DOI: https://doi.org/10.3103/S0005105517020078
- ID: 150162
如何引用文章
开放存取
##reader.subscriptionAccessGranted##
订阅存取
详细
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.
作者简介
D. Vinogradov
Federal Research Center for Computer Science and Control; Russian State University for the Humanities
编辑信件的主要联系方式.
Email: vinogradov.d.w@qmail.com
俄罗斯联邦, Moscow, 119333; Moscow, 125267
补充文件
