Method for Improving the Accuracy of Search Algorithms in Socially Significant Events

Vyacheslav Antonov; Veronika Suvorova; Yana Mikhailova; Ansaf Abdulnagimov

Информационные технологии интеллектуальной поддержки принятия решений, Информационные технологии интеллектуальной поддержки принятия решений 2020

Vyacheslav Antonov, Veronika Suvorova, Yana Mikhailova, Ansaf Abdulnagimov

Изменена: 2025-02-20

Аннотация

This article presents the results of calculations that allow us to visualize the connections of graphs of socially significant events, which are revealed through the tools of categorical logic as homomorphisms in the conditions of algorithmization of search mechanisms using combinatorial analysis and the principle of greedy maximization of information growth. The main result is a new method, which is based on the grouping of graph structures by highlighting their main ties in spirtah and creating their unique homomorphic image due to the greedy principle of maximizing the information gain in conjunction with combinatorial logic combinatorial analysis that allows the interpretation of socially significant events in the form of detail relationships creating its elements and forming them as an object and, subsequently, improve the accuracy of the algorithms.

Ключевые слова

graph; morphism; category; algorithm

Литература

[1] Theory of finite graphs, A. A. Zykov, Ed. Nauka, Siberian branch Novosibirsk, pp. 322-343, 1969.

[2] Combinatorics and graph theory, V. A. Nosov, Moscow state Institute of electronics and mathematics, M., pp. 32-50, 1999.

[3] Spectra of graphs. Theory and applications, D. Cvetkovic, M. Doob, J. Sachs, Science. Dumka, Kiev, pp. 22-281, 1984.

[4] Graph theory, O. Ore, Nauka, Main edition of physical and mathematical literature, M., 1980.

[5] Graph theory. An algorithmic approach., N. Christofides, Mir, M., 1978.

[6] http://webdocs.cs.ualberta.ca/~joe/Theses/HCarchive/main.html, Basil Vandegriend

[7] Combinatorics and graph theory, V. A. Noskov, Moscow state Institute of electronics and mathematics (Technical University), M., pp. 32-37, 1999.

[8] Category logic, V. L. Vasyukov, ANO Institute of logic, M., 2005.

[9] Spectral Graph Theory, Fan R. K. Chung, Regional Conference Series in Mathematics, Number 92, California, 1994.

[10] “Graph Theory”, R. Diestel, Springer, 2016.

[11] Introduction to Categories and Categorical Logic, S. Abramsky, N. Tzevelekos, 2011.

[12] Category theory, 2nd edition, S. Awodey, Oxford logic guides, 2010.

[13] 'What is a Thing?': Topos Theory in the Foundations of Physics, A. Doering, C. Isham, 2008.

[14] Probabilistic method, 2nd edition, N. Alon, J. Spencer, Binom. Knowledge lab, М., 2013.

[15] Information Theory, Inference, and Learning Algorithms, D.J.C. MacKay, Cambridge University Press, 2005.

[16] Analytic Combinatorics. Symbolic Combinatorics. P. Flajolet, R. Sedgewick, Philippe Flajolet and Robet Sedgewick, France-USA, 2002.

[17] Graph theory, Ed. 4th, F. Harari, Librokom, M., 2009.

[18] Graph theory, A. V. Omelchenko, MTSNMO, M., 2018.

[19] Graph theory—Handbooks, manuals, JL. Gross, J. Yellen, CRC PRESS LLC, D.S., 2003.

[20] Combinatorial Methods with Computer Applications, JL. Gross, Taylor & Francis Inc, Boca Raton, FL, United States, 2007.

[21] Handbook of Discrete and Combinatorial Mathematics, KH. Rosen, CRC PRESS LLC, D.S., 2000.

[22] Search Games, L.A. Petrosyan, A.Y. Garnaev, SPBU publishing house, SPb., 1992.

[23] Toposes. Logic of categorical analysis., R. Goldblatt, Mir, M., 1983.

[24] Inverses of triangular matrices and bipartite graphs, R.B. Bapat, E. Ghorbani, Indian Statistical Institute, Delhi Centre, K.N. Toosi University of Technology, India, Iran, 2018.

[25] Тhе Algorithm Design Manual, S.S. Skiena, BHV Petersburg, SPb., 2011.