Spacious complexity reduction of a composite Bayesian decision-making algorithm in an industrial enterprise management information system

I. P. Bolodurina; N. V. Speshilova; V. A. Tripkosh; R. R. Rakhmatullin; E. A. Speshilov

doi:10.1117/12.2669257

5 January 2023 Spacious complexity reduction of a composite Bayesian decision-making algorithm in an industrial enterprise management information system

I. P. Bolodurina, N. V. Speshilova, V. A. Tripkosh, R. R. Rakhmatullin, E. A. Speshilov

Author Affiliations +

Proceedings Volume 12564, 2nd International Conference on Computer Applications for Management and Sustainable Development of Production and Industry (CMSD-II-2022); 125640Q (2023) https://doi.org/10.1117/12.2669257
Event: Computer Applications for Management and Sustainable Development of Production and Industry (CMSD2022), 2022, Dushanbe, Tajikistan

Abstract

It is advisable to use mathematical modeling of industrial enterprise operating with the help of information technologies when there is a limited number of options, that`s why the problem of acceptable complexity arises while developing decision-making algorithm for computer system recognition in different technical, industrial, economic and management areas. The problem acquires a special importance when the recognition algorithm is based on the compound Bayesian procedures of decision-making which are characterized by a great calculating complexity. The article considers the peculiarities of recognition algorithm operation based on graph-scheme presentation of a priory information to make a decision about the situation class with compound Bayesian procedures. The algorithm complexity is assessed, the approaches to introduce the graph-schemes in the memory of computer systems which reduce the memory requirements are studied. The mathematical methods of graph theory, probability theory, complexity and combinatorial theory are used. The research results in a new method for space complexity reduction of the compound graph-scheme algorithm for situation recognition which enables to provide the efficiency of its calculating complexity. A revised version of the algorithm was suggested. Analytic expressions for calculating parameters of space representation of modified graph-schemes were obtained, their correctness was proved on specific examples.

Citation Download Citation

I. P. Bolodurina, N. V. Speshilova, V. A. Tripkosh, R. R. Rakhmatullin, and E. A. Speshilov "Spacious complexity reduction of a composite Bayesian decision-making algorithm in an industrial enterprise management information system", Proc. SPIE 12564, 2nd International Conference on Computer Applications for Management and Sustainable Development of Production and Industry (CMSD-II-2022), 125640Q (5 January 2023); https://doi.org/10.1117/12.2669257

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available

Members: $17.00

Non-members: $21.00 ADD TO CART

PROCEEDINGS
10 PAGES

DOWNLOAD PAPER SAVE TO MY LIBRARY

GET CITATION

RIGHTS & PERMISSIONS

Get copyright permission Get copyright permission on Copyright Marketplace

KEYWORDS

Detection and tracking algorithms

Decision making

Algorithm development

Computing systems

Object recognition

Mathematical modeling

Probability theory

Show All Keywords

Keywords/Phrases

Search In:

Publication Years