UDC 519.11.176
1 International Research and Training Center for Information Technologies and Systems of the NAS of Ukraine and MES of Ukraine, Kyiv, Ukraine
TymNad@gmail.com
|
|
ARTIFICIAL INTELLIGENCE PROBLEMS AND COMBINATORIAL OPTIMIZATION
Abstract. The method of modeling artificial intelligence problems using the theory of combinatorial optimization is described. As a result of these studies, the combinatorial nature of problems of this class was established, the cause of uncertainty of various types, which arises in the process of their solution, was revealed, and the nature of the fuzziness of the input data was explained. An example of the clustering problem is used to consider the situation of uncertainty caused by the structure of the argument (combinatorial set).
Keywords: combinatorial optimization, artificial intelligence, combinatorial configurations, clustering problem, uncertainty situation.
full text
REFERENCES
- Schlesinger M.I., Glavach V. Ten lectures on statistical and structural recognition [in Russian]. Kyiv: Nauk. Dumka, 2004. 546 p.
- Vintsyuk T.K. Analysis, recognition, and interpretation of speech signals [in Russian]. Kyiv: Nauk. Dumka, 1987. 262 p.
- Fainzilberg L.S. Mathematical methods for evaluating the usefulness of diagnostic features [in Russian]. Kyiv: Osvita Ukrainy, 2010. 152 p.
- Anisimov A.V., Marchenko O.O., Zemlyanskyi V.R. The influence of language on the lifespan of artificial intelligence populations. Kibernetyka ta systemnyj analiz. 2021. Vol. 57, No. 5. P. 3–11.
- Kvyetny R.N., Bisikalo O.V., Nazarov I.O. Determining the meaning of textual information based on the model of distribution of restrictions. Information-measuring and computing systems and complexes in technological processes. 2012. N 1. P. 93–96.
- Ivakhnenko A.G. Systems of heuristic self-organization in technical cybernetics [in Russian]. Kyiv: Technika, 1971. 392 p.
- Timofieva N.K. Theoretical and numerical methods of solving combinatorial optimization problems. Abstract. dis... doc. technical of science. V. M. Glushkov Institute of Cybernetics, National Academy of Sciences of Ukraine, Kyiv. 2007. 32 p.
- Grytsenko V.I., Tymofeeva N.K. Finding subclasses of solvable problems in combinatorial optimization and artificial intelligence based on the structure of input information. Kibernetyka ta obchyslyuvalʹna tekhnika. 2022. N 1 (207). P. 5–17.
- Timofieva N.K. On the nature of uncertainty and variable criteria in partition problems. Problemy upravleniya i informatiki. 2009. N 5. P. 88–99.
- Mandel I.D. Cluster analysis [Russian translation]. Moscow: Finansy i statistika, 1988. 176 p.
- Timofieva N.K. Dependence of the objective function of combinatorial optimization problems on the ordering of combinatorial configurations. Komp'yuternaya matematika. 2005. No. 2. P. 135–146.