<!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>Application of the Committee Machine Method to Forecast an Increase in the USD/RUB Exchange Rate Volatility</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Akberdina Viktoria Viktorovna</string-name>
          <email>akb_vic@mail.ru</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Chernavin Nikolai Pavlovich</string-name>
          <email>ch_k@mail.ru</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Chernavin Fedor Pavlovich</string-name>
          <email>chernavin_fedor@mail.ru</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>The Institute of Economics at the, Russian Academy of Science</institution>
          ,
          <addr-line>Yekaterinburg, Russian Federation</addr-line>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Yekaterinburg</institution>
          ,
          <addr-line>Russian Federation</addr-line>
        </aff>
      </contrib-group>
      <abstract>
        <p>In the article is studied problems of the committee machine method application to forecast weeks, in which there is a high possibility of an increase in the USD/RUB exchange rate volatility. All calculations were done on a data from financial markets for the period of April 2009 till September 2018.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>Introduction</p>
      <p>As a part of the trading technologies there are many strategies based on the different
forecasting methods. To use any method first of all there is a need to define what is predicted.</p>
      <p>Description of the research problem and applied forecasting method</p>
      <p>In terms of trading activities, it is commonly known that to earn money there must be
predicted direction in which prices on a certain financial instrument will move. But this is only
part of the truth, because by using of option strategies it is possible to earn just by a correct
prediction of a price movement power (volutility) with no difference if it would be downward or
upward.</p>
      <p>As part of option strategies traders need to forecast an increase in the volatility by some
methods. With development of computer technologies and free access to market data one of the
most popular group of methods to solve most of the trading problems has become a quantitive
analysis which use different mathematical models to forecast future market prices. In the context
of this article there is examined the operation and use of the committee machine method as a part
of the quantitive analysis.
2.1.1</p>
    </sec>
    <sec id="sec-2">
      <title>Options in the purchasing of volatility</title>
      <p>Option is a derivative financial instrument (contract) in which purchaser of an option acquires the right, and the seller
of the option undertakes obligation to buy (call-option) or sell (put-option) a certain asset in the future according to a price
(strike) stipulated by contract. Using a combination of options, a trader can make a purchase of a volatility, for this purpose
an option-put is purchased with a strike below the current market price and an option-call with a strike above the current
market price. So, in a case of a strong market movement, the execution of one of the contracts will be able to cover all the
costs for the purchase of both options and bring a great profit.
2.1.2</p>
    </sec>
    <sec id="sec-3">
      <title>The committee machine method</title>
      <sec id="sec-3-1">
        <title>The committee machine method makes it possible to get some generalized decision in contradictory situations, when</title>
        <p>there is no unambiguous decision. The committee machine method may be used in case, if there are a set of observations
with a group of parameters for each observation. Inside the set of all observations can be distinguished a subset which can
be divided into 2 classes. So, committee machine will need to solve a problem how by training on the subset with a known
division into classes, distinguish division into classes for a subset with unknown division into classes.</p>
        <p>The method name is related to the fact that the method’s operation logic resembles the logic of work of an ordinary
committee as a collegial governing body, where the combined response and decision are made on the basis of its multiple
members and experts’ responses and decisions. In the committee machine method, such experts (neural networks,
predictors) are several dividing linear discriminant hyperplanes called committee members, which votes for the decision
individually. The final single decision is based on all individual decisions combined by using of a committee machine
logic. There are 3 main committee machine logics: majority, unanimity and seniority logics (hereinafter for brevity sake,
consequently CM, CU, CS). In accordance with names, CM is a committee machine where a decision is accepted if a
majority of committee members votes for this decision; in the CU case a decision is accepted only if all committee members
votes for this decision; CS requires different committee members to have different weights which reflects their power in
the voting process, a decision is accepted if it collects enough total weights through the votes of the committee members.</p>
      </sec>
      <sec id="sec-3-2">
        <title>From a mathematical point of view, the committee machine method is a linear discriminant combination. Due to simultaneous use of several linear discriminant classifiers, the committee machine method takes into account nonlinear relations of variables that increases the quality of classification.</title>
      </sec>
      <sec id="sec-3-3">
        <title>At another point the committee member in geometric interpretation is just a line in a dimension of 2 parameters, or a</title>
        <p>plane in a dimension of 3 parameters. With further increase in number of parameters geometric interpretation is more
difficult because human mind has difficulties trying to imagine more than 3-dimensional space. However, to show how
this method works it is enough to study an example in a 2-dimensional space, with understanding that the same logic works
for a space with more dimensions. One of the simplest geometric example of the CM of 3 committee members for 2
parameters is shown in Figure 1.</p>
        <p>In accordance with Figure 1 there is shown that committee members don’t classify perfectly and there are some
classification errors. Consequently, the committee machine method solves a problem of how to find such combination of
the experts that a number of deviations for each class will be minimum. The mathematic representation of the committee
machine is a simple linear programming model with minimization by Chebyshev approximation (minimax).
ሺ෍݌
௜אூ
݌ሺ෍
௜אூ
ݖሺ෍
௧א்
෍ݖሺ
௧א்
෍ ݀
௝א௃ భ
෍ ݀
௝א௃ మ
௜௝ כ ݔ ௜௧ ሻ ൅ ܾ ௧ െ ܮ כ ݖ
௜௝ כ ݔ ௜௧ ሻ ൅ ܾ ௧ ൅ ܮ כ ݖ
௝௧ כ ܸ ௧ ሻ ൑ ݉ ൅ ݏݒ כ ݀
௝௧ כ ܸ ௧ ሻ ൑ ݏݒ െ ݉ െ ͳ ൅ ݏݒ כ ݀
௝ ൑ ܭ
௝ ൑ ܭ
ͳ כ ݄ܿ
ʹ כ ݄ܿ
௝ ௧ ൑ െߝ݆ א ܬ
௝ ௧ ൒ ߝ݆ א ܬ
௝ ݆ א ܬ
௝ ݆ א ܬ
ଵ ǡ ݐ א ܶͳሺሻ
ଶ ǡ ݐ א ܶʹሺሻ</p>
      </sec>
      <sec id="sec-3-4">
        <title>Objective function: min ch (7)</title>
        <p>, where ܬ ଵ and ܬ ଶ are the sets to be divided;
ܬ ൌ ܬ ଵ ׫ ܬ ଶ is the set of all observations;</p>
      </sec>
      <sec id="sec-3-5">
        <title>I is the set of observation parameters;</title>
      </sec>
      <sec id="sec-3-6">
        <title>T is the set of the committee members;</title>
        <p>i, j, t are the indices of the corresponding sets;
K1 and K2 are number of observation
ܬ ଶ consequently;
݌ ௝௜ is an i-th parameter of j-th observation (constants);
ݔ ௜௧ are the cofficients of hyperplanes (decision variables);
ܾ ௧ are the absolute terms of hyperplane (decision
variable);
(constant);
L is the gillion used for the conditions fulfillment rigor
in ܬ ଵ
and
error;
ε is a very small number used for the rigid restrictions
(constant);
ݖ ௝ ௧ is the Boolean variable to commit a violation of the
sets partition conditions;
݀ ݆ is the Boolean variable to fixate the computation
݊ is a number of the committee members;</p>
        <sec id="sec-3-6-1">
          <title>Vt is the fixated weights for each committee member</title>
          <p>(sv = σ ௧א் ܸ ௧ );
m is a minority (a variable in a range: 0&lt;= m &lt;= sv - 1);
ch is a Chebyshev approximation (minimax) variable.</p>
        </sec>
      </sec>
      <sec id="sec-3-7">
        <title>In context of this research there was chosen to analyze a Moscow Exchange (MOEX) market data on prices of financial</title>
        <p>instrument which reflect USD/RUB currency exchange rate (hereinafter for brevity sake USD/RUB). These are
USDRUB_TOM price, its trading volume (hereinafter for brevity sake VTOM), trading volume of financial instrument
USDRUB_TOD1 (hereinafter for brevity sake VTOD) and trading volume on USD/RUB currency exchange rate (hereinafter
for brevity sake USD/RUB) futures (hereinafter for brevity sake VFORTS) on the MOEX FORTS derivative market. In
addition, there is studied changes in currency exchange rates of AUD/USD, USD/CAD, BRL/USD and prices of Brent
crude oil, because their performance have a strong connection with USD/RUB. In Table 1 is described parameters name
and their calculation methodology.</p>
      </sec>
      <sec id="sec-3-8">
        <title>1 Both TOM and TOD reflect USD/RUB, but for TOD, the settlement date is the same as the transaction date, and for</title>
      </sec>
      <sec id="sec-3-9">
        <title>TOM, the settlement date is the next day.</title>
        <sec id="sec-3-9-1">
          <title>2 Under the cumulative total, we will keep in mind that if the direction of a volatility change coincides with</title>
          <p>the direction of a volatility change of the last week (Pn * P(n-1) &gt; 0), then we add the previous values to the current
value (Pn + Pn-1)</p>
          <p>The period from April 2009 to September 2018 was chosen for research. This period covers market changes that
occurred after the financial crisis of 2008 year, since the market has changed drastically since that time, and the crisis
period has been a runout, where standard patterns no longer work. Accordingly, in the period under review, observations
related to the weeks before a high USD/RUB volatility period were highlighted. In terms of this research by weeks before
a high USD/RUB volatility period will be regarded the following 2 situations:</p>
        </sec>
      </sec>
      <sec id="sec-3-10">
        <title>1. If the maximum rate change relative to the closing of the week within the next 2 weeks exceeds 2%, and within 4</title>
        <p>weeks it is no less than 1.5 times stronger than that fixed within 2 weeks if direction of price movement in both cases is the
same.</p>
      </sec>
      <sec id="sec-3-11">
        <title>2. If the maximum rate change within the next 4 weeks exceeds 8% and direction of price movement within the next 2 weeks is the same.</title>
      </sec>
      <sec id="sec-3-12">
        <title>These rules were empirically compiled by the authors based on the logic of an option trading strategy. As was</title>
        <p>mentioned, an option is a future contract, which means that it is not enough to understand just the fact that the value of the
asset should change drastically, but also take the time factor into account, because by the time the volatility will increase,
the contract may already be expired. Accordingly, based on this logic, it is introduced that the change in value should occur
abruptly (by more than 2%) within 2 weeks or gradually, but very strongly (by more than 8%) within 4 weeks.</p>
        <p>Below in Figure 2 is presented USD/RUB chart, which is based on the weekly data of the closing price for the period
from 06.04.2009 to 07.09.2018, where weeks which agree to the rules described before are highlighted. The chart timeline
axe is presented in the format “MM.YY”.</p>
        <p>75
65
55
45
35
25</p>
      </sec>
      <sec id="sec-3-13">
        <title>In Figure 2 out of 514 observations, 148 observations were selected according to the rules for selecting the high</title>
        <p>USD/RUB volatility periods. By studying the chart, you can see that most of the points formed in the period from June
2014 to January 2015. In this period, almost each of the weeks was selected, which turns the entire given period into
information noise for the model. Accordingly, since we are interested in the moments of trend change, and not just
confirmation of the current trend, we will try to introduce an additional rule, according to which, week is not highlighted
if in the previous 3 weeks there has been already highlighted week. With the introduction of this additional rule, the chart
will take the form as in Figure 3.
USD/RUB</p>
        <p>High volatility</p>
      </sec>
      <sec id="sec-3-14">
        <title>As can be seen in Figure 3 the number of the highlighted weeks are much smaller. There are only 83 weeks chosen as the moments before high volatile period.</title>
        <p>3</p>
        <p>The classification results</p>
      </sec>
      <sec id="sec-3-15">
        <title>While the mathematical model and dataset parameters are chosen there can be calculated classification decision rules for the trading strategies.</title>
        <p>3.1</p>
        <p>The classification results for different committee machine types</p>
      </sec>
      <sec id="sec-3-16">
        <title>Before calculation may be started there must be distinguished training and test datasets. A training dataset is a set of the samples which our mathematical model will try to optimize, while samples from a test dataset are not included, and give an opportunity to test the results without risk of model overtraining. Consequently, the entire period under research was divided into training and test datasets, as shown in Table 2.</title>
      </sec>
      <sec id="sec-3-17">
        <title>On the basis of the compiled datasets, calculations were made by the committee machine method with constructions of the committees from 3 to 6 committee members. The corresponding calculation results are presented in Table 3, where in the column “Committee type” a number is used to indicate a number of the committee members. Table 3: The results of classification with the different committee machine types (% correct recognition)</title>
      </sec>
      <sec id="sec-3-18">
        <title>Based on the results in Table 3, it may be stated that satisfactory results were obtained on the training dataset. At the</title>
        <p>same time, it is clear that the CU shows the results better than the CS, which indicates that the model of unanimity logic is
more applicable for the separation of this dataset. Despite the fact that with an increase in the number of the committee
members up to 6, can be seen an improvement in the results on the training dataset for CS to more than 84% correctly
recognized weeks, however, on the test sample, the results are much worse than for CU. Such a fact is a sign of the model
overtraining, and hence the senselessness of further increasing of the committee members number.</p>
      </sec>
      <sec id="sec-3-19">
        <title>Moreover, for further support idea of the unanimity logic advantages in classification of compiled datasets it is worth noting first of all that there is no example of CM, because in every case mathematic model has found better result by applying CU. And in addition, for a committee of 3 committee members, the model with precedence logic was eventually reduced to CU (m = 0) and therefore CS for 3 members was not given.</title>
        <p>3.2</p>
        <p>The analysis of the classification result for the specific committee machine</p>
        <p>By analyzing the results, at first glance, we can say that the result for J2 is not satisfactory, but if you look at the results
based on the trading problem, then the result has a real analytical value. To begin with, we will once again research the
chart given earlier, but specifically for the test dataset period as presented in Figure 4.</p>
        <p>69
67
65
63
61
59
57
55</p>
        <p>USD/RUB</p>
        <p>High volatility</p>
      </sec>
      <sec id="sec-3-20">
        <title>The chart shows that the 2 most important movements in the course volatility during 2018 occurred in the beginning of</title>
        <p>April and August. Accordingly, we can assume that the rule is satisfactory according to J2 of the test dataset, if it can
recognize at least one week for each period of high volatility. Of all the calculated committee machines, this condition is
satisfied only by an unanimity committee of 5 committee members, which out of 5 weeks in J2 recognized 2, one for each
period. The following Table 4 presents the coefficients of hyperplanes calculated for this committee.</p>
        <p>It is worth noting that the feature of the classification problem is the ambiguity of the selected classification feature,
since the choice of moments of increased volatility can be built according to the different criteria. Consequently, the above
indicated results do not fully reflect the effectiveness of the committee machine. Therefore, for empirical understanding, it
is worthwhile to consider the results obtained on the USD/RUB chart, as presented below in Figure 5.
75
65
55
45
35
25</p>
      </sec>
      <sec id="sec-3-21">
        <title>The chart shows that this decision rule in most cases correctly predicts moments of increasing volatility, with the</title>
        <p>exception of some periods. For example, in October 2012 to May 2013 for a long time there was no significant volatility
of the USD/RUB rate, but the decisive rule mistakenly recognized many weeks in this period as highly volatile. In authors’
point of view, it is possible to solve this problem and improve decision rule by introducing an additional parameter which
would reflect the average USD/RUB volatility over a long period, so that the model can recognize such periods.</p>
      </sec>
      <sec id="sec-3-22">
        <title>So, as a result of this research there was formed a decisive rule for predicting the growth of the USD/RUB volatility, which can be used as a part of the trading option strategies. There is still a way to significantly improve results by addition of better parameters, determine an optimal classification feature and removing of non-informative parameters and weeks from dataset. These improvements will be researched in the further authors’ works on this theme.</title>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Mazurov</surname>
            <given-names>V.D.</given-names>
          </string-name>
          <article-title>A committee machine method in optimization and classification tasks</article-title>
          . Moscow, Nauka Publ.,
          <year>1990</year>
          , 248 p.
          <article-title>(In Russ</article-title>
          .)
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Nikonov</surname>
            <given-names>O.I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chernavin</surname>
            <given-names>F.P.</given-names>
          </string-name>
          <article-title>Constructing rating groups of retail borrowers using the committee method</article-title>
          .
          <source>Money and Credit</source>
          ,
          <year>2014</year>
          , no.
          <issue>11</issue>
          , pp.
          <fpage>52</fpage>
          -
          <lpage>54</lpage>
          . (In Russ.)
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Osborne M.L. The Seniority</surname>
          </string-name>
          <article-title>Logic: A Logic for a Committee Machine</article-title>
          .
          <source>IEEE Trans. on Comp., 1977</source>
          , vol. C-
          <volume>26</volume>
          , iss. 12, pp.
          <fpage>1302</fpage>
          -
          <lpage>1306</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Takiyama R. A</surname>
          </string-name>
          <article-title>General Method for Training the Committee Machine</article-title>
          .
          <source>Pattern Recognition</source>
          ,
          <year>1978</year>
          , vol.
          <volume>10</volume>
          ,
          <issue>iss</issue>
          . 4, pp.
          <fpage>255</fpage>
          -
          <lpage>259</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>