Supper Algorithm of Pattern Recognition
Keywords:
algorithm, pattern recognition, graph, toposAbstract
In this paper, we present a novel and efficient algorithm for solving direct and inverse problems that exist in chemical preparations with antivirial effects. As to the best of our knowledge, the proposed algorithm being reported in this paper is the fastest algorithm published in the literature. The algorithm requires that the pattern information/data to be provided as input in the form of a graph. Most other published algorithms do not have this as a requirement. The algorithm is based on a topos classifier of topos proximity space construction. This algorithm is very effective for pattern recognition problems with given geometric and numerical characteristics. The algorithm’s effectiveness is illustrated by solving the problem of computing/finding the chemical molecule structure which is used in anti-AIDS preparations.
References
Gritsak–Groener V. V. The Computing Proximity of Chemical Compound with the Help of Topoi-Categorical Analysis, Proceeding of two USSR Interinstitute Conference "The Molecular Graphs in Chemical Researches". Kalinin, (1990)5.
Gritsak–Groener V. V. Proc. Nat. Acad. Sci. Ukraine, ser. A, N3(1993)100.
Gritsak–Groener V. V. Fundamental of Mathematical Cybernetics, 2004.
Gritsak–Groener V. V., Gritsak–Groener J. Gruppoid-Algorithm of Pattern Recognition // Proceedings of the XX-th IUPAP International Conference on Statistical Physics (STATPHYS"20). — Paris, 1998.
Gritsak–Groener V. V., Gritsak–Groener J. Pattern Recognition Algorithms in Statistical Physics. // The Proceedings of the XX-th IUPAP International Conference on Statistical Physics (STATPHYS"20). — Paris, 1998.
Gritsak–Groener V. V., Gritsak–Groener J. ARTS COMBINATORIA. — Charkiv, NTU “ChPI”, 2003.
