<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta>
      <journal-title-group>
        <journal-title>Multidimensional Sequence Clustering with Adaptive
Iterative Dynamic Time Warping. International Journal of Computing 18(1)</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.1109/ELNANO.2017.7939756</article-id>
      <title-group>
        <article-title>Intelligent Analysis of Best-Selling Books Statistics on Amazon</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Andrii Vasyliuk</string-name>
          <email>andrii.s.vasyliuk@lpnu.ua</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Yurii Matseliukh</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Taras Batiuk</string-name>
          <email>taras.batiuk.mnsa.2020@lpnu.ua</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Mykhailo Luchkevych</string-name>
          <email>luchkevychmm@gmail.com</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Iryna Shakleina</string-name>
          <email>ioshakleina@gmail.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Halyna Harbuzynska</string-name>
          <email>halyna.harbuzynska.sa.2019@lpnu.ua</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Serhii Kondratiuk</string-name>
          <email>serhii.kondratiuk.sa.2019@lpnu.ua</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ksenia Zelenska</string-name>
          <email>ksenia.zelenska.sa.2019@lpnu.ua</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Ivan Franko Drohobych State Pedagogical University</institution>
          ,
          <addr-line>I. Franko Street, 24, Drohobych, 82100</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Lviv Polytechnic National University</institution>
          ,
          <addr-line>S. Bandera Street, 12, Lviv, 79013</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2021</year>
      </pub-date>
      <volume>2851</volume>
      <fpage>366</fpage>
      <lpage>380</lpage>
      <abstract>
        <p>A data set of 550 elements was analyzed during the study, containing data on books: title, author, number of reviews, price, and rating. Smoothing methods were used to average local data for further forecasting, in which non-systematic elements replace each other. Clear graphs without sharp peaks were obtained. Based on which the methods of moving average, weighted moving average, exponential smoothing and median filtering, it was found that the books that became bestsellers in 2009-2011 did not have a high response rate. While in the following 2012 to 2019, there was an increase in the number of reviews; the average was 25,000 per book. Examining the correlation between Reviews and Prices, we found a relationship that indicates that books priced above $ 60 typically have no more than 10,000 reviews. Books priced from $ 40 to $ 60 have an average of no more than 20,000 reviews. Books up to $ 20 have different reviews, but mostly this value does not exceed 40,000, and those books that have more are the exception rather than the rule. The clustering method was applied to the 12 authors who wrote the bestsellers, and after normalizing the table and building proximity tables, we identified clusters.</p>
      </abstract>
      <kwd-group>
        <kwd>1 Cluster analysis</kwd>
        <kwd>information technologies</kwd>
        <kwd>intelligent analysis</kwd>
        <kwd>system analysis</kwd>
        <kwd>data on books</kwd>
        <kwd>best-selling books</kwd>
        <kwd>exponential smoothing</kwd>
        <kwd>median filtering</kwd>
        <kwd>data processing</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
    </sec>
    <sec id="sec-2">
      <title>2. Literature review</title>
      <p>Analysis of data on various socio-economic indicators has been conducted previously by many
scientists [6-10]. Prominent examples of public opinion research include [11-13], which studies which
book author received the highest average rating, which author wrote the most bestsellers, which book
received the most reviews, which genres became bestsellers more often how their ratings differ, etc.
[14-27]. The advantage is that the author [11] analyzed important indicators to conclude specific authors
and genres, but the disadvantage is that the author did not use smoothing methods. Also, the author [11]
identified the most popular author only based on rating, not taking into account the number of reviews.
The fact that the author [11] got rid of repetitions and cleaned the sample is an advantage and indicates
the reliability of the results and minimization of deviations. In addition, the author [11] constructed a
correlation matrix and visualized the results.</p>
      <p>Many authors [12, 13] use various methods of data visualization. Other similar results include the
works [28-30]. The authors [28, 29] conducted data research by constructing a histogram based on
rating data, reviews, prices, and a bar chart. The author [30], in turn, built histograms and pie charts and
used the method of linear regression. In addition, he built a heat map on which he reflected the
dependencies of ratings, reviews and prices. Intelligent systems are used each time in new areas [31,
32], allowing successful management decisions.</p>
    </sec>
    <sec id="sec-3">
      <title>3. Methods</title>
      <p>The histogram is constructed for simple representation of tabular data, using two axes that display
specific parameters and columns (rectangles) of the same width but different heights for visual
comparison with other columns [33-39]. This comparison allows you to understand the difference
between the selected elements simply.</p>
      <p>There are two types of time series smoothing approaches: analytical and algorithmic. Analytical is
based on assumptions, where the most striking examples may be the visual dependence of data in
various functions, such as hyperbola, exponent, parabola, etc. One of the above functions will be
suitable for a specific dependence, and the evaluation itself will be performed on this function.
However, the algorithmic approach uses other methods, such as moving averages. This method is that
at a particular time interval, the average value is chosen instead of the initial ones, respectively as if the
angles are smoothed, which can be seen visually on the graph.</p>
      <p>Smoothing with Kendall formulas is based on comparing hypotheses [40-43]. Specific indicators
are "ranked" - sorted by a certain parameter. Similarities/coincidences are determined, the sum of
coincidences is calculated according to certain formulas, and the sum of inversions is calculated. The
significance level is determined, and conclusions can be drawn from hypotheses.</p>
      <p>Exponential smoothing is used to detect trends over some time. The principle is one-parameter, i.e.,
its only parameter is the alpha, which is selected under certain conditions. The smoothing method's
result strongly depends on the smoothing parameter alpha, where the less alpha - the more smoothed
levels on the graph where we analyze them.</p>
      <p>We will use correlation analysis as one of the research methods [1, 2, 40-43]. This method is used
in various fields where statistics are used. It shows the relationship between two or more parameters.
The method can be used to conclude according to statistical data and construct statistical probabilities
in the form of diagrams for a visual understanding of the relevant dependencies.</p>
      <p>The correlation field is conditionally a graph of the dependence of the x and y axes. It is a built-in
correlation analysis, whereafter construction; you can determine the nature of the dependence, its
direction and form. It is a visual representation of the correlation, which helps assess the dependencies
of certain statistics better.</p>
    </sec>
    <sec id="sec-4">
      <title>4. Experiments</title>
      <p>At the beginning of our work, we had 550 rows of data. Our team intended to clear the data of
duplicate books, as one book could be a bestseller for several years. Still, after researching the available
information, we realized that it is necessary to keep a history for a comprehensive analysis of
antialiasing methods. That's why we decided to leave the dataset unchanged. So, we have 550 books sorted
over 11 years at the group level (Table 1). Then, we sorted the books by year and assigned the authors
an ID (Table 2).
Our dataset consists of seven columns [28-30]:
● ID - normal identifier;
● Name - the title of the book;
● Author - the author of the book;
● User rating - readers' rating, up to 5 points;
● Reviews - readers' reviews of the book;
● Price - the price of the book;
● Genre is the genre of the book.</p>
      <p>We chose only two genres: Fiction and Non-fiction. Most of the bestsellers from our dataset were
written by authors such as Stephanie Meyer, Stephen King, Rick Riordan, John Grisham, Jeff Kinney,
J.K. Rowling, George R.R. Martin, and Dav Pilkey, Bill O'Reilly. If you analyze the column User rating,
the rating ranges from 3.3 to 4.9. "The Casual Vacancy" by J.K. Rowling had the lowest rating among
our sample, but 27 books received the highest marks.</p>
      <p>The book entitled "Divine Soul Mind Body Healing and Transmission System: The Divine Way to
Heal You, Humanity, Mother Earth, and All Universes" by Zhi Gang Sha received as many as 37
reviews. It is interesting to note that the following book has the least number of reviews from the same
author. On the other hand, the book from Delia received the most reviews from Owens, entitled "Where
the Crawdads Sing», - with an incredible number - 87841.</p>
      <p>Surprisingly, the price of the book also affects its success. Thus, in our dataset, prices ranged from
$ 1 (10 books) to $ 105 ("Diagnostic and Statistical Manual of Mental Disorders, 5th Edition: DSM-5"
from the American Psychiatric Association).</p>
      <p>We had only two genres - Fiction and Non-fiction. One hundred fifty-nine books of the genre are
fiction, and one hundred eighty-six books are Non-fiction. Thus, we can say that non-fiction books
became bestsellers more often than fiction.</p>
      <p>Ivan Naratov [29], using the same dataset, identified the best authors by user rating (Fig. 1)</p>
      <sec id="sec-4-1">
        <title>After analyzing the data, we determined:</title>
        <p>● The following 13 authors have the highest rating: Nathan W. Pyle, Patrick Thorpe, Eric Carle,
Emily Winfield Martin, Chip Gaines, Jill Twiss, Rush Limbaugh, Sherri Duskey Rinker, Alice
Schertle, Pete Souza, Sarah Young, Lin-Manuel Miranda, Bill Martin Jr., Dav Pilkey. Their average
rating is 4.9. If you buy a book, you should look at these authors.
● Authors who wrote the most bestsellers: Jeff Kinney - 12 books, Rick Riordan - 10, JK Rowling
- 8, Stephenie Meyer - 7, Dav Pilkey - 6, Bill O'Reilly - 6, John Grisham - 5, EL James - 5, Suzanne
Collins - 5, Charlaine Harris - 4. These authors always have something worth reading.
● The most reviewed books are the followings: Where the Crawdads Sing - 87841 reviews, The
Girl He the Train - 79446, Becoming - 61133, Gone Girl - 57271, The Fault in Our Stars - 50482.</p>
        <p>The analysis identified which authors received the highest ratings from readers, which authors wrote
the most bestsellers, and which books received the most reader reviews.</p>
        <p>In addition, it was found that non-fiction literature is increasingly becoming a bestseller, but users
also prefer fiction, which confirms the statistically significant results obtained during testing.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Results</title>
      <p>Our team took a sample of all elements and two columns - ID and Reviews to conduct descriptive
statistics. The main type of data visualization in experimental and scientific-practical research reports
is graphs. The graph shows the relationship between two quantities, one of which is an independent
variable and its value, and the second variable is dependent and its value.</p>
      <p>On the graph "Dynamics of the indicator", we have shown the dynamics of responses to each book.
The book id is an independent variable, and the number of reviews is dependent (Fig. 2, Fig.3).</p>
      <p>In addition to the tabular and graphical representation of data, they are accompanied by their general
numerical and statistical characteristics, which relate to descriptive or descriptive statistics.</p>
      <p>
        The volume of our sample is 550. Let's start with the arithmetic mean, which measures the major
trend that reflects this sample's most characteristic value. The formula determines it [33-43]:
(
        <xref ref-type="bibr" rid="ref1">1</xref>
        )
where n is the sample size.
      </p>
      <p>Mode (denoted by "Mo") is the most common value among the variables sample.</p>
      <p>Median (denoted by "Me") is a value that bisects an ordered set of variables, i.e., to determine the
median, you need to sort the data, for example, in ascending order.</p>
      <p>The values of mean, mode and median are close to each other. They are equal in an ideal normal
distribution because they have the same meaning: the middle of the distribution.</p>
      <p>Scope (interval) - an indicator that indicates the width of the range of values. It is equal to the
difference between the maximum and minimum values.</p>
      <p>Standard deviation (σ) - is a measure of variability (variation) of the trait, which reflects the
magnitude of its variance relative to the arithmetic mean [33-43]:
,
,
where n is the sample size.</p>
      <p>For a more accurate and clear idea of the variation of the values of the indicator relative to the
average, the coefficient of variation is used [19-29]:
where σ is standard deviation.</p>
      <p>Coefficient of variation expresses the degree of variability of the sign-in per cent. Asymmetry is an
indicator that reflects the skew of the distribution relative to the fashion to the left or right. For
lefthanded or positive, asymmetry in the distribution, lower values are more common, and for right-handed
or negative - higher.</p>
      <p>Excess is an indicator that reflects the height of the distribution. In those cases, any reasons promote
the emergence of close to average values, the distribution with positive excess is formed. Suppose
extreme values dominate the distribution and, at the same time, lower and higher. In that case, such a
distribution is characterized by negative excess, and in the center of the distribution may form a
depression, which turns it into two vertices. The results of these indicators can be seen in Table 3.
So, analyzing the results (Table 3), we can say that:
● The average number of reviews for the book is 11993;
● Fashion and median are the same.
● Width of our range - scope - 87804;
● The measure of the variability of responses is the value equal to 11758, and the coefficient of
variation = 0.98, which is quite low;
● Asymmetry is equal to 2.39. Lower values are more common in the distribution, so it is
lefthanded (positive).
where k is number of intervals.</p>
      <p>
        Scott's formula is following [19-29]:
,
(
        <xref ref-type="bibr" rid="ref4">4</xref>
        )
(5)
      </p>
      <p>If the obtained data form a normal representative sample, i.e., a sample whose volume is sufficient
to determine their distribution, traditionally, to establish its type, a histogram is built. It is also a chart
that clearly shows the method of grouping data by some essential features.</p>
      <p>The most problematic in constructing a histogram is choosing the number of grouping intervals, i.e.
the number of groups divided into the sample. There are several dozen formulas for selecting or
determining the number of partition intervals, but the two most common are:</p>
      <p>Sturges’ formula is following [19-29]:
,
where h is the width of the interval, and s is the standard deviation of the values of the series.</p>
      <p>The number of intervals k is equal 10,103288 by the Sturges’ formula, and the interval width h is
equal 5022,9488 by the Scott's formula.</p>
      <p>Based on the image of the histogram, the analysis of frequencies of values is carried out for
approximation of empirical density of the law of distribution of initial data - the received histogram by
some analytical function.</p>
      <p>When constructing our histogram, based on the results according to the formulas of Sturgess and
Scott, we obtained the following histogram (Fig. 4). You can see that based on the histogram image
used - hyperbolic distribution law, hyperbolic function.</p>
    </sec>
    <sec id="sec-6">
      <title>6. Discussion</title>
      <p>Smoothing methods can be divided into two classes based on analytical and algorithmic approaches
[19-29]. In the algorithmic approach, the appearance of the trend is obtained due to various algorithms
that practically implement smoothing procedures [44-56]. These procedures provide the researcher only
with an algorithm for calculating the new value of the time series at any given time t.</p>
      <p>These methods can be classified as follows [55-78]:
● simple or ordinary moving average;
● weighted moving average;
● exponential smoothing;
● median smoothing.</p>
      <p>For these methods, we used the entire sample size in 2 categories - ID and Reviews.</p>
      <p>Smoothing, according to Kendall formulas [44], is a simple moving average when smoothing the
data, using different sizes of smoothing intervals w = 3, 5, 7, 9, 11, 13, 15, got seven consecutive
columns. After graphical construction of each smoothing interval, we obtained the following graphs
(Fig. 6-12). According to them, it can be clearly stated that the larger the interval, the smoother the
curve. Smoothed the data using the size of the smoothing interval w = 3 (Fig. 6), w = 5 (Fig. 7), w = 7
(Fig. 8), w = 9 (Fig. 9), w = 11 (Fig. 10), w = 13 (Fig. 11), w = 15 (Fig. 12).</p>
      <p>The obtained data were again smoothed, but using the size of the smoothing interval w = 5 (w = 3)
(Fig. 13). Smoothing of the obtained data was continued with a smoothing interval w = 7 (w = 5)
(Fig. 14) and until w = 15 (w = 13) (Fig. 19). Table 4 show the obtained consecutive seven columns.
After graphical construction of each smoothing interval, we obtained the following graphs (Fig. 13-19).</p>
      <p>After the results, you can see that turning points become less than individual smoothing with
sequential smoothing.</p>
      <p>Smoothing according to formulas from Pollard. Here, depending on the size of the smoothing
interval, the weight for the main level will change. Smoothing was performed in the same way as in the
previous paragraph. The result of smoothing according to Pollard's formulas is presented in Fig.20 –
Fig. 26.</p>
      <p>Therefore, comparing with the method of smoothing according to Kendall's formulas, we can say
that smoothing according to Pollard's formulas does not give such a smooth result as the previous
method, which can be seen when comparing the presented graphs. The result of smoothing according
to Pollard formulas at w = 5 (w = 3) we present in Fig.27, w = 7 (w = 5) – in Fig.28, w = 9 (w = 7) – in
Fig.29, w = 11 (w = 9) – in Fig.30, w = 13 (w = 11) – in Fig.31, w = 15 (w = 13) – in Fig.32, w = 17
(w = 15) – in Fig.33.</p>
      <p>Exponential smoothing. An essential feature of the use of exponential averages is the justification
of the value of the smoothing parameter. The smaller it is, the more the levels in the analyzed series are
smoothed. It means an increase in specific. This method of smoothing is widely used in forecasting
economic time series. The main parameter of exponential smoothing is the parameter - α, which takes
values from 0.1 to 0.3.</p>
      <p>We smoothed the same series with different values of the parameter α: 0.1, 0.15, 0.2, 0.25, 0.3. In
all these cases, we found for each smoothing the number of turning points and correlation coefficients
between the original values and the smoothed ones. The result of exponential smoothing at α = 0.1 we
present in Fig.34, at α = 0.15 – in Fig.35, at α = 0.2 – in Fig.36, at α = 0.25 – in Fig.37, at α = 0.3 – in
Fig.38.</p>
      <p>When plotting exponential smoothing graphs, we noticed that the smaller the alpha, the smoother
the graph itself. The number of turning points and the correlation coefficient for each α are shown in
Table 6.</p>
      <p>When analyzing the Table 6 of the number of turning points and correlation coefficients, we can see
that the greater the alpha - the greater the coefficient.</p>
      <p>Median smoothing. The median refers to the distributive mean, i.e., the value of the feature that
takes place in the middle of the variation series and, in contrast to the arithmetic mean, which
summarizes the indicator's value, leaves the value of the indicator that corresponds to the median.</p>
      <p>Median smoothing is as following.
● Eliminates single extreme or anomalous values of levels that are at least half the distance from
the smoothing interval;
● Maintains sharp differences in trends (moving average and exponential smoothing lubricates
them);
● Effectively eliminates single levels with very large or very small values that are random and
stand out sharply among other levels;
● When re-applying the median smoothing at a constant window interval size, the differences in
the behaviour of the levels persist as long as there are changes in the smoothed series.</p>
      <p>The main properties of the median are as follows: the number of positive deviations from the median
is equal to the number of negatives, and the sum of the absolute deviations of the sampling option
relative to the median is minimal.</p>
      <p>When working on this method, our team used the same smoothing intervals as in previous methods
(w = 3, 5, 7, 9, 11, 13, 15) which is presented in the Fig.39 - Fig.45.</p>
      <p>Correlation. We used the same sample of 100 elements in the correlation analysis [79-81] - ID and
Reviews. First, by constructing a correlation field (Fig. 46), you can visually assess the nature of the
connection.</p>
      <p>100000</p>
      <p>80000
sw60000
e
i
v
e 40000
R
20000
0
0</p>
      <p>60</p>
      <p>Price
20
40
80
100
120</p>
      <p>A sample correlation coefficient R is used to quantify the closeness of the connection. The sample
correlation coefficient R in absolute value does not exceed one. When calculating the correlation
coefficient, we obtained the following result: -0.057931 (Table 7). Graphs of autocorrelation functions
were constructed (Fig. 47).
1,2</p>
      <p>1
t 0,8
n
ie 0,6
c
i
ffe 0,4
o
C0,2</p>
      <p>0
-0,2 0
1,2</p>
      <p>1
0,8
0,6
0,4
0,2</p>
      <p>0
-0,2
2</p>
      <p>4
Lag
6
8
1
2
3
4
5
6
7</p>
      <p>We divided our 550 elements into the intervals what is shown in Table 8.</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.</p>
      <p>We built a correlation matrix for them, which is shown in Table 9.</p>
      <p>Clustering. Cluster analysis is one of the methods of multidimensional statistical analysis, i.e., data
analysis when each observation is presented not by one certain indicator but by a set of values of
different indicators [82-101]. It includes several algorithms for forming the clusters themselves and
distributing objects by clusters.</p>
      <p>Cluster analysis, first of all, solves the problem of adding structure to the data, i.e., their group
homogeneity, and provides a selection of compact, distant groups of objects, i.e., finds a "natural"
breakdown of the population in the cluster of objects. We created a table "object-property" for cluster
analysis, which is shown in Table 10.
The normalized table "object-property" shown in Table 11.</p>
      <p>They have constructed a proximity table (Table 12). For convenience, the names and surnames of
the authors were replaced by a unique number from 1 to 10.
0,000 0,439 0,520 0,927 0,787 0,327 0,530 0,316 0,556 0,703
0,439 0,000 0,837 1,071 0,904 0,627 0,559 0,560 0,696 1,063
0,520 0,837 0,000 1,362 1,180 0,249 1,043 0,334 0,882 0,961
0,927 1,071 1,362 0,000 0,864 1,229 0,587 1,233 1,029 0,615
0,787 0,904 1,180 0,864 0,000 0,970 0,516 0,932 0,360 0,746
0,327 0,627 0,249 1,229 0,970 0,000 0,836 0,095 0,659 0,882
0,530 0,559 1,043 0,587 0,516 0,836 0,000 0,801 0,551 0,694
0,316 0,560 0,334 1,233 0,932 0,095 0,801 0,000 0,609 0,917
0,556 0,696 0,882 1,029 0,360 0,659 0,551 0,609 0,000 0,787
0,703 1,063 0,961 0,615 0,746 0,882 0,694 0,917 0,787 0,000</p>
      <p>The distance between objects was measured in the Euclidean metric (Table 12). It is also called the
Euclidean distance and was calculated by the following formula.
where dE is the Euclidean distance.</p>
      <p>Carried out the association of clusters are presented in Table 13- Table 20.</p>
      <p>,</p>
      <sec id="sec-6-1">
        <title>Procedure for merging clusters is presented in Table 21. Visualization of the cluster analysis results is carried out using a dendrogram, i.e. a graphical representation of the results of sequential clustering, which is carried out in terms of the proximity matrix.</title>
        <p>Using a dendrogram, you can graphically or geometrically represent the clustering procedure,
provided that this procedure operates only with elements of the matrix of distances or similarities.</p>
        <p>Drawing horizontal lines in the plane of the dendrogram at a given height, in this case, allows you
to select individual clusters. (Fig. 48)</p>
        <p>Interpretation of the dendrogram is presented in Fig.48. Drawing horizontal lines in the plane of the
dendrogram at a given height, in this case, allows you to select individual clusters (Fig.48). Analyzing</p>
      </sec>
    </sec>
    <sec id="sec-7">
      <title>7. Conclusions</title>
      <p>A dataset of 550 elements was analyzed during the study, containing data on books: title, author,
number of reviews, price, and rating.</p>
      <p>By smoothing methods, we performed local averaging of data for another forecasting, in which
nonsystematic elements mutually replace each other. In this way, we get clear graphs without sharp peaks.
Thus, we can conclude based on the moving average, weighted moving average, exponential smoothing,
and median filtering graphs. The books that became bestsellers in 2009-2011 did not have a large
response rate, mostly no more than 20,000, while in the following 2012-2019 there is an increase in the
number of reviews. Their number often peaked at 40,000 reviews, with an average of 25,000 per book.</p>
      <p>Examining the correlation between Reviews and Prices, we found a relationship that indicates that
books priced above $ 60 typically have no more than 10,000 reviews. Books priced from $ 40 to $ 60
have an average of no more than 20,000 reviews. Books up to $ 20 have different reviews, but mostly
this value does not exceed 40,000, and those books that have more are the exception rather than the
rule.</p>
      <p>The clustering method was applied to the 12 authors who wrote the bestsellers, and after normalizing
the table and building proximity tables, we identified clusters. According to the constructed
dendrogram, groups of clusters at levels 0.4, 0.5 and 0.6 can be seen. Interestingly, the ten objects are
clustered only in the last iteration.
8. References
[5] I. Jonek-Kowalska, Towards the Reduction of CO2 Emissions. Paths of Pro-Ecological
Transformation of Energy Mixes in European Countries with an Above-Average Share of Coal in
Energy Consumption. Resources Policy, vol. 77, 2022. doi:10.1016/j.resourpol.2022.102701.
[6] M. Bublyk , A. Kowalska-Styczen , V. Lytvyn , V. Vysotska , The Ukrainian Economy
Transformation into the Circular Based he Fuzzy-Logic Cluster Analysis . Energies 2021, 14,
5951. https://doi.org/10.3390/en14185951
[7] D. Koshtura , M. Bublyk , Y. Matseliukh , D. Dosyn , L. Chyrun , O. Lozynska , I. Karpov , I.</p>
      <p>Peleshchak, M. Maslak , O. Sachenko , Analysis of the demand for bicycle use in a smart city
based he machine learning , volume Vol-2631 of CEUR workshop proceedings , 2020, pp .
172183.
[8] M. Bublyk , Y. Matseliukh , U. Motorniuk , M. Terebukh , Intelligent system of passenger
transportation by autopiloted electric buses in Smart City , volume Vol-2604 of CEUR workshop
proceedings , 2020, pp . 1280-1294.
[9] I. Bodnar, M. Bublyk, O. Veres, O. Lozynska, I. Karpov, Y. Burov, P. Kravets, I. Peleshchak, O.</p>
      <p>
        Vovk, O. Maslak, Forecasting the risk of cervical cancer in women in the human capital
development context using machine learning , volume Vol-2631 of CEUR workshop proceedings,
2020, pp . 491-501.
[10] I. Rishnyak , O. Veres , V. Lytvyn , M. Bublyk , I. Karpov , V. Vysotska , V. Panasyuk ,
Implementation models application for IT project risk management , volume Vol-2805 of CEUR
Workshop Proceedings, 2020, pp . 102-117.
[11] Amazon's books: [EDA/Plotly/hypothesis test], 2022. URL: https://www.kaggle.com/code/
ivannatarov/amazon-s-books-eda-plotly-hypothesis-test/notebook.
[12] A. Berko , I. Pelekh , L. Chyrun , M. Bublyk , I. Bobyk , Y. Matseliukh , L. Chyrun , Application
of ontologies and meta-models for dynamic integration of weakly structured data , in : Proceedings
of the 2020 IEEE 3rd International Conference he Data Stream Mining and Processing , DSMP,
2020, pp . 432-437.
[13] V. Vysotska , A. Berko , M. Bublyk , L. Chyrun , A. Vysotsky , K. Doroshkevych , Methods and
tools for web resources processing in e -commercial content systems , in : Proceedings of 15th
International Scientific and Technical Conference he Computer Sciences and Information
Technologies, CSIT, 1, 2020, pp . 114-118.
[14] D. Ivanchyshyn, V. Vysotska, S. Albota, The Film Script Generation Analysis Based on the
Fiction Book Text Using Machine Learning, in: Proceedings of the IEEE 16th International
Conference on Computer Sciences and Information Technologies (CSIT), 22-25 Sept., Lviv,
Ukraine. 2021, Vol. 2, pp. 68–80.
[15] O. Hladun, A. Berko, M. Bublyk, L. Chyrun, V. Schuchmann, Intelligent system for film script
formation based on artbook text and Big Data analysis, in: Proceedings of the IEEE 16th
International conference on computer science and information technologies on Computer science
and information technologies, Lviv, Ukraine, 22–25 September, 2021, pp. 138–146.
[16] Y. Bobalo, P. Stakhiv, B. Mandziy, N. Shakhovska, R. Holoschuk, The concept of electronic
textbook "Fundamentals of theory of electronic circuits", Przeglad Elektrotechniczny 88(3 A)
(2012) 16-18.
[17] O. Sichevska, V. Senkivskyy, S. Babichev, O. Khamula, Information technology of forming the
quality of art and technical design of books, CEUR Workshop Proceedings 2533 (2019) 45–57.
[18] N. Grabar, C. Grouin, A Year of Papers Using Biomedical Texts: Findings from the Section on
Natural Language Processing of the IMIA Yearbook, Yearbook of medical informatics 28(
        <xref ref-type="bibr" rid="ref1">1</xref>
        )
(2019) 218–222.
[19] V. Lytvyn, V. Vysotska, I. Budz, Y. Pelekh, N. Sokulska, R. Kovalchuk, L. Dzyubyk, O.
      </p>
      <p>
        Tereshchuk, M. Komar, Development of the quantitative method for automated text content
authorship attribution based on the statistical analysis of N-grams distribution, Eastern-European
Journal of Enterprise Technologies 6(
        <xref ref-type="bibr" rid="ref2 ref3 ref4">2-102</xref>
        ) (2019) 28-51. doi: 10.15587/1729-4061.2019.186834
[20] B. E. Kapustiy, B. P. Rusyn, V. A. Tayanov, Peculiarities of application of statistical detection
criteria for problems of pattern recognition, Journal of Automatioin and Inrormation Science 37(
        <xref ref-type="bibr" rid="ref2">2</xref>
        ),
(2005) 30-36.
[21] N. Lototska, Statistical Research of the Colour Component ЧОРНИЙ (BLACK) in R. Ivanychuk’s
      </p>
      <p>Text Corpus, CEUR Workshop Proceedings Vol-2870 (2021) 486-497.
[22] T. Shestakevych, Modeling the Process of Analysis of Statistical Characteristics of Student Digital</p>
      <p>Text, CEUR Workshop Proceedings Vol-2870 (2021) 657-669.
[23] A. Hadzalo, Analysis of Gender-Marked Units: Statistical Approach, CEUR workshop
proceedings Vol-2604 (2020) 462-471.
[24] I. Khomytska, V. Teslyuk, Statistical Models for Authorship Attribution, Advances in Intelligent</p>
      <p>Systems and Computing, 2019.
[25] I. Khomytska, V. Teslyuk, Authorship and Style Attribution by Statistical Methods of Style
Differentiation on the Phonological Level, Advances in Intelligent Systems and Computing 871
(2019) 105–118. doi: 10.1007/978-3-030-01069-0_8.
[26] I. Khomytska, V. Teslyuk, The Method of Statistical Analysis of the Scientific, Colloquial,
BellesLettres and Newspaper Styles on the Phonological Level. In ebook : Advances in Intelligent
Systems and Computing 512 (2016) 149–163.
[27] I. Kulchytskyi, Statistical Analysis of the Short Stories by Roman Ivanychuk, CEUR Workshop</p>
      <p>Proceedings Vol-2362 (2019) 312-321.
[28] Amazon Top 50 Bestselling Books 2009-2019, 2020. URL: https://www.kaggle.com/sootersaalu/
amazon-top-50-bestselling-books-2009-2019/tasks?taskId=2741.
[29] EDA: Amazon Top 50 Bestselling Books, 2022. URL:
https://www.kaggle.com/code/japandata509/eda-amazon-top-50-bestselling-books/notebook.
[30] Amazon Top 50 Bestselling Books 2009-2019, 2020.</p>
      <p>
        URL:https://www.kaggle.com/code/aryan27/
amazon-top-50-bestselling-books-20092019/notebook
[31] V. Lytvyn, A. Hryhorovych, V. Hryhorovych, V. Vysotska, M. Bublyk, L. Chyrun, Medical
content processing in intelligent system of district therapist, volume Vol-2753 of CEUR workshop
proceedings, 2020, pp. 415–429. http://ceur-ws.org/Vol-2753/paper29.pdf
[32] M. Baran, O. Kuzmin, M. Bublyk, V. Panasyuk, K. Lishchynska, Information system for quality
control of polyethylene production in a circular economy, volume Vol-2917 of CEUR Workshop
Proceedings, 2021, pp. 465–502. http://ceur-ws.org/Vol-2917/paper34.pdf
[33] Standard error, 2022. URL: https://ua.nesrakonk.ru/standard-error/.
[34] Standard deviation, 2022. URL: https://studopedia.su/10_11382_standartne-vidhilennya.html.
[35] Statistical models of marketing decisions taking into account the uncertainty factor, 2022. URL:
https://excel2.ru/articles/uroven-znachimosti-i-uroven-nadezhnosti-v-ms-excel.
[36] Grouping of statistical data - BukLib.net Library, 2022. URL: https://buklib.net/books/35946/
[37] Graphic presentation of information, 2022. URL:
https://studopedia.com.ua/1_132145_grafichnepodannya-informatsii.html.
[38] Construction of an interval variable sequence of continuous quantitative data, 2022. URL:
https://stud.com.ua/93314/statistika/pobudova_intervalnogo_variatsiynogo_ryadu_bezperernih_k
ilkisnih_danih.
[39] Forecasting the trend of the time series by algorithmic methods, 2022. URL:
http://ubooks.com.ua/books/000269/inx42.php.
[40] K.O. Soroka, Fundamentals of Systems Theory and Systems Analysis, Kharkiv, 2004.
[41] Yu.P. Surmin, Systems theory and system analysis, Kyiv, 2003.
[42] I.V. Stetsenko, Systems modeling, Cherkasy, 2010.
[43] S.S. Velykodnyi, Modeling of systems, Odessa, 2018.
[44] A. Agresti, Analysis of Ordinal Categorical Data, John Wiley &amp; Sons, 1984.
[45] S. Babichev, V. Lytvynenko, A. Gozhyj, M. Korobchynskyi, M. Voronenko, A fuzzy model for
gene expression profiles reducing based on the complex use of statistical criteria and Shannon
entropy, Advances in Intelligent Systems and Computing 754 (2018) 545-554.
[46] P. Bidyuk, I. Kalinina, A. Gozhyj, Methodology of constructing statistical models for nonlinear
non-stationary processes in medical diagnostic systems, CEUR Workshop Proceedings 2753 (2020)
36–45.
[47] R. Kaminskyi, N. Kunanets, A. Rzheuskyi, Mathematical support for statistical research based on
informational technologies, CEUR Workshop Proceedings 2105 (2018) 449-452.
[48] I. Gorbenko, A. Kuznetsov, Y. Gorbenko, S. Vdovenko, V. Tymchenko, M. Lutsenko, Studies on
Statistical Analysis And Performance Evaluation For Some Stream Ciphers. International Journal
of Computing 18(
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) (2019) 82-88.
[49] Y. Butelskyy, Statistical Methods to Detect Gender Peculiarities of Communication in Vkontakte
Social Network Groups, in: Proceedings of the 11th International Scientific and Technical
Conference on Computer Sciences and Information Technologies, CSIT, 2016, pp. 132-135. doi:
10.1109/STC-CSIT.2016.7589888.
[50] I. Sokolovskyy, N. Shakhovska, Statistical modeling of diffusion processes with a fractal structure,
      </p>
      <p>CEUR Workshop Proceedings 2488 (2019) 145–154.
[51] L. Chyrun, The E-Commerce Systems Modelling Based on Petri Networks, CEUR Workshop</p>
      <p>Proceedings Vol-2870 (2021) 1604-1631.
[52] O. Prokipchuk, L. Chyrun, M. Bublyk, V. Panasyuk, V. Yakimtsov, R. Kovalchuk, Intelligent
system for checking the authenticity of goods based on blockchain technology, volume Vol-2917
of CEUR Workshop Proceedings, 2021, pp. 618-665.
[53] A. Berko, V. Andrunyk, L. Chyrun, M. Sorokovskyy, O. Oborska, O. Oryshchyn, M. Luchkevych,
O. Brodovska, The Content Analysis Method for the Information Resources Formation in
Electronic Content Commerce Systems, CEUR Workshop Proceedings 2870 (2021) 1632-1651.
[54] M. Bublyk, V. Mykhailov, Y. Matseliukh, T. Pihniak, A. Selskyi, I. Grybyk, Change management
in R&amp;D-quality costs in challenges of the global economy, volume Vol-2870 of CEUR Workshop
Proceedings, 2021, pp. 1139–1151
[55] O. Bisikalo, O. Danilchuk, V. Kovtun, O. Kovtun, O. Nikitenko, V. Vysotska, Modeling of
operation of information system for critical use in the conditions of influence of a complex certain
negative factor, International Journal of Control, Automation and Systems (2022).
https://doi.org/10.1007/s12555-021-0368-6
[56] V. Kuchkovskiy, V. Andrunyk, M. Krylyshyn, L. Chyrun, A. Vysotskyi, S. Chyrun, N. Sokulska,
I. Brodovska, Application of Online Marketing Methods and SEO Technologies for Web Resources
Analysis within the Region, CEUR Workshop Proceedings Vol-2870 (2021) 1652-1693.
[57] P. Bidyuk, A. Gozhyj, I. Kalinina, V. Vysotska, Methods for Forecasting Nonlinear
NonStationary Processes in Machine Learning, Communications in Computer and Information Science
1158 (2020) 470-485. doi: 10.1007/978-3-030-61656-4_32.
[58] P. Bidyuk, A. Gozhyj, I. Kalinina, V. Vysotska, M. Vasilev, R. Malets, Forecasting Nonlinear
Nonstationary Processes in Machine Learning Task, in: Proceedings of the IEEE 3rd International
Conference on Data Stream Mining and Processing, DSMP, 2020, pp. 28-32. doi:
10.1109/DSMP47368.2020.9204077.
[59] A. Gozhyj, I. Kalinina, V. Nechakhin, V. Gozhyj, V. Vysotska, Modeling an Intelligent Solar
Power Plant Control System Using Colored Petri Nets, in: proceedings of the IEEE 11th
International Conference on Intelligent Data Acquisition and Advanced Computing Systems:
Technology and Applications (IDAACS), 22-25 Sept., Cracow, Poland, 2021, pp. 626–631.
[60] A. Gozhyj, I. Kalinina, V. Vysotska, V. Gozhyj, The method of web-resources management under
conditions of uncertainty based on fuzzy logic, in: Proceedings of the International Conference on
Computer Sciences and Information Technologies, CSIT, 2018, pp. 343-346. doi:
10.1109/STCCSIT.2018.8526761.
[61] A. Berko, Y. Matseliukh, Y. Ivaniv, L. Chyrun, V. Schuchmann, The text classification based on
Big Data analysis for keyword definition using stemming, in: proceedings of IEEE 16th
International conference on computer science and information technologies, Lviv, Ukraine, 22–25
September, 2021, pp. 184–188.
[62] A. Dyriv, V. Andrunyk, Y. Burov, I. Karpov, L. Chyrun, The user's psychological state
identification based on Big Data analysis for person's electronic diary, in: Proceedings of IEEE 16th
International conference on computer science and information technologies,Lviv, Ukraine, 22–25
September, 2021, pp. 101–112.
[63] V. Kiyko, V. Lytvyn, L. Chyrun, S. Vyshemyrska, I. Lurie, M. Hrubel, Forest cover type
classification based on environment characteristics and machine learning technology,
Communications in Computer and Information Science 1158 (2020) 501–524. doi:
10.1007/978-3030-61656-4_34.
[64] Y. Tverdokhlib, V. Andrunyk, L. Chyrun, L. Chyrun, N. Antonyuk, I. Dyyak, O. Naum, D. Uhryn,
V. Basto-Fernandes, Analysis and estimation of popular places in online tourism based on machine
learning technology, CEUR Workshop Proceedings 2631 (2020) 457–470.
[65] D. Uhryn, V. Andrunyk, L. Chyrun, N. Antonyuk, I. Dyyak, O. Naum, Service-oriented
architecture development as an integrating platform in the tourist area, CEUR Workshop
Proceedings 2631 (2020) 221–236.
[66] R. Levus, A.Berko, L. Chyrun, V. Panasyuk, M. Hrubel, Intelligent System for Arbitrage
Situations Searching in the Cryptocurrency Market, CEUR Workshop Proceedings Vol-2917
(2021) 407-440.
[67] V. Husak, L. Chyrun, Y. Matseliukh, A. Gozhyj, R. Nanivskyi, M. Luchko, Intelligent Real-Time</p>
      <p>Vehicle Tracking Information System, CEUR Workshop Proceedings Vol-2917 (2021) 666-698.
[68] A. Gozhyj, L. Chyrun, A. Kowalska-Styczen, O. Lozynska, Uniform method of operative content
management in web systems, CEUR Workshop Proceedings 2136 (2018) 62-77.
[69] L. Chyrun, Y. Burov, B. Rusyn, L. Pohreliuk, O. Oleshek, A. Gozhyj, I. Bobyk, Web resource
changes monitoring system development, CEUR Workshop Proceedings 2386 (2019) 255-273.
[70] L. Chyrun, A. Kowalska-Styczen, Y. Burov, A. Berko, A. Vasevych, I. Pelekh, Y. Ryshkovets,
Heterogeneous data with agreed content aggregation system development, volume 2386 of CEUR
Workshop Proceedings, 2019, pp. 35-54.
[71] L. Chyrun, A. Gozhyj, I. Yevseyeva, D. Dosyn, V. Tyhonov, M. Zakharchuk, Web Content</p>
      <p>Monitoring System Development, CEUR Workshop Proceedings Vol-2362 (2019) 126-142.
[72] Y. Kis, L. Chyrun, T. Tsymbaliak, L. Chyrun, Development of System for Managers Relationship
Management with Customers, Advances in Intelligent Systems and Computing 1020 (2020)
405421. doi: 10.1007 / 978-3-030-26474-1_29
[73] L. Chyrun, I. Turok, I. Dyyak, Information model of the tendering system for large projects, CEUR</p>
      <p>Workshop Proceedings 2604 (2020) 1224-1236.
[74] L. Podlesna, M. Bublyk, I. Grybyk, Y. Matseliukh, Y. Burov, P. Kravets, O. Lozynska, I. Karpov,
I. Peleshchak, R. Peleshchak, Optimization model of the buses number on the route based on
queueing theory in a Smart City, volume Vol-2631 of CEUR Workshop Proceedings, 2020, pp. 502
- 515.
[75] O. Garasym, L. Chyrun, N. Chernovol, A. Gozhyj, V. Gozhyj, I., Kalinina B., Rusyn, L. Pohreliuk,
M. Korobchynskyi, Network security analysis based on consolidated threat resources, CEUR
Workshop Proceedings 2604 (2020) 1004-1018.
[76] L. Chyrun, P. Kravets, O. Garasym, A. Gozhyj, I. Kalinina, Cryptographic information protection
algorithm selection optimization for electronic governance IT project management by the analytical
hierarchy process based on nonlinear conclusion criteria, CEUR Workshop Proceedings 2565
(2020) 205-220.
[77] I. Pelekh, A. Berko, V. Andrunyk, L. Chyrun, I. Dyyak, Design of a system for dynamic integration
of weakly structured data based on mash-up technology, in: Proceedings of the 2020 IEEE 3rd
International Conference on Data Stream Mining and Processing, DSMP, 2020, pp. 420-425. doi:
10.1109 / DSMP47368.2020.9204160.
[78] A. Berko, I. Pelekh, L. Chyrun, I. Dyyak, Information resources analysis system of dynamic
integration semi-structured data in a web environment, in: Proceedings of the 2020 IEEE 3rd
International Conference on Data Stream Mining and Processing, DSMP, 2020, pp. 414-419. doi:
10.1109 / DSMP47368.2020.9204101.
[79] N. Romanyshyn Algorithm for Disclosing Artistic Concepts in the Correlation of Explicitness and
Implicitness of Their Textual Manifestation, CEUR Workshop Proceedings Vol-2870 (2021)
719730.
[80] Y. Yusyn, T. Zabolotnia, Methods of Acceleration of Term Correlation Matrix Calculation in the</p>
      <p>Island Text Clustering Method, CEUR workshop proceedings Vol-2604 (2020) 140-150.
[81] B. Rusyn, V. Ostap, O. Ostap, A correlation method for fingerprint image recognition using
spectral features, in: Proceedings of the International Conference on Modern Problems of Radio
Engineering, Telecommunications and Computer Science, TCSET, 2002, pp. 219–220.
[82] P. Kravets, Y. Burov, V. Lytvyn, V. Vysotska, Gaming method of ontology clusterization</p>
      <p>
        Webology 16(
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) (2019) 55-76.
[83] P. Kravets, Y. Burov, O. Oborska, V. Vysotska, L. Dzyubyk, V. Lytvyn, Stochastic Game Model
of Data Clustering, CEUR Workshop Proceedings Vol-2853 (2021) 214-227.
      </p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>O.</given-names>
            <surname>Kuzmin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Bublyk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Shakhno</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Korolenko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Lashkun</surname>
          </string-name>
          ,
          <article-title>Innovative development of human capital in the conditions of globalization</article-title>
          ,
          <source>in : E3S Web of Conferences</source>
          , volume
          <volume>166</volume>
          ,
          <year>2020</year>
          ,
          <volume>13011</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>M.</given-names>
            <surname>Bublyk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Matseliukh</surname>
          </string-name>
          ,
          <article-title>Small-batteries utilization analysis based on mathematical statistics methods in challenges of circular economy</article-title>
          , volume Vol-
          <volume>2870</volume>
          <source>of CEUR Workshop Proceedings</source>
          ,
          <year>2021</year>
          , pp.
          <fpage>1594</fpage>
          -
          <lpage>1603</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>O.</given-names>
            <surname>Maslak</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Maslak</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Grishko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Hlazunova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Pererva</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Yakovenko</surname>
          </string-name>
          ,
          <article-title>Artificial Intelligence as a Key Driver of Business Operations Transformation in the Conditions of the Digital Economy</article-title>
          ,
          <source>2021 IEEE International Conference on Modern Electrical and Energy Systems (MEES)</source>
          ,
          <year>2021</year>
          , https://doi.org/10.1109/MEES52427.
          <year>2021</year>
          .
          <volume>9598744</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>M.</given-names>
            <surname>Bublyk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Vysotska</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Matseliukh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Mayik</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Nashkerska</surname>
          </string-name>
          ,
          <article-title>Assessing losses of human capital due to man-made pollution caused by emergencies</article-title>
          , volume Vol-
          <volume>2805</volume>
          <source>of CEUR Workshop Proceedings</source>
          ,
          <year>2020</year>
          , pp .
          <fpage>74</fpage>
          -
          <lpage>86</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>