<?xml version="1.0" encoding="UTF-8"?>
<TEI xml:space="preserve" xmlns="http://www.tei-c.org/ns/1.0" 
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" 
xsi:schemaLocation="http://www.tei-c.org/ns/1.0 https://raw.githubusercontent.com/kermitt2/grobid/master/grobid-home/schemas/xsd/Grobid.xsd"
 xmlns:xlink="http://www.w3.org/1999/xlink">
	<teiHeader xml:lang="en">
		<fileDesc>
			<titleStmt>
				<title level="a" type="main">A Distributed Classification Method for Real-time Healthcare Data Processing</title>
			</titleStmt>
			<publicationStmt>
				<publisher/>
				<availability status="unknown"><licence/></availability>
			</publicationStmt>
			<sourceDesc>
				<biblStruct>
					<analytic>
						<author>
							<persName><forename type="first">Vladislav</forename><surname>Kaverinskiy</surname></persName>
							<affiliation key="aff0">
								<orgName type="department">I.M. Frantsevich Institute for Problems of Material Sciences</orgName>
								<orgName type="institution">National Academy of Sciences of Ukraine</orgName>
								<address>
									<addrLine>3 Krzhizhanovsky str</addrLine>
									<postCode>03142</postCode>
									<settlement>Kyiv</settlement>
									<country key="UA">Ukraine</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Oleksandr</forename><surname>Palagin</surname></persName>
							<email>palagin_a@ukr.net</email>
							<affiliation key="aff1">
								<orgName type="department">Glushkov Institute of Cybernetics</orgName>
								<orgName type="institution">National Academy of Sciences of Ukraine</orgName>
								<address>
									<addrLine>40 Glushkov ave</addrLine>
									<postCode>03187</postCode>
									<settlement>Kyiv</settlement>
									<country key="UA">Ukraine</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Kyrylo</forename><surname>Malakhov</surname></persName>
							<email>k.malakhov@outlook.com</email>
							<affiliation key="aff1">
								<orgName type="department">Glushkov Institute of Cybernetics</orgName>
								<orgName type="institution">National Academy of Sciences of Ukraine</orgName>
								<address>
									<addrLine>40 Glushkov ave</addrLine>
									<postCode>03187</postCode>
									<settlement>Kyiv</settlement>
									<country key="UA">Ukraine</country>
								</address>
							</affiliation>
						</author>
						<author>
							<affiliation key="aff2">
								<address>
									<postCode>2024</postCode>
									<settlement>Cambridge</settlement>
									<region>MA</region>
									<country key="US">USA</country>
								</address>
							</affiliation>
						</author>
						<title level="a" type="main">A Distributed Classification Method for Real-time Healthcare Data Processing</title>
					</analytic>
					<monogr>
						<idno type="ISSN">1613-0073</idno>
					</monogr>
					<idno type="MD5">827E23A4E2C3CDC4BAC87F6DD98ED6F6</idno>
				</biblStruct>
			</sourceDesc>
		</fileDesc>
		<encodingDesc>
			<appInfo>
				<application version="0.7.2" ident="GROBID" when="2025-04-23T19:12+0000">
					<desc>GROBID - A machine learning software for extracting information from scholarly documents</desc>
					<ref target="https://github.com/kermitt2/grobid"/>
				</application>
			</appInfo>
		</encodingDesc>
		<profileDesc>
			<textClass>
				<keywords>
					<term>Classification</term>
					<term>Machine Learning</term>
					<term>Distributed Classification Method</term>
					<term>Data Science</term>
					<term>Random Forest</term>
				</keywords>
			</textClass>
			<abstract>
<div xmlns="http://www.tei-c.org/ns/1.0"><p>A complex classifier based on the Random Forest approach is developed. The main essence of the classifier is that it consists of several (in the current realization 4) binary classifier modules; each is trained to distinguish its class separation. A truth table has been developed which allows basing on the binary classifiers results to reach more precise and fine classification into a larger number of classes (5 in the current realization). The developed classification service has been trained and tested using a medical data set obtained at the Ternopil Regional Clinical Psychoneurological Hospital and matches the patients' depression level estimation with arterial pulsations oscillograms analysis data. The developed classifier exhibits a high accuracy range (up to 97%) in distinguishing all 5 levels. SHAP testing of the input factors' significance has been performed on the test data sample. Also were studied in classes' confusion and benchmarks for sequential and parallel classification modules performance. 1</p></div>
			</abstract>
		</profileDesc>
	</teiHeader>
	<text xml:lang="en">
		<body>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1.">Introduction</head><p>Classification AI systems have become a cornerstone in various fields such as medical diagnosis, finance, and natural language processing. These systems are designed to categorize data into predefined classes, enabling automated decision-making and pattern recognition. The effectiveness of classification systems largely depends on the algorithms used, with several notable approaches including support vector machines (SVMs), neural networks, and decision tree-based methods.</p><p>One of the most popular and powerful classification methods is the Random Forest algorithm. Introduced by Leo Breiman in 2001 <ref type="bibr" target="#b0">[1]</ref>, the Random Forest approach is an ensemble learning technique that builds multiple decision trees during training and outputs the mode of the classes for classification tasks or the mean prediction for regression tasks. This method combines the simplicity of decision trees with the power of ensemble learning, making it robust and versatile.</p><p>The Random Forest algorithm creates a 'forest' of decision trees, each trained on a random subset of the data. This random selection process, known as bootstrapping, and the randomness introduced in the selection of features for each split, help in reducing overfitting -a common problem with individual decision trees. By aggregating the predictions of multiple trees, Random Forests improve generalization and accuracy.</p><p>Numerous studies have demonstrated the efficacy of Random Forests in various domains. For instance, in the medical field, Random Forests have been used to classify and predict disease outcomes based on patient data <ref type="bibr" target="#b1">[2]</ref>. In finance, they are employed for credit scoring and fraud detection <ref type="bibr" target="#b2">[3]</ref>. Furthermore, environmental scientists use Random Forests for ecological and climate modelling due to their ability to handle complex interactions between variables <ref type="bibr" target="#b3">[4]</ref>.</p><p>Recent advancements have further enhanced the capabilities of Random Forests. Techniques such as the implementation of extremely randomized trees <ref type="bibr" target="#b4">[5]</ref> and the integration with deep learning methods are areas of active research. These advancements aim to combine the strengths of Random Forests with other powerful techniques to tackle increasingly complex datasets and tasks.</p><p>As mentioned, AI classification systems are widely used for medical purposes. A medical dataset was used to train and test the developed in the current study system. Nevertheless, the approach presented here is not limited to the medical tasks and the investigated subject area but could be applied to various scopes, especially those that have to operate with datasets with a wide number of features and a comparably limited number of data rows. Below we will give a brief description of the subject we focused on and the dataset we have operated with.</p><p>Measuring blood pressure is a crucial procedure for doctors at all stages of medical care <ref type="bibr" target="#b5">[6,</ref><ref type="bibr" target="#b6">7]</ref>. The advent of electronic blood pressure meters has enhanced the process by providing more detailed and informative data. Some advanced models of electronic pulse meters can register arterial pulsations, allowing them to calculate blood pressure values and transmit this information for further analysis <ref type="bibr" target="#b7">[8,</ref><ref type="bibr" target="#b8">9]</ref>. These readings contain valuable information that offers deeper insights into the overall state of the body and its systems <ref type="bibr" target="#b5">[6,</ref><ref type="bibr" target="#b9">10,</ref><ref type="bibr" target="#b10">11,</ref><ref type="bibr" target="#b11">12]</ref>.</p><p>In the analysis process, arterial oscillograms are created from the blood pressure curve for further examination. The practical application of arterial oscillography opens up significant opportunities for researchers and clinicians. It enables the use of machine learning methods to develop automated diagnostic AI systems that can assess a patient's condition based on objective measurement results.</p><p>This particular research focuses on creating a classifier capable of estimating the level of depression. Unlike patient surveys, which can be biased or outdated, this classifier would use blood pressure oscillograms as indicators of the body's condition. These oscillograms can serve as markers for various health states, providing a more objective and reliable basis for diagnosis.</p><p>Thus, the main objective of the presented study is to develop and test an AI classification system capable of dealing with datasets with a wide number of features and a comparably limited number of data rows and accurately distinguishing all the given classes. To solve the problem the following tasks are to be fulfilled: to find the most valuable features; to train and tune hyperparameters of the classifiers to increase accuracy; to test the developed classifier and find its peculiarities in classes mismatch and the features' significance according to the SHAP test.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.">Initial Dataset Characterization and Numerical Research Procedure</head><p>Patients aged 32 -65 with mental disorders were treated at Ternopil Regional Clinical Psychoneurological Hospital. Their mental and psychotic disorders were assessed using the Hospital Depression Rating Scale (HDRS) and the DASS-21 depression, anxiety, and stress scale. Diagnoses included bipolar affective disorder with a current episode of depression and depressive disorders without psychotic features.</p><p>Due to the high number of input parameters (1030 factors) and a relatively small dataset (181 patients), the parameters were analyzed separately to avoid distorted results. The patients were divided into five groups based on their initial depression levels. Groups 1 to 4 were formed based on questionnaire results, with increasing depression levels. Group 5 included patients undergoing treatment in the hospital.</p><p>Several studies aimed at telerehabilitation and informational medical rehabilitation support have been carried out in the V. M. Glushkov Institute of Cybernetics of NAS of Ukraine, which have resulted in a cloud telerehabilitation platform creation <ref type="bibr" target="#b12">[13,</ref><ref type="bibr" target="#b13">14,</ref><ref type="bibr" target="#b14">15,</ref><ref type="bibr" target="#b15">16]</ref>. The current study is a continuation of the efforts in the mentioned fields that could provide there a classification service for medical purposes.</p><p>To initial analyze the dataset the "Lazy Predict" technique from Scikit Learn was used. This method automatically learns several classifiers and ranks them by accuracy. The dataset had over a thousand parameters but only 181 data rows, many of which were inter-correlated. Thus, selecting key parameters was crucial for building a reliable classifier.</p><p>Not all features within the selected group were valuable for classification. Practical experience showed that using raw data did not yield a satisfactory classifier. Hence, feature correlations within each class were considered. Some features showed strong correlations in specific classes, serving as distinguishing factors.</p><p>To improve classification accuracy, input parameters were selected based on a combination of features and their value products, focusing on correlated patterns across classes. Additional effective features were identified through a systematic search methodology, aiming to enhance accuracy. This process involved adding new features from correlated pairs, retraining the classifier by the "Lazy Predict" technique, and selecting features that improved accuracy.</p><p>In the final stage, various classification options were explored using the selected features, developing a complex classifier capable of distinguishing different class groups and detecting multiple classes within the dataset. In this stage not only the best classifiers by the "Lazy Predict" ranging were tested but also ones that have somewhat lower positions, because due to the hyperparameters tuning, they may exhibit even more accuracy values. All the trained classifier objects were made to distinguish two classes (being binary) each of those may include one or several of the a priori classes. Then a truth table has been formed to define the classifier object results combination as belonging of the patient to one of the a priori classes with the corresponding additional remarks if necessary. The truth table in JSON formalized condition becomes a part of the automatic classification service.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.">Results and Discussion</head></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.1.">Input Parameters Selection</head><p>From the vast number of given in the data set parameters, ULF ones were selected to be the base. ULF is the power of ultra-low-frequency (ultra-slow) oscillations (with a frequency of less than 0.003 Hz.); the functional value of ULF waves consists in the integration and adaptation of the functional state of the organism to the influence of external factors; coordinates the functional activity of all body systems following changes in the external environment. According to the UMAP analysis, ULF factors could quite accurately split the patients into 2 groups: 1 -classes 1 and 2 (lighter levels of depression); 2 -classes 3, 4 and 5 (more serious depression cases). Those two groups then have been chosen for the initial classification fitting through the "Lazy Predict" technique.</p><p>A cauterization on reduced dimensions using UMAP also has shown that 11 patients form a completely separated cluster. Among them were ones of each of the a priori classes. Because they do not match the found main classes' separation they have been excluded from the training dataset. It has been found that the patients from that small cluster have some particular feature values, namely: zero values of ULF_100-70 and ULF_per_100-70 along with high values of ULF_70-100 (&gt; 2000) and ULF_70-end (&gt;300). This observation has formed the basis of the filter which does not regard the input data for the further classification process if they match the named conditions.</p><p>Direct usage of the ULF factors values (even normalized), however, did not allow to reach high classification accuracy. A particular essence of the initial features selection technique accepted in this study is finding the feature pairs which have a strong correlation for one of the classes but are weak in another or those that are correlated in both classes but with different singe of the correlation coefficient. The products of such correlated features were used along with the direct feature values to be in the set for the subsequent selection of the classifier.</p><p>The scheme of the feature selection is presented in Figure <ref type="figure" target="#fig_0">1</ref>. Features from the formed initial set (including the mentioned correlated pairs products) are being added to the model. The feature that provides the biggest accuracy is added to the model and removed from the consideration list. Then the cycle repeats until either there are no features left in the list or adding each of the remained features does not give any improvement to the model's accuracy. According to the analysis, 2 separate features from the ULF parameters and 12 their products have been selected for the model.</p><p>The given set of features increased the classifier's accuracy on the test data to ~0.78. However, for practical use, higher accuracy is desirable. To achieve this, more parameters were added to the model, specifically products of the ULF factors with other features. Additional experiments were conducted, sequentially adding products of ULF factors with other features to the model, and selecting combinations that most significantly increased the model's accuracy. As a result, 11 feature products have been added to the model.</p><p>This supplementation increased the model's accuracy to 0.95 on the test data. The best accuracy using the "Lazy Predict" technique was achieved by KNeighborsClassifier, but RandomForestClassifier also performed well. The obtained accuracy is suitable for developing a production classification service. However, it would be more desirable to make a classifier which can distinguish all 5 classes, but not 2 like this does. Taking into account quite a small dataset it was assumed to develop several binary classifiers each of which could distinguish different classes separation and grounding on their results to make a classification decision.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.2.">Development of a Distributed Classifier</head><p>Despite KNeighborsClassifier being found to show the best accuracy according to the "Lazy Predict" when classes grouping by the system classes 1 and 2 -group 1, classes 3, 4, and 5 -group 2, tuning of the hyperparameters showed that the Random Forest classifier could exhibit even bigger accuracy in this case -up to 0.97. Furthermore, it can provide rather better accuracy for other classes grouping cases. In Table <ref type="table">1</ref>, the values of the classifier hyperparameters provide the best-found accuracy for tasks of certain class groups distinguishing. For the hyperparameters (N estimators, Max depth, and Min samples split) and values optimization, the Powel method was used and implemented in SciPy. For the classifier that is trained to distinguish Class 5 (clinical cases) from all the others the Decision Tree classifier was used instead of the Random Forest. For the case, it can provide excellent accuracy being a relatively lighter type of model.</p><p>Each of the classifiers can return two values (class 1 or class 2) according to the way it was trained. All the possible classifier results combinations have been gathered in a table to analyze the meaning of all the possible options. Such a truth table is presented in Table <ref type="table" target="#tab_0">2</ref>.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Table 1 Classifiers hyper parameters value and achieved accuracy</head><p>The provided interpretations include possible controversial cases of the classifier's results. If the resulting combination is (1, 2, 1, 1) it means that the result of Classifier 2 contradicts the one of Classifier 1. Classifier 1 says that this is a light depression level (Class 1) but Classifier 2 says that this may be classes 3, 4 or 5 (harder levels). Classifier 3 does not contradict Classifier 2 -by their results combination this is probably Class 3. Classifier 4 also does not contradict any other, it merely says that this is not Class 5. So this case might be considered as Class 3, but taking into account the result of Classifier 1, which insists that it is a light case, we probably may say of a palliated Class 3.</p><p>The next controversial combination is (1, 1, 2, 1). In this case according to the Classifiers 1 and 2 results this may be Class 1 (light depression). However, the Classifiers 3 and 4 results give the Class 4 (severe depression). Because Classifier 4 insists that this is just not Class 5 (a clinical case) but might be also Class 1, as Classifiers 1 and 2 say, this case probably could be considered as Class 1 (but probably somewhat burdened).</p><p>The next case is the results combination (2, 1, 2, 1). Here Classifier 2 contradicts Classifier 3. The Classifiers' 1 and 2 results say that this is Class 2 but Classifier 3 insists that this is a much harder case -Class 4 (not 5 due to the Classifier 4). Thus, it may be Class 2 but burdened.</p><p>Such a combination as (1, 2, 2, 1) means that the Classifiers 2, 3, and 4 responses result in Class 4 (a severe case). However, Classifier 1 in this case insists on Class 1 (light depression). Therefore, this may be treated as Class 4 but somewhat palliated.</p><p>In any case, if Classifier 4 provides value 2 due to its high reliability such situations are to be considered as Class 5 (a clinical case). However, we could additionally provide a range of such cases, but the practical tests have shown that in all the regarded situations other classifiers return the value 2 -combination (2, 2, 2, 2 The possible results combinations along with the corresponding interpretations have been organized as a JSON structure used by the developed classification service for the final results provided. For the numerical estimations the controversial cases have been treated as +0. <ref type="bibr" target="#b24">25</ref> to the base obtained level for the burdened cases and as -0.25 for the palliated ones.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.3.">Architecture and Working Principles of the Distributed Classifier</head><p>The structure of the developed classification service is given in Figure <ref type="figure" target="#fig_1">2</ref>. Input messages through the API service come to the initial data filter. It checks if the input massage body has all the necessary fields, are the features values in the allowed range and whether the ULF_100-70, ULF_per_100-70, ULF_70-100, and ULF_70-end are fit the mentioned above restrictions (ULF_100-70 and ULF_per_100-70 must be not zero and in the case if ULF_70-100 &gt; 2000 and ULF_per_100-70 &gt; 300). If the input message has some extra fields they will be merely ignored. If there is a lack of some fields or the values are not sufficient the appropriate message will be returned without any subsequent classification procedures involved. Also, this component of the system orders the input features, received in the form of a dictionary, according to the given input structure which matches the order of the parameters as it was when the classifiers were training. This order is stored in a special file.  The structure of the income with a POST request input JSON massage is as follows: {"passwoed": "passwoed text row", "values": { "ULF_total": a float value from 1.25 to 39.7, "ULF_20": a float value from 0.001 to 460.7, "ULF_20-70": a float value from 0 to 1381.2, "ULF_70-100": a float value from 2.2 to 37357.5, "ULF_100-70": a float value from 0 to 2988.4, "ULF_70-end": a float value from 0 to 6855.3, "ULF_per_total": a float value from 2.24 to 16.5, "ULF_per_20": a float value from 0.001 to 5.2, "ULF_per_20-70": a float value from 0 to 10.3, "ULF_per_70-100": a float value from 0.034 to 13.4, "ULF_per_100-70": a float value from 0 to 16.0, "ULF_per_70-end": a float value from 0 to 14.2, "systola_2": a float value from 96 to 217, "O_IVR_neg": a float value from 11.2 to 254.5, "O_L2_pos": a float value from 24.9 to 1712.3, "Hurst_20-70": a float value from 0 to 0.94, "O_Mo_neg": a float value from 0.5 to 1.3, "V": a float value from 3.68 to 37.6, "HFx18x21_20": a float value from 0.32 to 99.5, "HF_70-100_int_p": a float value from 0 to 29574.7, "S_Hil_25_60Hz_total": a float value from 0.4 to 21.1, "S_Hil_HFx13x15_20": a float value from 0.006 to 13.5, "S_Hil_HFx15x18_20": ": a float value from 0.004 to 13.2 }} It includes a password field to protect the service from illegal usage. The password is kept in the system in an encrypted form. The main input information is to be given in the "values" section. It is a dictionary of the feature names and values which should be float values in the given ranges. The values' allowed ranges are determined by the corresponding values ranges in the training dataset and are stored in the form of JSON in a file. These files are generated automatically when the models are training.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Classifier results combinations</head></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Result interpretation</head><p>If the input data are satisfactory they are transformed into a Pandas data frame and normalized using the stored minimum and maximum values that come to the classification processor. It runs the previously trained classifiers on the given input data. A possibility is provided to run the classifier's execution subsequently or in parallel. The obtained results are compared with the stored interpretations. Then a resulting message is to be formed and returned through the API. The normal output message has the following JSON structure: { "class_code": "number of the estimated depression level class (from 0 to 4)", "prob": 1 if the result reliable, 0 if the result not reliable, "result": "verbose description of the result" } The value of the "class_code" field is a string. It will be supplemented with a "-" sign (for example "2-") if the case has been interpreted as a palliated one or "+" if it has been regarded as a burdened one. The "prob" will have a 0 value if the classifiers disagree as was denoted in Table <ref type="table" target="#tab_0">2</ref>. In other cases, it will be 1. The "result" field contains a verbose description of the classification result, for example, "Serious depression level (3 from 4). Not clinical.". Here the levels are counted from 1 to 4, and 5 is for the clinical cases.</p><p>For the abnormal situations the format of the output messages is different.</p><p>-for wrong password: { "error": "wrong password", "message": "access denied" } -for software error occurrence: { "error": "the error message", "message": "an error occurred during the message handling" } -for wrong input data format: { "result": "atypical input data", "reasons": ["list of explanations regarding the input inconsistence"] } Such massages could help to understand easily if something wrong is with the input or the system performance and what exactly is to be corrected.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.4.">Testing and the results analysis of the developed classification system</head><p>The resulting accuracy of the developed distributed classification system in distinguishing all 5 classes according to the final test on a test sample is obtained at ~0.92. However, the mismatching is different for certain classes. We can't split the results into positive and negative because the classifier is not binary. Nevertheless, we can consider how the classes could be mismatched. Plots in Figure <ref type="figure" target="#fig_2">3</ref>   </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Estimated class</head><p>As we can observe, the mismatching is different for the estimated classes. Except the Class 1 (light depression) the system does not tend to overestimate the depression level. But Class 1 in rare cases may be mismatched with some a harder depression Class 2. However, it also might be addressed to the priory estimation, which could be rather subjective. Nevertheless, it has never been mismatched with the more severe cases in the testing. The Class 2 has always been determined precisely. Class 3 in some cases might be mismatched with the neighboring less severe Class 2. Most of the mismatches have appeared for class 4, which has a smaller number of members. It rather often could be mismatched with less severe classes 2 and 3, but not with 1 or 5. The determination of the Class 5 (clinical cases) seems to be precise.</p><p>Actually, in this case, we can't treat results as true negative ones, because it just does not make sense. Nevertheless, as the true positive results we can accept the cases when the estimated class matches the a priori one. If the classifier overestimates the depression level, such a result may be considered a false positive, and if it underestimates the depression level we will treat the result as a false negative one. Therefore, we may say that we have true negative results number TN = 0. Thus, we can calculate the formal criteria. The confusion matrix made on the whole dataset for the considered case is given in Table <ref type="table" target="#tab_2">3</ref>.</p><p>According to the obtained results the values of the formal criteria will be as follows: Accuracy = 0.9172 Recall = 0.9341 Precision = 0.9811 * -we unable to consider any result as a true negative for the given case Thereby, we can see that the developed classifier has quite a high precision metric, but a lower recall value. That means that the estimated depression level is probably not lower than it is. However, the obtained evidence of a low depression level is not so reliable. According to the results for Class 4, where 37.5 estimations appear wrong, the model is rather poor in high depression level diagnostic. That is probably caused by a small sample number for this class (10 patients only). Also, we may not discount the possibility of exaggeration of a real depression level in some cases when the dataset was being formed.</p><p>The performance benchmark tests of the classification system have been carried out using the following hardware:</p><p>HP Probook 445 G7 6 cores CPU -AMD Ryzen 5 4500U with Radeon Graphics 32.0 Gb RAM The tests have been performed for both options of subsequent and parallel classifiers running. The time gap has been measured from the prepared data sent for the classification and the notinterpreted result obtained. The obtained average numbers are as follows:</p><p>-for subsequent executions: 0.1042 seconds -for parallel executions: 0.1123 seconds Thus, we can note that in this case running the classifiers in parallel does not make any profit in the performance, moreover, this even slows down the process.  It is worth noting that ULF_70-100, which has been found the most valuable according to the SHAP test, is included in the model as separate parameters, not only as products. That additionally proves their importance for the classification purpose. However, another separate parameter ULF_per_70-100 has rather a mediocre impact.</p><p>The proposed classification method demonstrates significant scalability, versatility, and adaptability, making it a valuable tool in modern healthcare. The method's distributed architecture allows for parallel processing and load balancing, enabling it to handle large datasets and complex classification tasks efficiently. The system's modular design further supports scalability by allowing the easy addition of new classifiers and incremental training, which is particularly advantageous in dynamic medical environments where data and conditions evolve over time.</p><p>In terms of integration into existing healthcare systems, the classifier can enhance clinical workflows by automating data analysis and providing real-time assessments. This is particularly beneficial in telemedicine platforms, where remote monitoring and diagnosis are critical. The classifier's ability to integrate seamlessly with Electronic Health Record systems also supports the automation of alerts and decision support, reducing the diagnostic workload on healthcare professionals and improving the accuracy of patient assessments. Moreover, the method's generalizability allows it to be adapted to various medical domains beyond the initial application to blood pressure oscillograms. The classifier can be extended to analyze cardiovascular, respiratory, neurological, and other types of medical data, as well as manage chronic conditions like diabetes and cancer. This flexibility makes it a promising tool for personalized medicine, where treatments can be tailored to individual patient needs based on detailed classifications.</p><p>Also, it could be noticed, that reusing software development artifacts, such as modules of the proposed here classification system, especially through a domain engineering approach with semantic analysis, is crucial for enhancing the effectiveness of software lifecycle processes. This approach, as analyzed in case studies, provides valuable insights and recommendations, particularly in the context of information defense systems <ref type="bibr">[17 -22]</ref>.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.">Conclusions</head><p>A classification service was developed, whose main peculiarity is the usage of several binary classification components each of them trained to distinguish its class separation. Grounding on the obtained results combination it is possible to determine several classes using for the model training a relatively small dataset. Another essence of the developed classification approach is usage only separate input feature values, but also products of the feature values whose correlation is significant for a particular data group only, but insignificant or has a different sign for the others. The developed technique has been implemented on the example of the medical dataset on blood pressure oscillograms as indicators of the body's condition, which have been matched with the depression levels.</p><p>Despite quite a small dataset the testing results have showed rather high metric values: Accuracy = 0.9172, Recall = 0.9341, and Precision = 0.9811. Thus the developed classification service has a high Precision value, but Recall is relatively lower. That is because it is more likely to tend to underestimate the depression level than to overestimate it. Thus, grounding on the obtained classification results we can assert that the depression level with a rather high probability is not lower than the received value. The most mismatched has appeared the Class 4 which had a very small data sample addressed to it.</p><p>According to the SHAP test, the most valuable for the classification are the following features: ULF_70-100, ULF_per_100-70, O_L2_pos, ULF_100-70, ULF_per_total. Most of them relay to the ULF group -the power of ultra-low-frequency (ultra-slow) oscillations (with a frequency of less than 0.003 Hz.)</p></div><figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_0"><head>Figure 1 :</head><label>1</label><figDesc>Figure 1: Model's features selection scheme.</figDesc><graphic coords="4,196.45,132.52,224.35,280.45" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_1"><head>Figure 2 :</head><label>2</label><figDesc>Figure 2: The structure of the developed classification service.</figDesc><graphic coords="7,77.75,63.55,413.60,178.35" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_2"><head>Figure 3 :</head><label>3</label><figDesc>demonstrate such observed mismatch patterns. For the estimated as-burdened values 0.25 was added to the class value and for the palliated 0.25 was subtracted. a) b) The classes mismatching test results: a) certain values; b) average values.</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_4"><head>For a better</head><label></label><figDesc>understanding of the selected features' role in the classification results a SHAP test has been carried out on a test 20 % sample. The main test results are shown in a diagram in Figure4.The obtained results show that the 5 most valuable input features are: HF_70-100_int_p and Hurst_20-70 has been found rather insignificant.</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_5"><head>Figure 4 :</head><label>4</label><figDesc>Figure 4: SHAP test results on the features impact to the classification</figDesc><graphic coords="10,142.03,202.21,333.20,202.60" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_0"><head>Table 2 A</head><label>2</label><figDesc>). truth table for the classifiers possible results combinations</figDesc><table><row><cell></cell><cell></cell><cell cols="2">Hyper parameters</cell><cell></cell><cell></cell></row><row><cell>Classifier No. and Classes groups</cell><cell>Classifier type</cell><cell>N estimators</cell><cell>Max depth</cell><cell>Min samples split</cell><cell>Achieved accuracy</cell></row><row><cell>Classifier 1 1 -Level 1 2 -Levels 2, 3, 4, 5</cell><cell>Random Forest</cell><cell>116</cell><cell>40</cell><cell>12</cell><cell>0.95</cell></row><row><cell>Classifier 2 1 -Levels 1 and 2 2 -Levels 3, 4, 5</cell><cell>Random Forest</cell><cell>47</cell><cell>7</cell><cell>7</cell><cell>0.97</cell></row><row><cell>Classifier 3 1 -Levels 1, 2, 3 2 -Levels 4, 5</cell><cell>Random Forest</cell><cell>47</cell><cell>11</cell><cell>5</cell><cell>0.93</cell></row><row><cell>Classifier 4 1 -Levels 1, 2, 3, 4 2 -Level 5</cell><cell>Decision Tree</cell><cell>-</cell><cell>-</cell><cell>2</cell><cell>0.99</cell></row></table></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_2"><head>Table 3</head><label>3</label><figDesc>The confusion matrix</figDesc><table><row><cell></cell><cell>Positive</cell><cell>Negative</cell></row><row><cell>True</cell><cell>156</cell><cell>0*</cell></row><row><cell>False</cell><cell>3</cell><cell>11</cell></row></table></figure>
		</body>
		<back>

			<div type="acknowledgement">
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Acknowledgements</head><p>This study would not have been possible without the financial support of the National Research Foundation of Ukraine (Open Funder Registry: 10.13039/100018227). Our work was funded by Grant contract: Development of the cloud-based platform for patient-centered telerehabilitation of oncology patients with mathematical-related modeling [23 -25], application ID: 2021.01/0136.</p></div>
			</div>


			<div type="availability">
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Data Availability Statement</head><p>The data that support the findings of this study are available from the corresponding author, Kyrylo Malakhov, upon reasonable request.</p></div>
			</div>

			<div type="references">

				<listBibl>

<biblStruct xml:id="b0">
	<analytic>
		<title level="a" type="main">Random Forests</title>
		<author>
			<persName><forename type="first">L</forename><surname>Breiman</surname></persName>
		</author>
		<idno type="DOI">10.1023/A:1010933404324</idno>
	</analytic>
	<monogr>
		<title level="j">Machine Learning</title>
		<imprint>
			<biblScope unit="volume">45</biblScope>
			<biblScope unit="page" from="5" to="32" />
			<date type="published" when="2001">2001</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b1">
	<analytic>
		<title level="a" type="main">XGBoost: A Scalable Tree Boosting System</title>
		<author>
			<persName><forename type="first">T</forename><surname>Chen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Guestrin</surname></persName>
		</author>
		<idno type="DOI">10.1145/2939672.2939785</idno>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining</title>
				<meeting>the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining</meeting>
		<imprint>
			<date type="published" when="2016">2016</date>
			<biblScope unit="page" from="785" to="794" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b2">
	<analytic>
		<title level="a" type="main">Classification and Regression by Random Forest</title>
		<author>
			<persName><forename type="first">A</forename><surname>Liaw</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Wiener</surname></persName>
		</author>
		<ptr target="http://CRAN.R-project.org/doc/Rnews/" />
	</analytic>
	<monogr>
		<title level="j">R News</title>
		<imprint>
			<biblScope unit="volume">2</biblScope>
			<biblScope unit="page" from="18" to="22" />
			<date type="published" when="2002">2002</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b3">
	<analytic>
		<title level="a" type="main">Newer Classification and Regression Tree Techniques: Bagging and Random Forests for Ecological Prediction</title>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">M</forename><surname>Prasad</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><forename type="middle">R</forename><surname>Iverson</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Liaw</surname></persName>
		</author>
		<idno type="DOI">10.1890/07-0539.1</idno>
	</analytic>
	<monogr>
		<title level="j">Ecosystems</title>
		<imprint>
			<biblScope unit="volume">9</biblScope>
			<biblScope unit="page" from="181" to="199" />
			<date type="published" when="2006">2006</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b4">
	<analytic>
		<title level="a" type="main">Extremely randomized trees</title>
		<author>
			<persName><forename type="first">P</forename><surname>Geurts</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Ernst</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Wehenkel</surname></persName>
		</author>
		<idno type="DOI">10.1007/s10994-006-6226-1</idno>
	</analytic>
	<monogr>
		<title level="j">Machine Learning</title>
		<imprint>
			<biblScope unit="volume">63</biblScope>
			<biblScope unit="page" from="3" to="42" />
			<date type="published" when="2006">2006</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b5">
	<monogr>
		<author>
			<persName><forename type="first">C</forename><forename type="middle">G</forename><surname>Caro</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><forename type="middle">J</forename><surname>Pedley</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><forename type="middle">C</forename><surname>Schroter</surname></persName>
		</author>
		<author>
			<persName><forename type="first">W</forename><forename type="middle">A</forename><surname>Seed</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><forename type="middle">H</forename><surname>Parker</surname></persName>
		</author>
		<idno type="DOI">10.1017/CBO9781139013406</idno>
		<title level="m">The Mechanics of the Circulation</title>
				<imprint>
			<publisher>Cambridge University Press</publisher>
			<date type="published" when="2011">2011</date>
		</imprint>
	</monogr>
	<note>2nd ed</note>
</biblStruct>

<biblStruct xml:id="b6">
	<monogr>
		<title level="m" type="main">Aplication Arterial Oscilography to Study the Adaptive Capacity of Subject with COVID-19 in Primary Care, Primary Health Care</title>
		<author>
			<persName><forename type="first">D</forename><surname>Vakulenko</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Vakulenko</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Hryshchuk</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Sas</surname></persName>
		</author>
		<idno type="DOI">10.5772/intechopen.98570</idno>
		<imprint>
			<date type="published" when="2022">2022</date>
			<publisher>IntechOpen</publisher>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b7">
	<analytic>
		<title level="a" type="main">Spectral analysis of arterial pulsations recorded during blood pressure measurement by the Oranta-AO information system, Arterial Oscillography: New Capabilities of the Blood Pressure Monitor with the Oranta-AO Information System</title>
		<author>
			<persName><forename type="first">D</forename><surname>Vakulenko</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Vakulenko</surname></persName>
		</author>
		<ptr target="https://novapublishers.com/shop/arterial-oscillography-new-capabilities-of-the-blood-pressure-monitor-with-the-oranta-ao-information-system/" />
	</analytic>
	<monogr>
		<title level="m">New Developments in Medical Research</title>
				<imprint>
			<publisher>Nova Science Publishers, Inc</publisher>
			<date type="published" when="2023">2023</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b8">
	<analytic>
		<title level="a" type="main">On the Development of Directed Acyclic Graphs in Differential Diagnostics of Pulmonary Diseases with the Help of Arterial Oscillogram Assessment, Graph-Based Modelling in Science</title>
		<author>
			<persName><forename type="first">V</forename><forename type="middle">P</forename><surname>Martsenyuk</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><forename type="middle">V</forename><surname>Vakulenko</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><forename type="middle">A</forename><surname>Hryshchuk</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><forename type="middle">O</forename><surname>Vakulenko</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><forename type="middle">O</forename><surname>Kravets</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Ya</surname></persName>
		</author>
		<author>
			<persName><surname>Klymuk</surname></persName>
		</author>
		<idno type="DOI">10.1007/978-3-030-76787-7_8</idno>
	</analytic>
	<monogr>
		<title level="m">Mechanisms and Machine Science</title>
				<editor>
			<persName><forename type="first">Art</forename><surname>Technology</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">S</forename><surname>Zawiślak</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">J</forename><surname>Rysiński</surname></persName>
		</editor>
		<meeting><address><addrLine>Cham</addrLine></address></meeting>
		<imprint>
			<publisher>Springer International Publishing</publisher>
			<date type="published" when="2022">2022</date>
			<biblScope unit="volume">107</biblScope>
			<biblScope unit="page" from="157" to="173" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b9">
	<monogr>
		<author>
			<persName><forename type="first">A</forename><surname>Pokrovsky</surname></persName>
		</author>
		<ptr target="https://cdn.e-rehab.pp.ua/u/pokrovsky-clinical-angiology-1979.pdf" />
		<title level="m">Clinical angiology, Medicine</title>
				<imprint>
			<date type="published" when="1979">1979</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b10">
	<analytic>
		<title level="a" type="main">Quantitation of beat-to-beat changes in stroke volume from the aortic pulse contour in man</title>
		<author>
			<persName><forename type="first">H</forename><forename type="middle">R</forename><surname>Warner</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><forename type="middle">H</forename><surname>Swan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><forename type="middle">C</forename><surname>Connolly</surname></persName>
		</author>
		<idno type="DOI">10.1152/jappl.1953.5.9.495</idno>
		<ptr target="https://pubmed.ncbi.nlm.nih.gov/13034677/" />
	</analytic>
	<monogr>
		<title level="j">J Appl Physiol</title>
		<imprint>
			<biblScope unit="volume">5</biblScope>
			<biblScope unit="page" from="495" to="507" />
			<date type="published" when="1953">1953</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b11">
	<analytic>
		<title level="a" type="main">The static elastic properties of 45 human thoracic and 20 abdominal aortas in vitro and the parameters of a new model</title>
		<author>
			<persName><forename type="first">G</forename><forename type="middle">J</forename><surname>Langewouters</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><forename type="middle">H</forename><surname>Wesseling</surname></persName>
		</author>
		<author>
			<persName><forename type="first">W</forename><forename type="middle">J</forename><surname>Goedhard</surname></persName>
		</author>
		<idno type="DOI">10.1016/0021-9290(84)90034-4</idno>
	</analytic>
	<monogr>
		<title level="j">J Biomech</title>
		<imprint>
			<biblScope unit="volume">17</biblScope>
			<biblScope unit="page" from="425" to="435" />
			<date type="published" when="1984">1984</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b12">
	<analytic>
		<title level="a" type="main">OntoChatGPT information system: Ontologydriven structured prompts for ChatGPT meta-learning</title>
		<author>
			<persName><forename type="first">O</forename><surname>Palagin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Kaverinskiy</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Litvin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Malakhov</surname></persName>
		</author>
		<idno type="DOI">10.47839/ijc.22.2.3086</idno>
	</analytic>
	<monogr>
		<title level="j">International Journal of Computing</title>
		<imprint>
			<biblScope unit="volume">22</biblScope>
			<biblScope unit="page" from="170" to="183" />
			<date type="published" when="2023">2023</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b13">
	<analytic>
		<title level="a" type="main">Digital health systems: Ontology-based universal dialog service for hybrid e-rehabilitation activities support</title>
		<author>
			<persName><forename type="first">O</forename><surname>Palagin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Kaverinsky</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Petrenko</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Malakhov</surname></persName>
		</author>
		<idno type="DOI">10.1109/IDAACS58523.2023.10348639</idno>
	</analytic>
	<monogr>
		<title level="m">IEEE 12th International Conference on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications (IDAACS)</title>
				<imprint>
			<date type="published" when="2023">2023. 2023</date>
			<biblScope unit="volume">1</biblScope>
			<biblScope unit="page" from="84" to="89" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b14">
	<analytic>
		<title level="a" type="main">Natural language-driven dialogue systems for support in physical medicine and rehabilitation</title>
		<author>
			<persName><forename type="first">V</forename><surname>Kaverinskiy</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Malakhov</surname></persName>
		</author>
		<idno type="DOI">10.18489/sacj.v35i2.17444</idno>
	</analytic>
	<monogr>
		<title level="j">South African Computer Journal</title>
		<imprint>
			<biblScope unit="volume">35</biblScope>
			<biblScope unit="page" from="119" to="126" />
			<date type="published" when="2023">2023</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b15">
	<analytic>
		<title level="a" type="main">Methodological foundations for development, formation and itsupport of transdisciplinary research</title>
		<author>
			<persName><forename type="first">O</forename><forename type="middle">V</forename><surname>Palagin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">G</forename><surname>Petrenko</surname></persName>
		</author>
		<idno type="DOI">10.1615/JAutomatInfScien.v50.i10.10</idno>
	</analytic>
	<monogr>
		<title level="j">Journal of Automation and Information Sciences</title>
		<imprint>
			<biblScope unit="volume">50</biblScope>
			<biblScope unit="issue">10</biblScope>
			<biblScope unit="page" from="1" to="17" />
			<date type="published" when="2018">2018</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b16">
	<analytic>
		<title level="a" type="main">Investigation of Drawbacks of the Software Development Artifacts Reuse Approaches based on Semantic Analysis</title>
		<author>
			<persName><forename type="first">O</forename><surname>Chebanyuk</surname></persName>
		</author>
		<idno type="DOI">10.1007/978-3-031-36118-0_46</idno>
	</analytic>
	<monogr>
		<title level="j">Lecture Notes on Data Engineering and Communications Technologies</title>
		<imprint>
			<biblScope unit="volume">181</biblScope>
			<biblScope unit="page" from="514" to="523" />
			<date type="published" when="2023">2023</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b17">
	<analytic>
		<title level="a" type="main">Formal foundations for software model to model transformation operation</title>
		<author>
			<persName><forename type="first">O</forename><surname>Chebanyuk</surname></persName>
		</author>
		<ptr target="https://ceur-ws.org/Vol-2139/124-131.pdf" />
	</analytic>
	<monogr>
		<title level="m">11th International Scientific and Practical Conference from Programming (UkrPROG&apos;2018), Kyiv, Ukraine, CEUR Workshop Proceedings</title>
				<imprint>
			<date type="published" when="2018">2018</date>
			<biblScope unit="volume">2139</biblScope>
			<biblScope unit="page" from="124" to="131" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b18">
	<monogr>
		<title level="m" type="main">Software Reuse Approach Based on Review and Analysis of Reuse Risks from Projects Uploaded to GitHub</title>
		<author>
			<persName><forename type="first">O</forename><surname>Chebanyuk</surname></persName>
		</author>
		<idno type="DOI">10.1007/978-3-031-44668-9_11</idno>
		<imprint>
			<date type="published" when="2023">2023</date>
			<publisher>Springer</publisher>
			<biblScope unit="volume">514</biblScope>
			<biblScope unit="page" from="144" to="155" />
			<pubPlace>CSECS</pubPlace>
		</imprint>
		<respStmt>
			<orgName>Computer Science and Education in Computer Science</orgName>
		</respStmt>
	</monogr>
</biblStruct>

<biblStruct xml:id="b19">
	<analytic>
		<title level="a" type="main">On One Approach To The Transfer Of An Information Structures Interpreter To Pld-Implementation</title>
		<author>
			<persName><forename type="first">M</forename><surname>Petrenko</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Sofiyuk</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Upr. Sist. I Mashiny</title>
		<imprint>
			<biblScope unit="volume">188</biblScope>
			<biblScope unit="issue">6</biblScope>
			<biblScope unit="page" from="48" to="57" />
			<date type="published" when="2003">2003</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b20">
	<analytic>
		<title level="a" type="main">Processor structure design</title>
		<author>
			<persName><forename type="first">O</forename><surname>Kurgaev</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Petrenko</surname></persName>
		</author>
		<idno type="DOI">10.1007/bf02366417</idno>
	</analytic>
	<monogr>
		<title level="j">Cybern. Syst. Anal</title>
		<imprint>
			<biblScope unit="volume">31</biblScope>
			<biblScope unit="issue">4</biblScope>
			<biblScope unit="page" from="618" to="625" />
			<date type="published" when="1995">1995</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b21">
	<analytic>
		<title level="a" type="main">Distinguishing features of design of a modern circuitry type processor</title>
		<author>
			<persName><forename type="first">M</forename><surname>Petrenko</surname></persName>
		</author>
		<author>
			<persName><forename type="first">O</forename><surname>Kurgaev</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Upr. Sist. I Mashiny</title>
		<imprint>
			<biblScope unit="volume">187</biblScope>
			<biblScope unit="issue">5</biblScope>
			<biblScope unit="page" from="16" to="19" />
			<date type="published" when="2003">2003</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b22">
	<analytic>
		<title level="a" type="main">Insight into the digital health system of Ukraine (eHealth): Trends, definitions, standards, and legislative revisions</title>
		<author>
			<persName><forename type="first">K</forename><forename type="middle">S</forename><surname>Malakhov</surname></persName>
		</author>
		<idno type="DOI">10.5195/ijt.2023.6599</idno>
	</analytic>
	<monogr>
		<title level="j">International Journal of Telerehabilitation</title>
		<imprint>
			<biblScope unit="volume">15</biblScope>
			<biblScope unit="page" from="1" to="21" />
			<date type="published" when="2023">2023</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b23">
	<analytic>
		<title level="a" type="main">Unified Representation of the Classical Ellipsoid Method</title>
		<author>
			<persName><forename type="first">P</forename><forename type="middle">I</forename><surname>Stetsyuk</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Fischer</surname></persName>
		</author>
		<author>
			<persName><forename type="first">O</forename><forename type="middle">M</forename><surname>Khomiak</surname></persName>
		</author>
		<idno type="DOI">10.1007/s10559-023-00614-x</idno>
	</analytic>
	<monogr>
		<title level="j">Cybern. Syst. Anal</title>
		<imprint>
			<biblScope unit="volume">59</biblScope>
			<biblScope unit="issue">5</biblScope>
			<biblScope unit="page" from="784" to="793" />
			<date type="published" when="2023">2023</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b24">
	<analytic>
		<title level="a" type="main">Algorithm Unions for Solving Discrete Optimization Problems</title>
		<author>
			<persName><forename type="first">I</forename><forename type="middle">V</forename><surname>Sergienko</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><forename type="middle">P</forename><surname>Shylo</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><forename type="middle">O</forename><surname>Roshchyn</surname></persName>
		</author>
		<idno type="DOI">10.1007/s10559-023-00611-0</idno>
	</analytic>
	<monogr>
		<title level="j">Cybern. Syst. Anal</title>
		<imprint>
			<biblScope unit="volume">59</biblScope>
			<biblScope unit="issue">5</biblScope>
			<biblScope unit="page" from="753" to="762" />
			<date type="published" when="2023">2023</date>
		</imprint>
	</monogr>
</biblStruct>

				</listBibl>
			</div>
		</back>
	</text>
</TEI>
