Skip to content
Publications

Talk · AIP conference proceedings · January 1, 2023

Completeness of the linear closure of the voting model

Anvar Kabulov, Alimdzhan Babadzhanov, Islambek Saymanov

Abstract

The purpose of this work is to select a set of basic operators for the considered model for calculating estimates, to construct their linear closure, and to prove the existence of a correct algorithm. The paper proposes the selection of a set of basic operators of the considered model for calculating estimates, the construction of their linear closure and a correct algorithm based on the training and control sample. The correctness of the algorithm composed of the previously defined operators and the threshold decision rule is proved. An operator is constructed from the linear closure of the model, such as the calculation of estimates, and the completeness of the linear closure of this model is proved for all problems.

Neural Networks and ApplicationsData Mining and Machine Learning ApplicationsMachine Learning and Algorithmsvoting modellinear closurecompleteness

More by Islambek Saymanov