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

DOI

10.2991/aisr.k.201029.049How to use a DOI?

Keywords

graph, morphism, category, algorithm

Abstract

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.

Copyright

© 2020, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Vyacheslav Antonov
AU  - Ansaf Abdulnagimov
AU  - Veronika Suvorova
AU  - Yana Mikhailova
PY  - 2020
DA  - 2020/11/10
TI  - Method for Improving the Accuracy of Search Algorithms in Socially Significant Events
BT  - Proceedings of the 8th Scientific Conference on Information Technologies for Intelligent Decision Making Support (ITIDS 2020)
PB  - Atlantis Press
SP  - 255
EP  - 259
SN  - 1951-6851
UR  - https://doi.org/10.2991/aisr.k.201029.049
DO  - 10.2991/aisr.k.201029.049
ID  - Antonov2020
ER  -