Yu. I. Zhuravlev
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Yu. I. Zhuravlev has a total of 25 co-authors. Here are the top co-authors by number of shared publications:
- Igor B. Gurevich
Federal Research Center “Computer Science and Control” of the Russian Academy of Sciences
3 shared publications - A. E. Dyusembaev
Al-Farabi Kazakh National University
2 shared publications - A. A. Dokukin
Baikov Institute of Metallurgy and Materials Science of the Russian Academy of Sciences, Moscow, Russian Federation
1 shared publication - A. A. Myagkov
Russian Academy of Sciences
1 shared publication - A. P. Vinogradov
Russian Academy of Sciences
1 shared publication - Alexander A. Dokukin
Federal Research Center “Computer Science and Control” of the Russian Academy of Sciences, Moscow, Russian Federation
1 shared publication
Latest Publications
- Open Access
- 1 January 2023
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 2997 (1) , 020012
Algebraic methods for solving recognition problems with non-intercuting classes
The article deals with recognition problems with non-overlapping classes. To solve these problems by algebraic methods, the article proposes a much simpler in d
- 1 January 2023
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 2997 (1) , 020012
Open AccessAlgebraic methods for solving recognition problems with non-intercuting classes
The article deals with recognition problems with non-overlapping classes. To solve these problems by algebraic methods, the article proposes a much simpler in d
- 1 October 2021
- Published by Pleiades Publishing Ltd in Pattern Recognition and Image Analysis
- Vol. 31 (4) , 699-708
Using Hough-Like Transforms for Extracting Relevant Regularities from Big Applied Data
A novel approach to searching for useful and/or relevant regularities in big applied data is proposed and tested using the example of voluminous archive notes in retail trade. Generalized precedents and analogs of the Hough transform in increased dimensions are used as computational basis for accurate formulation of hypotheses and numerical testing of dependences. Special attention is paid to importing a priori information and practical experience into the numerical models.
- 1 October 2021
- Published by Pleiades Publishing Ltd in Pattern Recognition and Image Analysis
- Vol. 31 (4) , 699-708
Using Hough-Like Transforms for Extracting Relevant Regularities from Big Applied Data
A novel approach to searching for useful and/or relevant regularities in big applied data is proposed and tested using the example of voluminous archive notes in retail trade. Generalized precedents and analogs of the Hough transform in increased dimensions are used as computational basis for accurate formulation of hypotheses and numerical testing of dependences. Special attention is paid to importing a priori information and practical experience into the numerical models.
- Open Access
- 1 July 2021
- Published by Pleiades Publishing Ltd in Doklady Mathematics
- Vol. 104 (1) , 212-215
Two-Level Regression Method Using Ensembles of Trees with Optimal Divergence
The article discusses a new two-level regression analysis method in which a corrective procedure is applied to optimal ensembles of regression trees. Optimization is carried out based on the simultaneous achievement of the divergence of the algorithms in the forecast space and a good approximation of the data by individual algorithms of the ensemble. Simple averaging, random regression forest, and gradient boosting are used as corrective procedures. Experiments are presented comparing the proposed method with the standard decision forest and the standard gradient boosting method for decision trees.
- 1 July 2021
- Published by Pleiades Publishing Ltd in Doklady Mathematics
- Vol. 104 (1) , 212-215
Open AccessTwo-Level Regression Method Using Ensembles of Trees with Optimal Divergence
The article discusses a new two-level regression analysis method in which a corrective procedure is applied to optimal ensembles of regression trees. Optimization is carried out based on the simultaneous achievement of the divergence of the algorithms in the forecast space and a good approximation of the data by individual algorithms of the ensemble. Simple averaging, random regression forest, and gradient boosting are used as corrective procedures. Experiments are presented comparing the proposed method with the standard decision forest and the standard gradient boosting method for decision trees.
- 1 October 2020
- Published by Allerton Press in Moscow University Computational Mathematics and Cybernetics
- Vol. 44 (4) , 196-202
Approximation of Quasiperiodic Signal Phase Trajectory Using Directional Regression
This paper solves the phase trajectory approximation problem. Quasiperiodic time series form its trajectory in high dimensional space. The trajectory is re
- 1 October 2020
- Published by Allerton Press in Moscow University Computational Mathematics and Cybernetics
- Vol. 44 (4) , 196-202
Approximation of Quasiperiodic Signal Phase Trajectory Using Directional Regression
This paper solves the phase trajectory approximation problem. Quasiperiodic time series form its trajectory in high dimensional space. The trajectory is re
- 1 July 2020
- Published by Pleiades Publishing Ltd in Pattern Recognition and Image Analysis
- Vol. 30 (3) , 303-314
Comparison of Different Dichotomous Classification Algorithms
Experimental investigations of various dichotomous classification algorithms are carried out. Dichotomous classification, or Error-Correcting Output Codes (ECOCs) classification, is based on the construction of a binary code matrix. The rows of the matrix contain unique codewords of classes, and columns are called dichotomies. A dichotomous classification consists of two stages: coding (construction of a code matrix) and decoding, making a decision on the correspondence of an object to a class by analyzing the code matrix. In this study, an experimental comparison of newly proposed methods for constructing dichotomies and a comparison of different approaches to decoding by the available code matrix are proposed. Preliminary experiments show the prospects of proposed methods.
- 1 July 2020
- Published by Pleiades Publishing Ltd in Pattern Recognition and Image Analysis
- Vol. 30 (3) , 303-314
Comparison of Different Dichotomous Classification Algorithms
Experimental investigations of various dichotomous classification algorithms are carried out. Dichotomous classification, or Error-Correcting Output Codes (ECOCs) classification, is based on the construction of a binary code matrix. The rows of the matrix contain unique codewords of classes, and columns are called dichotomies. A dichotomous classification consists of two stages: coding (construction of a code matrix) and decoding, making a decision on the correspondence of an object to a class by analyzing the code matrix. In this study, an experimental comparison of newly proposed methods for constructing dichotomies and a comparison of different approaches to decoding by the available code matrix are proposed. Preliminary experiments show the prospects of proposed methods.
- 23 September 2019
- Published by The Russian Academy of Sciences in Доклады Академии наук
- Vol. 488 (1) , 11-15
A neural network construction for pattern recognition problems with standard information on the basis of the algorithms of model with piecewise linear surfaces and parameters
In the paper for recognition problems with standard information on the basis of the operator approach and the model with parameters and piecewise linear surface has been constructed a neural network which reproduced of computations performs by the correct algorithm.
- 23 September 2019
- Published by The Russian Academy of Sciences in Доклады Академии наук
- Vol. 488 (1) , 11-15
A neural network construction for pattern recognition problems with standard information on the basis of the algorithms of model with piecewise linear surfaces and parameters
In the paper for recognition problems with standard information on the basis of the operator approach and the model with parameters and piecewise linear surface has been constructed a neural network which reproduced of computations performs by the correct algorithm.
- 1 September 2019
- Published by Pleiades Publishing Ltd in Doklady Mathematics
- Vol. 100 (2) , 411-415
Neural Network Construction for Recognition Problems with Standard Information on the Basis of a Model of Algorithms with Piecewise Linear Surfaces and Parameters
For recognition problems with standard information, a neural network reproducing computations performed by a correct algorithm is constructed on the basis of the operator approach and a model...
- 1 September 2019
- Published by Pleiades Publishing Ltd in Doklady Mathematics
- Vol. 100 (2) , 411-415
Neural Network Construction for Recognition Problems with Standard Information on the Basis of a Model of Algorithms with Piecewise Linear Surfaces and Parameters
For recognition problems with standard information, a neural network reproducing computations performed by a correct algorithm is constructed on the basis of the operator approach and a model...
- 1 December 2018
- Published by Pleiades Publishing Ltd in Computational Mathematics and Mathematical Physics
- Vol. 58 (12) , 2064-2077
Monotone Dualization Problem and Its Generalizations: Asymptotic Estimates of the Number of Solutions
Issues related to the construction of efficient algorithms for intractable discrete problems are studied. Enumeration problems are considered. Their intractability has two aspects—exponential...
- 1 December 2018
- Published by Pleiades Publishing Ltd in Computational Mathematics and Mathematical Physics
- Vol. 58 (12) , 2064-2077
Monotone Dualization Problem and Its Generalizations: Asymptotic Estimates of the Number of Solutions
Issues related to the construction of efficient algorithms for intractable discrete problems are studied. Enumeration problems are considered. Their intractability has two aspects—exponential...
- 1 January 2015
- Published by Pleiades Publishing Ltd in Pattern Recognition and Image Analysis
- Vol. 25 (1) , 132-160
On basic problems of image recognition in neurosciences and heuristic methods for their solution
The paper describes the possibilities and main results of mathematical and informational approaches to automating the analysis, recognition, and evaluation of images in brain research. The latter are conducted in such essential sectors of neuroscience as molecular and cellular neuroscience, behavioral neuroscience, systemic neuroscience, developmental neuroscience, cognitive neuroscience, theoretical and computational neuroscience, neurology and psychiatry, neural engineering, neurolinguistics, and neurovisualization. An important direction in simulating diseases, including diseases of the brain and their diagnoses, is the obtaining, storage, processing, and analysis of data extracted from digital images. The theoretical and methodical basis of automating the processing, analysis, and evaluation of experimental data obtained in brain research consists of the mathematical theory of image recognition and mathematical theory of image analysis. The paper presents examples of mathematical and informational approaches to automate the processing, analysis, and evaluation of microimages of neurons for constructing preclinical models of Parkinson’s disease.
- 1 January 2015
- Published by Pleiades Publishing Ltd in Pattern Recognition and Image Analysis
- Vol. 25 (1) , 132-160
On basic problems of image recognition in neurosciences and heuristic methods for their solution
The paper describes the possibilities and main results of mathematical and informational approaches to automating the analysis, recognition, and evaluation of images in brain research. The latter are conducted in such essential sectors of neuroscience as molecular and cellular neuroscience, behavioral neuroscience, systemic neuroscience, developmental neuroscience, cognitive neuroscience, theoretical and computational neuroscience, neurology and psychiatry, neural engineering, neurolinguistics, and neurovisualization. An important direction in simulating diseases, including diseases of the brain and their diagnoses, is the obtaining, storage, processing, and analysis of data extracted from digital images. The theoretical and methodical basis of automating the processing, analysis, and evaluation of experimental data obtained in brain research consists of the mathematical theory of image recognition and mathematical theory of image analysis. The paper presents examples of mathematical and informational approaches to automate the processing, analysis, and evaluation of microimages of neurons for constructing preclinical models of Parkinson’s disease.
- 16 September 2014
- Published by Pleiades Publishing Ltd in Pattern Recognition and Image Analysis
- Vol. 24 (3) , 333-346
Computer science: Subject, fundamental research problems, methodology, structure, and applied problems
The work is devoted to computer science. The subject, fundamental research problems, methodology, structure, and applied problems are defined and analyzed. The mathematical apparatus of computer science and its main methods—formalization, algorithmization, mathematical modeling, and programming—are considered. A characterization is given to the main fields of computer science pattern recognition, image analysis, artificial intelligence, intelligent data analysis, and information technologies. An in-depth analysis is carried out of the relationship and interaction between computer science and cybernetics. The role and the subject of informatics are discussed.
- 16 September 2014
- Published by Pleiades Publishing Ltd in Pattern Recognition and Image Analysis
- Vol. 24 (3) , 333-346
Computer science: Subject, fundamental research problems, methodology, structure, and applied problems
The work is devoted to computer science. The subject, fundamental research problems, methodology, structure, and applied problems are defined and analyzed. The mathematical apparatus of computer science and its main methods—formalization, algorithmization, mathematical modeling, and programming—are considered. A characterization is given to the main fields of computer science pattern recognition, image analysis, artificial intelligence, intelligent data analysis, and information technologies. An in-depth analysis is carried out of the relationship and interaction between computer science and cybernetics. The role and the subject of informatics are discussed.