A Probabilistic Algorithm for Calculating Similarities


Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access Subscription Access

Abstract

In this paper, we describe a new probabilistic algorithm for calculating hypotheses as the results of similarities between training examples for a machine learning problem based on a binary similarity operation. Unlike previously proposed probabilistic algorithms, the order of accounting for training examples is fixed for all hypotheses. This algorithm is useful for implementation using a GPGPU. The main result of this paper is the independence of the order of the appearance of training examples of the probabilities of each similarity in the sample.

About the authors

D. V. Vinogradov

Federal Research Center Computer Science and Control, Russian Academy of Sciences; Russian State University for the Humanities

Author for correspondence.
Email: vinogradov.d.w@gmail.com
Russian Federation, Moscow, 119333; Moscow, 125993

Supplementary files

Supplementary Files
Action
1. JATS XML

Copyright (c) 2019 Allerton Press, Inc.