Generative Models in the Problem of Evaluating the Efficiency of Computer Algorithms

The author formulates definitions of computer algorithm efficiency according to a criterion that characterizes accuracy, reliability, performance speed, and other consumer properties. Schemes of proof experiments based on stochastic models of generating artificial data with statistical characteristi...

Full description

Saved in:
Bibliographic Details
Published inCybernetics and systems analysis Vol. 60; no. 2; pp. 320 - 330
Main Author Fainzilberg, L. S.
Format Journal Article
LanguageEnglish
Published New York Springer US 01.03.2024
Springer
Springer Nature B.V
Subjects
Online AccessGet full text
ISSN1060-0396
1573-8337
DOI10.1007/s10559-024-00672-9

Cover

More Information
Summary:The author formulates definitions of computer algorithm efficiency according to a criterion that characterizes accuracy, reliability, performance speed, and other consumer properties. Schemes of proof experiments based on stochastic models of generating artificial data with statistical characteristics adequate to real observations are suggested. The experiments are aimed at determining the efficiency of computer algorithms that provide solutions to three different problems, namely, the optimal stopping for making a final decision during a sequential analysis of alternatives, training a linear classifier based on a finite sample of observations, and determining diagnostic signs of an ECG using the fasegraphy method. The results obtained based on statistical experiments are given.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1060-0396
1573-8337
DOI:10.1007/s10559-024-00672-9