Logical Classification Based on Finding Regular Representative Elementary Classifiersстатья
Информация о цитировании статьи получена из
Scopus
Статья опубликована в журнале из списка Web of Science и/или Scopus
Дата последнего поиска статьи во внешних источниках: 23 января 2026 г.
Аннотация:The paper considers an approach to the supervised classification problem , which is based on the application of the apparatus of discrete mathematics (logical methods of data analysis). The possibility of reducing the computation time at the stage of training a correct logical classifier was investigated. New models of classifiers were proposed, which are based on finding frequently occurring fragments of a special type in descriptions of precedents and are called regular elementary classifiers. Descriptions of models of classifiers were given using concepts of the theory of logical functions. To construct the desired fragments, the authors developed and implemented an original algorithm. The efficiency of the proposed classifier models was substantiated experimentally and confirmed by theoretical estimates of the complexity of their training. An upper asymptotic estimate of the typical number of regular elementary classifiers was obtained.