COMBINATORIAL OPTIMIZATION THEORY AND PROBLEM OF ARTIFICIAL INTELLIGENCE
Journal Title: Прикладні питання математичного моделювання - Year 2018, Vol 1, Issue 2
Abstract
The problems of artificial intelligence are complex in nature and not always subject to formalization. But many of the applications of this class are reduced to combinatorial optimization problems. This is due to the fact that their predominant part in finding an optimal solution requires the parsing of options. The parsing problems is characteristic of combinatorial nature. This property can be investigated by simulating the specified problems in the framework of the theory of combinatorial optimization. For their modeling it is necessary to determine the type of these problems (static or dynamic), to determine the argument of the objective function (combinatorial configuration), to modeling the objective function. As the system analysis shows, combinatorial configurations in problems of this class can be both an argument of the objective function and input data. Also, the development of intelligent systems requires the formalization of human natural intelligence, that is, it is necessary to describe the processes of natural thinking and answer the question: can it be simulated. The article gives a classification of natural intelligence, which is developed taking into account the situation of uncertainty. To this end, certain types of uncertainties that arise in solving applied problems of artificial intelligence are considered. The construction of mathematical models of problems of artificial intelligence using the theory of combinatorial optimization is shown on the example of recognition and segmentation of speech signals and clinical diagnostics. It is stated that they are divided into subproblems, which are solved by independent algorithms in the iterative mode. Such a computational scheme is characteristic of hybrid algorithms. By the argument of the objective function the problems of speech recognition and clinical diagnosis – similar to each other. The use of combinatorial optimization theory for modeling the problems of artificial intelligence allows us to establish their combinatorial nature, to formulate the objective function explicitly, to identify the characteristic features that determine the similarity of these problems. The conducted researches allow to reveal the reason of uncertainty of various kinds that arises in the process of their solution, and to explain the nature of the fuzziness of the input data.
Authors and Affiliations
Н. К. ТИМОФІЄВА
Keywords
Related Articles
- EP ID EP424716
- DOI 10.32782/2618-0340-2018-2-161-172
- Views 75
- Downloads 0
РОЗРОБКА ТЕХНОЛОГІЇ ПРОЕКТУВАННЯ ТА ВИГОТОВЛЕННЯ РОБОЧИХ КОЛІС ТУРБОКОМПРЕСОРА
Запропоновано методику формування комп'ютерної геометричної моделі робочого колеса турбокомпресора. Технологія передбачає виготовлення робочого колеса на п'ятикоординатному верстаті та забезпечує точність обробки поверхо...
APPLICATION OF IEC 61499 STANDARD FOR THE DESIGN OF A DISTRIBUTED CONTROL SYSTEM FOR MANUFACTURING PARTICLEBOARDS
The appearance of the first distributed control systems is associated with the widespread use of digital automation in the control system. The IEC 61499 architecture was conceived in anticipation of the demand for distri...
РОЗВ’ЯЗОК ЗАДАЧІ ДІРІХЛЕ ДЛЯ РІВНЯННЯ ЛАПЛАСА В ПОЛЯРНИХ КООРДИНАТАХ МЕТОДОМ МОНТЕ-КАРЛО
В роботі побудована модель випадкових блукань у полярних координатах для областей, які містять координатний полюс. За допомогою даної моделі можна розв’язувати задачу Діріхле для рівняння Лапласа у крузі та в будь-яких о...
CURRENT STATE AND PERSPECTIVES FOR FURTHER DEVELOPMENT OF SCIENTIFIC SCHOOL OF APPLIED GEOMETRY OF NATIONAL TECHNICAL UNIVERSITY OF UKRAINE "IGOR SIKORSKY KYIV POLYTECHNIC INSTITUTE"
The analysis of the current state, the main directions of researches, the obtained achievements and prospects for further development of the applied geometry school of the National Technical University of Ukraine "Igor S...
КВАЗІМЕТОД МОНТЕ-КАРЛО І КУБАТУРИ ДЛЯ СЕРЕНДИПОВИХ ПОЛІНОМІВ
У роботі розглядаються серендипові поліноми (стандартні та альтернативні) другого і третього порядків. Квазіметод Монте-Карло побудовано на базі квадратного обчислювального шаблона і стратифікованої вибірки із дев’яти ап...