Improved algorithm for matched-pairs selection of informative features in the problems of recognition of complex system states
DOI:
https://doi.org/10.15587/1729-4061.2021.229756Keywords:
computer systems, computer diagnostics, pattern recognition, complex system, informative featuresAbstract
The problem of computer diagnostics of complex systems is one of the non-trivial tasks of modern information technology. Such systems are, for example, computer networks, automatic and/or automated control systems for complex technological objects, including related to complex problems of environmental protection, biology, etc. In pattern recognition, one of the major problems is forming subspaces of informative features, which only in the «ensemble» allow diagnosing the states of such systems with a high degree of reliability.
An effective approach to solving this problem based on the principles of inductive modeling of complex systems is proposed. The quality criterion for recognizing classes of patterns is formulated, which also makes it possible to evaluate the quality of the constructed ensemble of informative features.
As an example, the problem of constructing an ensemble of informative features represented by a binary code based on the data of an experiment to determine the hazard levels of some plant protection products is considered. Real primary data on plant protection products used in practice were applied to recognize the effect of certain characteristics on the so-called integrated «hazard indicator».
Comparative numerical estimates of the effectiveness of the proposed approach are given. In this case, there can be a fivefold gain in the amount of computations for a relatively small number of input features equal to 5 compared to the known algorithms of the class considered in the paper. It is shown that, from a practical point of view, the described algorithm has advantages over the known algorithms with brute-force search of feature subspaces in pattern recognition problems.
References
- Yang, J., Honavar, V. (1998). Feature Subset Selection Using a Genetic Algorithm. Feature Extraction, Construction and Selection, 117–136. doi: https://doi.org/10.1007/978-1-4615-5725-8_8
- Carpenter, G. A., Grossberg, S. (1987). ART 2: self-organization of stable category recognition codes for analog input patterns. Applied Optics, 26 (23), 4919. doi: https://doi.org/10.1364/ao.26.004919
- Ilnitskiy, A., Burba, O. (2019). Statistical criteria for assessing the informativity of the sources of radio emission of telecommunication networks and systems in their recognition. Cybersecurity: Education, Science, Technique, 1 (5), 83–94. doi: https://doi.org/10.28925/2663-4023.2019.5.8394
- Zayats, V. M., Shokyra, G. Ya. (2012). Correction priority early signs in constructing recognition systems. Naukovyi visnyk NLTU Ukrainy, 22.7, 344–350.
- Jensen, R., Shen, Q. (2004). Semantics-preserving dimensionality reduction: rough and fuzzy-rough-based approaches. IEEE Transactions on Knowledge and Data Engineering, 16 (12), 1457–1471. doi: https://doi.org/10.1109/tkde.2004.96
- Jain, A. K., Duin, P. W., Mao, J. (2000). Statistical pattern recognition: a review. IEEE Transactions on Pattern Analysis and Machine Intelligence, 22 (1), 4–37. doi: https://doi.org/10.1109/34.824819
- Lavrakas, P. (2008). Encyclopedia of survey research methods. Sage Publications. doi: https://doi.org/10.4135/9781412963947
- Dopico, J. R. R., Dorado, J., Pazos, A. (Eds.) (2009). Encyclopedia of artificial intelligence. IGI Global. doi: https://doi.org/10.4018/978-1-59904-849-9
- Everitt, B. S., Landau, S., Leese, M., Stahl, D. (2011). Cluster Analysis. John Wiley & Sons, Ltd. doi: https://doi.org/10.1002/9780470977811
- Ivakhnenko, A. H., Koppa, Yu. V. (1974). Vybir ansambliu oznak i syntez bahatoriadnoho pertseptrona za oznakamy samoorhanizatsiyi. Avtomatyka, 2, 41–53.
- Ivahnenko, A. G., Koppa, Yu. V., Timchenko, I. K., Ivahnenko, N. A. (1980). Svyaz' teorii samoorganizatsii matematicheskih modeley na EVM i teorii raspoznavaniya obrazov. Avtomatika, 6, 3–13.
- Ivahnenko, A. G. (1981). Induktivnyy metod samoorganizatsii modeley slozhnyh sistem. Kyiv: Naukova dumka, 296.
- Gabor, D. (1971). Cybernetics and the Future of our Industrial Civilization. J. of Cybernetics, 1, 1–4.
- Gabor, D. (1972). Perspektivy planirovaniya. Avtomatika, 2, 16–22.
- Ivahnenko, A. G. (1989). Metod posledovatel'nogo oprobovaniya (perebora) klasterizatsiy-kandidatov po kriteriyam differentsial'nogo tipa. Raspoznavanie, klassifikatsiya, prognoz. Matematicheskie metody i ih primenenie, 2, 126–158.
- Madala, H. R., Ivakhnenko, A. G. (1994). Inductive learning algorithms for complex systems modeling. CRC Press, 380. doi: https://doi.org/10.1201/9781351073493
- Wójcik, W., Osypenko, V., Lytvynenko, V. (2013). The use of inductive clustering algorithms for forming expert groups in large-scale innovation projects. Elektronika: konstrukcje, technologie, zastosowania, 54 (8), 45–48. Available at: https://yadda.icm.edu.pl/baztech/element/bwmeta1.element.baztech-e864befd-7a77-411b-9ed7-44cb3446b06e
- Babichev, S., Lytvynenko, V., Osypenko, V. (2017). Implementation of the objective clustering inductive technology based on DBSCAN clustering algorithm. 2017 12th International Scientific and Technical Conference on Computer Sciences and Information Technologies (CSIT). doi: https://doi.org/10.1109/stc-csit.2017.8098832
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2021 Volodymyr Osypenko, Borys Zlotenko, Tetiana Kulik, Svitlana Demishonkova, Oleh Synyuk, Volodymyr Onofriichuk, Svitlana Smutko
This work is licensed under a Creative Commons Attribution 4.0 International License.
The consolidation and conditions for the transfer of copyright (identification of authorship) is carried out in the License Agreement. In particular, the authors reserve the right to the authorship of their manuscript and transfer the first publication of this work to the journal under the terms of the Creative Commons CC BY license. At the same time, they have the right to conclude on their own additional agreements concerning the non-exclusive distribution of the work in the form in which it was published by this journal, but provided that the link to the first publication of the article in this journal is preserved.
A license agreement is a document in which the author warrants that he/she owns all copyright for the work (manuscript, article, etc.).
The authors, signing the License Agreement with TECHNOLOGY CENTER PC, have all rights to the further use of their work, provided that they link to our edition in which the work was published.
According to the terms of the License Agreement, the Publisher TECHNOLOGY CENTER PC does not take away your copyrights and receives permission from the authors to use and dissemination of the publication through the world's scientific resources (own electronic resources, scientometric databases, repositories, libraries, etc.).
In the absence of a signed License Agreement or in the absence of this agreement of identifiers allowing to identify the identity of the author, the editors have no right to work with the manuscript.
It is important to remember that there is another type of agreement between authors and publishers – when copyright is transferred from the authors to the publisher. In this case, the authors lose ownership of their work and may not use it in any way.
