<!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 />
    <article-meta>
      <title-group>
        <article-title>Nonlinear transformation of signs and the search for patterns in the data of patients with chronic lymphocytic leukemia</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Nikolay Ignatyev</string-name>
          <email>n_ignatev@rambler.ru</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ekaterina Zguralskaya</string-name>
          <email>iatu@inbox.ru</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Maria Markovtseva</string-name>
          <email>mmark7@yandex.ru</email>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>National University of Uzbekistan</institution>
          ,
          <addr-line>Tashkent</addr-line>
          ,
          <country country="UZ">Uzbekistan</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Ulyanovsk State Technical University</institution>
          ,
          <addr-line>Ulyanovsk</addr-line>
          ,
          <country country="RU">Russia</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Ulyanovsk State University</institution>
          ,
          <addr-line>Ulyanovsk</addr-line>
          ,
          <country country="RU">Russia</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2020</year>
      </pub-date>
      <fpage>333</fpage>
      <lpage>336</lpage>
      <abstract>
        <p>-The paper considers the search for logical patterns by descriptions of objects in rectifying space. The rules of hierarchical agglomerative grouping are applied for the synthesis of latent features of this space. A pair of characteristics for combining into a group is chosen according to the maximum of criterion for characteristic values decomposition into disjoint intervals. The analytical form of arithmetic expressions for calculating latent features used to detect hidden patterns in the data of patients with chronic lymphocytic leukemia (CLL) is given.</p>
      </abstract>
      <kwd-group>
        <kwd>latent features</kwd>
        <kwd>the search for logical patterns</kwd>
        <kwd>hierarchical agglomerative grouping</kwd>
        <kwd>chronic lymphocytic leukemia</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>I. INTRODUCTION</title>
      <p>The choice of space to describe objects through
nonlinear transformations of features serves as a tool to detect
latent patterns in data. When using such transformations, the
structure of relations of objects in a new (latent) feature
space changes. Quantitative estimators of the structure can
be expressed in terms of compactness of objects of a class
and the sample as a whole.</p>
      <p>Several methods are proposed for evaluating
compactness [1, 2]. In [2], connection between
dimensionality of the feature space and the generalizing
ability of recognition algorithms according to the nearest
neighbor rule is shown through the measures of
compactness of the objects of a class and the sample as a
whole. The estimator of class compactness by a quantitative
feature in [3] was calculated as an extremum of the criterion
for decomposing the feature values into disjoint intervals.</p>
      <p>For the data analysis, the numerical axis is considered as
a universal scale with relations. The universal scale was
used to study the relations between the objects of classes
according to the results of the non-linear representation of
their descriptions by the defined sets of features on the
numerical axis [4]. Since the composition of each set is
initially unknown, it was proposed to use the criterion of
decomposing the feature values into disjoint intervals for its
search.</p>
      <p>Feature sets in [4] for further synthesis of latent features
on their basis were sequentially formed according to the
rules of hierarchical agglomerative grouping. The number of
latent (groups) of features was determined upon the
grouping results. A quality of informative orderliness of
latent features makes them desirable for the analysis. This
orderliness quality provides certain advantages for finding
latent patterns in data.</p>
      <p>The implementation of nonlinear transformations of
features is considered as one of the stages of reducing the
dimension of space [2]. When deciding whether to remove
latent signs from the set, the property of their ordering is
used. One of the goals of creating space through the removal
of features is to solve the problem of retraining recognition
algorithms. As a criterion for detecting the beginning of
retraining in [2], a measure of compactness was used,
calculated by solving the problem of minimal coverage of
the sample with reference objects.</p>
      <p>To detect hidden patterns in the data, you can use a
combination of linear and nonlinear methods to reduce the
dimension of the attribute space. The software
implementation of many linear methods is presented in the
Python language library [5]. As a linear display to the
numerical axis, we consider the calculation of generalized
object estimates [6] based on sets of heterogeneous
attributes. Presentation of the results of data analysis on the
numerical axis is a means for searching and recording
logical patterns in the form of half-planes.</p>
      <p>The issues of building information models in medicine
are most often considered from the point of large or poorly
structured systems [7]. Such systems require to take into
account how various factors are connected and how they
influence the processes in the body. The study explores the
search for patterns for patients with CLL [8]. Latent
features, synthesized according to the rules of a hierarchical
agglomerative grouping, are considered to be factors
affecting the duration of the patients actual survival. Here
the results of the search for latent patterns in the data of
CLL patients by latent features and the analytical form of
arithmetic expressions (formulas) to calculate their values
are presented. There are practically no publications
describing other methods of forming an analytical
representation (formulas) for calculating the values of latent
features based on nonlinear transformations.</p>
      <p>II. PROBLEM STATEMENT AND SOLUTION METHOD
Let a set of objects E0={S1, …, Sm} be given containing
representatives of two disjoint classes K1 and K2. Objects are
described using a set of n quantitative features
X(n)=(x1,…,xn). It is considered that the operator A is given
on E0 to transform the descriptions of objects from X(n) to
Y(k), k&lt;n.</p>
    </sec>
    <sec id="sec-2">
      <title>It is required to determine:</title>
      <p>

the number of latent features in Y(k);
analytical form (equations) of arithmetic expressions
to calculate the latent feature yi∊Y(k), i=1, …, k.</p>
      <p>The analytical form of arithmetic expressions for
calculating latent features is formed on the basis of the
algorithm from [2]. The set of feature numbers in the
description of the objects E0 will be identified as I =
{1,...,n}. The rules of hierarchical agglomerative grouping
nominal feature gradation.
are applied to calculate the values of latent features. Latent
features obtained at the p-th step of the grouping are denoted
as  

, j∊I, p≥0. For p=0, |I|=n. We will divide the ordered
set of   feature values of objects from E0 into two intervals
,  2 ] and ( 2 ,  3 ], each of which is considered as a</p>
      <p>Lets  1,  2 be the number of values of the feature   , j∊I
number of the element in an ascending order
of</p>
      <p>class
intervals [</p>
      <p>Ki,
i
=
1,2,
respectively
in
the
,  2 ] and ( 2 ,  3 ] , |Ki|&gt;1, v is the serial</p>
      <p>1, … ,    , … ,   
of values</p>
      <p>of objects from
boundaries of the intervals as 
= 
E0,
which</p>
      <p>defines the
 , 
1</p>
      <p>(5)
≥ max(   ,    ) and u ≠ v,
η= η +1 while η≤n;
{

 }
 , ∈</p>
      <p>by (5);
u, v∊I}. If Φ=⍉, then go 9;</p>
      <p>Step 3: Select Φ = {</p>
      <p>|  
by Γη, η&gt;0 being the subset of feature numbers from X (n).</p>
      <p>A
step-by-step
implementation
of the
hierarchical
agglomerative grouping algorithm will be as follows:
Step 1: p=0, λc=0, η =1. Execute Γη ={η}, Marginη=–2,
Step 2: Calculate the values of the elements of the matrix
Let {

 }
 , ∈</p>
      <p>, p ≥ 0 denote the square matrix of size
(np)(n-p), whose element   value at p = 0 is defined as





 .

(∑2=1 ∑2=1   (| 3− | −  3− )) →
2| 1|| 2|

 1
max
&lt; 2
&lt; 3
the intervals [
allows to calculate the optimal value of the boundary  2 for</p>
      <p>
        The extremum of criterion (
        <xref ref-type="bibr" rid="ref2">2</xref>
        ) is used as the weight  
(0≤   ≤1) of the feature
      </p>
      <p>. When   = 1, values of the
feature   for objects from classes K1 and K2 are mutually
disjoint.</p>
      <p>, 
The value of the combination  

by a pair of features
Sr∊E0 is calculated as
( 

 ), 0≤ p &lt;n, i, j∊I, i ≠ j of the object   = {  }

 ∈
,
− 2 )/( 3
− 
1
=  
(    (</p>
      <p />
      <p>−  2 )/( 3</p>
      <p>− 
1 )) + (1− 
)
   
− 
(


1 )+     (</p>
      <p>−  2

)/( 3

),  ,  ∈  ,   ,   ,   ∈ {−1,1},  
∈ [0; 1]
−</p>
      <p>
        −
(
        <xref ref-type="bibr" rid="ref3">3</xref>
        )
where
      </p>
      <p>
        ,   are the weights of the features determined
by (
        <xref ref-type="bibr" rid="ref2">2</xref>
        ), respectively from the set of values  

, 


and their

− 2 ) on E0; the values tij, ti,
tj∊{-1,1}, ηij∊ [0;1] are selected by the extremum of the
product
functional
 ( ,  ,  ) =
min  ∈ 1  −max  ∈ 2
      </p>
      <p />
      <p>max  ∈ 0  − min  ∈ 0</p>
      <p>
        =
max  ,  ,  ∈{−1,1},  ∈[0,1]
(
        <xref ref-type="bibr" rid="ref4">4</xref>
        )
      </p>
      <p>
        The extremum of functional (
        <xref ref-type="bibr" rid="ref4">4</xref>
        ) is interpreted as the
space between objects of classes K1 and K2 by the set of
values  
for a pair of features ( 

, 
 ), 0≤ p&lt;n, i, j∊I, i≠j.
      </p>
      <p>
        In (
        <xref ref-type="bibr" rid="ref3">3</xref>
        ), valuation of features along the boundaries of
intervals calculated by (
        <xref ref-type="bibr" rid="ref2">2</xref>
        ) is applied. Due to the valuation of
features, the values
      </p>
      <p>are scale independent.
,</p>
      <p>,t ∊I |   = λn and s&lt;t}. Define a pair {i, j}, i&lt;j as
Step 4: Calculate 
= max  ∈Φ  . Select ∆ ={(s, t),s</p>
      <p>{ ,  } = {{ ,  }, ( ,  ) ∈△</p>
      <p>△, |△| = 1,
 ( ,  ,  ) &gt;</p>
      <p>max
( , )∈△∖( , )
 ( ,  ,  );
go to 3;
object   = {</p>
      <p>Step 5: If λn&gt; λc or λn = λc and Margini &lt; φ(p, i, j), then
Γi =Γi ⋃ Γj, Γj =⍉, Margini = φ(p, i, j), go to 7;
Step 6: Display feature numbers from Γi, Γi =⍉, I=I\{i},
Step 7: p = p+1,</p>
      <p>I=I\max(i,j), k=min(i,j), λc = λn.</p>
      <p>Replace the values of the features in the description of the
 −1}</p>
      <p>∈
 

, r = 1, …, m with
= { 
 −1,  ∈  ∖ { },</p>
      <p>
        ,  =  ;
Step 8: For each pair (u, v), u, v∊I determine the value



= {

(
        <xref ref-type="bibr" rid="ref9">9</xref>
        )

 −1,  ∈  { },  ∈  ,
{ 

}

 =1
,  =  ,  ∈  .
      </p>
      <p>If n-p&gt; 1, then go to 3;</p>
    </sec>
    <sec id="sec-3">
      <title>Step 9: The end.</title>
      <p>When implementing the algorithm described above, in
order to form the analytical representation of arithmetic
expressions the parameter values were used.</p>
      <p>
        For example, here is the value η ∊ {0, 1} in (
        <xref ref-type="bibr" rid="ref3">3</xref>
        ). Then, in
the analytical representation of arithmetic expressions, a
linear or nonlinear parts are written while calculating the
latent feature by (
        <xref ref-type="bibr" rid="ref3">3</xref>
        ).
      </p>
      <p>If two or more nominal features are used to describe
admissible objects, then latent quantitative features can be
obtained based on combinations of their gradation [6]. The
values of such latent features are calculated as generalized
estimator of objects. The purpose of using generalized
estimator is to abandon the point estimator of objects
obtained on the basis of expert subjective criteria.</p>
      <p>Let us consider one of the methods for calculating
generalized estimates of objects using a set of latent
attributes</p>
      <p>Y(k)=(y1,…,yk), k
&lt;n.</p>
      <p>Let</p>
      <p>
        V={vi}i∊{1,…,k}
and
F={[ci1,ci2], (ci2,ci3]}i∊{1,…,k}, respectively, the set of weights
y1=1.2572*((0.1203*x0 – 0.2442*x1 – 0.5339*x2) –
The sequence of formation of the first latent feature from
and the set of boundaries of the intervals calculated from (
        <xref ref-type="bibr" rid="ref2">2</xref>
        )
on Y(k). We will form a new feature space for describing
objects in the nominal scale of measurements by gradations
from {1, 2}. Depending on the values of latent features of
the objects belonging to one of two disjoint intervals from
F, a gradation is written in the new space 1 or 2. The
contribution of the attribute yd∊Y(k) to the generalized
estimate by the gradation j∈{1, 2} and the weight vd∊V is
defined as
  ( ) =   (
 1
| 1|
−
 2 ),
| 2|
where  1 ,  2 is the number of gradation values j of the
attribute yd, respectively, in classes K1 and
K2. The
generalized estimate of the object Sr∈E0 according to its
description in the nominal measurement scale Sr=(ar1,…,ark)
and contributions (
        <xref ref-type="bibr" rid="ref6">6</xref>
        ) is calculated as
      </p>
      <p>(  ) = ∑ =1   (  ).</p>
      <p>
        III. COMPUTATION EXPERIMENT
(
        <xref ref-type="bibr" rid="ref6">6</xref>
        )
(
        <xref ref-type="bibr" rid="ref7">7</xref>
        )
total bilirubin, indirect bilirubin, glucose, urea, and the
glomerular filtration rate (GFR) was calculated using the
MDRD formula: GFR=186*{[serum creatinine (plasma) +
88.4] -1.154}*age-0.0203.
      </p>
      <p>Additionally, the
number of
chemotherapy courses performed and the actual survival
rate in months were recorded. Patients with HIV infection
and other oncological conditions were excluded from the
study.</p>
      <p>By gender, two data samples were generated. The
sample of these male patients consisted of 60 objects (64.6 ±
9.0 years old), female of 63 objects (67.0 ± 8.4 years old).
The objects of each sample were divided into two disjoint
classes K1 (actual survival rate is less than the prognosed
overall survival) and K2 (actual survival rate is greater than
or equal to the prognosed overall survival).</p>
      <p>The strongest patterns were obtained on the
male
patients data. Classes K1 and K2 were represented by 36 and
24 objects respectively. Based on the results of computation
experiments on two sets (identified as the first and second)
of the initial features, nonlinear combinations were obtained
to completely separate the objects of two classes. In the
second set, there</p>
      <p>
        was a feature of comorbidity index
missing. The complete separability of classes is confirmed
by the value of criterion (
        <xref ref-type="bibr" rid="ref2">2</xref>
        ), equal to 1.
      </p>
      <p>Here below the sequence of formation of the first two
latent features for each of the two sets of initial features is</p>
      <p>
        The sequence of formation of the first latent feature from
given.
the first set:
x0=0.1428*(comorbidity index – 4.0);
x1=0.0175*(GFR – 76.0);
x2=1.9463*(x0*x1 + 0.01);
x0=0.0243*(age – 63.0);
x1=0.0175*(GFR – 76.0);
the result (
        <xref ref-type="bibr" rid="ref2">2</xref>
        ) of decomposing the descriptions of the sample
objects according to the feature y2 into two intervals [c1; c2]
( c2; c3] as (c2 + b)/2, where b is the value closest to c2 from
(
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) and b &gt; c2.
      </p>
      <p>There is a functional dependence of GFR on age and
creatinine value depending on gender. Determination of the
points needed to calculate the comorbidity index demands
additional effort from a user to collect data from patients.
For practical reasons, the use of the second option (without
the comorbidity index) for calculating the latent feature
looks
preferable for the
prognosis. To
prognoses the
patient’s survival potential, it will be enough for the user to
set the values of measurable indicators - age and creatinine.</p>
      <p>
        The values of the first two latent features in [4] are
recommended to be used for visual representation of objects
on the plane. Recommendations are based on the analysis of
the results of breaking into disjoint groups of descriptions of
class objects in R2. Another argument when choosing the
first two latent features for visualization is their values
according to criterion (
        <xref ref-type="bibr" rid="ref2">2</xref>
        ). In the table 1 demonstrates the
existence of a relationship between the number of the latent
feature and its value according to (
        <xref ref-type="bibr" rid="ref2">2</xref>
        ) for female patients.
values of generalized estimates into two intervals according
to (
        <xref ref-type="bibr" rid="ref2">2</xref>
        ).A visual representation of objects (female patients) by
the first two latent features is shown in “Fig. 1”.
      </p>
      <p>
        Anomalous deviations in class objects can be visually
detected by their latent attribute values [11]. The probability
of such deviations is indicated by values (
        <xref ref-type="bibr" rid="ref2">2</xref>
        ) less than 1 for
all latent features from the table 1. In the interpretation of
latent features obtained by the algorithmic method, the
concept of “the set of permissible values” is not used.
      </p>
    </sec>
    <sec id="sec-4">
      <title>IV. CONCLUSION</title>
      <p>The search for hidden patterns in the data of CLL
patients is described. The algorithm to generate the
analytical representation of arithmetic expressions for
calculating the values of latent features is given. The
prognosis of the deviation of the actual survival rate of male
patients towards either decreasing or increasing from overall
survival is determined by a logical regularity in the form of
half-planes. The forecast of deviation of the actual terms of
survival of patients in the direction of decreasing or
increasing from the terms of overall survival is determined
by logical patterns in the form of half-planes. The found
patterns can be recommended for use in specialized medical
institutions.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>N.G.</given-names>
            <surname>Zagoruyko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.A.</given-names>
            <surname>Kutnenko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.O.</given-names>
            <surname>Zyryanov</surname>
          </string-name>
          and
          <string-name>
            <given-names>D.A.</given-names>
            <surname>Levanov</surname>
          </string-name>
          , “
          <article-title>Pattern recognition training without retraining</article-title>
          ,
          <source>” Machine Learning and Data Analysis</source>
          , vol.
          <volume>1</volume>
          , no.
          <issue>7</issue>
          , pp.
          <fpage>891</fpage>
          -
          <lpage>901</lpage>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>N.A.</given-names>
            <surname>Ignatyev</surname>
          </string-name>
          , “
          <article-title>Structure Choice for Relations between Objects in Metric Classification Algorithms,” Pattern Recognition and Image Analysis</article-title>
          , vol.
          <volume>28</volume>
          , pp.
          <fpage>590</fpage>
          -
          <lpage>597</lpage>
          ,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>E.N.</given-names>
            <surname>Zguralskaya</surname>
          </string-name>
          , “
          <article-title>Analysis of the structure of the relationship between the descriptions of objects of classes and evaluation of their compactness</article-title>
          ,
          <source>” CEUR Workshop Proceedings</source>
          , vol.
          <volume>2416</volume>
          , pp.
          <fpage>283</fpage>
          -
          <lpage>289</lpage>
          ,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>D.Y.</given-names>
            <surname>Saidov</surname>
          </string-name>
          , “
          <article-title>Data visualization and its proof by compactness criterion of objects of classes</article-title>
          ,”
          <source>International Journal of Intelligent Systems and Applications</source>
          , vol.
          <volume>9</volume>
          , no.
          <issue>8</issue>
          . pp.
          <fpage>51</fpage>
          -
          <lpage>58</lpage>
          ,
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          <string-name>
            <given-names>M.</given-names>
            <surname>Andreas</surname>
          </string-name>
          and G. Sarah, “
          <article-title>Introduction to machine learning using Python,” Data Professionals Guide</article-title>
          , SPb: Alpha Book,
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>N.A.</given-names>
            <surname>Ignat</surname>
          </string-name>
          <article-title>'ev, “Computing generalized parameters and data mining,” Automation and Remote Control</article-title>
          , vol.
          <volume>72</volume>
          , no.
          <issue>5</issue>
          , pp.
          <fpage>1068</fpage>
          -
          <lpage>1074</lpage>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>K.</given-names>
            <surname>Cresswell</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Callaghan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Khan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Mozaffar</surname>
          </string-name>
          and
          <string-name>
            <given-names>A.</given-names>
            <surname>Sheikh</surname>
          </string-name>
          , “
          <article-title>Investigating the use of data-driven artificial intelligence in computerised decision support systems for health and social care: A systematic review</article-title>
          ,
          <source>” Health Informatics Journal</source>
          , vol.
          <volume>26</volume>
          , no.
          <issue>3</issue>
          . pp.
          <fpage>2138</fpage>
          -
          <lpage>2147</lpage>
          ,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>A.K.</given-names>
            <surname>Nikitina</surname>
          </string-name>
          and
          <string-name>
            <given-names>N.O.</given-names>
            <surname>Sarajeva</surname>
          </string-name>
          , “
          <article-title>Treatment efficacy and survival of patients with chronic lymphatic leukemia depending on renal function,” Trans-Baikal Med</article-title>
          . Bulletin, no.
          <issue>4</issue>
          , pp.
          <fpage>122</fpage>
          -
          <lpage>127</lpage>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>J.L.</given-names>
            <surname>Binet</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Auquier</surname>
          </string-name>
          and G. Dighierol, “
          <article-title>A new prognostic classification of chronic lymphocytic leukemia derived from a multivariate survival analysis</article-title>
          ,
          <source>” Cancer</source>
          , vol.
          <volume>48</volume>
          , pp.
          <fpage>198</fpage>
          -
          <lpage>206</lpage>
          ,
          <year>1981</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>K.R.</given-names>
            <surname>Rai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Sawitsky</surname>
          </string-name>
          and
          <string-name>
            <given-names>E.P.</given-names>
            <surname>Cronkite</surname>
          </string-name>
          , “
          <article-title>Clinical staging of chronic lymphocytic leukemia</article-title>
          ,” Blood, no.
          <issue>46</issue>
          , pp.
          <fpage>219</fpage>
          -
          <lpage>234</lpage>
          ,
          <year>1975</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>D.V.</given-names>
            <surname>Semenova</surname>
          </string-name>
          and
          <string-name>
            <given-names>E.E.</given-names>
            <surname>Goldenok</surname>
          </string-name>
          , “
          <article-title>The method of generalized assessments on the example of diagnosing the severity of the course of acute pancreatitis,” Materials of the XVIII International Conf</article-title>
          . ITMM, Tomsk, vol.
          <volume>1</volume>
          , pp.
          <fpage>152</fpage>
          -
          <lpage>157</lpage>
          ,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>