卷 19, 编号 6 (2020)

Mathematical modeling and applied mathematics

Justification and Classification of Evaluation Fused in Rating Methods of Multi-criteria Choice

Mikoni S., Burakov D.

摘要

The recommendations on the application of methods of multidimensional estimation (MDE) of objects, proposed in the paper Velasquez M., Hester P.T. «An Analysis of Multi-Criteria Decision Making Methods», are analyzed. The weak substantiation of these recommendations, resulting from the superficial systematization of MDE methods, is noted. The recommendations are focused not on the classes of MDE methods, but on various areas of activity. However, in each area of activity there is a wide range of tasks for evaluating objects of various nature. In this regard, the urgency of a more thorough systematization of MDE methods is recognized. Taking into account the diversity of MDE methods, it was decided to limit ourselves to the systematization of methods that use evaluation functions (EF), and on this basis to offer general recommendations for their application. The review of MDE methods from a unified position required clarification of the terminology used in them. On the basis of the formal model of the criterion, the relationship between the concepts of "preference", "criterion" and "indicator" is established. To highlight the methods that use evaluation functions, the concept of the target value of the indicator is introduced. Regarding its location on the indicator scale, the concepts of ideal and real goals are introduced. The criteria corresponding to these goals are divided into target and restrictive ones. Using the proposed terminology, a review of the most well-known MDE methods was carried out. Of these, a group of methods using evaluation functions is distinguished. Variants of evaluation functions created on the basis of the criterion and postulates of the theory of value and utility are considered. On the basis of the similarity of the domains of definition and the meanings of EFs, the relationship between them is established. Regarding the target value of the indicator, they are divided into the functions of achieving the goal and functions of deviation from the goal. The mutual complementarity of these functions is shown. A group of functions of deviation from the goal is highlighted, which allows us to order objects separately according to penalties and rewards in relation to achieving a real goal. The concept of norm is introduced for the correspondence relation. On the example of medical analyzes, the practical application of deviation functions from the norm is shown using both the minimax and the weighted average generalizing function to establish a rating on a set of objects. The similarities and differences of the EFs revealed in the course of the study form the basis for the classification of the MDE methods that use them. The difference in EFs in terms of the complexity of creation is reflected in the proposed methodology for their application.
Informatics and Automation. 2020;19(6):1131-1165
pages 1131-1165 views

Mathematical Model of Object Classifier based on Bayesian Approach

Batenkov A., Batenkov K., Bogachev A., Mishin V.

摘要

The paper claims that the primary importance in solving the classification problem is to find the conditions for dividing the General complexity into classes, determine the quality of such a bundle, and verify the classifier model. We consider a mathematical model of a non-randomized classifier of features obtained without a teacher, when the number of classes is not set a priori, but only its upper bound is set. The mathematical model is presented in the form of a statement of a minimax conditional extreme task, and it is a problem of searching for the matrix of belonging of objects to a class, and representative (reference) elements within each class. The development of the feature classifier is based on the synthesis of two-dimensional probability density in the coordinate space: classes-objects. Using generalized functions, the probabilistic problem of finding the minimum Bayesian risk is reduced to a deterministic problem on a set of non-randomized classifiers. At the same time, the use of specially introduced constraints fixes non-randomized decision rules and plunges the integer problem of nonlinear programming into a General continuous nonlinear problem. For correct synthesis of the classifier, the dispersion curve of the isotropic sample is necessary. It is necessary to use the total intra-class and inter-class variance to characterize the quality of classification. The classification problem can be interpreted as a particular problem of the theory of catastrophes. Under the conditions of limited initial data, a minimax functional was found that reflects the quality of classification for a quadratic loss function. The developed mathematical model is classified as an integer nonlinear programming problem. The model is given using polynomial constraints to the form of a General problem of nonlinear continuous programming. The necessary conditions for the bundle into classes are found. These conditions can be used as sufficient when testing the hypothesis about the existence of classes.
Informatics and Automation. 2020;19(6):1166-1197
pages 1166-1197 views

New Method for Optimal Feature Set Reduction

German O., Nasrh S.

摘要

A problem of searching a minimum-size feature set to use in distribution of multidimensional objects in classes, for instance with the help of classifying trees, is considered. It has an important value in developing high speed and accuracy classifying systems. A short comparative review of existing approaches is given. Formally, the problem is formulated as finding a minimum-size (minimum weighted sum) covering set of discriminating 0,1-matrix, which is used to represent capabilities of the features to distinguish between each pair of objects belonging to different classes. There is given a way to build a discriminating 0,1-matrix. On the basis of the common solving principle, called the group resolution principle, the following problems are formulated and solved: finding an exact minimum-size feature set; finding a feature set with minimum total weight among all the minimum-size feature sets (the feature weights may be defined by the known methods, e.g. the RELIEF method and its modifications); finding an optimal feature set with respect to fuzzy data and discriminating matrix elements belonging to diapason [0,1]; finding statistically optimal solution especially in the case of big data. Statistically optimal algorithm makes it possible to restrict computational time by a polynomial of the problem sizes and density of units in discriminating matrix and provides a probability of finding an exact solution close to 1. Thus, the paper suggests a common approach to finding a minimum-size feature set with peculiarities in problem formulation, which differs it from the known approaches. The paper contains a lot of illustrations for clarification aims. Some theoretical statements given in the paper are based on the previously published works. In the concluding part, the results of the experiments are presented, as well as the information on dimensionality reduction for the coverage problem for big datasets. Some promising directions of the outlined approach are noted, including working with incomplete and categorical data, integrating the control model into the data classification system.

Informatics and Automation. 2020;19(6):1198-1221
pages 1198-1221 views

Artificial intelligence, knowledge and data engineering

Comparison of Two Objects Classification Techniques using Hidden Markov Models and Convolutional Neural Networks

Sarmiento C., Savage J.

摘要

This paper presents a comparison between discrete Hidden Markov Models and Convolutional Neural Networks for the image classification task. By fragmenting an image into sections, it is feasible to obtain vectors that represent visual features locally, but if a spatial sequence is established in a fixed way, it is possible to represent an image as a sequence of vectors. Using clustering techniques, we obtain an alphabet from said vectors and then symbol sequences are constructed to obtain a statistical model that represents a class of images. Hidden Markov Models, combined with quantization methods, can treat noise and distortions in observations for computer vision problems such as the classification of images with lighting and perspective changes.We have tested architectures based on three, six and nine hidden states favoring the detection speed and low memory usage. Also, two types of ensemble models were tested. We evaluated the precision of the proposed methods using a public domain data set, obtaining competitive results with respect to fine-tuned Convolutional Neural Networks, but using significantly less computing resources. This is of interest in the development of mobile robots with computers with limited battery life, but requiring the ability to detect and add new objects to their classification systems.

Informatics and Automation. 2020;19(6):1222-1254
pages 1222-1254 views

Vietnamese Text Classification Algorithm using Long Short Term Memory and Word2Vec

Phat H., Anh N.

摘要

In the context of the ongoing forth industrial revolution and fast computer science development the amount of textual information becomes huge. So, prior to applying the seemingly appropriate methodologies and techniques to the above data processing their nature and characteristics should be thoroughly analyzed and understood. At that, automatic text processing incorporated in the existing systems may facilitate many procedures. So far, text classification is one of the basic applications to natural language processing accounting for such factors as emotions’ analysis, subject labeling etc. In particular, the existing advancements in deep learning networks demonstrate that the proposed methods may fit the documents’ classifying, since they possess certain extra efficiency; for instance, they appeared to be effective for classifying texts in English. The thorough study revealed that practically no research effort was put into an expertise of the documents in Vietnamese language. In the scope of our study, there is not much research for documents in Vietnamese. The development of deep learning models for document classification has demonstrated certain improvements for texts in Vietnamese. Therefore, the use of long short term memory network with Word2vec is proposed to classify text that improves both performance and accuracy. The here developed approach when compared with other traditional methods demonstrated somewhat better results at classifying texts in Vietnamese language. The evaluation made over datasets in Vietnamese shows an accuracy of over 90%; also the proposed approach looks quite promising for real applications.

Informatics and Automation. 2020;19(6):1255-1279
pages 1255-1279 views

Digital information telecommunication technologies

Empirical Approach to the Estimating the Immunity of Phase Modulation Signals with Continuous Phase

Dvornikov S., Dvornikov S.

摘要

The high spectral efficiency of signals with continuous phase modulation (CPM) has determined their popularity and active use in various radio engineering projects. The uniqueness of the properties of CPM signals is associated with the preservation of the continuity of their phase when changing information messages for the duration of a symbol. At the same time, until recently, of the entire wide class of signals with continuous phase modulation, the most widespread were various variations, the so-called Minimum Shift Keying (MSK) signals. However, these are far from the only representatives of the class of CPM signals with the property of high spectral compactness. This article examines no less interesting signals of this class, formed by means of Dual Phase Modulation (DPM). In particular, analytical expressions of their synthesis are presented, their belonging to the class of CPM signals is substantiated. In addition, the article investigates the temporal properties of the phase function recommended by ITU-R SM.328-11 for the synthesis of signals with continuous phase modulation, presents the time and frequency fragments of MSK signals in comparison with signals with Binary Phase Shift Keying (BPSK). The stages of the analytical derivation of the model of noise immunity of PCM signals in terms of the probability of a bit error based on an empirical approach are presented. The generality of the obtained model with the known expression for MSK signals is shown by studying the difference function of the approximation error (error of the order of 10-3), which made it possible to obtain a more compact representation of the developed model in relation to DPM signals. It has been proven that DPM signals have higher noise immunity properties in relation to MSK signals (about 0.5 dB at an error level of 10-5), using the results of studying the difference functions determined by the difference between the signal symbols corresponding to the information values "1" and "0". The directions of further research are determined.
Informatics and Automation. 2020;19(6):1280-1306
pages 1280-1306 views

Comparative Analysis of Centrality Measures of Network Nodes based on Principal Component Analysis

Eremeev I., Tatarka M., Shuvaev F., Tsyganov A.

摘要

. The analysis of networks of a diverse nature, which are citation networks, social networks or information and communication networks, includes the study of topological properties that allow one to assess the relationships between network nodes and evaluate various characteristics, such as the density and diameter of the network, related subgroups of nodes, etc. For this, the network is represented as a graph – a set of vertices and edges between them. One of the most important tasks of network analysis is to estimate the significance of a node (or in terms of graph theory – a vertex). For this, various measures of centrality have been developed, which make it possible to assess the degree of significance of the nodes of the network graph in the structure of the network under consideration. The existing variety of measures of centrality gives rise to the problem of choosing the one that most fully describes the significance and centrality of the node. The relevance of the work is due to the need to analyze the centrality measures to determine the significance of vertices, which is one of the main tasks of studying networks (graphs) in practical applications. The study made it possible, using the principal component method, to identify collinear measures of centrality, which can be further excluded both to reduce the computational complexity of calculations, which is especially important for networks that include a large number of nodes, and to increase the reliability of the interpretation of the results obtained when evaluating the significance node within the analyzed network in solving practical problems. In the course of the study, the patterns of representation of various measures of centrality in the space of principal components were revealed, which allow them to be classified in terms of the proximity of the images of network nodes formed in the space determined by the measures of centrality used.
Informatics and Automation. 2020;19(6):1307-1331
pages 1307-1331 views

Centrally Reserved Access Model to the Medium in Digital Radio Communication Networks

Peregudov M., Steshkovoy A.

摘要

Currently, centrally reserved access to the medium in the digital radio communication networks of the IEEE 802.11 family standards is an alternative to random multiple access to the environment such as CSMA/CA and is mainly used in the transmission voice and video messages in real time. Centrally reserved access to the environment determines the scope of interest in it from attackers. However, the assessment of effectiveness of centrally reserved access to the environment under the conditions of potentially possible destructive impacts was not carried out and therefore it is impossible to assess the contribution of such impacts to the decrease in the effectiveness of such access. Also, the stage establishing of centrally reserved access to the environment was not previously taken into account. Analytical model development of centrally reserved access to the environment under the conditions of destructive influences in digital radio communication networks of the IEEE 802.11 family standards. A mathematical model of centrally reserved access to the environment has been developed, taking into account not only the stage of its functioning, but also the stage of formation under the conditions of destructive influences by the attacker. Moreover, in the model the stage of establishing centrally reserved access to the medium displays a sequential relationship of such access, synchronization elements in digital radio communication networks and random multiple access to the medium of the CSMA/CA type. It was established that collisions in the data transmission channel caused by destructive influences can eliminate centrally reserved access to the medium even at the stage of its establishment. The model is applicable in the design of digital radio communication networks of the IEEE 802.11 family of standards, the optimization of such networks of the operation, and the detection of potential destructive effects by an attacker.
Informatics and Automation. 2020;19(6):1332-1356
pages 1332-1356 views

Согласие на обработку персональных данных с помощью сервиса «Яндекс.Метрика»

1. Я (далее – «Пользователь» или «Субъект персональных данных»), осуществляя использование сайта https://journals.rcsi.science/ (далее – «Сайт»), подтверждая свою полную дееспособность даю согласие на обработку персональных данных с использованием средств автоматизации Оператору - федеральному государственному бюджетному учреждению «Российский центр научной информации» (РЦНИ), далее – «Оператор», расположенному по адресу: 119991, г. Москва, Ленинский просп., д.32А, со следующими условиями.

2. Категории обрабатываемых данных: файлы «cookies» (куки-файлы). Файлы «cookie» – это небольшой текстовый файл, который веб-сервер может хранить в браузере Пользователя. Данные файлы веб-сервер загружает на устройство Пользователя при посещении им Сайта. При каждом следующем посещении Пользователем Сайта «cookie» файлы отправляются на Сайт Оператора. Данные файлы позволяют Сайту распознавать устройство Пользователя. Содержимое такого файла может как относиться, так и не относиться к персональным данным, в зависимости от того, содержит ли такой файл персональные данные или содержит обезличенные технические данные.

3. Цель обработки персональных данных: анализ пользовательской активности с помощью сервиса «Яндекс.Метрика».

4. Категории субъектов персональных данных: все Пользователи Сайта, которые дали согласие на обработку файлов «cookie».

5. Способы обработки: сбор, запись, систематизация, накопление, хранение, уточнение (обновление, изменение), извлечение, использование, передача (доступ, предоставление), блокирование, удаление, уничтожение персональных данных.

6. Срок обработки и хранения: до получения от Субъекта персональных данных требования о прекращении обработки/отзыва согласия.

7. Способ отзыва: заявление об отзыве в письменном виде путём его направления на адрес электронной почты Оператора: info@rcsi.science или путем письменного обращения по юридическому адресу: 119991, г. Москва, Ленинский просп., д.32А

8. Субъект персональных данных вправе запретить своему оборудованию прием этих данных или ограничить прием этих данных. При отказе от получения таких данных или при ограничении приема данных некоторые функции Сайта могут работать некорректно. Субъект персональных данных обязуется сам настроить свое оборудование таким способом, чтобы оно обеспечивало адекватный его желаниям режим работы и уровень защиты данных файлов «cookie», Оператор не предоставляет технологических и правовых консультаций на темы подобного характера.

9. Порядок уничтожения персональных данных при достижении цели их обработки или при наступлении иных законных оснований определяется Оператором в соответствии с законодательством Российской Федерации.

10. Я согласен/согласна квалифицировать в качестве своей простой электронной подписи под настоящим Согласием и под Политикой обработки персональных данных выполнение мною следующего действия на сайте: https://journals.rcsi.science/ нажатие мною на интерфейсе с текстом: «Сайт использует сервис «Яндекс.Метрика» (который использует файлы «cookie») на элемент с текстом «Принять и продолжить».