Bulletin of National Technical University "KhPI". Series: System Analysis, Control and Information Technologies最新文献

{"title":"VERBAL DESCRIPTION OF THE TECHNOLOGY FOR PLANNING THE QUALITY IMPROVEMENT OF A SUBSET OF THE PROCESSES OF THE SPICE MATURITY REFERENCE MODEL","authors":"M. Godlevskyi, Georgi Burlakov","doi":"10.20998/2079-0023.2023.01.06","DOIUrl":"https://doi.org/10.20998/2079-0023.2023.01.06","url":null,"abstract":"It is noted that to solve the problem of developing information technology for planning the increase of maturity level of a subset of the processes of the SPICE reference maturity model, this issue must first be considered at the verbal level as a technology (sequence of stages) for the implementation of the given problem. At the first stage, the structure of the SPICE reference model, which consists of a number of separate processes, was formalized. This set is presented as a hierarchical structure: the first level is a set of processes and subprocesses; the second level is a set of process groups; the third level is a set of process categories. At the second stage, the method of assessing the level of possibility of a separate process/sub-process of the reference maturity model SPICE is considered. It is given from the point of view of two dimensions of the SPICE model: the purpose of the processes; the attributes of the processes (measurable characteristics necessary for managing the process and increasing the possibility of its execution). The third stage of the technology is focused on the synthesis of planning model of the subset development processes for the SPICE model, which determines the quality level of a separate component of the software development process (SDP), which in turn has a positive effect on the level of development of software systems. Assessment and planning of the possibility level of a subset of processes is implemented during a certain planning period under conditions of limited resources based on their optimal distribution, taking into account the importance of individual processes and their practices during the planning period. At the fourth stage of the technology, an algorithm for planning the development of a subset of processes of the reference maturity model SPICE is considered based on the method of sequential analysis of options. This is primarily due to the fact that the optimization model has an additive objective function. The method allows discarding those appropriate solutions that do not contain optimal solutions. In the future, when specifying the model, it is planned to choose an algorithm that belongs to this method and adapt it to the solution of the given problem. The fifth stage is devoted to information technology implementation of the developed model and algorithm. At this stage, the following set of problems is solved. Analysis of business processes of the technology of improving the quality of software development process. Definition of software requirements. Forming a diagram of use cases. Development of data models. Justification of the choice of tools for software development. Selection of reference system architecture. Next, software coding and testing. At the sixth stage, based on information technology, a number of variants of the plan for improving the quality of a subset of the processes of the SPICE maturity model are formed in order to support decision-making by the management of th","PeriodicalId":391969,"journal":{"name":"Bulletin of National Technical University \"KhPI\". Series: System Analysis, Control and Information Technologies","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123533673","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"ADAPTATION OF LAMBDAMART MODEL TO SEMI-SUPERVISED LEARNING","authors":"Klym Yamkovyi","doi":"10.20998/2079-0023.2023.01.12","DOIUrl":"https://doi.org/10.20998/2079-0023.2023.01.12","url":null,"abstract":"The problem of information searching is very common in the age of the internet and Big Data. Usually, there are huge collections of documents and only multiple percent of them are relevant. In this setup brute-force methods are useless. Search engines help to solve this problem optimally. Most engines are based on learning to rank methods, i.e. first of all algorithm produce scores for documents based on they feature and after that sorts them according to the score in an appropriate order. There are a lot of algorithms in this area, but one of the most fastest and a robust algorithm for ranking is LambdaMART. This algorithm is based on boosting and developed only for supervised learning, where each document in the collection has a rank estimated by an expert. But usually, in this area, collections contain tons of documents and their annotation requires a lot of resources like time, money, experts, etc. In this case, semi-supervised learning is a powerful approach. Semi-supervised learning is an approach to machine learning that combines a small amount of labeled data with a large amount of unlabeled data during training. Unlabeled data, when used in combination with a small quantity of labeled data, can produce significant improvement in learning accuracy. This paper is dedicated to the adaptation of LambdaMART to semi-supervised learning. The author proposes to add different weights for labeled and unlabeled data during the training procedure to achieve higher robustness and accuracy. The proposed algorithm was implemented using Python programming language and LightGBM framework that already has supervised the implementation of LambdaMART. For testing purposes, multiple datasets were used. One synthetic 2D dataset for a visual explanation of results and two real-world datasets MSLR-WEB10K by Microsoft and Yahoo LTRC.","PeriodicalId":391969,"journal":{"name":"Bulletin of National Technical University \"KhPI\". Series: System Analysis, Control and Information Technologies","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126165265","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"FORMATION OF A RECOMMENDATION SYSTEM FOR THE \"SMART REGION\" FOR THE PURPOSE OF CHOOSING INFORMATION TECHNOLOGIES AND THEIR IMPLEMENTATION WHEN CREATING APPLICATIONS","authors":"N. Kunanets, P. Fedorka, V. Kut","doi":"10.20998/2079-0023.2023.01.05","DOIUrl":"https://doi.org/10.20998/2079-0023.2023.01.05","url":null,"abstract":"An analysis of the possibility of implementing the most promising methodologies aimed at creating the infrastructure of a \"smart\" region was carried out. A detailed study of research-relevant scientific intelligence allows us to highlight the best developments. Many researchers focus only on the theoretical aspect of the issue. The authors of the article analyzed the principles of creating an information technology platform designed to facilitate the process of interaction of a resident of the region with the surrounding infrastructure. The formation of a \"smart region\" is designed to ensure active communication between representatives of various spheres of the agglomeration, i.e. local government bodies and various branches of the region’s functioning. It is the cooperation of these important life support links of the conglomeration of settlements that allows the development of a strategy aimed at improving living conditions and efficient use of resources. Today, there are already a number of successful examples of the formation of a certain basis and the laying of successful foundations for the development of \"smart regions\". It is the analysis of the best methods with the goal that becomes the basis of the application for the implementation of the \"Smart Region of Zakarpattia\" concept and the development of its own innovative information technology platform for the implementation of \"smart\" environment technologies. It is through the development of a high-quality information technology platform that the smart region is managed in order to improve the quality of services offered to citizens and make all management processes more efficient. In order to find the most optimal way of designing and meeting the community’s requirements, a recommendation system for selecting information technologies and their implementations is being developed, and as a result, we should get a balanced, optimal application model for the \"Smart Region of Transcarpathia\" information technology platform.","PeriodicalId":391969,"journal":{"name":"Bulletin of National Technical University \"KhPI\". Series: System Analysis, Control and Information Technologies","volume":"12 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114046301","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"THE CONCEPTUAL MENTAL MODEL OF EXPLANATION IN AN ARTIFICIAL INTELLIGENCE SYSTEM","authors":"S. Chalyi, I. Leshchynska","doi":"10.20998/2079-0023.2023.01.11","DOIUrl":"https://doi.org/10.20998/2079-0023.2023.01.11","url":null,"abstract":"The subject of research is the process of formation of explanations in artificial intelligence systems. To solve the problem of the opacity of decision-making in artificial intelligence systems, users should receive an explanation of the decisions made. The explanation allows you to trust these solutions and ensure their use in practice. The purpose of the work is to develop a conceptual mental model of explanation to determine the basic dependencies that determine the relationship between input data, as well as actions to obtain a result in an intelligent system, and its final solution. To achieve the goal, the following tasks are solved: structuring approaches to building mental models of explanations; construction of a conceptual mental model of explanation based on a unified representation of the user's knowledge. Conclusions. The structuring of approaches to the construction of mental models of explanations in intelligent systems has been carried out. Mental models are designed to reflect the user's perception of an explanation. Causal, statistical, semantic, and conceptual approaches to the construction of mental models of explanation are distinguished. It is shown that the conceptual model sets generalized schemes and principles regarding the process of functioning of the intellectual system. Its further detailing is carried out on the basis of a causal approach in the case of constructing an explanation for processes, a statistical approach when constructing an explanation about the result of the system's work, as well as a semantic approach when harmonizing the explanation with the user's basic knowledge. A three-level conceptual mental model of the explanation is proposed, containing levels of concepts regarding the basic principles of the functioning of the artificial intelligence system, an explanation that details this concept in an acceptable and understandable way for the user, as well as basic knowledge about the subject area, which is the basis for the formation of the explanation. In a practical aspect, the proposed model creates conditions for building and organizing a set of agreed explanations that describe the process and result of the intelligent system, considering the possibility of their perception by the user.","PeriodicalId":391969,"journal":{"name":"Bulletin of National Technical University \"KhPI\". Series: System Analysis, Control and Information Technologies","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122775011","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"АЛГОРИТМ ВИМІРЮВАННЯ ПОДІБНОСТІ МІТОК ДІЯЛЬНОСТЕЙ НА ОСНОВІ NLP У БАЗІ ДАНИХ МОДЕЛЕЙ БІЗНЕС-ПРОЦЕСІВ","authors":"Kopp Andrii, Dmytro Orlovskyi","doi":"10.20998/2079-0023.2023.01.08","DOIUrl":"https://doi.org/10.20998/2079-0023.2023.01.08","url":null,"abstract":"Business process modeling is an important part of organizational management since it enables companies to obtain insights into their operational workflows and find opportunities for development. However, evaluating and quantifying the similarity of multiple business process models can be difficult because these models frequently differ greatly in terms of structure and nomenclature. This study offers an approach that uses natural language processing techniques to evaluate the similarity of business process models in order to address this issue. The algorithm uses the activity labels given in the business process models as input to produce textual descriptions of the associated business processes. The algorithm includes various preprocessing stages to guarantee that the textual descriptions are correct and consistent. First, single words are retrieved and transformed to lower case from the resulting textual descriptions. After that, all non-alphabetic and stop words are removed from the retrieved words. The remaining words are then stemmed, which includes reducing them to their base form. The algorithm evaluates the similarity of distinct business process models using similarity measures, including Jaccard, Sorensen – Dice, overlap, and simple matching coefficients, after the textual descriptions have been prepared and preprocessed. These metrics provide a more detailed understanding of the similarities and differences across various business process models, which can then be used to influence decision-making and business process improvement initiatives. The software implementation of the proposed algorithm demonstrates its usage for similarity measurement in a database of business process models. Experiments show that the developed algorithm is 31% faster than a search based on the SQL LIKE clause and allows finding 18% more similar models in the business process model database.","PeriodicalId":391969,"journal":{"name":"Bulletin of National Technical University \"KhPI\". Series: System Analysis, Control and Information Technologies","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128563364","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"SIMULATION AND ANALYSIS OF ENCODERS OF INTERFERENCE-RESISTANT CASCADE CODES FOR DYNAMIC SYSTEMS","authors":"O. Nikulina, Valerii Severyn, Vladyslav Sharov","doi":"10.20998/2079-0023.2023.01.10","DOIUrl":"https://doi.org/10.20998/2079-0023.2023.01.10","url":null,"abstract":"For various channels of information transmission that can be used in local control systems of a wide range of processes, affordable, scalable, and inexpensive transmission methods are needed that allow the necessary information to be transmitted reliably without errors. Errors that occur in discrete, continuous communication channels are the main obstacle to the reliability of transmitted data. The main causes of errors are signal attenuation, noise and various interferences. As a result of the analysis of error statistics in discrete data transmission channels, it was concluded that single and double errors occur in the absolute majority of cases. It is proposed to combat errors by using tamper-resistant coding. Among the interference-resistant codes, redundant block-separated systematic codes are highlighted, among which is the Hamming code. The basis of the interference-resistant coding model is proposed to be the use of a systematic Hamming code followed by cascade coding by adding a parity check bit. The used model made it possible to deal with all the most likely cases of errors. Since this coding model must be flexibly used in different systems, a necessary criterion of the model is its universality. Therefore, the model was tested on a sample with code combinations of different numbers of bits. The purpose of this article is to analyze the dependence of the coding procedure execution time for encoders of different levels: a separate first-stage encoder, as well as a first-stage encoder with the addition of a second-stage encoder. Experiments were conducted with a large sample, which were subsequently analyzed and interpreted. Since the model proved to be flexible, simple, stable and effective as a result of experiments, and the process of combating interference by using cascade codes has proven itself well in world practice, it is recommended for use in various information management systems. The implementation of the coder for interference-resistant data transmission is given.","PeriodicalId":391969,"journal":{"name":"Bulletin of National Technical University \"KhPI\". Series: System Analysis, Control and Information Technologies","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123616575","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"GEOMETRIC MODELING: TRACKS AND FLOWS","authors":"A. Levterov, Hanna Pliekhova, Maryna Kostikova, A. Okun","doi":"10.20998/2079-0023.2023.01.09","DOIUrl":"https://doi.org/10.20998/2079-0023.2023.01.09","url":null,"abstract":"Mathematical models to solve optimization connection problems in nonsimply connected regions under typical technological restrictions on geometric and topological parameters of routes, first of all, on curvature and the number of bends, have been investigated and developed. The models are linked with the extant and prospective topogeodesic models of the territory polygonal images. The solution of connection problems involves search for optimum trajectories of routes and nets within unrestricted geometric shape areas. It needs the development of a plethora of general models as fields where connections are carried out. The connections can be of various types such as bendy, Manhattan, even, solid as well as routes of other types. Smeliakov and Pliekhova observe that the global and local regulation of geometric connections to solve connection problems can be presented as the general optimization connection problem that is defined as the problem of the choice of с, where W is a set of alternatives, R is a principle of optimality. In so doing, the set W can be presented as the totality of the phase space f and the restrictions Q that are applied to the parameters of the phase space f. In turn, it is expedient to imagine that the phase space f is the Cartesian product f = X*Y*Z*U of the output data X, disturbances Y, control parameters U and results Z. The analysis of problem indicates that first and foremost the effectiveness of the modelling of the phase space f is linked with the description of the output data X on the area F and space L of possible highways in F. This research is devoted to the solution of the problem to develop a model for connection tasks within the framework of geometric design.","PeriodicalId":391969,"journal":{"name":"Bulletin of National Technical University \"KhPI\". Series: System Analysis, Control and Information Technologies","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128199471","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"PARSIMONIOUS MACHINE LEARNING MODELS IN REQUIREMENTS ELICITATION TECHNIQUES SELECTION","authors":"Olga Solovei, Denys Gobov","doi":"10.20998/2079-0023.2023.01.13","DOIUrl":"https://doi.org/10.20998/2079-0023.2023.01.13","url":null,"abstract":"The subject of research in the article is machine learning algorithms used for requirement elicitation technique selection. The goal of the work is to build effective parsimonious machine learning models to predict the using particular elicitation techniques in IT projects that allow using as few predictor variables as possible without a significant deterioration in the prediction quality. The following tasks are solved in the article: design an algorithm to build parsimonious machine learning candidate models for requirement elicitation technique selection based on gathered information on practitioners' experience, assess parsimonious machine learning model accuracy, and design an algorithm for the best candidate model selection. The following methods are used: algorithm theory, statistics theory, sampling techniques, data modeling theory, and science experiments. The following results were obtained: 1) parsimonious machine learning candidate models were built for the requirement elicitation technique selection. They included less number of features that helps in the future to avoid overfitting problems associated with the best-fit models; 2) according to the proposed algorithm for best candidate selection – a single parsimonious model with satisfied performance was chosen. Conclusion: An algorithm is proposed to build parsimonious candidate models for requirement elicitation technique selection that avoids the overfitting problem. The algorithm for the best candidate model selection identifies when a parsimonious model's performance is degraded and decides on the suitable model's selection. Both proposed algorithms were successfully tested with four datasets and can be proposed for their extensions to others.","PeriodicalId":391969,"journal":{"name":"Bulletin of National Technical University \"KhPI\". Series: System Analysis, Control and Information Technologies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131247500","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"ELECTRON BEAMS IN THE GRADIENT MAGNETIC FIELD: CONTROL FOR CONVERTING LONGITUDINAL MOTION INTO TRANSVERSAL","authors":"O. Mazmanishvili, M.G. Reshetnyak, Ganna Sydorenko","doi":"10.20998/2079-0023.2023.01.04","DOIUrl":"https://doi.org/10.20998/2079-0023.2023.01.04","url":null,"abstract":"The motion of electrons in a cylindrical magnetic field with the gradient-type potential is considered. The motion of electrons in the cylindrical magnetic field with the gradient-type potential is considered. It is found that in the selected field, the initial motion of electrons along the longitudinal axis is converted into motion along the radius. It is determined that such the transformation is due to the action of a solenoidal magnetic field with large longitudinal gradient. The transformation of the longitudinal direction of motion into the transverse one turned out to be stable in the energy range of 20...55 keV of electrons and in the range of 5...50 mm of radial dimensions of the particle beam. The main dependences of the motion of the electron beam in the given solenoidal magnetic field are studied with the help of the software tool. The results of numerical simulation of electron trajectories in the gradient magnetic field with the circular secondary emission cathode located in the middle of the system are presented. To study the mechanism of stability with respect to magnetic field, two experimentally realized magnetic fields were used. Based on these two fields, arrays of additional 4 fields are numerically synthesized. For the set of 6 named fields, the operation of the gun, in which the particle undergoes the stable transformation of the direction of motion, is numerically studied. It is shown that for the given electron energy and the fixed magnetic field, the parameter that determines the rotation of the particles is the magnetic field gradient at the boundary of the entry region. It is found that the rotation effect takes place for the considered range of radial beam sizes, which leads to particle focusing. The possibility is shown to control the vertical coordinate of the focused beam on the basis of the field adjustment, thereby giving the interpretation of the pore dependence of the registration of electrons on the detector. The dependence of the formation of the final distribution of particles on the amplitude and gradient of the magnetic field along the axis of the system is studied. The results of numerical simulation on the motion of the electron beam are presented. Based on the model of electron flow motion, the characteristics of the resulting electron beam are considered. It is shown that the beam, having radial dimensions of 5...50 mm, is transformed and focused vertically on the area of 1 mm.","PeriodicalId":391969,"journal":{"name":"Bulletin of National Technical University \"KhPI\". Series: System Analysis, Control and Information Technologies","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125470563","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"EFFICIENCY SUBSTANTIATION FOR A SYNTHETICAL METHOD OF CONSTRUCTING A MULTIVARIATE POLYNOMIAL REGRESSION GIVEN BY A REDUNDANT REPRESENTATION","authors":"Alexander Pavlov, Maxim Holovchenko, Valeriia Drozd","doi":"10.20998/2079-0023.2023.01.01","DOIUrl":"https://doi.org/10.20998/2079-0023.2023.01.01","url":null,"abstract":"In recent years, the authors in their publications have developed two different approaches to the construction of a multivariate polynomial (in particular, linear) regressions given by a redundant representation. The first approach allowed us to reduce estimation of coefficients for nonlinear terms of a multivariate polynomial regression to construction of a sequence of univariate polynomial regressions and solution of corresponding nondegenerate systems of linear equations. The second approach was implemented using an example of a multivariate linear regression given by a redundant representation and led to the creation of a method the authors called a modified group method of data handling (GMDH), as it is a modification of the well-known heuristic self-organization method of GMDH (the author of GMDH is an Academician of the National Academy of Sciences of Ukraine O. G. Ivakhnenko). The modification takes into account that giving a multivariate linear regression by redundant representation allows for construction of a set of partial representations, one of which has the structure of the desired regression, to use not a multilevel selection algorithm, but an efficient algorithm for splitting the coefficients of the multivariate linear regression into two classes. As in the classic GMDH, the solution is found using a test sequence of data. This method is easily extended to the case of a multivariate polynomial regression since the unknown coefficients appear in the multivariate polynomial regression in a linear way. Each of the two approaches has its advantages and disadvantages. The obvious next step is to combine both approaches into one. This has led to the creation of a synthetic method that implements the advantages of both approaches, partially compensating for their disadvantages. This paper presents the aggregated algorithmic structure of the synthetic method, the theoretical properties of partial cases and, as a result, the justification of its overall efficiency.","PeriodicalId":391969,"journal":{"name":"Bulletin of National Technical University \"KhPI\". Series: System Analysis, Control and Information Technologies","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115427717","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}