<?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">Statistical Analysis of the Popularity of Programming Language Libraries Based on StackOverflow Queries</title>
			</titleStmt>
			<publicationStmt>
				<publisher/>
				<availability status="unknown"><licence/></availability>
			</publicationStmt>
			<sourceDesc>
				<biblStruct>
					<analytic>
						<author>
							<persName><forename type="first">Ihor</forename><surname>Rishnyak</surname></persName>
							<email>ihor.v.rishnyak@lpnu.ua</email>
							<affiliation key="aff0">
								<orgName type="institution">Lviv Polytechnic National University</orgName>
								<address>
									<addrLine>S. Bandera Street, 12</addrLine>
									<postCode>79013</postCode>
									<settlement>Lviv</settlement>
									<country key="UA">Ukraine</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Yurii</forename><surname>Matseliukh</surname></persName>
							<affiliation key="aff0">
								<orgName type="institution">Lviv Polytechnic National University</orgName>
								<address>
									<addrLine>S. Bandera Street, 12</addrLine>
									<postCode>79013</postCode>
									<settlement>Lviv</settlement>
									<country key="UA">Ukraine</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Taras</forename><surname>Batiuk</surname></persName>
							<affiliation key="aff0">
								<orgName type="institution">Lviv Polytechnic National University</orgName>
								<address>
									<addrLine>S. Bandera Street, 12</addrLine>
									<postCode>79013</postCode>
									<settlement>Lviv</settlement>
									<country key="UA">Ukraine</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Lyubomyr</forename><surname>Chyrun</surname></persName>
							<email>lyubomyr.chyrun@lnu.edu.ua</email>
							<affiliation key="aff1">
								<orgName type="institution">Ivan Franko National University of Lviv</orgName>
								<address>
									<addrLine>University Street, 1</addrLine>
									<postCode>79000</postCode>
									<settlement>Lviv</settlement>
									<country key="UA">Ukraine</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Oleksandra</forename><surname>Strembitska</surname></persName>
							<email>oleksandra.strembitska.sa.2019@lpnu.ua</email>
							<affiliation key="aff0">
								<orgName type="institution">Lviv Polytechnic National University</orgName>
								<address>
									<addrLine>S. Bandera Street, 12</addrLine>
									<postCode>79013</postCode>
									<settlement>Lviv</settlement>
									<country key="UA">Ukraine</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Oksana</forename><surname>Mlynko</surname></persName>
							<email>oxanamlunko@gmail.com</email>
							<affiliation key="aff0">
								<orgName type="institution">Lviv Polytechnic National University</orgName>
								<address>
									<addrLine>S. Bandera Street, 12</addrLine>
									<postCode>79013</postCode>
									<settlement>Lviv</settlement>
									<country key="UA">Ukraine</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Viktoriia</forename><surname>Liashenko</surname></persName>
							<email>viktoriia.liashenko.sa.2019@lpnu.ua</email>
							<affiliation key="aff0">
								<orgName type="institution">Lviv Polytechnic National University</orgName>
								<address>
									<addrLine>S. Bandera Street, 12</addrLine>
									<postCode>79013</postCode>
									<settlement>Lviv</settlement>
									<country key="UA">Ukraine</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Andrii</forename><surname>Lema</surname></persName>
							<affiliation key="aff0">
								<orgName type="institution">Lviv Polytechnic National University</orgName>
								<address>
									<addrLine>S. Bandera Street, 12</addrLine>
									<postCode>79013</postCode>
									<settlement>Lviv</settlement>
									<country key="UA">Ukraine</country>
								</address>
							</affiliation>
						</author>
						<author>
							<affiliation key="aff2">
								<orgName type="department">International Conference on Computational Linguistics and Intelligent Systems</orgName>
								<address>
									<addrLine>May 12-13</addrLine>
									<postCode>2022</postCode>
									<settlement>Gliwice</settlement>
									<country key="PL">Poland</country>
								</address>
							</affiliation>
						</author>
						<title level="a" type="main">Statistical Analysis of the Popularity of Programming Language Libraries Based on StackOverflow Queries</title>
					</analytic>
					<monogr>
						<imprint>
							<date/>
						</imprint>
					</monogr>
					<idno type="MD5">285A209A089BA3B6CFF4E3AFD2D88EEA</idno>
				</biblStruct>
			</sourceDesc>
		</fileDesc>
		<encodingDesc>
			<appInfo>
				<application version="0.7.2" ident="GROBID" when="2023-03-24T12:57+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>Statistical analysis, information technologies, business analysis, programming language libraries, StackOverflow queries, data processing 0000-0001-5727-3438 (I. Rishnyak)</term>
					<term>0000-0002-1721-7703 (Y. Matseliukh)</term>
					<term>0000-0001-5797-594X (T. Batiuk)</term>
					<term>0000-0002-9448-1751 (L. Chyrun)</term>
					<term>0000-0003-2754-7076 (O. Strembitska)</term>
					<term>0000-0001-9878-6846 (O. Mlynko)</term>
					<term>0000-0003-0966-7912 (V. Liashenko)</term>
					<term>0000-0001-6490-6221 (A. Lema)</term>
				</keywords>
			</textClass>
			<abstract>
<div xmlns="http://www.tei-c.org/ns/1.0"><p>This paper presents a statistical analysis of existing trends in the spread of programming language libraries based on data set studies. The various problems that arise when using specific libraries of different programming languages for certain periods, the most common is the month, are studied and analyzed. The results of the study of existing trends in the spread of programming language libraries, collected in the studied dataset, are presented graphically, set key descriptive characteristics, taking into account the correlation of data. Trends in the behavior of the studied indicators using the methods of smoothing time series are determined. A cluster analysis of programming language libraries was performed, making it possible to group data by clusters and form appropriate data groups for ranking programming language libraries.</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>The rapid growth in popularity of programming language libraries based on Stack <ref type="bibr">Overflow queries</ref> has not yet solved the problem of solving complex technical questions that cannot be answered through queries on the Internet. A typical problem is when developers, looking for answers by submitting queries in search engines, get all kinds of results, often spam or incorrect, outdated, and sometimes offtopic. You often have to look for a blog post and then sit with the source for a long time (more than ten minutes) to identify a way to solve a technical problem in a particular post. Stack Overflow is a place where developers ask and get a reliable answer. Stack Overflow allows developers to improve their level as a programmer, using the experience of others. It increases the code experience even for those already experienced, helping others who have not been able to figure it out themselves. Stack Overflow is the formation of future technologies as the world's future. The above proves the relevance of the study of the popularity of libraries of programming languages, where it is crucial to analyze the composition, structure, and issues of various queries in specific libraries each month. This study is especially relevant for beginners who are now trying to choose a language. The problem's urgency is no less for experienced developers to expand their knowledge in studying each subsequent programming language.</p><p>From the point of view of business analysts, this analysis can be considered the creation of a library rating system, i.e., identifying the most significant number of queries and determining the most popular languages. Based on the analyzed data, the business analyst will be able to assess the decline, growth, and invariability of the popularity of languages in 2009-2019 and offer his vision of the possible development of specific languages.</p><p>The work aims to use the main methods of visualization, graphical display, and primary statistical processing of numerical data presented by a sample or time series to identify trends in the studied indicators of programming language libraries, present the nature of their trends, apply time series smoothing methods and tabulation MS Excel. Determination by methods of correlation analysis of experimental data presented by time sequences.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.">Related Works</head><p>Research on the popularity of programming languages, according to scientists <ref type="bibr" target="#b0">[1]</ref><ref type="bibr" target="#b1">[2]</ref><ref type="bibr" target="#b2">[3]</ref>, is one of the components of the problem of human capital development. Having hard skills employees and acquiring soft skills is an important task, as it allows you to solve important social <ref type="bibr" target="#b3">[4]</ref><ref type="bibr" target="#b4">[5]</ref>, economic <ref type="bibr" target="#b5">[6]</ref><ref type="bibr" target="#b6">[7]</ref><ref type="bibr" target="#b7">[8]</ref> and technical <ref type="bibr" target="#b8">[9]</ref><ref type="bibr" target="#b9">[10]</ref><ref type="bibr" target="#b10">[11]</ref><ref type="bibr" target="#b11">[12]</ref><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><ref type="bibr" target="#b16">[17]</ref><ref type="bibr" target="#b17">[18]</ref><ref type="bibr" target="#b18">[19]</ref><ref type="bibr" target="#b19">[20]</ref><ref type="bibr" target="#b20">[21]</ref><ref type="bibr" target="#b21">[22]</ref><ref type="bibr" target="#b22">[23]</ref> issues. Since its inception, the system we consider in this paper has provided an opportunity to ask questions about programming and get answers to them for 12 years <ref type="bibr" target="#b23">[24]</ref><ref type="bibr" target="#b24">[25]</ref><ref type="bibr" target="#b25">[26]</ref><ref type="bibr" target="#b26">[27]</ref><ref type="bibr" target="#b27">[28]</ref><ref type="bibr" target="#b28">[29]</ref><ref type="bibr" target="#b29">[30]</ref><ref type="bibr" target="#b30">[31]</ref><ref type="bibr" target="#b31">[32]</ref><ref type="bibr" target="#b32">[33]</ref><ref type="bibr" target="#b33">[34]</ref><ref type="bibr" target="#b34">[35]</ref><ref type="bibr" target="#b35">[36]</ref>.</p><p>Confectioners discuss recipes in culinary forums; students discuss their questions in help groups in telegrams; parents of these children have joint chats on Viber, where they solve problems. Older people gather under the porches to discuss neighbors or world news, i.e., every branch of people or professionals should have a place where he can ask his question, hear an expert's opinion, discuss a topic or give advice. Therefore, the importance of using the StackOverflow system is beyond doubt.</p><p>Its relevance has been described in many articles <ref type="bibr" target="#b23">[24]</ref><ref type="bibr" target="#b24">[25]</ref><ref type="bibr" target="#b25">[26]</ref><ref type="bibr" target="#b26">[27]</ref><ref type="bibr" target="#b27">[28]</ref><ref type="bibr" target="#b28">[29]</ref><ref type="bibr" target="#b29">[30]</ref><ref type="bibr" target="#b30">[31]</ref><ref type="bibr" target="#b31">[32]</ref><ref type="bibr" target="#b32">[33]</ref><ref type="bibr" target="#b33">[34]</ref><ref type="bibr" target="#b34">[35]</ref><ref type="bibr" target="#b35">[36]</ref> and videos on YouTube and other social networks. Also, if you practice programming, you are interested in specific questions and decided to enter them in the Google search. One of the first results will be the site Stack Overflow. One example of relevance is the Wikipedia site. He reports that a 2016 study by Android developers using Stack Overflow generated ten times more functional code (but less secure, which is a disadvantage) than developers using official documentation <ref type="bibr" target="#b29">[30,</ref><ref type="bibr" target="#b36">37]</ref>.</p><p>In researching the chosen topic, we considered the HABR website <ref type="bibr" target="#b30">[31]</ref>, which was created to publish news and opinions related to IT and business. These libraries of programming languages will be our attributes.</p><p>• Month is here are the day-month data on the library in the StackOverflow program;</p><p>• NLTK is the number of queries about the NLTK library (a set of libraries and programs for symbolic and statistical processing of natural languages for English, written in the Python programming language); • spaCy is the number of requests for the spacy library (open-source library for advanced natural language processing (NLP) in Python); • Stanford-NLP is number of queries about Stanford -NLP library; • Python is the number of queries about the Python library; • R is number of requests for r library; • NumPy is the number of queries about the NumPy library (python language extension); • SciPy -the number of queries about the spicy library; • MATLAB is the number of queries about the MATLAB library; • Machine-Learning -the number of requests for machine learning. In these works <ref type="bibr" target="#b30">[31]</ref>, the user described his story. For seven years, he used the system we are discussing, and during this time, he "answered 3516 questions, asked 58, entered the hall of fame in several languages, met many wise people, and actively used all the site's features.</p><p>The issues of the most popular programming languages under discussion and their libraries are already discussed on the website StackOverflow <ref type="bibr" target="#b29">[30,</ref><ref type="bibr" target="#b36">37]</ref>.</p><p>Is it possible to trust the answers to your questions on the site and actively use them? -After all, users are interested in each question and will quickly correct it in case of error. The HABR website <ref type="bibr" target="#b30">[31]</ref> also explains that the average programmer cannot write code without a break of several hours. Therefore, to avoid unnecessary distractions and overloads, you can have a great time with like-minded people on StackOverflow <ref type="bibr" target="#b29">[30,</ref><ref type="bibr" target="#b36">37]</ref>. The user is set a rating by answering the question, and his "reputation" can rise exponentially, depending on the site activity. After a reputation mark of 25,000, the user gets access to all SO statistics and permission to store queries in the user database.</p><p>Thus, the SO system is one of the most popular among professional software developers, system administrators, and programmers. All questions are marked with a specific topic tag (or multiple tags, depending on the topics involved) to which the question relates. By clicking on the label, you can view their list to select the topic that interests you. In our case, these are the themes of libraries of different programming languages.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.">Methods</head><p>To solve the problems in this work, we will use standard methods <ref type="bibr" target="#b37">[38]</ref><ref type="bibr" target="#b38">[39]</ref><ref type="bibr" target="#b39">[40]</ref><ref type="bibr" target="#b40">[41]</ref><ref type="bibr" target="#b41">[42]</ref><ref type="bibr" target="#b42">[43]</ref><ref type="bibr" target="#b43">[44]</ref><ref type="bibr" target="#b44">[45]</ref>. The correlation field is a graph that establishes a relationship between variables, where X of each corresponds to the value of the factor feature (abscissa), and Y -the value of the resultant feature (ordinate) of a particular unit of observation. The number of points on the Graph corresponds to the number of observation units. The location of the points indicates the presence and direction of communication <ref type="bibr" target="#b37">[38]</ref><ref type="bibr" target="#b38">[39]</ref><ref type="bibr" target="#b39">[40]</ref><ref type="bibr" target="#b40">[41]</ref><ref type="bibr" target="#b41">[42]</ref><ref type="bibr" target="#b42">[43]</ref><ref type="bibr" target="#b43">[44]</ref><ref type="bibr" target="#b44">[45]</ref>.</p><p>Building a correlation field is carried out mainly in the following steps: choose two variables that change over time. Then measure the value of the dependent variable and enter the result in the table. Then construct a coordinate plane on the X-axis to indicate the value of the independent variable and on the Y-axis -the dependent. Then you need to mark the points of the correlation field on the Graph. On the X-axis for the first value of the independent variable, mark a point on the Y-axis corresponding to the value of the dependent variable. The resulting set of points is called the correlation field <ref type="bibr" target="#b37">[38]</ref><ref type="bibr" target="#b38">[39]</ref><ref type="bibr" target="#b39">[40]</ref><ref type="bibr" target="#b40">[41]</ref><ref type="bibr" target="#b41">[42]</ref><ref type="bibr" target="#b42">[43]</ref><ref type="bibr" target="#b43">[44]</ref><ref type="bibr" target="#b44">[45]</ref>. We analyze the received schedule and conclude the presence of communication or its absence.</p><p>Correlation coefficient is an indicator used to measure the density of the relationship between traits in the correlation-regression model of linear dependence <ref type="bibr" target="#b45">[46]</ref><ref type="bibr" target="#b46">[47]</ref><ref type="bibr" target="#b47">[48]</ref><ref type="bibr" target="#b48">[49]</ref><ref type="bibr" target="#b49">[50]</ref><ref type="bibr" target="#b50">[51]</ref><ref type="bibr" target="#b51">[52]</ref>. The absolute value of the correlation coefficient ranges from -1 to +1.</p><p>The correlation ratio determines the correlation in any of its forms, namely in, straight or curved. The correlation ratio can be determined to estimate the curvilinear relationship between the values of X and Y. It always has a positive value and is in the range from 0 to + 1. The value of the zero ratios is taken when the relationship between the features is absent <ref type="bibr" target="#b37">[38]</ref><ref type="bibr" target="#b38">[39]</ref><ref type="bibr" target="#b39">[40]</ref><ref type="bibr" target="#b40">[41]</ref><ref type="bibr" target="#b41">[42]</ref><ref type="bibr" target="#b42">[43]</ref><ref type="bibr" target="#b43">[44]</ref><ref type="bibr" target="#b44">[45]</ref><ref type="bibr" target="#b45">[46]</ref><ref type="bibr" target="#b46">[47]</ref><ref type="bibr" target="#b47">[48]</ref><ref type="bibr" target="#b48">[49]</ref><ref type="bibr" target="#b49">[50]</ref><ref type="bibr" target="#b50">[51]</ref><ref type="bibr" target="#b51">[52]</ref>.</p><p>Autocorrelation is the correlation of a function with itself shifted by a certain amount of independent variable. The autocorrelation function graph can be obtained by plotting the correlation coefficient of two functions along the ordinate axis and the value along the abscissa axis <ref type="bibr" target="#b37">[38]</ref><ref type="bibr" target="#b38">[39]</ref><ref type="bibr" target="#b39">[40]</ref><ref type="bibr" target="#b40">[41]</ref><ref type="bibr" target="#b41">[42]</ref><ref type="bibr" target="#b42">[43]</ref><ref type="bibr" target="#b43">[44]</ref><ref type="bibr" target="#b44">[45]</ref>. The autocorrelation function measures the linearity of the relationship between the elements of the time series spaced apart at x points in time. The Graph of an autocorrelation function is called a correlogram.</p><p>The correlation matrix is a table that represents the values of the correlation coefficients for different variables. It shows the numerical value of the correlation coefficient for all combinations of variables. It is generally used when we need to determine the relationship between more than two variables. It consists of rows and columns that contain variables, and each cell contains coefficient values that inform the degree of association and linear relationship between two variables <ref type="bibr" target="#b37">[38]</ref><ref type="bibr" target="#b38">[39]</ref><ref type="bibr" target="#b39">[40]</ref><ref type="bibr" target="#b40">[41]</ref><ref type="bibr" target="#b41">[42]</ref><ref type="bibr" target="#b42">[43]</ref><ref type="bibr" target="#b43">[44]</ref><ref type="bibr" target="#b44">[45]</ref>. In addition, it can be used in specific statistical analyzes. Multiple linear regression, where we have several independent variables and a correlation matrix, helps determine the degree of association.</p><p>The multiple correlation coefficient describes the correlation's intensity, or the relationship's degree of closeness, between a dependent variable and several independent variables <ref type="bibr" target="#b37">[38]</ref><ref type="bibr" target="#b38">[39]</ref><ref type="bibr" target="#b39">[40]</ref><ref type="bibr" target="#b40">[41]</ref><ref type="bibr" target="#b41">[42]</ref><ref type="bibr" target="#b42">[43]</ref><ref type="bibr" target="#b43">[44]</ref><ref type="bibr" target="#b44">[45]</ref>. Its value cannot be less than the absolute value of any partial or straightforward correlation coefficient. The primary indicator of the closeness of the connection in multiple correlations is the coefficient of multiple correlations, which has a value from 0 to +1. Charts are used to represent data on a sheet graphically. There are several standard chart types in Excel. Charts can be ¬placed directly on the sheet next to the data used to build the chart. Such charts are called embedded. In addition, the chart can occupy a separate sheet in the book, which is called a chart sheet. No matter how the chart was created, it is always linked to the sheet data. If the data changes, the chart will be updated automatically <ref type="bibr" target="#b32">[33]</ref>. The graphical form of data representation is called a chart. In the form of a chart, you can provide sets of numbers, sums of money, percentages, dates, and time values. Chart is created using the Chart Wizard, launched by the Chart Wizard button on the Standard toolbar (Fig. <ref type="figure">1</ref>). Output Range is a range of spreadsheet cells ¬that contains data that will be displayed graphically or in the form of textual explanatory elements. A graphic representation of a single value is called a data element in the chart. A row of data is a sequence of data arranged in a single row or column of a spreadsheet and displayed graphically on a chart (Fig. <ref type="figure">2</ref>). Typically, the value shown in the diagram depends on another value or set of text values. Such independent values and text values are called data categories <ref type="bibr" target="#b32">[33]</ref>. Descriptive statistics <ref type="bibr" target="#b24">[25]</ref><ref type="bibr" target="#b25">[26]</ref><ref type="bibr" target="#b26">[27]</ref><ref type="bibr" target="#b27">[28]</ref><ref type="bibr" target="#b28">[29]</ref><ref type="bibr" target="#b31">[32]</ref><ref type="bibr" target="#b32">[33]</ref><ref type="bibr" target="#b33">[34]</ref><ref type="bibr" target="#b34">[35]</ref><ref type="bibr" target="#b35">[36]</ref> provide the basis for the formation of competencies for choosing a measurement scale, automation of data processing using different formats at the stage of their collection, presentation of results in various forms, graphical presentation of results, calculation of statistical distribution parameters, and evaluation of general population parameters using information technology. It selects quantitative information necessary (or interesting) for different people. Large data sets must be generalized or collapsed before humans can study them. It is what descriptive statistics do, which describes, summarizes, or reduces the properties of data sets to the desired type. Descriptive statistics are used to analyze and interpret statistical data, construct statistical distributions and calculate the relevant numerical parameters that characterize the study population. It is used to organize information collection, check the quality of data and their interpretation, and the image of statistical material <ref type="bibr" target="#b24">[25]</ref><ref type="bibr" target="#b25">[26]</ref><ref type="bibr" target="#b26">[27]</ref><ref type="bibr" target="#b27">[28]</ref><ref type="bibr" target="#b28">[29]</ref><ref type="bibr" target="#b31">[32]</ref><ref type="bibr" target="#b32">[33]</ref><ref type="bibr" target="#b33">[34]</ref><ref type="bibr" target="#b34">[35]</ref><ref type="bibr" target="#b35">[36]</ref><ref type="bibr" target="#b36">[37]</ref>. A result of descriptive statistics shows in the Table <ref type="table" target="#tab_1">2</ref>.</p><p>The construction of histograms interprets the distribution data more apparent <ref type="bibr" target="#b31">[32]</ref>. It involves dividing the entire range of possible values of X into a finite number of intervals (in the multidimensional case -rectangular) and counting the number of implementations that fall into each of them (Fig. <ref type="figure" target="#fig_2">3</ref>).</p><p>Cumulate is the curve of the interval variation series's accumulated frequencies <ref type="bibr" target="#b33">[34]</ref>. The Graph of the integral distribution function F (x) is compared with the cumulative and is also considered in probability theory <ref type="bibr" target="#b33">[34]</ref>. The concepts of histograms and cumulates are associated with continuous data and their interval variation series <ref type="bibr" target="#b33">[34]</ref>. Their graphs are empirical estimates of the probability density and distribution function (Fig. <ref type="figure" target="#fig_2">3</ref>).</p><p>The methods of smoothing time series are the method of moving average, exponential smoothing, adaptive smoothing, and their modifications <ref type="bibr" target="#b24">[25]</ref><ref type="bibr" target="#b25">[26]</ref><ref type="bibr" target="#b26">[27]</ref><ref type="bibr" target="#b27">[28]</ref><ref type="bibr" target="#b28">[29]</ref><ref type="bibr" target="#b31">[32]</ref><ref type="bibr" target="#b32">[33]</ref><ref type="bibr" target="#b33">[34]</ref><ref type="bibr" target="#b34">[35]</ref><ref type="bibr" target="#b35">[36]</ref>. They are used to reduce the influence of a random component (random fluctuations) in time series. They make it possible to obtain more "pure" values, which consist only of deterministic components. Some of the methods aim to highlight some components, such as trends <ref type="bibr" target="#b24">[25]</ref><ref type="bibr" target="#b25">[26]</ref><ref type="bibr" target="#b26">[27]</ref><ref type="bibr" target="#b27">[28]</ref><ref type="bibr" target="#b28">[29]</ref><ref type="bibr" target="#b31">[32]</ref><ref type="bibr" target="#b32">[33]</ref><ref type="bibr" target="#b33">[34]</ref><ref type="bibr" target="#b34">[35]</ref><ref type="bibr" target="#b35">[36]</ref>. Smoothing methods can be divided into two classes based on analytical and algorithmic approaches.  The simplest way of forecasting is considered to be the approach that determines the forecast estimate from the achieved level using the average level, average growth, and average growth rateextrapolation based on the average level of the series <ref type="bibr" target="#b24">[25]</ref><ref type="bibr" target="#b25">[26]</ref><ref type="bibr" target="#b26">[27]</ref><ref type="bibr" target="#b27">[28]</ref><ref type="bibr" target="#b28">[29]</ref><ref type="bibr" target="#b31">[32]</ref><ref type="bibr" target="#b32">[33]</ref><ref type="bibr" target="#b33">[34]</ref><ref type="bibr" target="#b34">[35]</ref><ref type="bibr" target="#b35">[36]</ref>. When extrapolating socioeconomic processes based on the average level of the series, the predicted value is taken as the arithmetic mean of the previous levels of the series. The reliability interval considers the uncertainty hidden in the estimate of the mean. However, the projected indicator is assumed to be equal to the average sample value. The approach doesn't consider that individual indicator values fluctuated around the average in the past <ref type="bibr" target="#b24">[25]</ref><ref type="bibr" target="#b25">[26]</ref><ref type="bibr" target="#b26">[27]</ref><ref type="bibr" target="#b27">[28]</ref><ref type="bibr" target="#b28">[29]</ref><ref type="bibr" target="#b31">[32]</ref><ref type="bibr" target="#b32">[33]</ref><ref type="bibr" target="#b33">[34]</ref><ref type="bibr" target="#b34">[35]</ref><ref type="bibr" target="#b35">[36]</ref>. It will also happen in the future.</p><p>Methods of analytical smoothing include regression analysis and the method of least squares and its modifications <ref type="bibr" target="#b24">[25]</ref><ref type="bibr" target="#b25">[26]</ref><ref type="bibr" target="#b26">[27]</ref><ref type="bibr" target="#b27">[28]</ref><ref type="bibr" target="#b28">[29]</ref><ref type="bibr" target="#b31">[32]</ref><ref type="bibr" target="#b32">[33]</ref><ref type="bibr" target="#b33">[34]</ref><ref type="bibr" target="#b34">[35]</ref><ref type="bibr" target="#b35">[36]</ref>. To identify the primary trend by the analytical method means to give the studied process the same development throughout the observation period. Therefore, for 4 of these methods, choosing the optimal function of the deterministic trend (growth curve) is essential, which smooths out several observations. Forecasting methods based on regression methods are used for short-term and medium-term forecasting. They do not allow adaptation: the forecasting procedure must be repeated first with the receipt of new data. The optimal length of the lead period is determined separately for each economic process, taking into account its statistical instability.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.">Results</head><p>The most commonly used method is smoothing time series using moving averages <ref type="bibr" target="#b24">[25]</ref><ref type="bibr" target="#b25">[26]</ref><ref type="bibr" target="#b26">[27]</ref><ref type="bibr" target="#b27">[28]</ref><ref type="bibr" target="#b28">[29]</ref><ref type="bibr" target="#b31">[32]</ref><ref type="bibr" target="#b32">[33]</ref><ref type="bibr" target="#b33">[34]</ref><ref type="bibr" target="#b34">[35]</ref><ref type="bibr" target="#b35">[36]</ref>. The algorithm for calculating the moving average is as follows <ref type="bibr" target="#b24">[25]</ref><ref type="bibr" target="#b25">[26]</ref><ref type="bibr" target="#b26">[27]</ref><ref type="bibr" target="#b27">[28]</ref><ref type="bibr" target="#b28">[29]</ref><ref type="bibr" target="#b31">[32]</ref><ref type="bibr" target="#b32">[33]</ref><ref type="bibr" target="#b33">[34]</ref><ref type="bibr" target="#b34">[35]</ref><ref type="bibr" target="#b35">[36]</ref>.</p><p>(1)</p><p>Algorithm for calculating the weighted average is as follows <ref type="bibr" target="#b24">[25]</ref><ref type="bibr" target="#b25">[26]</ref><ref type="bibr" target="#b26">[27]</ref><ref type="bibr" target="#b27">[28]</ref><ref type="bibr" target="#b28">[29]</ref><ref type="bibr" target="#b31">[32]</ref><ref type="bibr" target="#b32">[33]</ref><ref type="bibr" target="#b33">[34]</ref><ref type="bibr" target="#b34">[35]</ref><ref type="bibr" target="#b35">[36]</ref>.</p><p>(2)</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.1.">Smoothing according to Kendel formulas -simple moving average</head><p>Smooth the data using the dimensions of the smoothing interval w = 3, 5, 7, 9, 11, 13, 15 are presented in Fig. <ref type="figure">4</ref>-Fig. <ref type="figure">6</ref>. The smoothed data for queries about MatLab are calculated using to Kendel formulas for the smoothing interval w = 3 (Fig. <ref type="figure">4</ref>, a), w = 5 (Fig. <ref type="figure">4, b</ref>), w = 7 (Fig. <ref type="figure">4, c</ref>), w = 9 (Fig. <ref type="figure" target="#fig_4">5</ref>, a), w = 11 (Fig. <ref type="figure" target="#fig_4">5, b</ref>), w = 13 (Fig. <ref type="figure" target="#fig_4">5, c</ref>), w = 15 (Fig. <ref type="figure">6</ref>).  We smoothed the data using the smoothing interval w = 3, then we smoothed the obtained smoothed data again, but use the size of the smoothing interval w = 5. We continued smoothing the obtained data with a smoothing interval w = 7 and so on to w = 15.    In both cases, we find for each smoothing the number of turning points and correlation coefficients between the original values and the smoothed ones. The correlation coefficients between the original values and the smoothed ones are calculated in Table <ref type="table">3</ref>.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Table 3</head><p>The correlation coefficients between the original values and the smoothed ones Interval w 3 5 7 9 11 13 15 5 (3) 7 ( <ref type="formula" target="#formula_2">5</ref>) 9 (7) 11 ( <ref type="formula">9</ref>) 13 (11) 15 (13) Correlat. coeffic. 0,980 0,962 0,953 0,939 0,925 0,916 -0,977 0,971 0,965 0,958 0,953 0,950 </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.2.">Smoothing according to Pollard formulas</head><p>John Pollard's algorithm, proposed by him in 1975, is used to factorize integers <ref type="bibr" target="#b27">[28]</ref>. It is based on Floyd's algorithm for finding the length of the cycle in the sequence and some consequences of the paradox of birthdays. The algorithm most effectively factored composite numbers with relatively minor factors in the decomposition. All of Pollard's ρ-methods construct a numerical sequence, the elements of which form a loop, starting with some number n, which can be illustrated by the arrangement of numbers in the Greek letter ρ. It was the name for a family of methods <ref type="bibr" target="#b27">[28]</ref>. We smooth the data for queries about R using the same dimensions of the smoothing interval (w = 3, 5, 7, 9, 11, 13, 15). It is presented in Fig. <ref type="figure">9</ref>-Fig. <ref type="figure" target="#fig_9">11</ref>. The smoothed data for queries about R are calculated using Pollard formulas for the smoothing interval w = 3 (Fig. <ref type="figure">9</ref>, a), w = (Fig. <ref type="figure">9, b</ref>), w = 7 (Fig. <ref type="figure">9, c</ref>), w = 9 (Fig. <ref type="figure">10, a</ref>), w = 11 (Fig. <ref type="figure">10, b</ref>), w = 13 (Fig. <ref type="figure">10, c</ref>), w = 15 (Fig. <ref type="figure" target="#fig_9">11</ref>).   We smooth the data using the size of the smoothing interval w = 3, then we smooth the obtained smoothed data again, but we use the size of the smoothing interval w = 5.</p><p>The smoothed data for queries about R obtained by the smoothing data again. In Fig. <ref type="figure" target="#fig_0">12</ref> there are presented the smoothed data for queries about R using the smoothing interval w = 5 (w = 3) (a), w = 7 (w = 5) (b).   </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.3.">Exponential smoothing</head><p>We add all sample elements to construct exponential smoothing and multiply by a factor (1 -α). The α takes values from zero to one, and the last element of the already created table of values for a certain α is multiplied by α (the Sum of coefficients should be equal to 1). The following is a graph of exponential smoothing for all required α.</p><p>Exponential smoothing queries about Machine Learning for а=0.1 (a), а=0.15 (b), а=0.2 (c), а=0.25 (d), а=0.3 (e) are presented in the Fig. <ref type="figure" target="#fig_12">14</ref>.</p><p>We find the number of turning points and coefficients for each smoothing correlation between original and smoothed values. The correlation coefficients between the original values and the smoothed ones are calculated in the    </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.4.">Median smoothing</head><p>Median  </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="6.">Discussions 6.1. Data correlation</head><p>Correlation analysis is a group of methods that can detect the presence and degree of relationship between several parameters that change randomly <ref type="bibr" target="#b23">[24]</ref>. Two samples (data sets) are studied in the simplest case. Their multidimensional complexes (groups) are studied in the general case. The purpose of correlation analysis is to determine whether one variable has a significant dependence on another <ref type="bibr" target="#b24">[25]</ref>. The main tasks of correlation analysis are the definition and expression of the form of analytical dependence of the resultant trait y on the factor traits хі.</p><p>There are the following stages of correlation analysis <ref type="bibr" target="#b23">[24,</ref><ref type="bibr" target="#b24">25]</ref>.</p><p>• Identifying the relationship between the signs; • Determining the form of communication; • Determination of strength (tightness) and direction of communication. Advantages of correlation analysis are as following.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>•</head><p>Ability to create a new rule of the interaction of functions with each other; • Estimation of the interaction of functions received strangely. Disadvantages are as following. The results obtained using the technique can be used only in the field of this study or close to it. A correlation occurs when a series of values of a function (dependent variable) corresponds to the same value of an argument (independent variable) <ref type="bibr" target="#b23">[24]</ref>.</p><p>To construct a correlation field, we considered the definition of the concept of correlation field. The correlation field (scatter plot) is a graphical representation of the relationship between the two studied sequences <ref type="bibr" target="#b23">[24,</ref><ref type="bibr" target="#b24">25]</ref>. Thus, it is a set of points in a rectangular coordinate system, the abscissa of each of which corresponds to the value of the factor feature (x), and the ordinate -the value of the resultant feature (y) of a particular unit of observation. The number of points on the Graph corresponds to the number of observation units. The location of points on the correlation field allows you to judge the nature of the dependence, for example, linear, parabolic, hyperbolic, logistical, logarithmic, exponential, exponential, or no dependence <ref type="bibr" target="#b23">[24]</ref>.</p><p>Fig. <ref type="figure" target="#fig_6">18</ref> shows the behavior of the correlation field for queries about the python programming language for only one month for each day. From Fig. <ref type="figure" target="#fig_6">18</ref> it is seen that the nature of the dependence is linear. The dependence is described by an equation y = 1932x -17317 with a high coefficient of determination R² = 0,972.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Figure 18: The correlation field for queries about Python to days during one month</head><p>The correlation field is built from the input data (x and game) in the form of a scatter plot. Analyzing the location of points on the correlation field, we can judge the nature of the dependence, namely that it is linear. Request dates start from 2009 and are collected until 2019 inclusive, broken down by all months. The lowest number of requests for Python was one month of 2009 and increased with each passing month, indicating the language's growing popularity and increased number of users. Data from 2019 to 2021 are not collected in the network date. However, analyzing the statistics, we can predict even more significant growth in the popularity of the programming language, as there are requests for its library. That is, the data has a growing trend.</p><p>We are determining the value of the correlation coefficient. A sample correlation coefficient is used to quantify the closeness of the connection. The correlation coefficient characterizes the degree of closeness of the linear dependence. In general, when some stochastic dependence relates the X and Y values, the correlation coefficient may have a value in the range of -1 ≤ r ≤ +1 <ref type="bibr" target="#b23">[24]</ref>.</p><p>The formula for calculating the correlation coefficient is as following. The statistical scientific sources <ref type="bibr" target="#b23">[24]</ref><ref type="bibr" target="#b24">[25]</ref><ref type="bibr" target="#b25">[26]</ref><ref type="bibr" target="#b26">[27]</ref><ref type="bibr" target="#b27">[28]</ref><ref type="bibr" target="#b28">[29]</ref> are recommended to use the following expression to calculate the correlation coefficient.</p><p>(4)</p><p>The calculated correlation coefficient for queries about Python is equal to R 2 =0,98588536. It is a good correlation coefficient, and it shows that there is a dependence; it is linear and quite close.</p><p>The correlation ratio is used in cases where there are following case <ref type="bibr" target="#b23">[24]</ref><ref type="bibr" target="#b24">[25]</ref><ref type="bibr" target="#b25">[26]</ref><ref type="bibr" target="#b26">[27]</ref><ref type="bibr" target="#b27">[28]</ref><ref type="bibr" target="#b28">[29]</ref>.</p><p>• Between a pair of studied features, there is a nonlinear relationship;</p><formula xml:id="formula_1">•</formula><p>The nature of the sample data (number, density of location on the correlation field) allows their grouping on the y-axis, and secondly, the ability to calculate "individual" mathematical expectations within each grouping interval. According to the preliminary construction of the correlation field, we see that the Graph is linear, so it is impractical to calculate the correlation ratio.</p><p>To divide one of the sequences into three equal parts we divide the sequence, corresponding to the number of queries about the python in the programming language library (Table <ref type="table" target="#tab_12">5</ref>). As we can see the partition is performed so that the number of sample elements at each interval is the same, and it is equal 44. In the case of many observations, when the correlation coefficients need to be calculated sequentially for several samples, for convenience, the obtained coefficients are summarized in tables, which are called correlation matrices.</p><p>The correlation matrix is a square table where the correlation coefficient between the corresponding parameters is located at the corresponding row and column intersection <ref type="bibr" target="#b23">[24]</ref><ref type="bibr" target="#b24">[25]</ref><ref type="bibr" target="#b25">[26]</ref><ref type="bibr" target="#b26">[27]</ref><ref type="bibr" target="#b27">[28]</ref><ref type="bibr" target="#b28">[29]</ref>.</p><p>Dividing the sample into three equal parts, we build a correlation matrix (Table <ref type="table">6</ref>).</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Table 6</head><p>The correlation matrix of the queries about python 1st part 2nd part 3rd part 1st 1 2nd 0,92230619 1 3rd 0,8602376 0,86988678 1</p><p>The formula for calculating the autocorrelation coefficient is as following <ref type="bibr" target="#b23">[24]</ref><ref type="bibr" target="#b24">[25]</ref><ref type="bibr" target="#b25">[26]</ref><ref type="bibr" target="#b26">[27]</ref><ref type="bibr" target="#b27">[28]</ref><ref type="bibr" target="#b28">[29]</ref>.</p><p>(</p><formula xml:id="formula_2">)<label>5</label></formula><p>To calculate the autocorrelation coefficient according to the formula <ref type="bibr" target="#b4">(5)</ref>. We used the CORREL function. The autocorrelation coefficient for queries about Python is presented in Table <ref type="table" target="#tab_13">7</ref>. The sequence of autocorrelation coefficients of the levels of the first, second, third, etc. orders is called the autocorrelation function. The Graph of the autocorrelation function is called the correlogram <ref type="bibr" target="#b24">[25]</ref><ref type="bibr" target="#b25">[26]</ref><ref type="bibr" target="#b26">[27]</ref><ref type="bibr" target="#b27">[28]</ref><ref type="bibr" target="#b28">[29]</ref>. The correlogram for the queries about python is presented in Fig. <ref type="figure" target="#fig_16">19</ref>. The pattern of the correlogram shows that the studied series is not stationary because in the case of a stationary time series, the correlogram must decline rapidly. </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="6.2.">The cluster data analysis</head><p>To form an "object-property" table from our data, let's split the data so that the 2nd, 3rd, 4th, and 5th columns can be considered objects. The first column will then be considered a property. To calculate each of the properties, we use the standard formulas <ref type="bibr" target="#b52">[53]</ref><ref type="bibr" target="#b53">[54]</ref><ref type="bibr" target="#b54">[55]</ref><ref type="bibr" target="#b55">[56]</ref><ref type="bibr" target="#b56">[57]</ref><ref type="bibr" target="#b57">[58]</ref><ref type="bibr" target="#b58">[59]</ref><ref type="bibr" target="#b59">[60]</ref><ref type="bibr" target="#b60">[61]</ref><ref type="bibr" target="#b61">[62]</ref>. To calculate the properties in column 2016, we used only the data for queries collected from this 2016 (Table <ref type="table" target="#tab_14">8</ref>). The term "average" in the Table <ref type="table" target="#tab_14">8</ref> means the average number of queries in the NumPy library overall 12 months. Accordingly, "minimum" shows the lowest number of requests during the year (for a month), and "maximum" -the most. "Volume" -the number of lines for a given year. There are 12 of them every year, because of 12 months a year. "Fashion" is the value of a certain quantity, which occurs most often in all observations. Since the statistics on queries changed every month and there was never one repeated for at least two months, cannot talk about fashion, it is impossible to determine. "Median" is a number that divides the list of attribute values into two equal parts so that there is the same number of units on both sides. "Standard error" is the approximate standard deviation of the statistical sample. The more data points involved in calculating the mean, the smaller the standard error <ref type="bibr" target="#b62">[63]</ref><ref type="bibr" target="#b63">[64]</ref><ref type="bibr" target="#b64">[65]</ref><ref type="bibr" target="#b65">[66]</ref><ref type="bibr" target="#b66">[67]</ref><ref type="bibr" target="#b67">[68]</ref><ref type="bibr" target="#b68">[69]</ref><ref type="bibr" target="#b69">[70]</ref><ref type="bibr" target="#b70">[71]</ref><ref type="bibr" target="#b71">[72]</ref><ref type="bibr" target="#b72">[73]</ref><ref type="bibr" target="#b73">[74]</ref><ref type="bibr" target="#b74">[75]</ref><ref type="bibr" target="#b75">[76]</ref><ref type="bibr" target="#b76">[77]</ref><ref type="bibr" target="#b77">[78]</ref><ref type="bibr" target="#b78">[79]</ref>. "Standard deviation" is the deviation of all characteristic values from their average value.  It is one of the essential methods to help determine how much a particular value change <ref type="bibr" target="#b73">[74]</ref><ref type="bibr" target="#b74">[75]</ref><ref type="bibr" target="#b75">[76]</ref><ref type="bibr" target="#b76">[77]</ref><ref type="bibr" target="#b77">[78]</ref><ref type="bibr" target="#b78">[79]</ref>. The larger the standard deviation, the more comprehensive the range of changes in the values of this value "Amount" -the total number of requests to the library for twelve months for each described year. The "level of reliability" is the ability to reject the null hypothesis when it is correct. It is a good possibility of error of the first kind for this task. "Sampling variance" -allows you to measure how far random values are distributed from their average value. Larger variance values indicate more significant deviations of the values of the random variable from the center of the distribution. "Excess" is a numerical characteristic of the probability distribution of an objective random variable. The excess coefficient characterizes the "steepness," i.e., the rate of increase of the distribution curve compared to the standard curve. "Asymmetry" measures how asymmetric the distribution (skew) can be. If we talk about the opposite concept of symmetry, the distribution relative to the center on the right and left is ideal mirror images of each other. "Interval" -the interval between the extreme values of the feature in the group of units. To construct a matrix of similarities (Table <ref type="table" target="#tab_15">9</ref>) we used formula (6) by analogy with the previous Table 8 .</p><p>(6) The resulting proximity matrix (Table <ref type="table" target="#tab_15">9</ref>) is a symmetric diagonal matrix that indicates the amount of proximity between objects. Agglomerative hierarchical cluster analysis is performed based on such a matrix. The choice of integration strategy is determined by the approach. We chose the strategy of the nearest neighbor. In it, the distance between two groups is defined as the distance between the two closest elements of these groups.</p><p>After performing the cluster analysis procedure sequentially, we obtained proximity matrices for 3 (Table <ref type="table" target="#tab_16">10</ref>) and 2 clusters (Table <ref type="table" target="#tab_0">11</ref>). The cluster analysis procedure starts with the proximity matrix. In it, we determine the smallest number. It is 508047.4, located at the 1st and 3rd objects intersection. Therefore, we group the 1st and 3rd objects and create a new table. Now determine the minimum number again. This time it is at the intersection of objects (1.3) and (2). We are grouping them again. We built a table "union-node-metric" (Table <ref type="table" target="#tab_17">12</ref>). Our union-node-metric table is formed in 3 steps. In the first, there is a union of objects 1 and 3. In the second step of objects (1,3) and 2. In the third (1,3,2) and 4. According to the steps, nodes are formed, named d 5, d 6, and d 7, because there are four objects, and the next numbering begins after the 4th. And the representation of the metric is the minimum value at each stage of the construction of the table.</p><p>The constructed dendrogram for programming language libraries can help us to visualize the results of cluster analysis in the Fig. <ref type="figure" target="#fig_18">20</ref>. We construct the dendrogram of clustering several objects manually in the draft version and then implement it in a graphical environment. Indicators on the dendrogram on the left represent the metric, the bottom objects, and the top point to each node separately. Drawing horizontal lines in the plane of the dendrogram at a given height, in this case, allows you to select individual clusters.</p><p>When interpreting the results of cluster analysis, we observe 3 clusters at level 2248031, among which cluster 1 includes objects 1.3, the second cluster -only one object 2, and the third -only object 4. At level 983393,4 we observe 2 clusters, among which the first cluster includes three objects 1,3,2, and the second -only one object 4. At the level of 508047,4 we observe one cluster of all elements.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="7.">Conclusions</head><p>In this work, we learned the basic visualization methods, graphical display, and primary statistical processing of numerical data represented by a sample of time series.</p><p>We got acquainted with the main methods of highlighting the trend of the behavior of the studied indicator, which is represented by the nature of its trend, using methods of smoothing time series and presenting the results using an MS Excel spreadsheet. We also got acquainted with the methods of correlation analysis of experimental data presented by time sequences. We learned to build a correlation field, determine the value of the correlation coefficient, calculate the correlation ratio, plot autocorrelation functions, divide one of the sequences into three equal parts, build a correlation matrix for them and find multiple correlation coefficients. We also divided a given set of objects, each characterized by the same set of specific features, into separate groups using hierarchical agglomerative cluster analysis. A library rating system has been created, i.e., the most significant number of queries has been identified, and the most popular language has been identified. In ranking queries in language libraries, where the first is Python, the least popular -is spacy. The tendency of the growing popularity of all language libraries characterizes the active development of programming and, most importantly, people's interest in the work. The obtained data will allow experts to assess the decline, growth, and invariability of the popularity of languages in the recent period (2009-2019) and offer their vision of the possible development of specific programming languages.</p></div><figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_0"><head>Figure 1 :Figure 2 :</head><label>12</label><figDesc>Figure 1: Graphical data representation of queries by date in the Cartesian coordinate system</figDesc><graphic coords="4,113.04,412.68,401.34,208.50" 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>Figure 3: The diagrams of the distribution data of queries -frequency and cumulate</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_3"><head>11 FrequencyFigure 4 :</head><label>114</label><figDesc>9,11 10,09 11,07 12,05 13,03 14,01 14,11 15,09 16,07 17,05 18,03 19,01 19,The smoothed data for queries about MatLab using the smoothing interval w = 3 (a), w = 5 (b), w = 7 (c)</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_4"><head>Figure 5 :</head><label>5</label><figDesc>The smoothed data for queries about MatLab using the smoothing interval w = 9 (a), w = 11 (b), w = 13 (c) The smoothed data for queries about MatLab obtained by the smoothing data again. In Fig. 7 there are presented the smoothed data for queries about MatLab using the smoothing interval w = 5 (w = 3) (a), w = 7 (w = 5) (b). Fig. 8 shown the smoothed data for queries about MatLab for w = 9 (w = 7) (a), w = 11 (w = 9) (b), w = 13 (w = 11) (c), w = 15 (w = 13) (d) according to Kendel formulas.</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_5"><head>Figure 6 :Figure 7 :</head><label>67</label><figDesc>Figure 6: The smoothed data for queries about MatLab using the smoothing interval w = 15 according to Kendel formulas</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_6"><head>Figure 8 :</head><label>8</label><figDesc>The smoothed data for queries about MatLab using the smoothing interval w = 5 (w = 3) (a), w = 7 (w = 5) (a), w = 9 (w = 7) (a), w = 11 (w = 9) (a), w = 13 (w = 11) (a), w = 15 (w = 13) (a) according to Kendel formulas</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_8"><head>Figure 9 :Figure 10 :</head><label>910</label><figDesc>The smoothed data for queries about R using the smoothing interval w = (a), w = 5 (b), w = 7 The smoothed data for queries about R using the smoothing interval w = 9 (a), w = 11 (b), w = 13 (c) according to Pollard formulas</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_9"><head>Figure 11 :</head><label>11</label><figDesc>Figure 11: The smoothed data for queries about R using the smoothing interval w = 15 according to Pollard formulas</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_10"><head>Figure 12 :</head><label>12</label><figDesc>Fig. 13 shown the smoothed data for queries about R for w = 9 (w = 7) (a), w = 11 (w = 9) (b), w = 13 (w = 11) (c), w = 15 (w = 13) (d) according to Pollard formulas. a b The smoothed data for queries about R using the smoothing interval w = 5 (w = 3) (a), w = 7 (w = 5) (b) according to Pollard formulas</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_11"><head>Figure 13 :</head><label>13</label><figDesc>The smoothed data for queries about R using the smoothing interval w = 9 (w = 7) (a), w = 11 (w = 9) (b), w = 13 (w = 11) (c), w = 15 (w = 13) (d) according to Pollard formulas</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_12"><head>Figure 14 :</head><label>14</label><figDesc>Exponential smoothing queries about Machine Learning for а=0.1 (a), а=0.15 (b), а=0.2 (c), а=0.25 (d), а=0.3 (e)</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_13"><head>Figure 15 :</head><label>15</label><figDesc>smoothing queries about Python for w=3 (a), w=5 (b), w=7 (a), w=9 (a), w=11 (a), w=13 (a), w=15 (a) are presented in the Fig. 15-Fig. 17. a b Median smoothing queries about Python for w=3 (a), w=5(b)</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_16"><head>Figure 19 :</head><label>19</label><figDesc>Figure 19: The correlogram for queries about Python vs each lag</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_18"><head>Figure 20 :</head><label>20</label><figDesc>Figure 20: The constructed dendrogram of programming language libraries</figDesc><graphic coords="25,195.50,72.00,203.45,307.15" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_0"><head>Table 1</head><label>1</label><figDesc>The dataset structure of the programming language libraries based on StackOverflow queries</figDesc><table><row><cell></cell><cell></cell><cell></cell><cell>Stanford-</cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell>Machine-</cell></row><row><cell>month</cell><cell cols="2">NLTK spaCy</cell><cell>NLP</cell><cell>Python</cell><cell>R</cell><cell cols="3">NumPy SciPy MATLAB</cell><cell>Learning</cell></row><row><cell>09-Jan</cell><cell>0</cell><cell>0</cell><cell>0</cell><cell>631</cell><cell>8</cell><cell>6</cell><cell>2</cell><cell>19</cell><cell>8</cell></row><row><cell>09-Feb</cell><cell>1</cell><cell>0</cell><cell>0</cell><cell>633</cell><cell>9</cell><cell>7</cell><cell>3</cell><cell>27</cell><cell>4</cell></row><row><cell>…</cell><cell>…</cell><cell>…</cell><cell>…</cell><cell>…</cell><cell>…</cell><cell>…</cell><cell>…</cell><cell>…</cell><cell>…</cell></row><row><cell>19-Nov</cell><cell>72</cell><cell>79</cell><cell>14</cell><cell cols="2">23602 4883</cell><cell>1297</cell><cell>199</cell><cell>479</cell><cell>918</cell></row><row><cell>19-Dec</cell><cell>82</cell><cell>72</cell><cell>13</cell><cell cols="2">20058 4150</cell><cell>1118</cell><cell>159</cell><cell>349</cell><cell>983</cell></row></table></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_1"><head>Table 2</head><label>2</label><figDesc>The dataset structure of the programming language libraries based on Stack Overflow queries</figDesc><table><row><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell>Machi</cell></row><row><cell></cell><cell></cell><cell></cell><cell>Stan-</cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell>ne-</cell></row><row><cell></cell><cell></cell><cell></cell><cell>ford-</cell><cell></cell><cell></cell><cell></cell><cell></cell><cell>MAT-</cell><cell>Learni</cell></row><row><cell>Index</cell><cell cols="2">NLTK spaCy</cell><cell>NLP</cell><cell>Python</cell><cell>R</cell><cell>NumPy</cell><cell>SciPy</cell><cell>LAB</cell><cell>ng</cell></row><row><cell>Mean</cell><cell cols="3">42,70 11,85 25,54</cell><cell cols="3">9856,70 2411,86 514,20</cell><cell cols="3">112,45 651,68 264,40</cell></row><row><cell>Standar</cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell></row><row><cell>d Error</cell><cell>2,53</cell><cell>1,83</cell><cell>1,99</cell><cell>541,47</cell><cell>149,25</cell><cell>34,20</cell><cell>6,06</cell><cell>34,46</cell><cell>21,73</cell></row><row><cell cols="2">Median 44,50</cell><cell>0,00</cell><cell>17,50</cell><cell cols="3">9651,50 2613,50 486,00</cell><cell cols="3">130,50 581,00 154,50</cell></row><row><cell>Mode</cell><cell>0,00</cell><cell>0,00</cell><cell>0,00</cell><cell>-</cell><cell>139,00</cell><cell>6,00</cell><cell>2,00</cell><cell>99,00</cell><cell>8,00</cell></row><row><cell>Standar</cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell></row><row><cell>d</cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell></row><row><cell>Deviatio</cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell></row><row><cell>n</cell><cell cols="3">29,02 21,07 22,82</cell><cell cols="3">6221,07 1714,76 392,88</cell><cell>69,68</cell><cell cols="2">395,95 249,66</cell></row><row><cell>Sample</cell><cell>842,4</cell><cell>443,8</cell><cell></cell><cell>38701728</cell><cell>294039</cell><cell>154357,</cell><cell>4855,4</cell><cell>156776,</cell><cell>62327,</cell></row><row><cell>Variance</cell><cell>2</cell><cell>1</cell><cell>520,80</cell><cell>,16</cell><cell>9,25</cell><cell>03</cell><cell>1</cell><cell>11</cell><cell>85</cell></row><row><cell cols="2">Kurtosis -1,23</cell><cell>2,15</cell><cell>-0,79</cell><cell>-1,15</cell><cell>-1,51</cell><cell>-1,32</cell><cell>-1,33</cell><cell>-1,04</cell><cell>-0,57</cell></row><row><cell>Skewnes</cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell></row><row><cell>s</cell><cell>0,05</cell><cell>1,80</cell><cell>0,66</cell><cell>0,17</cell><cell>-0,06</cell><cell>0,22</cell><cell>-0,28</cell><cell>0,13</cell><cell>0,80</cell></row><row><cell></cell><cell>106,0</cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell></row><row><cell>Range</cell><cell>0</cell><cell cols="8">79,00 79,00 22971,00 5136,00 1306,00 227,00 1516,00 981,00</cell></row><row><cell>Minimu</cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell></row><row><cell>m</cell><cell>0,00</cell><cell>0,00</cell><cell>0,00</cell><cell>631,00</cell><cell>2,00</cell><cell>4,00</cell><cell>2,00</cell><cell>19,00</cell><cell>2,00</cell></row><row><cell>Maximu</cell><cell>106,0</cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell></row><row><cell>m</cell><cell>0</cell><cell cols="8">79,00 79,00 23602,00 5138,00 1310,00 229,00 1535,00 983,00</cell></row><row><cell></cell><cell>5637,</cell><cell>1564,</cell><cell>3371,0</cell><cell>1301085,</cell><cell>318365,</cell><cell>67875,0</cell><cell>14844,</cell><cell>86022,0</cell><cell>34901,</cell></row><row><cell>Sum</cell><cell>00</cell><cell>00</cell><cell>0</cell><cell>00</cell><cell>00</cell><cell>0</cell><cell>00</cell><cell>0</cell><cell>00</cell></row><row><cell></cell><cell>132,0</cell><cell>132,0</cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell></row><row><cell>Count</cell><cell>0</cell><cell>0</cell><cell>132,00</cell><cell>132,00</cell><cell>132,00</cell><cell>132,00</cell><cell cols="3">132,00 132,00 132,00</cell></row><row><cell>Largest</cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell></row><row><cell>(2)</cell><cell cols="9">94,00 79,00 79,00 23414,00 5117,00 1297,00 223,00 1433,00 918,00</cell></row><row><cell>Smallest</cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell></row><row><cell>(2)</cell><cell>0,00</cell><cell>0,00</cell><cell>0,00</cell><cell>633,00</cell><cell>4,00</cell><cell>6,00</cell><cell>2,00</cell><cell>24,00</cell><cell>3,00</cell></row><row><cell>Confide</cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell></row><row><cell>nce</cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell></row><row><cell>Level</cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell></row><row><cell>(95.0%)</cell><cell>5,00</cell><cell>3,63</cell><cell>3,93</cell><cell>1071,17</cell><cell>295,25</cell><cell>67,65</cell><cell>12,00</cell><cell>68,18</cell><cell>42,99</cell></row></table></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_8"><head>Table 4 .</head><label>4</label><figDesc></figDesc><table><row><cell>6000</cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell>6000</cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell></row><row><cell>5000</cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell>5000</cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell></row><row><cell>4000</cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell>4000</cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell></row><row><cell>3000</cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell>3000</cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell></row><row><cell>2000</cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell>2000</cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell></row><row><cell>1000</cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell>1000</cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell></row><row><cell>0</cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell>0</cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell></row><row><cell cols="2">1</cell><cell>10</cell><cell>19</cell><cell>28</cell><cell>37</cell><cell>46</cell><cell>55</cell><cell>64</cell><cell>73</cell><cell>82</cell><cell>91</cell><cell>100</cell><cell>109</cell><cell>118</cell><cell cols="2">127</cell><cell>1</cell><cell>10</cell><cell>19</cell><cell>28</cell><cell>37</cell><cell>46</cell><cell>55</cell><cell>64</cell><cell>73</cell><cell>82</cell><cell>91</cell><cell>100</cell><cell>109</cell><cell>118</cell><cell>127</cell></row><row><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell cols="2">w=7</cell><cell></cell><cell></cell><cell cols="4">w=9(w=7)</cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell cols="2">w=9</cell><cell></cell><cell></cell><cell cols="4">w=11(w=9)</cell><cell></cell></row><row><cell>6000</cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell>6000</cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell></row><row><cell>5000</cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell>5000</cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell></row><row><cell>4000</cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell>4000</cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell></row><row><cell>3000</cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell>3000</cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell></row><row><cell>2000</cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell>2000</cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell></row><row><cell>1000</cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell>1000</cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell></row><row><cell>0</cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell>0</cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell></row><row><cell>1</cell><cell cols="2">10</cell><cell>19</cell><cell>28</cell><cell>37</cell><cell>46</cell><cell>55</cell><cell>64</cell><cell>73</cell><cell>82</cell><cell>91</cell><cell>100</cell><cell>109</cell><cell cols="2">118</cell><cell>127</cell><cell>1</cell><cell>10</cell><cell>19</cell><cell>28</cell><cell>37</cell><cell>46</cell><cell>55</cell><cell>64</cell><cell>73</cell><cell>82</cell><cell>91</cell><cell>100</cell><cell>109</cell><cell>118</cell><cell>127</cell></row><row><cell></cell><cell></cell><cell></cell><cell></cell><cell cols="3">w=11</cell><cell></cell><cell></cell><cell cols="4">w=13(w=11)</cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell cols="3">w=13</cell><cell></cell><cell></cell><cell cols="4">w=15(w=13)</cell><cell></cell></row></table></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_10"><head>Table 4</head><label>4</label><figDesc>The correlation coefficients between the original values and the smoothed ones</figDesc><table><row><cell>Factor α</cell><cell>0.1</cell><cell>0.15</cell><cell>0.2</cell><cell>0.25</cell><cell>0.3</cell></row><row><cell cols="2">Correlation coefficient 0,958867</cell><cell>0,964152</cell><cell>0,96739</cell><cell>0,969568</cell><cell>0,971129</cell></row><row><cell>Number of correct turning points</cell><cell>26</cell><cell>32</cell><cell>38</cell><cell>38</cell><cell></cell></row></table></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_12"><head>Table 5</head><label>5</label><figDesc>The divided sequence of the queries about python in the programming language libraries into three</figDesc><table><row><cell>equal intervals</cell><cell></cell><cell></cell><cell></cell></row><row><cell></cell><cell>1st part</cell><cell>2nd part</cell><cell>3rd part</cell></row><row><cell>Interval</cell><cell>(1; 45)</cell><cell>(45; 89)</cell><cell>[89; 132]</cell></row><row><cell>Number of sample items</cell><cell>44</cell><cell>44</cell><cell>44</cell></row></table></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_13"><head>Table 7</head><label>7</label><figDesc>Multiple correlation coefficients for the queries about python</figDesc><table><row><cell>Lag</cell><cell>Autocorrelation coefficients</cell></row><row><cell>1</cell><cell>0,98701089</cell></row><row><cell>2</cell><cell>0,98096642</cell></row><row><cell>3</cell><cell>0,98308662</cell></row><row><cell>4</cell><cell>0,9783225</cell></row><row><cell>5</cell><cell>0,9783225</cell></row><row><cell>6</cell><cell>0,97742187</cell></row><row><cell>7</cell><cell>0,97709153</cell></row></table></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_14"><head>Table 8</head><label>8</label><figDesc>The Normalized table "object-property"</figDesc><table><row><cell>Index</cell><cell>2016</cell><cell>2017</cell><cell>2018</cell><cell>2019</cell></row><row><cell>Average</cell><cell>13259.25</cell><cell>16678.92</cell><cell>17191.67</cell><cell>19861.33</cell></row><row><cell>Standard error</cell><cell>0.037773</cell><cell>0.026568</cell><cell>0.037599</cell><cell>0.027778</cell></row><row><cell>Median</cell><cell>13108</cell><cell>16620</cell><cell>17334.5</cell><cell>20047.5</cell></row><row><cell>Fashion</cell><cell># N / A</cell><cell># N / A</cell><cell># N / A</cell><cell># N / A</cell></row><row><cell>Standard deviation</cell><cell>580.6382</cell><cell>1304,687</cell><cell>894.8652</cell><cell>1939,741</cell></row><row><cell>Sampling variance</cell><cell>367789.8</cell><cell>1856955</cell><cell>873582.2</cell><cell>4104650</cell></row><row><cell>Kurtosis</cell><cell>-0.63691</cell><cell>-0.25216</cell><cell>-1.25289</cell><cell>0.25504</cell></row><row><cell>Asymmetry</cell><cell>0.396782</cell><cell>0.09637</cell><cell>-0.39425</cell><cell>0.7177</cell></row><row><cell>Interval</cell><cell>328,5209</cell><cell>738.1827</cell><cell>506.3083</cell><cell>1097,492</cell></row><row><cell>Minimum</cell><cell>12424</cell><cell>14388</cell><cell>15537</cell><cell>17167</cell></row><row><cell>Maximum</cell><cell>14296</cell><cell>18935</cell><cell>18329</cell><cell>23602</cell></row><row><cell>Sum</cell><cell>159111</cell><cell>200147</cell><cell>206300</cell><cell>238336</cell></row><row><cell>Amount</cell><cell>12</cell><cell>12</cell><cell>12</cell><cell>12</cell></row><row><cell>Reliability level (95%)</cell><cell>0.083137</cell><cell>0.058476</cell><cell>0.082755</cell><cell>0.061138</cell></row></table></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_15"><head>Table 9</head><label>9</label><figDesc>The proximity matrix for four clusters</figDesc><table><row><cell>Cluster</cell><cell>1</cell><cell>2</cell><cell>3</cell><cell>4</cell></row><row><cell>1</cell><cell>0</cell><cell>1489747</cell><cell>508047.4</cell><cell>3737727</cell></row><row><cell>2</cell><cell>1489747</cell><cell>0</cell><cell>983393.4</cell><cell>2248031</cell></row><row><cell>3</cell><cell>508047.4</cell><cell>983393.4</cell><cell>0</cell><cell>3231234</cell></row><row><cell>4</cell><cell>3737727</cell><cell>2248031</cell><cell>3231234</cell><cell>0</cell></row></table></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_16"><head>Table 10 The</head><label>10</label><figDesc></figDesc><table><row><cell>proximity matrix for 3 clusters</cell><cell></cell><cell></cell><cell></cell></row><row><cell>Cluster</cell><cell>1.3</cell><cell>2</cell><cell>4</cell></row><row><cell>1.3</cell><cell>0</cell><cell>983393,4</cell><cell>3231234</cell></row><row><cell>2</cell><cell>983393,4</cell><cell>0</cell><cell>2248031</cell></row><row><cell>4</cell><cell>3231234</cell><cell>2248031</cell><cell>0</cell></row><row><cell>Table 11</cell><cell></cell><cell></cell><cell></cell></row><row><cell>The proximity matrix for 2 clusters</cell><cell></cell><cell></cell><cell></cell></row><row><cell>Cluster</cell><cell cols="2">1.3.2</cell><cell>4</cell></row><row><cell>1.3.2</cell><cell>0</cell><cell></cell><cell>2248031</cell></row><row><cell>4</cell><cell cols="2">2248031</cell><cell>0</cell></row></table></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_17"><head>Table 12</head><label>12</label><figDesc>The union-node-metric table for programming language libraries</figDesc><table><row><cell>Step</cell><cell>Association</cell><cell>Node</cell><cell>Metrics</cell></row><row><cell>1</cell><cell>1 + 3</cell><cell>d5</cell><cell>508047.4</cell></row><row><cell>2</cell><cell>1 + 3 + 2</cell><cell>d6</cell><cell>983393.4</cell></row><row><cell>3</cell><cell>1 + 3 + 2 + 4</cell><cell>d7</cell><cell>2248031</cell></row></table></figure>
		</body>
		<back>

			<div type="funding">
<div xmlns="http://www.tei-c.org/ns/1.0"><p>The structure of the dataset <ref type="bibr" target="#b23">[24]</ref> is presented in the Table <ref type="table">1</ref> and has ten fields, among which month, NLTK (Natural Language Toolkit), spaCy, Stanford-NLP, Python, R, NumPy, SciPy, MATLAB, Machine-Learning, and 132 rows for 12 years.</p></div>
			</div>

			<div type="references">

				<listBibl>

<biblStruct xml:id="b0">
	<analytic>
		<title level="a" type="main">Innovative development of human capital in the conditions of globalization</title>
		<author>
			<persName><forename type="first">O</forename><surname>Kuzmin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Bublyk</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Shakhno</surname></persName>
		</author>
		<author>
			<persName><forename type="first">O</forename><surname>Korolenko</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Lashkun</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">E3S Web of Conferences</title>
		<imprint>
			<biblScope unit="volume">166</biblScope>
			<biblScope unit="page">13011</biblScope>
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b1">
	<analytic>
		<title level="a" type="main">Forecasting the risk of cervical cancer in women in the human capital development context using machine learning</title>
		<author>
			<persName><forename type="first">I</forename><surname>Bodnar</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Bublyk</surname></persName>
		</author>
		<author>
			<persName><forename type="first">O</forename><surname>Veres</surname></persName>
		</author>
		<author>
			<persName><forename type="first">O</forename><surname>Lozynska</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Karpov</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Burov</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Kravets</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Peleshchak</surname></persName>
		</author>
		<author>
			<persName><forename type="first">O</forename><surname>Vovk</surname></persName>
		</author>
		<author>
			<persName><forename type="first">O</forename><surname>Maslak</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="s">CEUR workshop proceedings</title>
		<imprint>
			<biblScope unit="volume">2631</biblScope>
			<biblScope unit="page" from="491" to="501" />
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b2">
	<analytic>
		<title level="a" type="main">Assessing losses of human capital due to man-made pollution caused by emergencies</title>
		<author>
			<persName><forename type="first">M</forename><surname>Bublyk</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Vysotska</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Matseliukh</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Mayik</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Nashkerska</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="s">CEUR Workshop Proceedings</title>
		<imprint>
			<biblScope unit="volume">2805</biblScope>
			<biblScope unit="page" from="74" to="86" />
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b3">
	<analytic>
		<title level="a" type="main">Analysis of the demand for bicycle use in a smart city based on machine learning</title>
		<author>
			<persName><forename type="first">D</forename><surname>Koshtura</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Bublyk</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Matseliukh</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Dosyn</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Chyrun</surname></persName>
		</author>
		<author>
			<persName><forename type="first">O</forename><surname>Lozynska</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Karpov</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Peleshchak</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Maslak</surname></persName>
		</author>
		<author>
			<persName><forename type="first">O</forename><surname>Sachenko</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="s">CEUR workshop proceedings</title>
		<imprint>
			<biblScope unit="volume">2631</biblScope>
			<biblScope unit="page" from="172" to="183" />
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b4">
	<analytic>
		<title level="a" type="main">Intelligent system of passenger transportation by autopiloted electric buses in Smart City</title>
		<author>
			<persName><forename type="first">M</forename><surname>Bublyk</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Matseliukh</surname></persName>
		</author>
		<author>
			<persName><forename type="first">U</forename><surname>Motorniuk</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Terebukh</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="s">CEUR workshop proceedings</title>
		<imprint>
			<biblScope unit="volume">2604</biblScope>
			<biblScope unit="page" from="1280" to="1294" />
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b5">
	<analytic>
		<title level="a" type="main">Implementation models application for IT project risk management</title>
		<author>
			<persName><forename type="first">I</forename><surname>Rishnyak</surname></persName>
		</author>
		<author>
			<persName><forename type="first">O</forename><surname>Veres</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Lytvyn</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Bublyk</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Karpov</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Vysotska</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Panasyuk</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="s">CEUR Workshop Proceedings</title>
		<imprint>
			<biblScope unit="volume">2805</biblScope>
			<biblScope unit="page" from="102" to="117" />
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b6">
	<analytic>
		<title level="a" type="main">Methods and tools for web resources processing in e-commercial content systems</title>
		<author>
			<persName><forename type="first">V</forename><surname>Vysotska</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Berko</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Bublyk</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Chyrun</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Vysotsky</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Doroshkevych</surname></persName>
		</author>
		<idno type="DOI">10.1109/CSIT49958.2020.9321950</idno>
	</analytic>
	<monogr>
		<title level="m">Proceedings of 15th International Scientific and Technical Conference on Computer Sciences and Information Technologies, CSIT</title>
				<meeting>15th International Scientific and Technical Conference on Computer Sciences and Information Technologies, CSIT</meeting>
		<imprint>
			<date type="published" when="2020">2020</date>
			<biblScope unit="volume">1</biblScope>
			<biblScope unit="page" from="114" to="118" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b7">
	<analytic>
		<title level="a" type="main">The Ukrainian Economy Transformation into the Circular Based on Fuzzy-Logic Cluster Analysis</title>
		<author>
			<persName><forename type="first">M</forename><surname>Bublyk</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Kowalska-Styczen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Lytvyn</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Vysotska</surname></persName>
		</author>
		<idno type="DOI">10.3390/en14185951</idno>
	</analytic>
	<monogr>
		<title level="j">Energies</title>
		<imprint>
			<biblScope unit="volume">14</biblScope>
			<biblScope unit="page">5951</biblScope>
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b8">
	<analytic>
		<title level="a" type="main">Application of ontologies and meta-models for dynamic integration of weakly structured data</title>
		<author>
			<persName><forename type="first">A</forename><surname>Berko</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Pelekh</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Chyrun</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Bublyk</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Bobyk</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Matseliukh</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Chyrun</surname></persName>
		</author>
		<idno type="DOI">10.1109/DSMP47368.2020.9204321</idno>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the IEEE 3rd International Conference on Data Stream Mining and Processing</title>
				<meeting>the IEEE 3rd International Conference on Data Stream Mining and Processing</meeting>
		<imprint>
			<publisher>DSMP</publisher>
			<date type="published" when="2020">2020</date>
			<biblScope unit="page" from="432" to="437" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b9">
	<analytic>
		<title level="a" type="main">Propaganda Detection in Text Data Based on NLP and Machine Learning</title>
		<author>
			<persName><forename type="first">V.-A</forename><surname>Oliinyk</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Vysotska</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Burov</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Mykich</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Basto-Fernandes</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="s">CEUR workshop proceedings</title>
		<imprint>
			<biblScope unit="volume">2631</biblScope>
			<biblScope unit="page" from="132" to="144" />
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b10">
	<analytic>
		<title level="a" type="main">DDOS Attacks Analysis Based on Machine Learning in Challenges of Global Changes</title>
		<author>
			<persName><forename type="first">R</forename><surname>Lynnyk</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Vysotska</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Matseliukh</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Burov</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Demkiv</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Zaverbnyj</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Sachenko</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Shylinska</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Yevseyeva</surname></persName>
		</author>
		<author>
			<persName><forename type="first">O</forename><surname>Bihun</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="s">CEUR workshop proceedings</title>
		<imprint>
			<biblScope unit="volume">2631</biblScope>
			<biblScope unit="page" from="159" to="171" />
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b11">
	<analytic>
		<title level="a" type="main">Linguistic Analysis of Textual Commercial Content for Information Resources Processing</title>
		<author>
			<persName><forename type="first">V</forename><surname>Vysotska</surname></persName>
		</author>
		<idno type="DOI">10.1109/TCSET.2016.7452160</idno>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the International Conference on Modern Problems of Radio Engineering</title>
				<meeting>the International Conference on Modern Problems of Radio Engineering<address><addrLine>TCSET</addrLine></address></meeting>
		<imprint>
			<publisher>Telecommunications and Computer Science</publisher>
			<date type="published" when="2016">2016</date>
			<biblScope unit="page" from="709" to="713" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b12">
	<analytic>
		<title level="a" type="main">Technology for the Psychological Portraits Formation of Social Networks Users for the IT Specialists Recruitment Based on Big Five, NLP and Big Data Analysis</title>
		<author>
			<persName><forename type="first">V</forename><surname>Lytvyn</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Vysotska</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Rzheuskyi</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="s">CEUR Workshop Proceedings</title>
		<imprint>
			<biblScope unit="volume">2392</biblScope>
			<biblScope unit="page" from="147" to="171" />
			<date type="published" when="2019">2019</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b13">
	<analytic>
		<title level="a" type="main">Application of Sentence Parsing for Determining Keywords in Ukrainian Texts</title>
		<author>
			<persName><forename type="first">Lytvyn</forename><surname>Vasyl</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Vysotska</forename><surname>Victoria</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Dosyn</forename><surname>Dmytro</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Holoschuk</forename><surname>Roman</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Rybchak</forename><surname>Zoriana</surname></persName>
		</author>
		<idno type="DOI">10.1109/STC-CSIT.2017.8098797</idno>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the International Conference on Computer Sciences and Information Technologies</title>
				<meeting>the International Conference on Computer Sciences and Information Technologies</meeting>
		<imprint>
			<publisher>CSIT</publisher>
			<date type="published" when="2017">2017</date>
			<biblScope unit="page" from="326" to="331" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b14">
	<analytic>
		<title level="a" type="main">Ontological approach to plot analysis and modeling</title>
		<author>
			<persName><forename type="first">Y</forename><surname>Burov</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Vysotska</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Kravets</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="s">CEUR Workshop Proceedings</title>
		<imprint>
			<biblScope unit="volume">2362</biblScope>
			<biblScope unit="page" from="22" to="31" />
			<date type="published" when="2019">2019</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b15">
	<analytic>
		<title level="a" type="main">Authorship Identification of the Scientific Text in Ukrainian with Using the Lingvometry Methods</title>
		<author>
			<persName><forename type="first">V</forename><surname>Vysotska</surname></persName>
		</author>
		<author>
			<persName><forename type="first">O</forename><surname>Kanishcheva</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Hlavcheva</surname></persName>
		</author>
		<idno type="DOI">10.1109/STC-CSIT.2018.8526735</idno>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the International Conference on Computer Sciences and Information Technologies</title>
				<meeting>the International Conference on Computer Sciences and Information Technologies</meeting>
		<imprint>
			<publisher>CSIT</publisher>
			<date type="published" when="2018">2018</date>
			<biblScope unit="page" from="34" to="38" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b16">
	<analytic>
		<title level="a" type="main">Web service interaction modeling with colored petri nets</title>
		<author>
			<persName><forename type="first">A</forename><surname>Gozhyj</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Kalinina</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Gozhyj</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Vysotska</surname></persName>
		</author>
		<idno type="DOI">10.1109/IDAACS.2019.8924400</idno>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the International Conference on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications, IDAACS</title>
				<meeting>the International Conference on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications, IDAACS</meeting>
		<imprint>
			<date type="published" when="2019">2019</date>
			<biblScope unit="volume">1</biblScope>
			<biblScope unit="page" from="319" to="323" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b17">
	<analytic>
		<title level="a" type="main">Qualitative and Quantitative Characteristics Analysis for Information Security Risk Assessment in E-Commerce Systems</title>
		<author>
			<persName><forename type="first">A</forename><surname>Gozhyj</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Kalinina</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Vysotska</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Sachenko</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Kovalchuk</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="s">CEUR Workshop Proceedings</title>
		<imprint>
			<biblScope unit="volume">2762</biblScope>
			<biblScope unit="page" from="177" to="190" />
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b18">
	<analytic>
		<title level="a" type="main">Optimization model of the buses number on the route based on queueing theory in a smart city</title>
		<author>
			<persName><forename type="first">L</forename><surname>Podlesna</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Bublyk</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Grybyk</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Matseliukh</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Burov</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Kravets</surname></persName>
		</author>
		<author>
			<persName><forename type="first">O</forename><surname>Lozynska</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Karpov</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Peleshchak</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Peleshchak</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="s">CEUR workshop proceedings</title>
		<imprint>
			<biblScope unit="volume">2631</biblScope>
			<biblScope unit="page" from="502" to="515" />
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b19">
	<analytic>
		<title level="a" type="main">Research of Pareto-Optimal Schemes of Control of Availability of the Information System for Critical Use</title>
		<author>
			<persName><forename type="first">O</forename><surname>Bisikalo</surname></persName>
		</author>
		<author>
			<persName><forename type="first">O</forename><surname>Kovtun</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Kovtun</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Vysotska</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="s">CEUR Workshop Proceedings</title>
		<imprint>
			<biblScope unit="volume">2623</biblScope>
			<biblScope unit="page" from="174" to="193" />
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b20">
	<analytic>
		<title level="a" type="main">Ukrainian Participles Formation by the Generative Grammars Use</title>
		<author>
			<persName><forename type="first">V</forename><surname>Vysotska</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="s">CEUR workshop proceedings</title>
		<imprint>
			<biblScope unit="volume">2604</biblScope>
			<biblScope unit="page" from="407" to="427" />
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b21">
	<analytic>
		<title level="a" type="main">A comparative analysis for English and Ukrainian texts processing based on semantics and syntax approach</title>
		<author>
			<persName><forename type="first">V</forename><surname>Vysotska</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Holoshchuk</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Holoshchuk</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">CEUR Workshop Proceedings</title>
				<imprint>
			<date type="published" when="2021">2021</date>
			<biblScope unit="volume">2870</biblScope>
			<biblScope unit="page" from="311" to="356" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b22">
	<analytic>
		<title level="a" type="main">Real-time Ukrainian text recognition and voicing</title>
		<author>
			<persName><forename type="first">K</forename><surname>Tymoshenko</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Vysotska</surname></persName>
		</author>
		<author>
			<persName><forename type="first">O</forename><surname>Kovtun</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Holoshchuk</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Holoshchuk</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="s">CEUR Workshop Proceedings</title>
		<imprint>
			<biblScope unit="volume">2870</biblScope>
			<biblScope unit="page" from="357" to="387" />
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b23">
	<monogr>
		<ptr target="https://www.kaggle.com/aishu200023/stackindex" />
		<title level="m">Data Set</title>
				<imprint>
			<date type="published" when="2022">2022</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b24">
	<analytic>
		<title level="a" type="main">Small-batteries utilization analysis based on mathematical statistics methods in challenges of circular economy</title>
		<author>
			<persName><forename type="first">M</forename><surname>Bublyk</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Matseliukh</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="s">CEUR workshop proceedings</title>
		<imprint>
			<biblScope unit="volume">2870</biblScope>
			<biblScope unit="page" from="1594" to="1603" />
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b25">
	<monogr>
		<title level="m" type="main">Standard error</title>
		<ptr target="https://ua.nesrakonk.ru/standard-error/" />
		<imprint>
			<date type="published" when="2022">2022</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b26">
	<monogr>
		<ptr target="https://studopedia.su/10_11382_standartne-vidhilennya.html" />
		<title level="m">Standard deviation</title>
				<imprint>
			<date type="published" when="2022">2022</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b27">
	<monogr>
		<title level="m" type="main">Statistical models of marketing decisions taking into account the uncertainty factor</title>
		<ptr target="https://excel2.ru/articles/uroven-znachimosti-i-uroven-nadezhnosti-v-ms-excel" />
		<imprint>
			<date type="published" when="2022">2022</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b28">
	<monogr>
		<title level="m" type="main">Grouping of statistical data -BukLib</title>
		<ptr target="https://buklib.net/books/35946/" />
		<imprint>
			<date type="published" when="2022">2022</date>
		</imprint>
		<respStmt>
			<orgName>Library</orgName>
		</respStmt>
	</monogr>
</biblStruct>

<biblStruct xml:id="b29">
	<monogr>
		<title/>
		<author>
			<persName><forename type="first">Stack</forename><surname>Overflow</surname></persName>
		</author>
		<ptr target="https://en.wikipedia.org/wiki/Stack_Overflow" />
		<imprint>
			<date type="published" when="2022">2022</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b30">
	<monogr>
		<title level="m" type="main">StackOverflow is more than just a repository of answers to stupid questions</title>
		<ptr target="https://habr.com/ru/post/482232/" />
		<imprint>
			<date type="published" when="2022">2022</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b31">
	<monogr>
		<title/>
		<author>
			<persName><surname>Techtrend</surname></persName>
		</author>
		<ptr target="http://techtrend.com.ua/index.php?newsid=20844" />
		<imprint>
			<date type="published" when="2022">2022</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b32">
	<monogr>
		<ptr target="https://studopedia.com.ua/1_132145_grafichne-podannya-informatsii.html" />
		<title level="m">Graphic presentation of information</title>
				<imprint>
			<date type="published" when="2022">2022</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b33">
	<monogr>
		<title level="m" type="main">Construction of an interval variable sequence of continuous quantitative data</title>
		<ptr target="https://stud.com.ua/93314/statistika/pobudova_intervalnogo_variatsiynogo_ryadu_bezperernih_kilkisnih_danih" />
		<imprint>
			<date type="published" when="2022">2022</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b34">
	<monogr>
		<title level="m" type="main">Forecasting the trend of the time series by algorithmic methods</title>
		<ptr target="http://ubooks.com.ua/books/000269/inx42.php" />
		<imprint>
			<date type="published" when="2022">2022</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b35">
	<monogr>
		<title/>
		<author>
			<persName><surname>Wikideck</surname></persName>
		</author>
		<ptr target="https://wp-uk.wikideck.com/" />
		<imprint>
			<date type="published" when="2022">2022</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b36">
	<monogr>
		<title/>
		<author>
			<persName><surname>Stackoverflow</surname></persName>
		</author>
		<ptr target="https://ru.stackoverflow.com" />
		<imprint>
			<date type="published" when="2022">2022</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b37">
	<analytic>
		<title level="a" type="main">Methods for Forecasting Nonlinear Non-Stationary Processes in Machine Learning</title>
		<author>
			<persName><forename type="first">P</forename><surname>Bidyuk</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Gozhyj</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Kalinina</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Vysotska</surname></persName>
		</author>
		<idno type="DOI">10.1007/978-3-030-61656-4_32</idno>
	</analytic>
	<monogr>
		<title level="j">Communications in Computer and Information Science</title>
		<imprint>
			<biblScope unit="volume">1158</biblScope>
			<biblScope unit="page" from="470" to="485" />
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b38">
	<analytic>
		<title level="a" type="main">Forecasting Nonlinear Nonstationary Processes in Machine Learning Task</title>
		<author>
			<persName><forename type="first">P</forename><surname>Bidyuk</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Gozhyj</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Kalinina</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Vysotska</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Vasilev</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Malets</surname></persName>
		</author>
		<idno type="DOI">10.1109/DSMP47368.2020.9204077</idno>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the IEEE 3rd International Conference on Data Stream Mining and Processing</title>
				<meeting>the IEEE 3rd International Conference on Data Stream Mining and Processing</meeting>
		<imprint>
			<publisher>DSMP</publisher>
			<date type="published" when="2020">2020</date>
			<biblScope unit="page" from="28" to="32" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b39">
	<analytic>
		<title level="a" type="main">Intensity Estimation of Noise-Like Signal in Presence of Uncorrelated Pulse Interferences</title>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">B</forename><surname>Lozynskyy</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><forename type="middle">M</forename><surname>Romanyshyn</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><forename type="middle">P</forename><surname>Rusyn</surname></persName>
		</author>
		<idno type="DOI">10.3103/S0735272719050030</idno>
	</analytic>
	<monogr>
		<title level="j">Radioelectronics and Communications Systems</title>
		<imprint>
			<biblScope unit="volume">62</biblScope>
			<biblScope unit="issue">5</biblScope>
			<biblScope unit="page" from="214" to="222" />
			<date type="published" when="2019">2019</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b40">
	<analytic>
		<title level="a" type="main">Algorithm for Disclosing Artistic Concepts in the Correlation of Explicitness and Implicitness of Their Textual Manifestation</title>
		<author>
			<persName><forename type="first">N</forename><surname>Romanyshyn</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="s">CEUR Workshop Proceedings</title>
		<imprint>
			<biblScope unit="volume">2870</biblScope>
			<biblScope unit="page" from="719" to="730" />
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b41">
	<analytic>
		<title level="a" type="main">Robust Training of ADALINA Based on the Criterion of the Maximum Correntropy in the Presence of Outliers and Correlated Noise</title>
		<author>
			<persName><forename type="first">O</forename><surname>Rudenko</surname></persName>
		</author>
		<author>
			<persName><forename type="first">O</forename><surname>Bezsonov</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="s">CEUR Workshop Proceedings</title>
		<imprint>
			<biblScope unit="volume">2870</biblScope>
			<biblScope unit="page" from="1694" to="1705" />
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b42">
	<analytic>
		<title level="a" type="main">Methods of Acceleration of Term Correlation Matrix Calculation in the Island Text Clustering Method</title>
		<author>
			<persName><forename type="first">Y</forename><surname>Yusyn</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Zabolotnia</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="s">CEUR workshop proceedings</title>
		<imprint>
			<biblScope unit="volume">2604</biblScope>
			<biblScope unit="page" from="140" to="150" />
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b43">
	<analytic>
		<title level="a" type="main">A correlation method for fingerprint image recognition using spectral features</title>
		<author>
			<persName><forename type="first">B</forename><surname>Rusyn</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Ostap</surname></persName>
		</author>
		<author>
			<persName><forename type="first">O</forename><surname>Ostap</surname></persName>
		</author>
		<idno type="DOI">10.1109/TCSET.2002.1015935</idno>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the International Conference on Modern Problems of Radio Engineering, Telecommunications and Computer Science</title>
				<meeting>the International Conference on Modern Problems of Radio Engineering, Telecommunications and Computer Science<address><addrLine>TCSET</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2002">2002. 2002</date>
			<biblScope unit="page" from="219" to="220" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b44">
	<analytic>
		<title level="a" type="main">Robust Approach to Estimation of the Intensity of Noisy Signal with Additive Uncorrelated Impulse Interference</title>
		<author>
			<persName><forename type="first">A</forename><surname>Lozynskyy</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Romanyshyn</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Rusyn</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Minialo</surname></persName>
		</author>
		<idno type="DOI">10.1109/DSMP.2018.8478625</idno>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 2018 IEEE 2nd International Conference on Data Stream Mining and Processing</title>
				<meeting>the 2018 IEEE 2nd International Conference on Data Stream Mining and Processing<address><addrLine>DSMP</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2018">2018. 2018</date>
			<biblScope unit="page" from="251" to="254" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b45">
	<analytic>
		<title level="a" type="main">Comparative Analysis of Regression Regularization Methods for Life Expectancy Prediction</title>
		<author>
			<persName><forename type="first">N</forename><surname>Boyko</surname></persName>
		</author>
		<author>
			<persName><forename type="first">O</forename><surname>Moroz</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="s">CEUR Workshop Proceedings</title>
		<imprint>
			<biblScope unit="volume">2917</biblScope>
			<biblScope unit="page" from="310" to="326" />
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b46">
	<analytic>
		<title level="a" type="main">Optimization of Regression Analysis by Conducting Parallel Calculations</title>
		<author>
			<persName><forename type="first">L</forename><surname>Mochurad</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="s">CEUR Workshop Proceedings</title>
		<imprint>
			<biblScope unit="volume">2870</biblScope>
			<biblScope unit="page" from="982" to="996" />
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b47">
	<analytic>
		<title level="a" type="main">Risk Assessment Technology of Crediting with the Use of Logistic Regression Model</title>
		<author>
			<persName><forename type="first">R</forename><surname>Yurynets</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Z</forename><surname>Yurynets</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Dosyn</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Kis</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="s">CEUR Workshop Proceedings</title>
		<imprint>
			<biblScope unit="volume">2362</biblScope>
			<biblScope unit="page" from="153" to="162" />
			<date type="published" when="2019">2019</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b48">
	<analytic>
		<title level="a" type="main">Retrospective analysis by multifactor regression in the evaluation of the results of fine-needle aspiration biopsy of thyroid nodules</title>
		<author>
			<persName><forename type="first">A</forename><surname>Kucher</surname></persName>
		</author>
		<author>
			<persName><forename type="first">O</forename><surname>Boyko</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Ilkanych</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Fechan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Shakhovska</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="s">CEUR Workshop Proceedings</title>
		<imprint>
			<biblScope unit="volume">2753</biblScope>
			<biblScope unit="page" from="443" to="447" />
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b49">
	<analytic>
		<title level="a" type="main">Application of a combined approach for predicting a peptide-protein binding affinity using regulatory regression methods with advance reduction of features</title>
		<author>
			<persName><forename type="first">O</forename><surname>Murzenko</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Olszewski</surname></persName>
		</author>
		<author>
			<persName><forename type="first">O</forename><surname>Boskin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Lurie</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Savina</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Voronenko</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Lytvynenko</surname></persName>
		</author>
		<idno type="DOI">10.1109/IDAACS.2019.8924244</idno>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 10th IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications</title>
				<meeting>the 10th IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications<address><addrLine>IDAACS</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2019">2019</date>
			<biblScope unit="volume">1</biblScope>
			<biblScope unit="page">8924244</biblScope>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b50">
	<analytic>
		<title level="a" type="main">Optimally weighted cluster kriging for big data regression</title>
		<author>
			<persName><forename type="first">B</forename><surname>Van Stein</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Wang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">W</forename><surname>Kowalczyk</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Bäck</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Emmerich</surname></persName>
		</author>
		<idno type="DOI">10.1007/978-3-319-24465-5_27</idno>
	</analytic>
	<monogr>
		<title level="j">Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics</title>
		<imprint>
			<biblScope unit="volume">9385</biblScope>
			<biblScope unit="page" from="310" to="321" />
			<date type="published" when="2015">2015</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b51">
	<analytic>
		<title level="a" type="main">Price modeling of laaS providers using multiple regression [Modelagem de Preços de Provedores de IaaS Utilizando Regressão Múltipla</title>
		<author>
			<persName><forename type="first">C</forename><forename type="middle">L M</forename><surname>Belusso</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Sawicki</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Basto-Fernandes</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><forename type="middle">Z</forename><surname>Frantz</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Roos-Frantz</surname></persName>
		</author>
		<idno type="DOI">2017.10.23919/CISTI.2017.7975845</idno>
	</analytic>
	<monogr>
		<title level="m">Iberian Conference on Information Systems and Technologies</title>
				<imprint>
			<publisher>CISTI</publisher>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b52">
	<analytic>
		<title level="a" type="main">Gaming method of ontology clusterization</title>
		<author>
			<persName><forename type="first">P</forename><surname>Kravets</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Burov</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Lytvyn</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Vysotska</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Webology</title>
		<imprint>
			<biblScope unit="volume">16</biblScope>
			<biblScope unit="issue">1</biblScope>
			<biblScope unit="page" from="55" to="76" />
			<date type="published" when="2019">2019</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b53">
	<analytic>
		<title level="a" type="main">Stochastic Game Model of Data Clustering</title>
		<author>
			<persName><forename type="first">P</forename><surname>Kravets</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Burov</surname></persName>
		</author>
		<author>
			<persName><forename type="first">O</forename><surname>Oborska</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Vysotska</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Dzyubyk</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Lytvyn</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="s">CEUR Workshop Proceedings</title>
		<imprint>
			<biblScope unit="volume">2853</biblScope>
			<biblScope unit="page" from="214" to="227" />
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b54">
	<analytic>
		<title level="a" type="main">The Use of Inductive Methods to Identify Subtypes of Glioblastomas in Gene Clustering</title>
		<author>
			<persName><forename type="first">I</forename><surname>Lurie</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Lytvynenko</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Olszewski</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Voronenko</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Kornelyuk</surname></persName>
		</author>
		<author>
			<persName><forename type="first">U</forename><surname>Zhunissova</surname></persName>
		</author>
		<author>
			<persName><forename type="first">О</forename><surname>Boskin</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="s">CEUR Workshop Proceedings</title>
		<imprint>
			<biblScope unit="volume">2631</biblScope>
			<biblScope unit="page" from="406" to="418" />
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b55">
	<analytic>
		<title level="a" type="main">Adaptive Recovery of Distorted Data Based on Credibilistic Fuzzy Clustering Approach</title>
		<author>
			<persName><forename type="first">Y</forename><surname>Bodyanskiy</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Shafronenko</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Klymova</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="s">CEUR Workshop Proceedings</title>
		<imprint>
			<biblScope unit="volume">2870</biblScope>
			<biblScope unit="page" from="6" to="15" />
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b56">
	<analytic>
		<title level="a" type="main">A Method of Detecting Bot Networks Based on Graph Clustering in the Recommendation System of Social Network</title>
		<author>
			<persName><forename type="first">Y</forename><surname>Meleshko</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Yakymenko</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Semenov</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="s">CEUR Workshop Proceedings</title>
		<imprint>
			<biblScope unit="volume">2870</biblScope>
			<biblScope unit="page" from="1249" to="1261" />
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b57">
	<analytic>
		<title level="a" type="main">Comparison of Clustering Algorithms for Revenue and Cost Analysis</title>
		<author>
			<persName><forename type="first">N</forename><surname>Boyko</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Hetman</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Kots</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="s">CEUR Workshop Proceedings</title>
		<imprint>
			<biblScope unit="volume">2870</biblScope>
			<biblScope unit="page" from="1866" to="1877" />
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b58">
	<analytic>
		<title level="a" type="main">Image Segmentation Based on the Evaluation of the Tendency of Image Elements to form Clusters with the Help of Point Field Characteristics</title>
		<author>
			<persName><forename type="first">R</forename><forename type="middle">J</forename><surname>Kosarevych</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><forename type="middle">P</forename><surname>Rusyn</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><forename type="middle">V</forename><surname>Korniy</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><forename type="middle">I</forename><surname>Kerod</surname></persName>
		</author>
		<idno type="DOI">10.1007/s10559-015-9762-5</idno>
	</analytic>
	<monogr>
		<title level="j">Cybernetics and Systems Analysis</title>
		<imprint>
			<biblScope unit="volume">51</biblScope>
			<biblScope unit="issue">5</biblScope>
			<biblScope unit="page" from="704" to="713" />
			<date type="published" when="2015">2015</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b59">
	<analytic>
		<title level="a" type="main">An Evaluation of the Objective Clustering Inductive Technology Effectiveness Implemented Using Density-Based and Agglomerative Hierarchical Clustering Algorithms</title>
		<author>
			<persName><forename type="first">S</forename><surname>Babichev</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Durnyak</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Pikh</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Senkivskyy</surname></persName>
		</author>
		<idno type="DOI">10.1007/978-3-030-26474-1_37</idno>
	</analytic>
	<monogr>
		<title level="j">Advances in Intelligent Systems and Computing</title>
		<imprint>
			<biblScope unit="page" from="532" to="553" />
			<date type="published" when="1020">1020. 2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b60">
	<analytic>
		<title level="a" type="main">Criterial analysis of gene expression sequences to create the objective clustering inductive technology</title>
		<author>
			<persName><forename type="first">S</forename><surname>Babichev</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">A</forename><surname>Taif</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Lytvynenko</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Osypenko</surname></persName>
		</author>
		<idno type="DOI">10.1109/ELNANO.2017.7939756</idno>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the International Conference on Electronics and Nanotechnology</title>
				<meeting>the International Conference on Electronics and Nanotechnology</meeting>
		<imprint>
			<publisher>ELNANO</publisher>
			<date type="published" when="2017">2017</date>
			<biblScope unit="page" from="244" to="248" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b61">
	<analytic>
		<title level="a" type="main">Implementation of the objective clustering inductive technology based on DBSCAN clustering algorithm</title>
		<author>
			<persName><forename type="first">S</forename><surname>Babichev</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Lytvynenko</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Osypenko</surname></persName>
		</author>
		<idno type="DOI">10.1109/STC-CSIT.2017.8098832</idno>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 12th International Scientific and Technical Conference on Computer Sciences and Information Technologies, CSIT</title>
				<meeting>the 12th International Scientific and Technical Conference on Computer Sciences and Information Technologies, CSIT</meeting>
		<imprint>
			<date type="published" when="2017">2017</date>
			<biblScope unit="volume">1</biblScope>
			<biblScope unit="page" from="479" to="484" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b62">
	<analytic>
		<title level="a" type="main">Objective clustering inductive technology of gene expression profiles based on SOTA clustering algorithm</title>
		<author>
			<persName><forename type="first">S</forename><forename type="middle">A</forename><surname>Babichev</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Gozhyj</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">I</forename><surname>Kornelyuk</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><forename type="middle">I</forename><surname>Lytvynenko</surname></persName>
		</author>
		<idno type="DOI">10.7124/bc.000961</idno>
	</analytic>
	<monogr>
		<title level="j">Biopolymers and Cell</title>
		<imprint>
			<biblScope unit="volume">33</biblScope>
			<biblScope unit="issue">5</biblScope>
			<biblScope unit="page" from="379" to="392" />
			<date type="published" when="2017">2017</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b63">
	<analytic>
		<title level="a" type="main">Two Step Density-Based Object-Inductive Clustering Algorithm</title>
		<author>
			<persName><forename type="first">V</forename><surname>Lytvynenko</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Lurie</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Krejci</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Voronenko</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Savina</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">A</forename><surname>Taif</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="s">CEUR Workshop Proceedings</title>
		<imprint>
			<biblScope unit="volume">2386</biblScope>
			<biblScope unit="page" from="117" to="135" />
			<date type="published" when="2019">2019</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b64">
	<analytic>
		<title level="a" type="main">Multidimensional Sequence Clustering with Adaptive Iterative Dynamic Time Warping</title>
		<author>
			<persName><forename type="first">S</forename><surname>Mashtalir</surname></persName>
		</author>
		<author>
			<persName><forename type="first">O</forename><surname>Mikhnova</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Stolbovyi</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">International Journal of Computing</title>
		<imprint>
			<biblScope unit="volume">18</biblScope>
			<biblScope unit="issue">1</biblScope>
			<biblScope unit="page" from="53" to="59" />
			<date type="published" when="2019">2019</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b65">
	<analytic>
		<title level="a" type="main">4-D pattern structure features by three stages clustering algorithm for image analysis and classification</title>
		<author>
			<persName><forename type="first">R</forename><surname>Melnyk</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Tushnytskyy</surname></persName>
		</author>
		<idno type="DOI">10.1007/s10044-013-0326-x</idno>
	</analytic>
	<monogr>
		<title level="j">Pattern Analysis and Applications</title>
		<imprint>
			<biblScope unit="volume">16</biblScope>
			<biblScope unit="issue">2</biblScope>
			<biblScope unit="page" from="201" to="211" />
			<date type="published" when="2013">2013</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b66">
	<analytic>
		<title level="a" type="main">Circuit board image analysis by clustering</title>
		<author>
			<persName><forename type="first">R</forename><surname>Melnyk</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Tushnytskyy</surname></persName>
		</author>
		<idno type="DOI">10.1109/MEMSTECH.2008.4558732</idno>
	</analytic>
	<monogr>
		<title level="m">Proceeding of the 4th International Conference of Young Scientists on Perspective Technologies and Methods in MEMS Design</title>
				<meeting>eeding of the 4th International Conference of Young Scientists on Perspective Technologies and Methods in MEMS Design</meeting>
		<imprint>
			<publisher>MEMSTECH</publisher>
			<date type="published" when="2008">2008</date>
			<biblScope unit="page" from="44" to="45" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b67">
	<analytic>
		<title level="a" type="main">An improved software defect prediction algorithm using self-organizing maps combined with hierarchical clustering and data preprocessing</title>
		<author>
			<persName><forename type="first">N</forename><surname>Shakhovska</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Yakovyna</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Kryvinska</surname></persName>
		</author>
		<idno type="DOI">10.1007/978-3-030-59003-1_27</idno>
	</analytic>
	<monogr>
		<title level="j">Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</title>
		<imprint>
			<biblScope unit="volume">12391</biblScope>
			<biblScope unit="page" from="414" to="424" />
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b68">
	<analytic>
		<title level="a" type="main">Comparison Analysis of Biclustering Algorithms with the use of Artificial Data and Gene Expression Profiles</title>
		<author>
			<persName><forename type="first">S</forename><surname>Babichev</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Osypenko</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Lytvynenko</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Voronenko</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Korobchynskyi</surname></persName>
		</author>
		<idno type="DOI">10.1109/ELNANO.2018.8477439</idno>
	</analytic>
	<monogr>
		<title level="m">Proceeding of the IEEE 38th International Conference on Electronics and Nanotechnology</title>
				<meeting>eeding of the IEEE 38th International Conference on Electronics and Nanotechnology</meeting>
		<imprint>
			<publisher>ELNANO</publisher>
			<date type="published" when="2018">2018</date>
			<biblScope unit="page" from="298" to="304" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b69">
	<analytic>
		<title level="a" type="main">Gene expression sequences clustering based on the internal and external clustering quality criteria</title>
		<author>
			<persName><forename type="first">S</forename><surname>Babichev</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Krejci</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Bicanek</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Lytvynenko</surname></persName>
		</author>
		<idno type="DOI">10.1109/STC-CSIT.2017.8098744</idno>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 12th International Scientific and Technical Conference on Computer Sciences and Information Technologies, CSIT</title>
				<meeting>the 12th International Scientific and Technical Conference on Computer Sciences and Information Technologies, CSIT</meeting>
		<imprint>
			<date type="published" when="2017">2017</date>
			<biblScope unit="volume">1</biblScope>
			<biblScope unit="page" from="91" to="94" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b70">
	<analytic>
		<title level="a" type="main">Model of the objective clustering inductive technology of gene expression profiles based on SOTA and DBSCAN clustering algorithms</title>
		<author>
			<persName><forename type="first">S</forename><surname>Babichev</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Lytvynenko</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Skvor</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Fiser</surname></persName>
		</author>
		<idno type="DOI">10.1007/978-3-319-70581-1_2</idno>
	</analytic>
	<monogr>
		<title level="j">Advances in Intelligent Systems and Computing</title>
		<imprint>
			<biblScope unit="volume">689</biblScope>
			<biblScope unit="page" from="21" to="39" />
			<date type="published" when="2018">2018</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b71">
	<analytic>
		<title level="a" type="main">Features of E-Learning Realization Using Virtual Research Laboratory</title>
		<author>
			<persName><forename type="first">N</forename><surname>Shakhovska</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Vysotska</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Chyrun</surname></persName>
		</author>
		<idno type="DOI">10.1109/STC-CSIT.2016.7589891</idno>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the International Conference on Computer Sciences and Information Technologies</title>
				<meeting>the International Conference on Computer Sciences and Information Technologies</meeting>
		<imprint>
			<publisher>CSIT</publisher>
			<date type="published" when="2016">2016</date>
			<biblScope unit="page" from="143" to="148" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b72">
	<analytic>
		<title level="a" type="main">Intelligent Systems Design of Distance Learning Realization for Modern Youth Promotion and Involvement in Independent Scientific Researches</title>
		<author>
			<persName><forename type="first">N</forename><surname>Shakhovska</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Vysotska</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Chyrun</surname></persName>
		</author>
		<idno type="DOI">10.1007/978-3-319-45991-2_12</idno>
	</analytic>
	<monogr>
		<title level="j">Advances in Intelligent Systems and Computing</title>
		<imprint>
			<biblScope unit="volume">512</biblScope>
			<biblScope unit="page" from="175" to="198" />
			<date type="published" when="2017">2017</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b73">
	<analytic>
		<title level="a" type="main">Preface: Modern Machine Learning Technologies and Data Science</title>
		<author>
			<persName><forename type="first">M</forename><surname>Emmerich</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Lytvyn</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Yevseyeva</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><forename type="middle">B</forename><surname>Fernandes</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Dosyn</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Vysotska</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="s">CEUR Workshop Proceedings</title>
		<imprint>
			<biblScope unit="volume">2386</biblScope>
			<date type="published" when="2019">2019</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b74">
	<analytic>
		<title level="a" type="main">Preface: Modern Machine Learning Technologies and Data Science</title>
		<author>
			<persName><forename type="first">M</forename><surname>Emmerich</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Lytvyn</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Vysotska</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Basto-Fernandes</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Lytvynenko</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="s">CEUR Workshop Proceedings</title>
		<imprint>
			<biblScope unit="volume">2631</biblScope>
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b75">
	<analytic>
		<author>
			<persName><forename type="first">M</forename><surname>Emmerich</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Lytvyn</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Vysotska</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><forename type="middle">B</forename><surname>Fernandes</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Lytvynenko</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Preface: 3rd International Workshop on Modern Machine Learning Technologies and Data Science</title>
		<title level="s">CEUR Workshop Proceedings</title>
		<imprint>
			<date type="published" when="2021">2021</date>
			<biblScope unit="page">2917</biblScope>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b76">
	<analytic>
		<title level="a" type="main">Chebyshev Approximation by the Sum of the Polynomial and Logarithmic Expression with Hermite Interpolation</title>
		<author>
			<persName><forename type="first">P</forename><forename type="middle">S</forename><surname>Malachivskyy</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><forename type="middle">V</forename><surname>Pizyur</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><forename type="middle">A</forename><surname>Andrunyk</surname></persName>
		</author>
		<idno type="DOI">10.1007/s10559-018-0078-0</idno>
	</analytic>
	<monogr>
		<title level="j">Cybernetics and Systems Analysis</title>
		<imprint>
			<biblScope unit="volume">54</biblScope>
			<biblScope unit="issue">5</biblScope>
			<biblScope unit="page" from="765" to="770" />
			<date type="published" when="2018">2018</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b77">
	<analytic>
		<title level="a" type="main">Cluster-based Kriging approximation algorithms for complexity reduction</title>
		<author>
			<persName><forename type="first">B</forename><surname>Van Stein</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Wang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">W</forename><surname>Kowalczyk</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Emmerich</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Bäck</surname></persName>
		</author>
		<idno type="DOI">10.1007/s10489-019-01549-7</idno>
	</analytic>
	<monogr>
		<title level="j">Applied Intelligence</title>
		<imprint>
			<biblScope unit="volume">50</biblScope>
			<biblScope unit="issue">3</biblScope>
			<biblScope unit="page" from="778" to="791" />
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b78">
	<analytic>
		<title level="a" type="main">Time complexity reduction in efficient global optimization using cluster kriging</title>
		<author>
			<persName><forename type="first">H</forename><surname>Wang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Emmerich</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Van Stein</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Back</surname></persName>
		</author>
		<idno type="DOI">10.1145/3071178.3071321</idno>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 2017 Genetic and Evolutionary Computation Conference on GECCO</title>
				<meeting>the 2017 Genetic and Evolutionary Computation Conference on GECCO</meeting>
		<imprint>
			<date type="published" when="2017">2017</date>
			<biblScope unit="page" from="889" to="896" />
		</imprint>
	</monogr>
</biblStruct>

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