<?xml version="1.0" encoding="utf-8"?><!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.0 20120330//EN" "JATS-journalpublishing1.dtd"><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">INFORMATICA</journal-id>
<journal-title-group><journal-title>Informatica</journal-title></journal-title-group>
<issn pub-type="epub">1822-8844</issn><issn pub-type="ppub">0868-4952</issn><issn-l>0868-4952</issn-l>
<publisher>
<publisher-name>Vilnius University</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">INFO1201</article-id>
<article-id pub-id-type="doi">10.15388/Informatica.2019.198</article-id>
<article-categories><subj-group subj-group-type="heading">
<subject>Research Article</subject></subj-group></article-categories>
<title-group>
<article-title>Support System for Trading in Exchange Market by Distributional Forecasting Model</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name><surname>Maknickas</surname><given-names>Algirdas</given-names></name><email xlink:href="algirdas.maknickas@vgtu.lt">algirdas.maknickas@vgtu.lt</email><xref ref-type="aff" rid="j_info1201_aff_001">1</xref><xref ref-type="corresp" rid="cor1">∗</xref><bio>
<p><bold>A. Maknickas</bold> was awarded the doctor of technological science degree at Vilnius Gediminas Technical University, in 2009 (Faculty of Fundamental Sciences). From 2011 until 2017 he was an associate professor of Vilnius Gediminas Technical University at the Department of Information Technologies. At present he is a professor of Vilnius Gediminas Technical University at the Department of Mechanical and Material Engineering, senior researcher at Institute of Mechanics and Head at Laboratory of Numerical Simulation. His research interests include the problems of artificial intelligence, computational complexity, continuum mechanics, etc.</p></bio>
</contrib>
<contrib contrib-type="author">
<name><surname>Maknickienė</surname><given-names>Nijole</given-names></name><email xlink:href="nijole.maknickiene@vgtu.lt">nijole.maknickiene@vgtu.lt</email><xref ref-type="aff" rid="j_info1201_aff_002">2</xref><bio>
<p><bold>N. Maknickienė</bold> was awarded the doctor of social sciences degree at Vilnius Gediminas Technical University, in 2015. At present she is affiliated in Departments of Finantial Engineering and Economy as an associate professor. Her main research interests include preparation of big data in economical statistics, the applications of artificial intelligence algorithms in financial engineering, risk management, behaviour of investors, etc.</p></bio>
</contrib>
<aff id="j_info1201_aff_001"><label>1</label>Laboratory of Numerical Simulation, <institution>Vilnius Gediminas Technical University</institution>, Basanaviciaus al. 28, Vilnius, <country>Lithuania</country></aff>
<aff id="j_info1201_aff_002"><label>2</label>Department of Financial Engineering, <institution>Vilnius Gediminas Technical University</institution>, Sauletekio al. 11, Vilnius, <country>Lithuania</country></aff>
</contrib-group>
<author-notes>
<corresp id="cor1"><label>∗</label>Corresponding author.</corresp>
</author-notes>
<pub-date pub-type="ppub"><year>2019</year></pub-date>
<pub-date pub-type="epub"><day>1</day><month>1</month><year>2019</year></pub-date><volume>30</volume><issue>1</issue><fpage>73</fpage><lpage>90</lpage><history><date date-type="received"><month>2</month><year>2018</year></date><date date-type="accepted"><month>9</month><year>2018</year></date></history>
<permissions><copyright-statement>© 2019 Vilnius University</copyright-statement><copyright-year>2019</copyright-year>
<license license-type="open-access" xlink:href="http://creativecommons.org/licenses/by/4.0/">
<license-p>Open access article under the <ext-link ext-link-type="uri" xlink:href="http://creativecommons.org/licenses/by/4.0/">CC BY</ext-link> license.</license-p></license></permissions>
<abstract>
<p>Integration of algorithms of investment theory and artificial intelligence allows one to create a support system for investors in exchange markets based on the ensemble of long-short-term-memory (LSTM) based recurrent neural networks (RNN). The proposed support system contains five stages: preparation of historical data, prediction by an ensemble of LSTM RNNs, assessment of prediction distributions, investment portfolio formation and verification. The prediction process outputs a multi-modal distribution, which provides useful information for investors. The research compares four different strategies based on a combination of distribution forecasting models. The high-low strategy helps decision-makers in exchange markets to recognize signals of transactions and fix limits for expectations. A combination of high-low-daily-weekly predictions helps investors to make daily transactions with knowing distribution of exchange rates during the week. The shift in time of five hours between London and New York inspired us to create a UK-NY strategy, which allows investors to recognize the signals of the market in a very short time. The joined high-low-UK-NY strategy increases the possibility of recognizing the signals of transactions in a very short time and of fixing the limits for day trading. So, this support system for investors is verified as a profitable tool for speculators in the relatively risky currency market.</p>
</abstract>
<kwd-group>
<label>Key words</label>
<kwd>artificial intelligence</kwd>
<kwd>EVOLINO</kwd>
<kwd>finance market</kwd>
<kwd>forecast distribution</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="j_info1201_s_001">
<label>1</label>
<title>Introduction</title>
<p>The efficient market hypothesis states that financial tools such as stock prices or exchange rates move randomly. This implies that future prices are unpredictable. However, the amount of researches in forecasting financial markets is growing rapidly. Forecasting models combine different forecasting methods: time series forecasting, behavioural forecasting, expert evaluation methods and others. Different approaches to solving a problem are combined in one model with the aim of helping make the right solution at the right time. Bilson (<xref ref-type="bibr" rid="j_info1201_ref_005">1981</xref>) presented a ‘speculative hypothesis’ that forward prices are the best unbiased forecast of future spot prices. Fama (<xref ref-type="bibr" rid="j_info1201_ref_017">1984</xref>) associated a negative correlation of the expected future exchange rate and forward exchange rate components with the efficiency and rationality of the financial market.</p>
<p>Historically, first of all a linear or non-linear regression-based forecasting model was started developing. Forecast combinations of experts based on principal components and trimmed means, performance-based weighting, and least squares estimates of optimal weights, as well as Bayesian shrinkage are presented in paper Genre <italic>et al.</italic> (<xref ref-type="bibr" rid="j_info1201_ref_021">2013</xref>). The authors Song <italic>et al.</italic> (<xref ref-type="bibr" rid="j_info1201_ref_050">2013</xref>) presented a tourism demand forecasting system (TDFS). The TDFS process is comprised of three stages – preliminary data analysis, the generation of quantitative forecasts and judgmental adjustments – which correspond to the three key system components: the data module, the quantitative forecasting module and the judgmental forecasting module, respectively. The results show that this combination of quantitative and judgemental forecasts improves the forecasting accuracy. Schorfheide and Song (<xref ref-type="bibr" rid="j_info1201_ref_047">2015</xref>) developed a vector auto regression for time series, which are observed at mixed frequencies – quarterly and monthly for macroeconomic data.</p>
<p>Different probability forecasts were investigated by De Luca and Carfora (<xref ref-type="bibr" rid="j_info1201_ref_013">2014</xref>). This research showed that the forecasts obtained by the permutation of the Binomial Heterogeneous Autoregressive model and each of the probability models are better compared to the forecasts obtained by every single model.</p>
<p>Weighted forecast combinations perform better than forecasts selected using information criteria, in terms of both point forecast accuracy or prediction interval coverage Kolassa (<xref ref-type="bibr" rid="j_info1201_ref_026">2011</xref>). Researchers DelSole <italic>et al.</italic> (<xref ref-type="bibr" rid="j_info1201_ref_014">2013</xref>) propose a statistical test for whether a multi-model with unequal weights has significantly smaller errors than with equal weights. Adhikari and Agrawal (<xref ref-type="bibr" rid="j_info1201_ref_003">2014b</xref>) comprehensively evaluated a wide variety of benchmark weights selection techniques for the linear expression of multiple forecasts at their different prediction accuracies. Petropoulos <italic>et al.</italic> (<xref ref-type="bibr" rid="j_info1201_ref_038">2014</xref>) determined that increasing the length of a series has a small positive effect on prediction accuracy. A detailed description of regression based prediction models can be found in Elliott <italic>et al.</italic> (<xref ref-type="bibr" rid="j_info1201_ref_016">2013</xref>).</p>
<p>The successful application of artificial neural networks (ANN) in time series forecasting is based on researches of Lapedes and Farber (<xref ref-type="bibr" rid="j_info1201_ref_028">1987</xref>; <xref ref-type="bibr" rid="j_info1201_ref_029">1988</xref>). Since that time researchers and developers of ANN use the Mackey-Glass test to approve correctness of a new proposed neural network in time series forecasting. Today’s developed neural nets vary in the forecasting root mean square error (RMSE) from 0.02 in classical back-propagation neural networks Lee and Kim (<xref ref-type="bibr" rid="j_info1201_ref_030">1994</xref>) to 0.006 in multi-logic multi-valued neurons neural networks and outperform regression based models Zang <italic>et al.</italic> (<xref ref-type="bibr" rid="j_info1201_ref_054">1998</xref>).</p>
<p>This success encouraged other researchers to apply ANN in forecasting of chaotic behaviour or stock prices or exchange rates. Donaldson and Kamstra (<xref ref-type="bibr" rid="j_info1201_ref_015">1996</xref>) found that ANNs, which combine time series forecasts of stock market volatility, generally outperform predictions from a variety of traditional methods using international stock market data. Predictions of neural network (NN) and linear models with forecasting of 111 time series representing daily cash withdrawal amounts were presented in Andrawis <italic>et al.</italic> (<xref ref-type="bibr" rid="j_info1201_ref_004">2011</xref>). A combination of forecasting models or a combination of different forecasts in one model can give the decision-maker special information. Adhikari and Agrawal (<xref ref-type="bibr" rid="j_info1201_ref_002">2014a</xref>) investigated the ability of finance market forecasting and proposed to use the linear part of a financial dataset that is processed through the random walk model, and the remaining non-linear residuals ensemble of multilayer perceptron or Elman recurrent neural network model.</p>
<p>Researchers agree that a time period is one of the most important measures of future predictions. Short-term predictions of a time series, using past values, have been researched Farmer and Sidorowich (<xref ref-type="bibr" rid="j_info1201_ref_018">1987</xref>), as has the prediction of time series using neural network approach Samanta (<xref ref-type="bibr" rid="j_info1201_ref_043">2011</xref>); Chen (<xref ref-type="bibr" rid="j_info1201_ref_008">2014</xref>); Fonseca and Gómez-Gil (<xref ref-type="bibr" rid="j_info1201_ref_020">2014</xref>). The attention of researchers to financial markets turn to time components of EVolution of recurrent systems with Optimal LINear Output (EVOLINO) RNNs: frequency and shift throw time zones.</p>
<p>A list of point forecasting can be constructed as an ensemble, where each NN element can be an artificial expert. Araújo and New (<xref ref-type="bibr" rid="j_info1201_ref_001">2007</xref>) investigated ensembles of forecasting and combined ensembles and reached a better accuracy of prediction. Kourentzes <italic>et al.</italic> (<xref ref-type="bibr" rid="j_info1201_ref_027">2014</xref>) proposed an ensemble of neural networks, which are based on complex methods of combining forecasts. The authors of this paper suggest that both median and mode are very useful operators as they provide better accuracy than mean ensembles consistently across two datasets. Zhang (<xref ref-type="bibr" rid="j_info1201_ref_055">2012</xref>) presented recent developments in several methodological areas such as seasonal time series modelling, multi-period forecasting and the ensemble method. The numerical results presented by Zhang <italic>et al.</italic> (<xref ref-type="bibr" rid="j_info1201_ref_056">2015</xref>) indicate that the proposed ensemble provides better performance than the single predictive models composing it.</p>
<p>Most popular of combined the forecasting is point forecasts as an attempt to find some single correct prediction decision task, but mostly the result of point forecasting is just one point of possibilities in interval based distribution. When a decision is made in uncertainty, we should investigate an interval or the probability distributions of expected values. Therefore, the combined interval and density forecasting are investigated in Wallis (<xref ref-type="bibr" rid="j_info1201_ref_052">2005</xref>). Rodrigues and Salish (<xref ref-type="bibr" rid="j_info1201_ref_041">2015</xref>) proposed threshold models to analyse and forecast interval-valued time series. The idea of combined prediction intervals was investigated in another paper Kavousi-Fard <italic>et al.</italic> (<xref ref-type="bibr" rid="j_info1201_ref_025">2016</xref>) by using the lower upper bound estimation method based on a combination of prediction intervals to overcome the performance instability of neural networks.</p>
<p>The forecasting of exchange markets has a high level of risk. For successful trading, reliable trading strategies are needed. Mittermayer (<xref ref-type="bibr" rid="j_info1201_ref_036">2004</xref>) derived appropriate trading strategies by means of the earlier categorization. Other authors investigated strategies based on different data sets of historical prices: open-high-low-close Caporale and Gil-Alana (<xref ref-type="bibr" rid="j_info1201_ref_007">2013</xref>); Fiszeder and Perczak (<xref ref-type="bibr" rid="j_info1201_ref_019">2013</xref>); Sermpinis <italic>et al.</italic> (<xref ref-type="bibr" rid="j_info1201_ref_048">2015</xref>); Mantri and Nayak (<xref ref-type="bibr" rid="j_info1201_ref_034">2015</xref>).</p>
<p>Cabrera-Paniagua <italic>et al.</italic> (<xref ref-type="bibr" rid="j_info1201_ref_006">2015</xref>) present an affective decision-making system devoted to the support of decision-making processes in the stock exchange market domain based on artificial emotions. Prokesch <italic>et al.</italic> (<xref ref-type="bibr" rid="j_info1201_ref_039">2015</xref>) contribute to the field of decision-making and foresight support system by presenting a web-based forecasting system for macroeconomic indicators with a financial expert group in a market environment. Chourmouziadis and Chatzoglou (<xref ref-type="bibr" rid="j_info1201_ref_009">2016</xref>) present a short-term trading fuzzy system using a novel trading strategy in order to assist investors in their portfolio management.</p>
<p>Our aim is to propose a new trading support system for trading on the exchange markets. Information generated from the support system gives investors an advantage in making investment decisions. The proposed support system includes five stages: preparation of historical data, prediction by an ensemble of LSTM RNNs, assessment of predictions distributions, investment portfolio formation and verification. In our research four profitable trading strategies waere compared based on the combination of distribution forecasting.</p>
</sec>
<sec id="j_info1201_s_002">
<label>2</label>
<title>Trading Support System</title>
<fig id="j_info1201_fig_001">
<label>Fig. 1</label>
<caption>
<p>Diagram of support system for investors.</p>
</caption>
<graphic xlink:href="info1201_g001.jpg"/>
</fig>
<p>The trading support system contains five components: data collection, prediction, prediction assessment, selection of the portfolio and verification. The data collection includes historical exchange rates accumulated into a database. The prediction module provides a full set of forecasts, calculated by recurrent neural network ensembles. Each predicted exchange rate is used for the creation of forecasting distributions, which are used later for investment asset allocation and portfolio optimization. Verification in a demo, real-time market demonstrates the reliability of the proposed support system. Figure <xref rid="j_info1201_fig_001">1</xref> shows a block diagram of our developed trading support system.</p>
<sec id="j_info1201_s_003">
<label>2.1</label>
<title>Overview of Prediction Module</title>
<p>The appropriate selection of neural network architecture influences the quality of all trading support systems. The idea of using LSTM RNNs as a non-linear function <italic>f</italic> to predict an exchange rate is based on the former’s ability to obtain qualified predictions for the chaotic Mackey-Glass time series Gers (<xref ref-type="bibr" rid="j_info1201_ref_022">2001</xref>). It is possible because first-order RNNs could work as finite state automata if their weights were integers, as Turing machines if their weights were rational numbers and as super Turing machines or hyper-computers if their weights were real numbers Siegelmann <italic>et al.</italic> (<xref ref-type="bibr" rid="j_info1201_ref_049">1999</xref>). The EVOLINO recurrent neural network with LSTM is second-order RNN, and researchers Goudreau <italic>et al.</italic> (<xref ref-type="bibr" rid="j_info1201_ref_023">1994</xref>) have shown that these are strictly more powerful than first-order RNNs. This explains why Schmidhuber <italic>et al.</italic> (<xref ref-type="bibr" rid="j_info1201_ref_046">2007</xref>) obtained the second best known prediction RMSE <inline-formula id="j_info1201_ineq_001"><alternatives><mml:math>
<mml:mn>1.9</mml:mn>
<mml:mo>×</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mn>10</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mo>−</mml:mo>
<mml:mn>3</mml:mn>
</mml:mrow>
</mml:msup></mml:math><tex-math><![CDATA[$1.9\times {10^{-3}}$]]></tex-math></alternatives></inline-formula> for Mackey–Glass time series compared to <inline-formula id="j_info1201_ineq_002"><alternatives><mml:math>
<mml:mn>6.3</mml:mn>
<mml:mo>×</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mn>10</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mo>−</mml:mo>
<mml:mn>5</mml:mn>
</mml:mrow>
</mml:msup></mml:math><tex-math><![CDATA[$6.3\times {10^{-5}}$]]></tex-math></alternatives></inline-formula> for echo state networks Jaeger (<xref ref-type="bibr" rid="j_info1201_ref_024">2004</xref>).</p>
<p>The kernel of forecasting module is presented in Fig. <xref rid="j_info1201_fig_002">2</xref>. The module consists of 4 parts: preprocessor, prediction, count of distribution and formation of the portfolio. The preprocessor part collects data into a MySQL data base. The predicting part learns, validates and predicts each expert of 4xLSTM neural network by using parallelization algorithms. Finally, the obtained predicted data are used for the counting of future histogram and the formation of the portfolio on top of it.</p>
<fig id="j_info1201_fig_002">
<label>Fig. 2</label>
<caption>
<p>Diagram of prediction module.</p>
</caption>
<graphic xlink:href="info1201_g002.jpg"/>
</fig>
<p>Figure <xref rid="j_info1201_fig_003">3</xref> shows the basic operation of EVOLINO network Schmidhuber <italic>et al.</italic> (<xref ref-type="bibr" rid="j_info1201_ref_046">2007</xref>). The output of the network at time <inline-formula id="j_info1201_ineq_003"><alternatives><mml:math>
<mml:mi mathvariant="italic">t</mml:mi>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mi mathvariant="italic">y</mml:mi>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:mi mathvariant="italic">t</mml:mi>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo>
<mml:mo stretchy="false">∈</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="double-struck">R</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:msup></mml:math><tex-math><![CDATA[$t,y(t)\in {\mathbb{R}^{2}}$]]></tex-math></alternatives></inline-formula> is computed by the following formulas <disp-formula-group id="j_info1201_dg_001">
<disp-formula id="j_info1201_eq_001">
<label>(1)</label><alternatives><mml:math display="block">
<mml:mtable displaystyle="true" columnalign="left">
<mml:mtr>
<mml:mtd class="align-odd">
<mml:mi mathvariant="italic">y</mml:mi>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:mi mathvariant="italic">t</mml:mi>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo>
<mml:mo>=</mml:mo>
<mml:mi mathvariant="italic">W</mml:mi>
<mml:mi mathvariant="italic">ϕ</mml:mi>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:mi mathvariant="italic">t</mml:mi>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo>
<mml:mo mathvariant="normal">,</mml:mo>
</mml:mtd>
</mml:mtr>
</mml:mtable></mml:math><tex-math><![CDATA[\[ y(t)=W\phi (t),\]]]></tex-math></alternatives>
</disp-formula>
<disp-formula id="j_info1201_eq_002">
<label>(2)</label><alternatives><mml:math display="block">
<mml:mtable displaystyle="true" columnalign="left">
<mml:mtr>
<mml:mtd class="align-odd">
<mml:mi mathvariant="italic">ϕ</mml:mi>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:mi mathvariant="italic">t</mml:mi>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo>
<mml:mo>=</mml:mo>
<mml:mi mathvariant="normal">Φ</mml:mi>
<mml:mo maxsize="1.19em" minsize="1.19em" fence="true" mathvariant="normal">(</mml:mo>
<mml:mi mathvariant="italic">u</mml:mi>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:mi mathvariant="italic">t</mml:mi>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mi mathvariant="italic">u</mml:mi>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:mi mathvariant="italic">t</mml:mi>
<mml:mo>−</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mo>…</mml:mo>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mi mathvariant="italic">u</mml:mi>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:mi mathvariant="italic">t</mml:mi>
<mml:mo>−</mml:mo>
<mml:mi mathvariant="italic">k</mml:mi>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo>
<mml:mo maxsize="1.19em" minsize="1.19em" fence="true" mathvariant="normal">)</mml:mo>
<mml:mo mathvariant="normal">,</mml:mo>
</mml:mtd>
</mml:mtr>
</mml:mtable></mml:math><tex-math><![CDATA[\[ \phi (t)=\Phi \big(u(t),u(t-1),\dots ,u(t-k)\big),\]]]></tex-math></alternatives>
</disp-formula>
</disp-formula-group> where <inline-formula id="j_info1201_ineq_004"><alternatives><mml:math>
<mml:mi mathvariant="italic">u</mml:mi>
<mml:mo stretchy="false">∈</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="double-struck">R</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:msup></mml:math><tex-math><![CDATA[$u\in {\mathbb{R}^{2}}$]]></tex-math></alternatives></inline-formula> is <inline-formula id="j_info1201_ineq_005"><alternatives><mml:math>
<mml:mi mathvariant="italic">k</mml:mi>
<mml:mo>+</mml:mo>
<mml:mn>1</mml:mn></mml:math><tex-math><![CDATA[$k+1$]]></tex-math></alternatives></inline-formula> inputs, <inline-formula id="j_info1201_ineq_006"><alternatives><mml:math>
<mml:mi mathvariant="italic">ϕ</mml:mi>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:mi mathvariant="italic">t</mml:mi>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo>
<mml:mo stretchy="false">∈</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="double-struck">R</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:msup></mml:math><tex-math><![CDATA[$\phi (t)\in {\mathbb{R}^{2}}$]]></tex-math></alternatives></inline-formula> is the output of recurrent neural network <inline-formula id="j_info1201_ineq_007"><alternatives><mml:math>
<mml:mi mathvariant="normal">Φ</mml:mi>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:mo>·</mml:mo>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo></mml:math><tex-math><![CDATA[$\Phi (\cdot )$]]></tex-math></alternatives></inline-formula>, <italic>W</italic> is the weight matrix, which is calculated by mean square error minimization.</p>
<fig id="j_info1201_fig_003">
<label>Fig. 3</label>
<caption>
<p>Recurrent neural network receives sequential inputs <inline-formula id="j_info1201_ineq_008"><alternatives><mml:math>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">u</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:mi mathvariant="italic">t</mml:mi>
<mml:mo>−</mml:mo>
<mml:mi mathvariant="italic">k</mml:mi>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">u</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:mi mathvariant="italic">t</mml:mi>
<mml:mo>−</mml:mo>
<mml:mi mathvariant="italic">k</mml:mi>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo></mml:math><tex-math><![CDATA[$({u_{1}}(t-k),{u_{2}}(t-k))$]]></tex-math></alternatives></inline-formula> and creates outputs <inline-formula id="j_info1201_ineq_009"><alternatives><mml:math>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">y</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:mi mathvariant="italic">t</mml:mi>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">y</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:mi mathvariant="italic">t</mml:mi>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo></mml:math><tex-math><![CDATA[$({y_{1}}(t),{y_{2}}(t))$]]></tex-math></alternatives></inline-formula>.</p>
</caption>
<graphic xlink:href="info1201_g003.jpg"/>
</fig>
<p>The block diagram of the LSTM network is shown in Fig. <xref rid="j_info1201_fig_004">4</xref>. The LSTM RNN forms network with <inline-formula id="j_info1201_ineq_010"><alternatives><mml:math>
<mml:mi mathvariant="italic">N</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>4</mml:mn>
<mml:mi mathvariant="italic">n</mml:mi></mml:math><tex-math><![CDATA[$N=4n$]]></tex-math></alternatives></inline-formula> memory cells, where <italic>N</italic> is the total number of neurons and <italic>n</italic> is the number of memory cells. The genetic evolution algorithm is applied to weights of each quartet of memory cells separately. The cell with a forget gate (<inline-formula id="j_info1201_ineq_011"><alternatives><mml:math>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">G</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">F</mml:mi>
</mml:mrow>
</mml:msub></mml:math><tex-math><![CDATA[${G_{F}}$]]></tex-math></alternatives></inline-formula>) and gate (<inline-formula id="j_info1201_ineq_012"><alternatives><mml:math>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">G</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">I</mml:mi>
</mml:mrow>
</mml:msub></mml:math><tex-math><![CDATA[${G_{I}}$]]></tex-math></alternatives></inline-formula>) controls access to the cell by the external inputs that are summed into the Σ unit, and the output gate (<inline-formula id="j_info1201_ineq_013"><alternatives><mml:math>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">G</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>0</mml:mn>
</mml:mrow>
</mml:msub></mml:math><tex-math><![CDATA[${G_{0}}$]]></tex-math></alternatives></inline-formula>). Nodes Π represent the multiplication function and the linear regression Moore–Penrose pseudo-inverse method used to compute pseudo-inverse weights for the output (Schmidhuber <italic>et al.</italic> (<xref ref-type="bibr" rid="j_info1201_ref_044">2005a</xref>), <xref ref-type="bibr" rid="j_info1201_ref_045">2005b</xref>; <xref ref-type="bibr" rid="j_info1201_ref_046">2007</xref>).</p>
<fig id="j_info1201_fig_004">
<label>Fig. 4</label>
<caption>
<p>LSTM network with four memory cells.</p>
</caption>
<graphic xlink:href="info1201_g004.jpg"/>
</fig>
<p>As described in Schmidhuber <italic>et al.</italic> (<xref ref-type="bibr" rid="j_info1201_ref_046">2007</xref>), the state of the cell <italic>i</italic> is computed by 
<disp-formula id="j_info1201_eq_003">
<label>(3)</label><alternatives><mml:math display="block">
<mml:mtable displaystyle="true">
<mml:mtr>
<mml:mtd>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">s</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:mi mathvariant="italic">t</mml:mi>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo>
<mml:mo>=</mml:mo>
<mml:mi mathvariant="italic">n</mml:mi>
<mml:mi mathvariant="italic">e</mml:mi>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">t</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:mi mathvariant="italic">t</mml:mi>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="italic">g</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">in</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:mi mathvariant="italic">t</mml:mi>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo>
<mml:mo>+</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="italic">g</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">forget</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:mi mathvariant="italic">t</mml:mi>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">s</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:mi mathvariant="italic">t</mml:mi>
<mml:mo>−</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo>
<mml:mo mathvariant="normal">,</mml:mo>
</mml:mtd>
</mml:mtr>
</mml:mtable></mml:math><tex-math><![CDATA[\[ {s_{i}}(t)=ne{t_{i}}(t){g_{i}^{\mathit{in}}}(t)+{g_{i}^{\mathit{forget}}}(t){s_{i}}(t-1),\]]]></tex-math></alternatives>
</disp-formula> 
where <inline-formula id="j_info1201_ineq_014"><alternatives><mml:math>
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="italic">g</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">in</mml:mi>
</mml:mrow>
</mml:msubsup></mml:math><tex-math><![CDATA[${g_{i}^{\mathit{in}}}$]]></tex-math></alternatives></inline-formula> and <inline-formula id="j_info1201_ineq_015"><alternatives><mml:math>
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="italic">g</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">forget</mml:mi>
</mml:mrow>
</mml:msubsup></mml:math><tex-math><![CDATA[${g_{i}^{\mathit{forget}}}$]]></tex-math></alternatives></inline-formula> are the activation of the input and forget gates, respectively, and <inline-formula id="j_info1201_ineq_016"><alternatives><mml:math>
<mml:mi mathvariant="italic">net</mml:mi></mml:math><tex-math><![CDATA[$\mathit{net}$]]></tex-math></alternatives></inline-formula> is the weighted sum of the external inputs (included by the <inline-formula id="j_info1201_ineq_017"><alternatives><mml:math>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="normal">Σ</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">s</mml:mi>
</mml:mrow>
</mml:msub></mml:math><tex-math><![CDATA[${\Sigma _{s}}$]]></tex-math></alternatives></inline-formula> in Fig. <xref rid="j_info1201_fig_004">4</xref>): 
<disp-formula id="j_info1201_eq_004">
<label>(4)</label><alternatives><mml:math display="block">
<mml:mtable displaystyle="true">
<mml:mtr>
<mml:mtd>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">net</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:mi mathvariant="italic">t</mml:mi>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo>
<mml:mo>=</mml:mo>
<mml:mi mathvariant="italic">h</mml:mi>
<mml:mo maxsize="2.03em" minsize="2.03em" fence="true" mathvariant="normal">(</mml:mo>
<mml:munder>
<mml:mrow>
<mml:mstyle displaystyle="true">
<mml:mo largeop="true" movablelimits="false">∑</mml:mo></mml:mstyle>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:munder>
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="italic">w</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">cell</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">c</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:mi mathvariant="italic">t</mml:mi>
<mml:mo>−</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo>
<mml:mo>+</mml:mo>
<mml:munder>
<mml:mrow>
<mml:mstyle displaystyle="true">
<mml:mo largeop="true" movablelimits="false">∑</mml:mo></mml:mstyle>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">k</mml:mi>
</mml:mrow>
</mml:munder>
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="italic">w</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mi mathvariant="italic">k</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">cell</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">u</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">k</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:mi mathvariant="italic">t</mml:mi>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo>
<mml:mo maxsize="2.03em" minsize="2.03em" fence="true" mathvariant="normal">)</mml:mo>
<mml:mo mathvariant="normal">,</mml:mo>
</mml:mtd>
</mml:mtr>
</mml:mtable></mml:math><tex-math><![CDATA[\[ {\mathit{net}_{i}}(t)=h\bigg(\sum \limits_{j}{w_{ij}^{\mathit{cell}}}{c_{j}}(t-1)+\sum \limits_{k}{w_{ik}^{\mathit{cell}}}{u_{k}}(t)\bigg),\]]]></tex-math></alternatives>
</disp-formula> 
where <italic>h</italic> is the identity function, and <inline-formula id="j_info1201_ineq_018"><alternatives><mml:math>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">c</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub></mml:math><tex-math><![CDATA[${c_{j}}$]]></tex-math></alternatives></inline-formula> is the output of cell <italic>j</italic>: 
<disp-formula id="j_info1201_eq_005">
<label>(5)</label><alternatives><mml:math display="block">
<mml:mtable displaystyle="true">
<mml:mtr>
<mml:mtd>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">c</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:mi mathvariant="italic">t</mml:mi>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo>
<mml:mo>=</mml:mo>
<mml:mo movablelimits="false">tanh</mml:mo>
<mml:mo maxsize="1.19em" minsize="1.19em" fence="true" mathvariant="normal">(</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="italic">g</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">out</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:mi mathvariant="italic">t</mml:mi>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">s</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:mi mathvariant="italic">t</mml:mi>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo>
<mml:mo maxsize="1.19em" minsize="1.19em" fence="true" mathvariant="normal">)</mml:mo>
<mml:mo mathvariant="normal">,</mml:mo>
</mml:mtd>
</mml:mtr>
</mml:mtable></mml:math><tex-math><![CDATA[\[ {c_{j}}(t)=\tanh \big({g_{j}^{\mathit{out}}}(t){s_{j}}(t)\big),\]]]></tex-math></alternatives>
</disp-formula> 
where <inline-formula id="j_info1201_ineq_019"><alternatives><mml:math>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="italic">g</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">out</mml:mi>
</mml:mrow>
</mml:msup></mml:math><tex-math><![CDATA[${g^{\mathit{out}}}$]]></tex-math></alternatives></inline-formula> is the output gate of cell <italic>j</italic>. The value of each gate <inline-formula id="j_info1201_ineq_020"><alternatives><mml:math>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">g</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
</mml:msub></mml:math><tex-math><![CDATA[${g_{i}}$]]></tex-math></alternatives></inline-formula> of memory cell <italic>i</italic> is open or closed at time <italic>t</italic> is calculated by: 
<disp-formula id="j_info1201_eq_006">
<label>(6)</label><alternatives><mml:math display="block">
<mml:mtable displaystyle="true">
<mml:mtr>
<mml:mtd>
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="italic">g</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">type</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mo>=</mml:mo>
<mml:mi mathvariant="italic">σ</mml:mi>
<mml:mo maxsize="2.03em" minsize="2.03em" fence="true" mathvariant="normal">(</mml:mo>
<mml:munder>
<mml:mrow>
<mml:mstyle displaystyle="true">
<mml:mo largeop="true" movablelimits="false">∑</mml:mo></mml:mstyle>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:munder>
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="italic">w</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">type</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">c</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:mi mathvariant="italic">t</mml:mi>
<mml:mo>−</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo>
<mml:mo>+</mml:mo>
<mml:munder>
<mml:mrow>
<mml:mstyle displaystyle="true">
<mml:mo largeop="true" movablelimits="false">∑</mml:mo></mml:mstyle>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">k</mml:mi>
</mml:mrow>
</mml:munder>
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="italic">w</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mi mathvariant="italic">k</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">type</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">u</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">k</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:mi mathvariant="italic">t</mml:mi>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo>
<mml:mo maxsize="2.03em" minsize="2.03em" fence="true" mathvariant="normal">)</mml:mo>
<mml:mo mathvariant="normal">,</mml:mo>
</mml:mtd>
</mml:mtr>
</mml:mtable></mml:math><tex-math><![CDATA[\[ {g_{i}^{\mathit{type}}}=\sigma \bigg(\sum \limits_{j}{w_{ij}^{\mathit{type}}}{c_{j}}(t-1)+\sum \limits_{k}{w_{ik}^{\mathit{type}}}{u_{k}}(t)\bigg),\]]]></tex-math></alternatives>
</disp-formula> 
where <italic>type</italic> can be <italic>input</italic>, <italic>output</italic>, or <italic>forget</italic>, and <italic>σ</italic> is standard sigmoid function. The gates receive input from the output of other cell <inline-formula id="j_info1201_ineq_021"><alternatives><mml:math>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">c</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub></mml:math><tex-math><![CDATA[${c_{j}}$]]></tex-math></alternatives></inline-formula> and from the external inputs to the network.</p>
<p>To date, the design of neural networks is more of an art than a science and is based on simulations derived from limited experiments Zang <italic>et al.</italic> (<xref ref-type="bibr" rid="j_info1201_ref_054">1998</xref>). Simulations of EVOLINO show that the best observable RMSE can be obtained for the configuration of neurons 36 and number of data 85 and equals 0.078 and second best RMSE 0.097 obtainable for configuration of neurons 64 and number of data 85. An investigation of training RMSE shows that it is in the interval from 0.0001 to 0.005 for number of neurons 60–64 and goes to <inline-formula id="j_info1201_ineq_022"><alternatives><mml:math>
<mml:mn>1.3</mml:mn>
<mml:mo>×</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mn>10</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mo>−</mml:mo>
<mml:mn>29</mml:mn>
</mml:mrow>
</mml:msup></mml:math><tex-math><![CDATA[$1.3\times {10^{-29}}$]]></tex-math></alternatives></inline-formula> for number of neurons 68. Therefore, we use number of neurons 64. The number of training epochs is important also. It was chosen so that over-fitting of RNN would be avoided and would be equal to 180. All numeric data was obtained for tanh activation function.</p>
<p>The second idea of artificial prediction is based on uncertainty of the future events. This means that the future can be described by the distribution of different event, not trying to fix a single point in the future. This was taken into account by our algorithm using single predictions of RNNs to obtain the predicted histogram of possible exchange rate values. Additionally, we require to filter out unrealistic values. In this case, the first-fourth percentile method was used for removing values in this range as unrealistic.</p>
<p>Finally, weekly and daily histograms of possible exchange rate values were used for making decisions about appropriate investments. As was mentioned before, this method can be used because the weights are optimized using a genetic algorithm, where each optimization sequence gives different values for a single prediction point.</p>
</sec>
<sec id="j_info1201_s_004">
<label>2.2</label>
<title>Data Preparation</title>
<p>The choice of exchange rates for trading is based on the orthogonality of the portfolio. The conditions under which an investment portfolio solves the efficient portfolio optimization problem are formulated by Roll (<xref ref-type="bibr" rid="j_info1201_ref_042">1980</xref>). An orthogonal portfolio should satisfy the following conditions: 
<disp-formula id="j_info1201_eq_007">
<label>(7)</label><alternatives><mml:math display="block">
<mml:mtable displaystyle="true">
<mml:mtr>
<mml:mtd>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">O</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">c</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:munder>
<mml:mrow>
<mml:mstyle displaystyle="true">
<mml:mo largeop="true" movablelimits="false">∑</mml:mo></mml:mstyle>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:munder>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">r</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">σ</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">σ</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mn>0</mml:mn>
<mml:mo mathvariant="normal">,</mml:mo>
</mml:mtd>
</mml:mtr>
</mml:mtable></mml:math><tex-math><![CDATA[\[ {O_{c}}=\sum \limits_{ij}{r_{ij}}{\sigma _{i}}{\sigma _{j}}=0,\]]]></tex-math></alternatives>
</disp-formula> 
where <inline-formula id="j_info1201_ineq_023"><alternatives><mml:math>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">r</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub></mml:math><tex-math><![CDATA[${r_{ij}}$]]></tex-math></alternatives></inline-formula> is the correlation coefficient between tools, <inline-formula id="j_info1201_ineq_024"><alternatives><mml:math>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">σ</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
</mml:msub></mml:math><tex-math><![CDATA[${\sigma _{i}}$]]></tex-math></alternatives></inline-formula> and <inline-formula id="j_info1201_ineq_025"><alternatives><mml:math>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">σ</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub></mml:math><tex-math><![CDATA[${\sigma _{j}}$]]></tex-math></alternatives></inline-formula> is the standard deviation of tool <italic>i</italic> and <italic>j</italic>, respectively.</p>
<p>It is very difficult to reach <inline-formula id="j_info1201_ineq_026"><alternatives><mml:math>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">O</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">c</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mn>0</mml:mn></mml:math><tex-math><![CDATA[${O_{c}}=0$]]></tex-math></alternatives></inline-formula> in practice. So, we use <italic>ε</italic> to denote the degree of closeness to orthogonality: 
<disp-formula id="j_info1201_eq_008">
<label>(8)</label><alternatives><mml:math display="block">
<mml:mtable displaystyle="true">
<mml:mtr>
<mml:mtd>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">O</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">c</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:munder>
<mml:mrow>
<mml:mstyle displaystyle="true">
<mml:mo largeop="true" movablelimits="false">∑</mml:mo></mml:mstyle>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:munder>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">r</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">σ</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">σ</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mi mathvariant="italic">ε</mml:mi>
<mml:mo>.</mml:mo>
</mml:mtd>
</mml:mtr>
</mml:mtable></mml:math><tex-math><![CDATA[\[ {O_{c}}=\sum \limits_{ij}{r_{ij}}{\sigma _{i}}{\sigma _{j}}=\varepsilon .\]]]></tex-math></alternatives>
</disp-formula>
</p>
<table-wrap id="j_info1201_tab_001">
<label>Table 1</label>
<caption>
<p>Exchangerates used in the investigation.</p>
</caption>
<table>
<thead>
<tr>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">Exchange rate names</td>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">Abbreviation</td>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">Time</td>
</tr>
</thead>
<tbody>
<tr>
<td style="vertical-align: top; text-align: left">British pounds and Australian dollars</td>
<td style="vertical-align: top; text-align: left">GBP/AUD</td>
<td style="vertical-align: top; text-align: left">D, W OHLC, NY, UK</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">New Zealand dollars and Canadian dollars</td>
<td style="vertical-align: top; text-align: left">NZD/CAD</td>
<td style="vertical-align: top; text-align: left">D, W OHLC, NY, UK</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Euro and Japanese yen</td>
<td style="vertical-align: top; text-align: left">EUR/JPY</td>
<td style="vertical-align: top; text-align: left">D, W OHLC, NY, UK</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">US dollars and Swiss francs</td>
<td style="vertical-align: top; text-align: left">USD/CHF</td>
<td style="vertical-align: top; text-align: left">D, W OHLC, NY, UK</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Euro and US dollars</td>
<td style="vertical-align: top; text-align: left">EUR/USD</td>
<td style="vertical-align: top; text-align: left">D, W OHLC, NY, UK</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Gross Britain Pounds and US dollars</td>
<td style="vertical-align: top; text-align: left">GBP/USD</td>
<td style="vertical-align: top; text-align: left">D, W OHLC, NY, UK</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">US dollars and Swiss francs</td>
<td style="vertical-align: top; text-align: left">USD/CHF</td>
<td style="vertical-align: top; text-align: left">D, W OHLC, NY, UK</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">US dollars and Japanese yen</td>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">USD/JPY</td>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">D, W OHLC, NY, UK</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>In our research, we use the following exchange rates: The daily (D) and weekly (W) open, high, low and close (OHLC) and the New York (NY) and London (UK) time exchange rates are recorded in a MySQL database Widenius <italic>et al.</italic> (<xref ref-type="bibr" rid="j_info1201_ref_053">2002</xref>). Additionally, we collect and use the XAU/USD rate (gold against the US dollar). The closest orthogonality of two data vectors ‘pupil and teacher’ can be achieved by varying time shift parameter <inline-formula id="j_info1201_ineq_027"><alternatives><mml:math>
<mml:mi mathvariant="italic">a</mml:mi>
<mml:mo>⩾</mml:mo>
<mml:mn>0</mml:mn></mml:math><tex-math><![CDATA[$a\geqslant 0$]]></tex-math></alternatives></inline-formula> while seeking a minimum of the sum Maknickas and Maknickienė (<xref ref-type="bibr" rid="j_info1201_ref_031">2012</xref>): 
<disp-formula id="j_info1201_eq_009">
<label>(9)</label><alternatives><mml:math display="block">
<mml:mtable displaystyle="true">
<mml:mtr>
<mml:mtd>
<mml:mo movablelimits="false">min</mml:mo>
<mml:mo maxsize="2.03em" minsize="2.03em" fence="true" mathvariant="normal">(</mml:mo>
<mml:munderover accentunder="false" accent="false">
<mml:mrow>
<mml:mstyle displaystyle="true">
<mml:mo largeop="true" movablelimits="false">∑</mml:mo></mml:mstyle>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">t</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>0</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">N</mml:mi>
<mml:mo>−</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:munderover>
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="italic">η</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">XXX</mml:mi>
<mml:mo mathvariant="normal" stretchy="false">/</mml:mo>
<mml:mi mathvariant="italic">YYY</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">t</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="italic">η</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">XAU</mml:mi>
<mml:mo mathvariant="normal" stretchy="false">/</mml:mo>
<mml:mi mathvariant="italic">USD</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">t</mml:mi>
<mml:mo>−</mml:mo>
<mml:mi mathvariant="italic">a</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mo maxsize="2.03em" minsize="2.03em" fence="true" mathvariant="normal">)</mml:mo>
<mml:mo>.</mml:mo>
</mml:mtd>
</mml:mtr>
</mml:mtable></mml:math><tex-math><![CDATA[\[ \min \bigg({\sum \limits_{t=0}^{N-1}}{\eta _{\mathit{XXX}/\mathit{YYY}}^{t}}{\eta _{\mathit{XAU}/\mathit{USD}}^{t-a}}\bigg).\]]]></tex-math></alternatives>
</disp-formula> 
The best shift value <italic>a</italic> is then saved in the DB. Note that we do not use the direct <inline-formula id="j_info1201_ineq_028"><alternatives><mml:math>
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="italic">η</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">XXX</mml:mi>
<mml:mo mathvariant="normal" stretchy="false">/</mml:mo>
<mml:mi mathvariant="italic">YYY</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">t</mml:mi>
</mml:mrow>
</mml:msubsup></mml:math><tex-math><![CDATA[${\eta _{\mathit{XXX}/\mathit{YYY}}^{t}}$]]></tex-math></alternatives></inline-formula> exchange rate data (where index <inline-formula id="j_info1201_ineq_029"><alternatives><mml:math>
<mml:mi mathvariant="italic">X</mml:mi>
<mml:mi mathvariant="italic">X</mml:mi>
<mml:mi mathvariant="italic">X</mml:mi>
<mml:mo mathvariant="normal" stretchy="false">/</mml:mo>
<mml:mi mathvariant="italic">Y</mml:mi>
<mml:mi mathvariant="italic">Y</mml:mi>
<mml:mi mathvariant="italic">Y</mml:mi></mml:math><tex-math><![CDATA[$XXX/YYY$]]></tex-math></alternatives></inline-formula> denotes currency exchange rates GBP/AUD, NZD/CAD, EUR/JPY, USD/CHF, EUR/USD, GBP/USD, USD/CHF, USD/JPY), but the following rational logarithms of <inline-formula id="j_info1201_ineq_030"><alternatives><mml:math>
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="italic">η</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">t</mml:mi>
</mml:mrow>
</mml:msubsup></mml:math><tex-math><![CDATA[${\eta _{i}^{t}}$]]></tex-math></alternatives></inline-formula> and <inline-formula id="j_info1201_ineq_031"><alternatives><mml:math>
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="italic">η</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">t</mml:mi>
<mml:mo>−</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msubsup></mml:math><tex-math><![CDATA[${\eta _{i}^{t-1}}$]]></tex-math></alternatives></inline-formula>: 
<disp-formula id="j_info1201_eq_010">
<label>(10)</label><alternatives><mml:math display="block">
<mml:mtable displaystyle="true">
<mml:mtr>
<mml:mtd>
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="italic">l</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">t</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mo>=</mml:mo>
<mml:mo movablelimits="false">log</mml:mo>
<mml:mo maxsize="1.19em" minsize="1.19em" fence="true" mathvariant="normal">(</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="italic">η</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">t</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mo mathvariant="normal" stretchy="false">/</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="italic">η</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">t</mml:mi>
<mml:mo>−</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msubsup>
<mml:mo maxsize="1.19em" minsize="1.19em" fence="true" mathvariant="normal">)</mml:mo>
<mml:mo>.</mml:mo>
</mml:mtd>
</mml:mtr>
</mml:mtable></mml:math><tex-math><![CDATA[\[ {l_{t}^{j}}=\log \big({\eta _{j}^{t}}/{\eta _{j}^{t-1}}\big).\]]]></tex-math></alternatives>
</disp-formula> 
The choice of the logarithmic scale was based on a lognormal distributed data of the current investigation. So, a neural network will optimize weights for logarithmic, time percentage growth/decrease of exchange rate values. When the best four different shift values have been determined, the evolutionary LSTM RNN can begin the weight optimization process. RNN input data must be in the range <inline-formula id="j_info1201_ineq_032"><alternatives><mml:math>
<mml:mo fence="true" stretchy="false">[</mml:mo>
<mml:mn>0</mml:mn>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo fence="true" stretchy="false">]</mml:mo></mml:math><tex-math><![CDATA[$[0,1]$]]></tex-math></alternatives></inline-formula>, so the original data should be normalized by dividing all set of values by the maximum value in the interval <inline-formula id="j_info1201_ineq_033"><alternatives><mml:math>
<mml:mo fence="true" stretchy="false">[</mml:mo>
<mml:mn>0</mml:mn>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mi mathvariant="italic">T</mml:mi>
<mml:mo fence="true" stretchy="false">]</mml:mo></mml:math><tex-math><![CDATA[$[0,T]$]]></tex-math></alternatives></inline-formula>, i.e.<disp-formula-group id="j_info1201_dg_002">
<disp-formula id="j_info1201_eq_011">
<label>(11)</label><alternatives><mml:math display="block">
<mml:mtable displaystyle="true" columnalign="left">
<mml:mtr>
<mml:mtd class="align-odd">
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="italic">l</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">t</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mo>=</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="italic">l</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">t</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mo mathvariant="normal" stretchy="false">/</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="italic">l</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo movablelimits="false">max</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mo mathvariant="normal">,</mml:mo>
</mml:mtd>
</mml:mtr>
</mml:mtable></mml:math><tex-math><![CDATA[\[ {l_{t}^{1j}}={l_{t}^{j}}/{l_{\max }^{j}},\]]]></tex-math></alternatives>
</disp-formula>
<disp-formula id="j_info1201_eq_012">
<label>(12)</label><alternatives><mml:math display="block">
<mml:mtable displaystyle="true" columnalign="left">
<mml:mtr>
<mml:mtd class="align-odd">
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="italic">l</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo movablelimits="false">max</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mo>=</mml:mo>
<mml:mo movablelimits="false">max</mml:mo>
<mml:mo maxsize="1.19em" minsize="1.19em" fence="true" mathvariant="normal">(</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="italic">l</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">t</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mo maxsize="1.19em" minsize="1.19em" fence="true" mathvariant="normal">)</mml:mo>
<mml:mo>.</mml:mo>
</mml:mtd>
</mml:mtr>
</mml:mtable></mml:math><tex-math><![CDATA[\[ {l_{\max }^{j}}=\max \big({l_{t}^{j}}\big).\]]]></tex-math></alternatives>
</disp-formula>
</disp-formula-group> The predicted data should be reversed by an opposite algorithm using the same value of <inline-formula id="j_info1201_ineq_034"><alternatives><mml:math>
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="italic">l</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo movablelimits="false">max</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msubsup></mml:math><tex-math><![CDATA[${l_{\max }^{j}}$]]></tex-math></alternatives></inline-formula>. All predicted exchange rate values are multiplied by max value <inline-formula id="j_info1201_ineq_035"><alternatives><mml:math>
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="italic">l</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo movablelimits="false">max</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msubsup></mml:math><tex-math><![CDATA[${l_{\max }^{j}}$]]></tex-math></alternatives></inline-formula>. Finally, the exponent of each predicted value is applied as follows: 
<disp-formula id="j_info1201_eq_013">
<label>(13)</label><alternatives><mml:math display="block">
<mml:mtable displaystyle="true">
<mml:mtr>
<mml:mtd>
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="italic">η</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">t</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mo>=</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="italic">η</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">t</mml:mi>
<mml:mo>−</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msubsup>
<mml:mo movablelimits="false">exp</mml:mo>
<mml:mo maxsize="1.19em" minsize="1.19em" fence="true" mathvariant="normal">(</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="italic">l</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">t</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="italic">l</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo movablelimits="false">max</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mo maxsize="1.19em" minsize="1.19em" fence="true" mathvariant="normal">)</mml:mo>
<mml:mo mathvariant="normal">,</mml:mo>
</mml:mtd>
</mml:mtr>
</mml:mtable></mml:math><tex-math><![CDATA[\[ {\eta _{j}^{t}}={\eta _{j}^{t-1}}\exp \big({l_{t}^{1j}}{l_{\max }^{j}}\big),\]]]></tex-math></alternatives>
</disp-formula> 
where <inline-formula id="j_info1201_ineq_036"><alternatives><mml:math>
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="italic">η</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>0</mml:mn>
</mml:mrow>
</mml:msubsup></mml:math><tex-math><![CDATA[${\eta _{j}^{0}}$]]></tex-math></alternatives></inline-formula> is the first value in the set.</p>
</sec>
<sec id="j_info1201_s_005">
<label>2.3</label>
<title>Acceleration of Simulation</title>
<p>Selection of the optimal number in an ensemble was investigated in an earlier work Maknickienė and Maknickas (<xref ref-type="bibr" rid="j_info1201_ref_033">2013</xref>). Two types of acceleration were applied in this work: software based and hardware based.</p>
<p>The pyhton profiler was used for software based acceleration. The profiler shows time consumption of running functions. The obtained running times of pure python functions allow to identify functions which must be accelerated. The slowest running functions then were converted into fortran code and after compilation by f2py Peterson (<xref ref-type="bibr" rid="j_info1201_ref_037">2009</xref>) were imported into EVOLINO python code. Conversion of python code to fortran code allows an acceleration from 10 to 100 times.</p>
<p>Hardware acceleration is achieved using a multi-core workstation by applying the MPI python interface MPI4PY (Dalcin <italic>et al.</italic> (<xref ref-type="bibr" rid="j_info1201_ref_012">2011</xref>), <xref ref-type="bibr" rid="j_info1201_ref_011">2008</xref>; <xref ref-type="bibr" rid="j_info1201_ref_010">2005</xref>). The calculations were performed in parallel on the dedicated server of www.hostex.lt cloud with the following configuration: cpu is 32x Intel(R) Xeon(R) CPU E5-2630 v3 @ 2.40 GHz; ram is 64 GB RAM; hdd is RAID1 600 GB SAS. An ensemble of 176 predictive neural networks on the presented configurations allows one to obtain forecasting in a half hour (20–30 min). Finally, the support system generates the prediction histogram and its parameters such as the mean, median, mode, skewness and kurtosis.</p>
</sec>
<sec id="j_info1201_s_006">
<label>2.4</label>
<title>Investment Asset Allocation</title>
<p>In general, selection of the investment portfolio and diversification of investment risk can be done by using Markowitz (<xref ref-type="bibr" rid="j_info1201_ref_035">1952</xref>) portfolio optimization equations 
<disp-formula id="j_info1201_eq_014">
<label>(14)</label><alternatives><mml:math display="block">
<mml:mtable displaystyle="true">
<mml:mtr>
<mml:mtd>
<mml:mfenced separators="" open="{" close="">
<mml:mrow>
<mml:mtable equalrows="false" equalcolumns="false" columnalign="left">
<mml:mtr>
<mml:mtd class="array">
<mml:mo movablelimits="false">max</mml:mo>
<mml:mo maxsize="1.61em" minsize="1.61em" fence="true" mathvariant="normal">(</mml:mo>
<mml:munder>
<mml:mrow>
<mml:mo largeop="false" movablelimits="false">∑</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
</mml:munder>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">ω</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mi mathvariant="italic">E</mml:mi>
<mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">R</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo>
<mml:mo maxsize="1.61em" minsize="1.61em" fence="true" mathvariant="normal">)</mml:mo>
<mml:mo mathvariant="normal">,</mml:mo>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd class="array">
<mml:mo movablelimits="false">min</mml:mo>
<mml:mo maxsize="1.61em" minsize="1.61em" fence="true" mathvariant="normal">(</mml:mo>
<mml:munder>
<mml:mrow>
<mml:mo largeop="false" movablelimits="false">∑</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
</mml:munder>
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="italic">ω</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:msubsup>
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="italic">σ</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:msubsup>
<mml:mo>+</mml:mo>
<mml:munder>
<mml:mrow>
<mml:mo largeop="false" movablelimits="false">∑</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mo mathvariant="normal">,</mml:mo>
<mml:mi mathvariant="italic">j</mml:mi>
<mml:mo stretchy="false">≠</mml:mo>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
</mml:munder>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">ω</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">ω</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">σ</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">σ</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">ρ</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo maxsize="1.61em" minsize="1.61em" fence="true" mathvariant="normal">)</mml:mo>
<mml:mo mathvariant="normal">,</mml:mo>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd class="array">
<mml:munder>
<mml:mrow>
<mml:mo largeop="false" movablelimits="false">∑</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
</mml:munder>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">ω</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo mathvariant="normal">,</mml:mo>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd class="array">
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">ω</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>⩾</mml:mo>
<mml:mn>0</mml:mn>
<mml:mo mathvariant="normal">,</mml:mo>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:mfenced>
</mml:mtd>
</mml:mtr>
</mml:mtable></mml:math><tex-math><![CDATA[\[ \left\{\begin{array}{l}\max \Big(\textstyle\sum \limits_{i}{\omega _{i}}E({R_{i}})\Big),\\ {} \min \Big(\textstyle\sum \limits_{i}{\omega _{i}^{2}}{\sigma _{i}^{2}}+\textstyle\sum \limits_{i,j\ne i}{\omega _{i}}{\omega _{j}}{\sigma _{i}}{\sigma _{j}}{\rho _{ij}}\Big),\\ {} \textstyle\sum \limits_{i}{\omega _{i}}=1,\\ {} {\omega _{i}}\geqslant 0,\end{array}\right.\]]]></tex-math></alternatives>
</disp-formula> 
where <inline-formula id="j_info1201_ineq_037"><alternatives><mml:math>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">R</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
</mml:msub></mml:math><tex-math><![CDATA[${R_{i}}$]]></tex-math></alternatives></inline-formula> is the return on asset <italic>i</italic> and <inline-formula id="j_info1201_ineq_038"><alternatives><mml:math>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">ω</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
</mml:msub></mml:math><tex-math><![CDATA[${\omega _{i}}$]]></tex-math></alternatives></inline-formula> is the weighting of component asset (that is, the proportion of asset <italic>i</italic> in the portfolio), <inline-formula id="j_info1201_ineq_039"><alternatives><mml:math>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">σ</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
</mml:msub></mml:math><tex-math><![CDATA[${\sigma _{i}}$]]></tex-math></alternatives></inline-formula> is the return variance of asset component <italic>i</italic> and <inline-formula id="j_info1201_ineq_040"><alternatives><mml:math>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">ρ</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub></mml:math><tex-math><![CDATA[${\rho _{ij}}$]]></tex-math></alternatives></inline-formula> is the correlation coefficient between the returns on asset components <italic>i</italic> and <italic>j</italic>. If the return variance of asset components is known, the optimization can be done by quadratic programming algorithms.</p>
<p>It can be demonstrated that the minimum of total return variance is close to <inline-formula id="j_info1201_ineq_041"><alternatives><mml:math>
<mml:msub>
<mml:mrow>
<mml:mo largeop="false" movablelimits="false">∑</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="italic">ω</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:msubsup>
<mml:msubsup>
<mml:mrow>
<mml:mi mathvariant="italic">σ</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:msubsup></mml:math><tex-math><![CDATA[${\textstyle\sum _{i}}{\omega _{i}^{2}}{\sigma _{i}^{2}}$]]></tex-math></alternatives></inline-formula> Maknickienė (<xref ref-type="bibr" rid="j_info1201_ref_032">2014</xref>). Therefore, the minimum can be achieved by choosing large enough amount of asset components or by choosing of small amount of orthogonal asset components. Furthermore, obtained forecasting distributions allow to calculate the probability of sell or buy orders for a current market exchange rate by summation of forecasting distribution from the current exchange rate to zero or to max value, accordingly. It allows to determine which direction the asset component must be traded. If total buy or sell probability of the asset component return is near 1, we have a strong <italic>buy</italic> or <italic>sell</italic> signal. On the other hand, if total buy or sell probability of an asset component return is near 0.5, we have a strong <italic>hold</italic> signal. Finally, we will use the equation 
<disp-formula id="j_info1201_eq_015">
<label>(15)</label><alternatives><mml:math display="block">
<mml:mtable displaystyle="true">
<mml:mtr>
<mml:mtd>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">ω</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo><mml:mstyle displaystyle="true">
<mml:mfrac>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">p</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">ri</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mo largeop="false" movablelimits="false">∑</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">p</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">rj</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfrac>
</mml:mstyle>
</mml:mtd>
</mml:mtr>
</mml:mtable></mml:math><tex-math><![CDATA[\[ {\omega _{i}}=\frac{{p_{\mathit{ri}}}}{{\textstyle\sum _{j}}{p_{\mathit{rj}}}}\]]]></tex-math></alternatives>
</disp-formula> 
for the determination of weights <inline-formula id="j_info1201_ineq_042"><alternatives><mml:math>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">ω</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:mrow>
</mml:msub></mml:math><tex-math><![CDATA[${\omega _{i}}$]]></tex-math></alternatives></inline-formula>, where <inline-formula id="j_info1201_ineq_043"><alternatives><mml:math>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">p</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">ri</mml:mi>
</mml:mrow>
</mml:msub></mml:math><tex-math><![CDATA[${p_{\mathit{ri}}}$]]></tex-math></alternatives></inline-formula> is the probability of asset component return without solving quadratic programming optimization equations.</p>
</sec>
</sec>
<sec id="j_info1201_s_007">
<label>3</label>
<title>Trading Strategies</title>
<p>The information that is available to the investor in the currency market is highly diverse. The proper selection of information channels, data and strategies can significantly increase the probability of successful transactions. The predicted multi-modal distribution provides useful information for investors. The standard deviation indicates the riskiness of a decision, the kurtosis reflects the dispersal of possible values and the skewness additionally indicates the asymmetry of the decision. Furthermore, second and third modes also provide information about changes in the future exchange rate value.</p>
<p>Verification is made in real-time with the demo platform of ‘Oanda’ by using seven different portfolios with different exchange rates: NZD/CAD (New Zealand dollars and Canadian dollars), EUR/JPY (Euro and Japanese yen), GBP/AUD (British pounds and Australian dollars), USD/CHF (US dollars and Swiss francs), USD/JPY (US dollar and Japanese yen), EUR/USD (Euro and US dollars) and GBP/USD (British pounds and US dollars). Our research compares four different strategies based on the combination of distribution forecasting: high-low, day-week, UK-NY end high-low-UK-NY.</p>
<sec id="j_info1201_s_008">
<label>3.1</label>
<title>High-Low Strategy</title>
<p>The historical data consist of high, low, and open, closing values, so the distribution of expected values predicts the corresponding exchange rate for the next period. However, close or open data are less informative for investors. Obviously, an investor makes profit on his decision to buy the lowest values and sell the highest values of financial instruments. Thus, our proposal is to use for the prediction assessment the composition of two distributions, one of which produced using low exchange rate values and the other using high exchange rate values. Thus, our support system is predicting twice. The assessment is made from the composition of high-low distributions, taking into account the close values of the previous day. So, real time decisions are made according to the exchange rate value at the moment of decision-making Stankevic˘ienė <italic>et al.</italic> (<xref ref-type="bibr" rid="j_info1201_ref_051">2014</xref>).</p>
<p>An example of a high-low assessment is shown in Fig. <xref rid="j_info1201_fig_005">5</xref>, which presents the two distributions for the expected EUR/JPY values: high (black) and low (grey). The modes of these distributions are to the right of the close values (the dotted line), so the trading decision in these cases is to <italic>buy</italic>. For this exchange rate <italic>buy</italic> trading decision, the probability of buy loss <inline-formula id="j_info1201_ineq_044"><alternatives><mml:math>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">P</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">l</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mn>0.22</mml:mn></mml:math><tex-math><![CDATA[${P_{l}}=0.22$]]></tex-math></alternatives></inline-formula>, and the probability of buy profit <inline-formula id="j_info1201_ineq_045"><alternatives><mml:math>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">P</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">p</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mn>0.78</mml:mn></mml:math><tex-math><![CDATA[${P_{p}}=0.78$]]></tex-math></alternatives></inline-formula>, where the probability is calculated as normed sum of bars below and above close value.</p>
<fig id="j_info1201_fig_005">
<label>Fig. 5</label>
<caption>
<p>High-low distributions of daily EUR/JPY predicted exchange rate.</p>
</caption>
<graphic xlink:href="info1201_g005.jpg"/>
</fig>
<p>The high-low strategy helps decision-makers in the exchange markets to recognize signals of transactions and to fix limits for expectations (<italic>take a profit</italic> and <italic>stop a loss</italic>).</p>
</sec>
<sec id="j_info1201_s_009">
<label>3.2</label>
<title>Daily-Weekly-High-Low Strategy</title>
<p>A short-term prediction is useful for quickly making decisions in real-time speculations. Knowledge about long-term predictions is the basis for a trading strategy. A combination of these predictions gives a new time horizon for investors and makes their decisions more strategic.</p>
<p>The support system is used four times in this case: daily historical data with high values, daily data with low values, weekly data with high values and weekly data with low values. Two compositions of distributions have some variants. When both compositions are showing the markets changing in the same direction, it is a very clear market trend, but when the two compositions show the markets changing in different directions, the markets are in state of uncertainty.</p>
<fig id="j_info1201_fig_006">
<label>Fig. 6</label>
<caption>
<p>Daily (a) and weekly (b) GBP/AUD high-low compositions of distributions in one scale.</p>
</caption>
<graphic xlink:href="info1201_g006.jpg"/>
</fig>
<p>Our experiment seeks to compare two high-low compositions based on daily and weekly time series, where short-term predictions were made using historical data on daily highs and lows. There we can see the decision to <italic>sell</italic> because both distributions (black and grey) are on the left side of the closing value (the dotted line) of the previous day. The probability of sell profit <inline-formula id="j_info1201_ineq_046"><alternatives><mml:math>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">P</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">p</mml:mi>
</mml:mrow>
</mml:msub></mml:math><tex-math><![CDATA[${P_{p}}$]]></tex-math></alternatives></inline-formula> is <inline-formula id="j_info1201_ineq_047"><alternatives><mml:math>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">P</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">p</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mn>0.89</mml:mn></mml:math><tex-math><![CDATA[${P_{p}}=0.89$]]></tex-math></alternatives></inline-formula>, probability of sell loss <inline-formula id="j_info1201_ineq_048"><alternatives><mml:math>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">P</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">l</mml:mi>
</mml:mrow>
</mml:msub></mml:math><tex-math><![CDATA[${P_{l}}$]]></tex-math></alternatives></inline-formula> is <inline-formula id="j_info1201_ineq_049"><alternatives><mml:math>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">P</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">l</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mn>0.11</mml:mn></mml:math><tex-math><![CDATA[${P_{l}}=0.11$]]></tex-math></alternatives></inline-formula>, where probability is calculated as a normed sum of bars below and above close value. Therefore in the case of the daily GBP/AUD predicted exchange rate distributions the <italic>sell</italic> trading decision should be made. Weekly exchange rates predictions are made in the same way. The weekly composition of probabilities is similar, and the decision is also to <italic>sell</italic>. The probability of loss <inline-formula id="j_info1201_ineq_050"><alternatives><mml:math>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">P</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">l</mml:mi>
</mml:mrow>
</mml:msub></mml:math><tex-math><![CDATA[${P_{l}}$]]></tex-math></alternatives></inline-formula> is <inline-formula id="j_info1201_ineq_051"><alternatives><mml:math>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">P</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">l</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mn>0.22</mml:mn></mml:math><tex-math><![CDATA[${P_{l}}=0.22$]]></tex-math></alternatives></inline-formula> and the probability of profit <inline-formula id="j_info1201_ineq_052"><alternatives><mml:math>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">P</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">p</mml:mi>
</mml:mrow>
</mml:msub></mml:math><tex-math><![CDATA[${P_{p}}$]]></tex-math></alternatives></inline-formula> is <inline-formula id="j_info1201_ineq_053"><alternatives><mml:math>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">P</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">p</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mn>0.78</mml:mn></mml:math><tex-math><![CDATA[${P_{p}}=0.78$]]></tex-math></alternatives></inline-formula>, where the same way probability is calculated as a normed sum of bars below and above close value. Therefore in the case of the weekly predicted distributions of GBP/AUD the <italic>sell</italic> trading decision should be made, too. A comparison of daily and weekly GBP/AUD predictions is shown in Fig. <xref rid="j_info1201_fig_006">6</xref>. The comparison of daily and weekly compositions of distributions in one scale shows that the weekly distribution is more scattered, so it is more risky. But information from daily and weekly predictions helps investors to make daily transactions by knowing the perspective of a week. Sometimes the directions of daily and weekly predictions are the same, and sometimes they are the opposite.</p>
</sec>
<sec id="j_info1201_s_010">
<label>3.3</label>
<title>UK-NY Strategy</title>
<p>The global finance market has, in general, no time zones. All exchange rates are the same around the globe. Divisions of historical data into time intervals are different in the London exchange market (UK) and in the New York exchange market (NY). The shift of time is equal to five hours. We decided to build a composition of forecasts from two distributions of UK-NY. An expectation of this strategy is to go profitable by using daily exchange rates.</p>
<p>In this case, the support system is used twice: the first time with data fixed at the moment of the closing of the London exchange market and the second time with data fixed at the moment of the closing of the New York exchange market. The results of the prediction are composed of two distributions, which show the direction of the exchange rate changing during the period of the New York trading hours. Therefore, the decision should be made at the moment of opening hours of the New York trading time.</p>
<fig id="j_info1201_fig_007">
<label>Fig. 7</label>
<caption>
<p>Distributions of UK-NY of daily USD/JPY exchange rate predictions.</p>
</caption>
<graphic xlink:href="info1201_g007.jpg"/>
</fig>
<p>The distributions combined by UK-NY time difference for USD/JPY rate expected values are shown in Fig. <xref rid="j_info1201_fig_007">7</xref>. There is a clear shift of expectations to the right side, so the decision is to <italic>sell</italic>. A short-term prediction can be successfully used for daily trading. A trading decision is made with the newest information of the finance market. The shift of time in five hours allows investors to recognize the signals of the market in a very short time.</p>
</sec>
<sec id="j_info1201_s_011">
<label>3.4</label>
<title>High-Low-UK-NY Strategy</title>
<p>For investors in exchange markets, it is important to know not only the direction of exchange of the exchange rate but also the moment when this trend will change. To find the limits of daily fluctuations of the exchange rate, we decided to use high-low-UK-NY distributions. A combination of high-low and UK-NY predictions can be explained like 3D: high-low-shift.</p>
<p>The support system in this case is used four times: separately high and low historical data fixed at the moment of the closing of the London market and separately high and low historical data fixed at the moment of the closing of the New York market. Two compositions of distributions determine the shift of exchange rate and the limits of the trading day in the future: high and low.</p>
<p>Cases of EUR/USD high-UK-NY and low-UK-NY are shown in Fig. <xref rid="j_info1201_fig_008">8</xref>. There we can see the decision is to buy because the modes of both compositions of distributions (high and low) are on the right side from the closing value (the dotted line) of the previous day, and the distributions of NY are to the right of UK distributions. The modes of the distributions are as follows: low-UK 1.11, low-NY 1.12, high-UK 1.115, high-NY 1.122. The close value of the previous day is 1.11068, and Take profit can be fixed at 1.12.</p>
<fig id="j_info1201_fig_008">
<label>Fig. 8</label>
<caption>
<p>Low-UK-NY composition of distributions: (a) and high-UK-NY composition of distributions, (b) of daily EUR/USD exchange rate predictions.</p>
</caption>
<graphic xlink:href="info1201_g008.jpg"/>
</fig>
<p>The comparison of high-UK-NY and low-UK-NY compositions of distributions in one scale shows that the UK distributions are more scattered, so the UK market is more risky. However, information from the forecasts from two time zones helps investors make daily decisions while knowing the perspective of the full day. Sometimes the directions of high and low forecasts are the same, and sometimes they are opposite, which is additional information about the behaviour of the exchange markets.</p>
</sec>
<sec id="j_info1201_s_012">
<label>3.5</label>
<title>Evaluation of Prediction Strategies</title>
<p>The distribution of expected values is also a distribution of point predictions. An investor using probability distribution, selects one point from the distribution for take profit and another for stop loss. So we decided to evaluate our new strategies by using the mean absolute percentage error (MAPE).</p>
<table-wrap id="j_info1201_tab_002">
<label>Table 2</label>
<caption>
<p>Trading results using different portfolios.</p>
</caption>
<table>
<thead>
<tr>
<td style="vertical-align: top; text-align: left; border-top: solid thin">Strategy</td>
<td style="vertical-align: top; text-align: left; border-top: solid thin">Portfolio</td>
<td style="vertical-align: top; text-align: left; border-top: solid thin">MAPE</td>
<td style="vertical-align: top; text-align: left; border-top: solid thin">Total profit</td>
<td style="vertical-align: top; text-align: left; border-top: solid thin">Profit</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin"/>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">(level of risk)</td>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">(%)</td>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">(euro)</td>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">per trade</td>
</tr>
</thead>
<tbody>
<tr>
<td style="vertical-align: top; text-align: left">Hi</td>
<td style="vertical-align: top; text-align: left">daily moderate</td>
<td style="vertical-align: top; text-align: left">0.20</td>
<td style="vertical-align: top; text-align: left">3612.29</td>
<td style="vertical-align: top; text-align: left">26.23</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">gh-low</td>
<td style="vertical-align: top; text-align: left">conservative</td>
<td style="vertical-align: top; text-align: left">0.3</td>
<td style="vertical-align: top; text-align: left">1041.82</td>
<td style="vertical-align: top; text-align: left">12.39</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left"/>
<td style="vertical-align: top; text-align: left">daily aggressive</td>
<td style="vertical-align: top; text-align: left">0.38</td>
<td style="vertical-align: top; text-align: left">2855.29</td>
<td style="vertical-align: top; text-align: left">11.25</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Day-week</td>
<td style="vertical-align: top; text-align: left">conservative</td>
<td style="vertical-align: top; text-align: left">0.37</td>
<td style="vertical-align: top; text-align: left">1777.15</td>
<td style="vertical-align: top; text-align: left">44.4</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left"/>
<td style="vertical-align: top; text-align: left">moderate</td>
<td style="vertical-align: top; text-align: left">0.32</td>
<td style="vertical-align: top; text-align: left">2219.0</td>
<td style="vertical-align: top; text-align: left">34.7</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left"/>
<td style="vertical-align: top; text-align: left">aggressive</td>
<td style="vertical-align: top; text-align: left">0.86</td>
<td style="vertical-align: top; text-align: left">2934.04</td>
<td style="vertical-align: top; text-align: left">22</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">NY-UK</td>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">conservative</td>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">0.10</td>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">741.53</td>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">41.2</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>The best evaluator of forecasting the finance markets is the real market with all of its unpredictable factors like banking interventions, geopolitical events, natural catastrophes and other events. We are trading every day on the ‘Oanda’ demo platform with seven different portfolios with different level of risk. Portfolios are determined by the choice of different risk levels of the trading account. A conservative portfolio has a 1:10 leverage, and funds are shared equally. A moderate portfolio has a 1:20 leverage, and the funds are divided in proportion to the projected profit. An aggressive portfolio has a 1:50 leverage, and the funds are divided in proportion to the projected profit. Different strategies started at different times: high-low has been alive more than one year, day-week has been alive slightly less than one year, UK-NY has been alive for some months, and high-low-UK-NY is too new for evaluation.</p>
<p>The MAPE varies from 0.1% to 0.86%. The profitability is similar with regard to the duration of trading in the currency market. Moderate and aggressive portfolios are more profitable than conservative ones. Profit per trade is about twice as high when applied daily-weekly or with the UK-NY strategy than in the case of the high-low strategy. These results show that the daily-weekly and UK-NY strategies allow investors to find a more accurate time for stopping transactions and keep the currency active for a longer period of time.</p>
</sec>
</sec>
<sec id="j_info1201_s_013">
<label>4</label>
<title>Conclusions</title>
<p>In our research, we developed a novel support system by using the latest technological breakthroughs of artificial intelligence and investor experience. A combination of distributional forecasts gives investors new opportunities based on data mining and information about future behaviour of exchange rates.</p>
<p>We validated the efficiency of developed trading support system by calculation of predicting RMSE of single agent of EVOLINO RNN ensemble in comparison to predicting RMSE of Mackey–Glass chaotic time series. The numeric recalculation of different RNN configurations allows to find the optimized configuration neural networks of predicting module.</p>
<p>We proposed four different strategies based on a combination of distribution forecasts with different opportunities of time perspective and fixing the end of transactions: 
<list>
<list-item id="j_info1201_li_001">
<label>1.</label>
<p>The high-low strategy helps investors to recognize signals of transactions and to fix limits for expectations;</p>
</list-item>
<list-item id="j_info1201_li_002">
<label>2.</label>
<p>The daily-weekly strategy helps investors to make daily transactions while knowing the perspective of a week;</p>
</list-item>
<list-item id="j_info1201_li_003">
<label>3.</label>
<p>The UK-NY strategy allows investors to recognize the signals of the market in a very short term;</p>
</list-item>
<list-item id="j_info1201_li_004">
<label>4.</label>
<p>The high-low-UK-NY strategy helps investors to recognize the signals of transactions in a very short term and to fix the limits.</p>
</list-item>
</list> 
The accuracy of forecasting MAPE with respect to mode in all cases is from 0.1% to 0.86%. The profitability is similar with regard to the duration of trading in the currency market. Profit per trade is about twice as high when applied daily-weekly or with the UK-NY strategy than in the case of the high-low strategy. These results show that daily-weekly and UK-NY strategies allow the investor to find a more accurate time for stopping a transaction and keeping the currency active for a longer period of time.</p>
</sec>
</body>
<back>
<ref-list id="j_info1201_reflist_001">
<title>References</title>
<ref id="j_info1201_ref_001">
<mixed-citation publication-type="journal"><string-name><surname>Araújo</surname>, <given-names>M.B.</given-names></string-name>, <string-name><surname>New</surname>, <given-names>M.</given-names></string-name> (<year>2007</year>). <article-title>Ensemble forecasting of species distributions</article-title>. <source>Trends in Ecology and Evolution</source>, <volume>22</volume>(<issue>1</issue>), <fpage>42</fpage>–<lpage>7</lpage>.</mixed-citation>
</ref>
<ref id="j_info1201_ref_002">
<mixed-citation publication-type="journal"><string-name><surname>Adhikari</surname>, <given-names>R.</given-names></string-name>, <string-name><surname>Agrawal</surname>, <given-names>R.K.</given-names></string-name> (<year>2014</year>a). <article-title>A combination of artificial neural network and random walk models for financial time series forecasting</article-title>. <source>Neural Computing and Applications</source>, <volume>24</volume>(<issue>6</issue>), <fpage>1441</fpage>–<lpage>1449</lpage>.</mixed-citation>
</ref>
<ref id="j_info1201_ref_003">
<mixed-citation publication-type="journal"><string-name><surname>Adhikari</surname>, <given-names>R.</given-names></string-name>, <string-name><surname>Agrawal</surname>, <given-names>R.K.</given-names></string-name> (<year>2014</year>b). <article-title>Performance evaluation of weights selection schemes for linear combination of multiple forecasts</article-title>. <source>Artificial Intelligence Review</source>, <volume>42</volume>(<issue>4</issue>), <fpage>529</fpage>–<lpage>548</lpage>.</mixed-citation>
</ref>
<ref id="j_info1201_ref_004">
<mixed-citation publication-type="journal"><string-name><surname>Andrawis</surname>, <given-names>R.R.</given-names></string-name>, <string-name><surname>Atiya</surname>, <given-names>A.F.</given-names></string-name>, <string-name><surname>El-Shishiny</surname>, <given-names>H.</given-names></string-name> (<year>2011</year>). <article-title>Forecast combinations of computational intelligence and linear models for the NN5 time series forecasting competition</article-title>. <source>International Journal of Forecasting</source>, <volume>27</volume>(<issue>3</issue>), <fpage>672</fpage>–<lpage>688</lpage>.</mixed-citation>
</ref>
<ref id="j_info1201_ref_005">
<mixed-citation publication-type="journal"><string-name><surname>Bilson</surname>, <given-names>J.</given-names></string-name> (<year>1981</year>). <article-title>The ‘speculative efficiency’ hypothesis</article-title>. <source>Journal of Business</source>, <volume>54</volume>, <fpage>425</fpage>–<lpage>452</lpage>.</mixed-citation>
</ref>
<ref id="j_info1201_ref_006">
<mixed-citation publication-type="journal"><string-name><surname>Cabrera-Paniagua</surname>, <given-names>D.</given-names></string-name>, <string-name><surname>Cubillos</surname>, <given-names>C.</given-names></string-name>, <string-name><surname>Vicari</surname>, <given-names>R.</given-names></string-name>, <string-name><surname>Urra</surname>, <given-names>E.</given-names></string-name> (<year>2015</year>). <article-title>Decision-making system for stock exchange market using artificial emotions</article-title>. <source>Expert Systems with Applications</source>, <volume>42</volume>(<issue>20</issue>), <fpage>7070</fpage>–<lpage>7083</lpage>.</mixed-citation>
</ref>
<ref id="j_info1201_ref_007">
<mixed-citation publication-type="journal"><string-name><surname>Caporale</surname>, <given-names>G.M.</given-names></string-name>, <string-name><surname>Gil-Alana</surname>, <given-names>L.A.</given-names></string-name> (<year>2013</year>). <article-title>Long memory and fractional integration in high frequency data on the US dollar/British pound spot exchange rate</article-title>. <source>International Review of Financial Analysis</source>, <volume>29</volume>, <fpage>1</fpage>–<lpage>9</lpage>.</mixed-citation>
</ref>
<ref id="j_info1201_ref_008">
<mixed-citation publication-type="journal"><string-name><surname>Chen</surname>, <given-names>C.W.</given-names></string-name> (<year>2014</year>). <article-title>Retracted: applications of neural network based fuzzy logic control to a nonlinear time-delay chaotic system</article-title>. <source>Journal of Vibration and Control</source>, <volume>20</volume>(<issue>4</issue>), <fpage>589</fpage>–<lpage>605</lpage>.</mixed-citation>
</ref>
<ref id="j_info1201_ref_009">
<mixed-citation publication-type="journal"><string-name><surname>Chourmouziadis</surname>, <given-names>K.</given-names></string-name>, <string-name><surname>Chatzoglou</surname>, <given-names>P.D.</given-names></string-name> (<year>2016</year>). <article-title>An intelligent short term stock trading fuzzy system for assisting investors in portfolio management</article-title>. <source>Expert Systems with Applications</source>, <volume>43</volume>, <fpage>298</fpage>–<lpage>311</lpage>.</mixed-citation>
</ref>
<ref id="j_info1201_ref_010">
<mixed-citation publication-type="journal"><string-name><surname>Dalcin</surname>, <given-names>L.</given-names></string-name>, <string-name><surname>Paz</surname>, <given-names>R.</given-names></string-name>, <string-name><surname>Storti</surname>, <given-names>M.</given-names></string-name> (<year>2005</year>). <article-title>MPI for Python</article-title>. <source>Journal of Parallel and Distributed Computing</source>, <volume>65</volume>(<issue>9</issue>), <fpage>1108</fpage>–<lpage>1115</lpage>.</mixed-citation>
</ref>
<ref id="j_info1201_ref_011">
<mixed-citation publication-type="journal"><string-name><surname>Dalcin</surname>, <given-names>L.</given-names></string-name>, <string-name><surname>Paz</surname>, <given-names>R.</given-names></string-name>, <string-name><surname>Storti</surname>, <given-names>M.</given-names></string-name>, <string-name><surname>D’Elia</surname>, <given-names>J.</given-names></string-name> (<year>2008</year>). <article-title>MPI for Python: performance improvements and MPI-2 extensions</article-title>. <source>Journal of Parallel and Distributed Computing</source>, <volume>68</volume>(<issue>5</issue>), <fpage>655</fpage>–<lpage>662</lpage>.</mixed-citation>
</ref>
<ref id="j_info1201_ref_012">
<mixed-citation publication-type="journal"><string-name><surname>Dalcin</surname>, <given-names>L.</given-names></string-name>, <string-name><surname>Kler</surname>, <given-names>P.</given-names></string-name>, <string-name><surname>Paz</surname>, <given-names>R.</given-names></string-name>, <string-name><surname>Cosimo</surname>, <given-names>A.</given-names></string-name> (<year>2011</year>). <article-title>Parallel distributed computing using Python</article-title>. <source>Advances in Water Resources</source>, <volume>34</volume>(<issue>9</issue>), <fpage>1124</fpage>–<lpage>1139</lpage>.</mixed-citation>
</ref>
<ref id="j_info1201_ref_013">
<mixed-citation publication-type="journal"><string-name><surname>De Luca</surname>, <given-names>G.</given-names></string-name>, <string-name><surname>Carfora</surname>, <given-names>A.</given-names></string-name> (<year>2014</year>). <article-title>Predicting US recessions through a combination of probability forecasts</article-title>. <source>Empirical Economics</source>, <volume>46</volume>(<issue>1</issue>), <fpage>127</fpage>–<lpage>144</lpage>.</mixed-citation>
</ref>
<ref id="j_info1201_ref_014">
<mixed-citation publication-type="journal"><string-name><surname>DelSole</surname>, <given-names>T.</given-names></string-name>, <string-name><surname>Yang</surname>, <given-names>X.</given-names></string-name>, <string-name><surname>Tippett</surname>, <given-names>M.K.</given-names></string-name> (<year>2013</year>). <article-title>Is unequal weighting significantly better than equal weighting for multi-model forecasting?</article-title> <source>Quarterly Journal of the Royal Meteorological Society</source>, <volume>139</volume>(<issue>670</issue>), <fpage>176</fpage>–<lpage>183</lpage>.</mixed-citation>
</ref>
<ref id="j_info1201_ref_015">
<mixed-citation publication-type="journal"><string-name><surname>Donaldson</surname>, <given-names>R.G.</given-names></string-name>, <string-name><surname>Kamstra</surname>, <given-names>M.</given-names></string-name> (<year>1996</year>). <article-title>Forecast combining with neural networks</article-title>. <source>Journal of Forecasting</source>, <volume>15</volume>(<issue>1</issue>), <fpage>49</fpage>–<lpage>61</lpage>.</mixed-citation>
</ref>
<ref id="j_info1201_ref_016">
<mixed-citation publication-type="book"><string-name><surname>Elliott</surname>, <given-names>G.</given-names></string-name>, <string-name><surname>Granger</surname>, <given-names>V.W.</given-names></string-name>, <string-name><surname>Timmermann</surname>, <given-names>A.</given-names></string-name> (Eds.) (<year>2013</year>). <source>Handbook of Economic Forecasting SET 2A–2B</source>. <publisher-name>Elsevier</publisher-name>.</mixed-citation>
</ref>
<ref id="j_info1201_ref_017">
<mixed-citation publication-type="journal"><string-name><surname>Fama</surname>, <given-names>E.F.</given-names></string-name> (<year>1984</year>). <article-title>Forward and spot exchange rates</article-title>. <source>Journal of Monetary Economics</source>, <volume>14</volume>(<issue>3</issue>), <fpage>319</fpage>–<lpage>338</lpage>.</mixed-citation>
</ref>
<ref id="j_info1201_ref_018">
<mixed-citation publication-type="journal"><string-name><surname>Farmer</surname>, <given-names>J.D.</given-names></string-name>, <string-name><surname>Sidorowich</surname>, <given-names>J.J.</given-names></string-name> (<year>1987</year>). <article-title>Predicting chaotic time series</article-title>. <source>Physical Review Letters</source>, <volume>59</volume>(<issue>8</issue>), <fpage>845</fpage>.</mixed-citation>
</ref>
<ref id="j_info1201_ref_019">
<mixed-citation publication-type="journal"><string-name><surname>Fiszeder</surname>, <given-names>P.</given-names></string-name>, <string-name><surname>Perczak</surname>, <given-names>G.</given-names></string-name> (<year>2013</year>). <article-title>A new look at variance estimation based on low, high and closing prices taking into account the drift</article-title>. <source>Statistica Neerlandica</source>, <volume>67</volume>(<issue>4</issue>), <fpage>456</fpage>–<lpage>481</lpage>.</mixed-citation>
</ref>
<ref id="j_info1201_ref_020">
<mixed-citation publication-type="chapter"><string-name><surname>Fonseca</surname>, <given-names>R.</given-names></string-name>, <string-name><surname>Gómez-Gil</surname>, <given-names>P.</given-names></string-name> (<year>2014</year>). <chapter-title>Temporal validated meta-learning for long-term forecasting of chaotic time series using Monte Carlo cross-validation</chapter-title>. In: <source>Recent Advances on Hybrid Approaches for Designing Intelligent Systems</source>. <publisher-name>Springer</publisher-name>, pp. <fpage>353</fpage>–<lpage>367</lpage>.</mixed-citation>
</ref>
<ref id="j_info1201_ref_021">
<mixed-citation publication-type="journal"><string-name><surname>Genre</surname>, <given-names>V.</given-names></string-name>, <string-name><surname>Kenny</surname>, <given-names>G.</given-names></string-name>, <string-name><surname>Meyler</surname>, <given-names>A.</given-names></string-name>, <string-name><surname>Timmermann</surname>, <given-names>A.</given-names></string-name> (<year>2013</year>). <article-title>Combining expert forecasts: can anything beat the simple average?</article-title> <source>International Journal of Forecasting</source>, <volume>29</volume>(<issue>1</issue>), <fpage>108</fpage>–<lpage>121</lpage>.</mixed-citation>
</ref>
<ref id="j_info1201_ref_022">
<mixed-citation publication-type="other"><string-name><surname>Gers</surname>, <given-names>F.</given-names></string-name> (2001). <italic>Long Short-Term Memory in Recurrent Neural Networks</italic>. PhD thesis, Ecole Polytechnique Federale de Lausanne.</mixed-citation>
</ref>
<ref id="j_info1201_ref_023">
<mixed-citation publication-type="journal"><string-name><surname>Goudreau</surname>, <given-names>M.</given-names></string-name>, <string-name><surname>Giles</surname>, <given-names>C.</given-names></string-name>, <string-name><surname>Chakradhar</surname>, <given-names>S.</given-names></string-name>, <string-name><surname>Chen</surname>, <given-names>D.</given-names></string-name> (<year>1994</year>). <article-title>First-order vs. second-order single layer recurrent neural networks</article-title>. <source>IEEE Transactions on Neural Networks</source>, <volume>5</volume>(<issue>3</issue>), <fpage>511</fpage>.</mixed-citation>
</ref>
<ref id="j_info1201_ref_024">
<mixed-citation publication-type="journal"><string-name><surname>Jaeger</surname>, <given-names>H.</given-names></string-name> (<year>2004</year>). <article-title>Harnessing nonlinearity: predicting chaotic systems and saving energy in wireless communication</article-title>. <source>Science</source>, <volume>304</volume>, <fpage>78</fpage>–<lpage>80</lpage>.</mixed-citation>
</ref>
<ref id="j_info1201_ref_025">
<mixed-citation publication-type="journal"><string-name><surname>Kavousi-Fard</surname>, <given-names>A.</given-names></string-name>, <string-name><surname>Khosravi</surname>, <given-names>A.</given-names></string-name>, <string-name><surname>Nahavandi</surname>, <given-names>S.</given-names></string-name> (<year>2016</year>). <article-title>A new fuzzy-based combined prediction interval for wind power forecasting</article-title>. <source>IEEE Transactions on Power Systems</source>, <volume>31</volume>(<issue>1</issue>), <fpage>18</fpage>–<lpage>26</lpage>.</mixed-citation>
</ref>
<ref id="j_info1201_ref_026">
<mixed-citation publication-type="journal"><string-name><surname>Kolassa</surname>, <given-names>S.</given-names></string-name> (<year>2011</year>). <article-title>Combining exponential smoothing forecasts using Akaike weights</article-title>. <source>International Journal of Forecasting</source>, <volume>27</volume>(<issue>2</issue>), <fpage>238</fpage>–<lpage>251</lpage>.</mixed-citation>
</ref>
<ref id="j_info1201_ref_027">
<mixed-citation publication-type="journal"><string-name><surname>Kourentzes</surname>, <given-names>N.</given-names></string-name>, <string-name><surname>Barrow</surname>, <given-names>D.</given-names></string-name>, <string-name><surname>Crone</surname>, <given-names>S.</given-names></string-name> (<year>2014</year>). <article-title>Neural network ensemble operators for time series forecasting</article-title>. <source>Expert Systems with Applications</source>, <volume>41</volume>(<issue>9</issue>), <fpage>4235</fpage>–<lpage>4244</lpage>.</mixed-citation>
</ref>
<ref id="j_info1201_ref_028">
<mixed-citation publication-type="other"><string-name><surname>Lapedes</surname>, <given-names>A.</given-names></string-name>, <string-name><surname>Farber</surname>, <given-names>R.</given-names></string-name> (1987). <italic>Non linear Signal Processing Using Neural Networks: Prediction and System Modelling</italic>. Technical report LA-UR-87-2662, Los Alamos National Laboratory, Los Alamos, NM.</mixed-citation>
</ref>
<ref id="j_info1201_ref_029">
<mixed-citation publication-type="chapter"><string-name><surname>Lapedes</surname>, <given-names>A.</given-names></string-name>, <string-name><surname>Farber</surname>, <given-names>R.</given-names></string-name> (<year>1988</year>). <chapter-title>How neural nets work</chapter-title>. In: <string-name><surname>Anderson</surname>, <given-names>D.Z.</given-names></string-name> (Ed.), <source>Neural Information Processing Systems</source>. <publisher-name>American Institute of Physics</publisher-name>, <publisher-loc>New York</publisher-loc>, pp. <fpage>442</fpage>–<lpage>456</lpage>.</mixed-citation>
</ref>
<ref id="j_info1201_ref_030">
<mixed-citation publication-type="chapter"><string-name><surname>Lee</surname>, <given-names>S.-H.</given-names></string-name>, <string-name><surname>Kim</surname>, <given-names>I.</given-names></string-name> (<year>1994</year>). <chapter-title>Time series analysis using fuzzy learning</chapter-title>. In: <source>Proceedings of the International Conference on Neural Information Processing</source>, <conf-loc>Seoul, Korea</conf-loc>, Vol. <volume>6</volume>, pp. <fpage>1577</fpage>–<lpage>1582</lpage>.</mixed-citation>
</ref>
<ref id="j_info1201_ref_031">
<mixed-citation publication-type="chapter"><string-name><surname>Maknickas</surname>, <given-names>A.</given-names></string-name>, <string-name><surname>Maknickienė</surname>, <given-names>N.</given-names></string-name> (<year>2012</year>). <chapter-title>Influence of data orthogonality: on the accuracy and stability of financial market predictions</chapter-title>. In: <source>IJCCI 2012</source>. <publisher-name>INSTICC</publisher-name>, pp. <fpage>616</fpage>–<lpage>619</lpage>.</mixed-citation>
</ref>
<ref id="j_info1201_ref_032">
<mixed-citation publication-type="journal"><string-name><surname>Maknickienė</surname>, <given-names>N.</given-names></string-name> (<year>2014</year>). <article-title>Selection of orthogonal investment portfolio using Evolino RNN trading model</article-title>. <source>Procedia – Social and Behavioral Sciences</source>, <volume>110</volume>, <fpage>1158</fpage>–<lpage>1165</lpage>.</mixed-citation>
</ref>
<ref id="j_info1201_ref_033">
<mixed-citation publication-type="journal"><string-name><surname>Maknickienė</surname>, <given-names>N.</given-names></string-name>, <string-name><surname>Maknickas</surname>, <given-names>A.</given-names></string-name> (<year>2013</year>). <article-title>Financial market prediction system with evolino neural network and delphi method</article-title>. <source>Journal of Business Economics and Management</source>, <volume>14</volume>(<issue>2</issue>), <fpage>403</fpage>–<lpage>413</lpage>.</mixed-citation>
</ref>
<ref id="j_info1201_ref_034">
<mixed-citation publication-type="chapter"><string-name><surname>Mantri</surname>, <given-names>J.K.</given-names></string-name>, <string-name><surname>Nayak</surname>, <given-names>B.B.</given-names></string-name> (<year>2015</year>). <chapter-title>Financial trading system using combination of textual and numeric data</chapter-title>. In: <source>Intelligent Computing, Communication and Devices</source>. <publisher-name>Springer</publisher-name>, <publisher-loc>India</publisher-loc>, pp. <fpage>433</fpage>–<lpage>439</lpage>.</mixed-citation>
</ref>
<ref id="j_info1201_ref_035">
<mixed-citation publication-type="journal"><string-name><surname>Markowitz</surname>, <given-names>H.</given-names></string-name> (<year>1952</year>). <article-title>Portfolio selection</article-title>. <source>The Journal of Finance</source>, <volume>7</volume>(<issue>1</issue>), <fpage>77</fpage>–<lpage>91</lpage>.</mixed-citation>
</ref>
<ref id="j_info1201_ref_036">
<mixed-citation publication-type="chapter"><string-name><surname>Mittermayer</surname>, <given-names>M.A.</given-names></string-name> (<year>2004</year>). <chapter-title>Forecasting intraday stock price trends with text mining techniques</chapter-title>. In: <source>Proceedings of the 37th Annual Hawaii International Conference on System Sciences</source>. <publisher-name>IEEE Press</publisher-name>, pp. <fpage>10</fpage>–<lpage>19</lpage>. <comment>2004</comment>.</mixed-citation>
</ref>
<ref id="j_info1201_ref_037">
<mixed-citation publication-type="journal"><string-name><surname>Peterson</surname>, <given-names>P.</given-names></string-name> (<year>2009</year>). <source>International Journal of Computational Science and Engineering</source>, <volume>4</volume>(<issue>4</issue>), <fpage>296</fpage>–<lpage>305</lpage>.</mixed-citation>
</ref>
<ref id="j_info1201_ref_038">
<mixed-citation publication-type="journal"><string-name><surname>Petropoulos</surname>, <given-names>F.</given-names></string-name>, <string-name><surname>Makridakis</surname>, <given-names>S.</given-names></string-name>, <string-name><surname>Assimakopoulos</surname>, <given-names>V.</given-names></string-name>, <string-name><surname>Nikolopoulos</surname>, <given-names>K.</given-names></string-name> (<year>2014</year>). <article-title>‘Horses for Courses’ in demand forecasting</article-title>. <source>European Journal of Operational Research</source>, <volume>237</volume>(<issue>1</issue>), <fpage>152</fpage>–<lpage>163</lpage>.</mixed-citation>
</ref>
<ref id="j_info1201_ref_039">
<mixed-citation publication-type="journal"><string-name><surname>Prokesch</surname>, <given-names>T.</given-names></string-name>, <string-name><surname>Heiko</surname>, <given-names>A.</given-names></string-name>, <string-name><surname>Wohlenberg</surname>, <given-names>H.</given-names></string-name> (<year>2015</year>). <article-title>Integrating prediction market and Delphi methodology into a foresight support system–insights from an online game</article-title>. <source>Technological Forecasting and Social Change</source>, <volume>97</volume>, <fpage>47</fpage>–<lpage>64</lpage>.</mixed-citation>
</ref>
<ref id="j_info1201_ref_040">
<mixed-citation publication-type="other">Python 2.7.3 profiler, retrieved 2016. <ext-link ext-link-type="uri" xlink:href="https://docs.python.org/2/library/profile.html">https://docs.python.org/2/library/profile.html</ext-link>.</mixed-citation>
</ref>
<ref id="j_info1201_ref_041">
<mixed-citation publication-type="journal"><string-name><surname>Rodrigues</surname>, <given-names>P.M.</given-names></string-name>, <string-name><surname>Salish</surname>, <given-names>N.</given-names></string-name> (<year>2015</year>). <article-title>Modeling and forecasting interval time series with threshold models</article-title>. <source>Advances in Data Analysis and Classification</source>, <volume>9</volume>(<issue>1</issue>), <fpage>41</fpage>–<lpage>57</lpage>.</mixed-citation>
</ref>
<ref id="j_info1201_ref_042">
<mixed-citation publication-type="journal"><string-name><surname>Roll</surname>, <given-names>R.</given-names></string-name> (<year>1980</year>). <article-title>Orthogonal portfolios</article-title>. <source>Journal of Financial and Quantitative Analysis</source>, <volume>15</volume>(<issue>05</issue>), <fpage>1005</fpage>–<lpage>1023</lpage>.</mixed-citation>
</ref>
<ref id="j_info1201_ref_043">
<mixed-citation publication-type="journal"><string-name><surname>Samanta</surname>, <given-names>B.</given-names></string-name> (<year>2011</year>). <article-title>Prediction of chaotic time series using computational intelligence</article-title>. <source>Expert Systems with Applications</source>, <volume>38</volume>(<issue>9</issue>), <fpage>11406</fpage>–<lpage>11411</lpage>.</mixed-citation>
</ref>
<ref id="j_info1201_ref_044">
<mixed-citation publication-type="other"><string-name><surname>Schmidhuber</surname>, <given-names>J.</given-names></string-name>, <string-name><surname>Gagliolo</surname>, <given-names>M.</given-names></string-name>, <string-name><surname>Wierstra</surname>, <given-names>D.</given-names></string-name>, <string-name><surname>Gomez</surname>, <given-names>F.</given-names></string-name> (2005a). <italic>Evolino for recurrent support vector machines</italic>. arXiv preprint cs/0512062.</mixed-citation>
</ref>
<ref id="j_info1201_ref_045">
<mixed-citation publication-type="chapter"><string-name><surname>Schmidhuber</surname>, <given-names>J.</given-names></string-name>, <string-name><surname>Wierstra</surname>, <given-names>D.</given-names></string-name>, <string-name><surname>Gomez</surname>, <given-names>F.</given-names></string-name> (<year>2005</year>b). <chapter-title>Evolino: hybrid neuroevolution/optimal linear search for sequence prediction</chapter-title>. In: <source>Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI)</source>. <publisher-name>Citeseer</publisher-name>.</mixed-citation>
</ref>
<ref id="j_info1201_ref_046">
<mixed-citation publication-type="journal"><string-name><surname>Schmidhuber</surname>, <given-names>J.</given-names></string-name>, <string-name><surname>Wierstra</surname>, <given-names>D.</given-names></string-name>, <string-name><surname>Gagliolo</surname>, <given-names>M.</given-names></string-name>, <string-name><surname>Gomez</surname>, <given-names>F.</given-names></string-name> (<year>2007</year>). <article-title>Training recurrent networks by evolino</article-title>. <source>Neural Computation</source>, <volume>19</volume>(<issue>3</issue>), <fpage>757</fpage>–<lpage>779</lpage>.</mixed-citation>
</ref>
<ref id="j_info1201_ref_047">
<mixed-citation publication-type="journal"><string-name><surname>Schorfheide</surname>, <given-names>F.</given-names></string-name>, <string-name><surname>Song</surname>, <given-names>D.</given-names></string-name> (<year>2015</year>). <article-title>Real-time forecasting with a mixed-frequency VAR</article-title>. <source>Journal of Business and Economic Statistics</source>, <volume>33</volume>(<issue>3</issue>), <fpage>366</fpage>–<lpage>380</lpage>.</mixed-citation>
</ref>
<ref id="j_info1201_ref_048">
<mixed-citation publication-type="journal"><string-name><surname>Sermpinis</surname>, <given-names>G.</given-names></string-name>, <string-name><surname>Laws</surname>, <given-names>J.</given-names></string-name>, <string-name><surname>Dunis</surname>, <given-names>C.L.</given-names></string-name> (<year>2015</year>). <article-title>Modelling commodity value at risk with Psi Sigma neural networks using open-high-low-close data</article-title>. <source>The European Journal of Finance</source>, <volume>21</volume>(<issue>4</issue>), <fpage>316</fpage>–<lpage>336</lpage>.</mixed-citation>
</ref>
<ref id="j_info1201_ref_049">
<mixed-citation publication-type="journal"><string-name><surname>Siegelmann</surname>, <given-names>H.T.</given-names></string-name>, <string-name><surname>Ben-Hur</surname>, <given-names>A.</given-names></string-name>, <string-name><surname>Fishman</surname>, <given-names>S.</given-names></string-name> (<year>1999</year>). <article-title>Computational complexity for continuous time dynamics</article-title>. <source>Physical Review Letters</source>, <volume>83</volume>(<issue>7</issue>), <fpage>1463</fpage>–<lpage>1466</lpage>.</mixed-citation>
</ref>
<ref id="j_info1201_ref_050">
<mixed-citation publication-type="journal"><string-name><surname>Song</surname>, <given-names>H.</given-names></string-name>, <string-name><surname>Gao</surname>, <given-names>B.Z.</given-names></string-name>, <string-name><surname>Lin</surname>, <given-names>V.S.</given-names></string-name> (<year>2013</year>). <article-title>Combining statistical and judgmental forecasts via a web-based tourism demand forecasting system</article-title>. <source>International Journal of Forecasting</source>, <volume>29</volume>(<issue>2</issue>), <fpage>295</fpage>–<lpage>310</lpage>.</mixed-citation>
</ref>
<ref id="j_info1201_ref_051">
<mixed-citation publication-type="chapter"><string-name><surname>Stankevic˘ienė</surname>, <given-names>J.</given-names></string-name>, <string-name><surname>Maknickienė</surname>, <given-names>N.</given-names></string-name>, <string-name><surname>Maknickas</surname>, <given-names>A.</given-names></string-name> (<year>2014</year>). <chapter-title>Investigation of exchange market prediction model based on high-low daily data</chapter-title>. In: <source>The 8th international scientific conference “Business and Management 2014”</source>. <publisher-name>Technika</publisher-name>, <publisher-loc>Vilnius</publisher-loc>.</mixed-citation>
</ref>
<ref id="j_info1201_ref_052">
<mixed-citation publication-type="journal"><string-name><surname>Wallis</surname>, <given-names>K.F.</given-names></string-name> (<year>2005</year>). <article-title>Combining density and interval forecasts: a modest proposal</article-title>. <source>Oxford Bulletin of Economics and Statistics</source>, <volume>67</volume>(<issue>1</issue>), <fpage>983</fpage>–<lpage>994</lpage>.</mixed-citation>
</ref>
<ref id="j_info1201_ref_053">
<mixed-citation publication-type="book"><string-name><surname>Widenius</surname>, <given-names>M.</given-names></string-name>, <string-name><surname>DuBois</surname>, <given-names>P.</given-names></string-name>, <string-name><surname>Axmark</surname>, <given-names>D.</given-names></string-name> (<year>2002</year>). <source>Mysql Reference Manual</source>. <publisher-name>O’Reilly &amp; Associates, Inc.</publisher-name>, <publisher-loc>Sebastopol, CA</publisher-loc>.</mixed-citation>
</ref>
<ref id="j_info1201_ref_054">
<mixed-citation publication-type="journal"><string-name><surname>Zang</surname>, <given-names>G.B.</given-names></string-name>, <string-name><surname>Patuwo</surname>, <given-names>E.</given-names></string-name>, <string-name><surname>Hu</surname>, <given-names>M.Y.</given-names></string-name> (<year>1998</year>). <article-title>Forecasting with artificial neural networks: the state of art</article-title>. <source>International Journal of Forecasting</source>, <volume>14</volume>, <fpage>35</fpage>–<lpage>62</lpage>.</mixed-citation>
</ref>
<ref id="j_info1201_ref_055">
<mixed-citation publication-type="chapter"><string-name><surname>Zhang</surname>, <given-names>G.P.</given-names></string-name> (<year>2012</year>). <chapter-title>Neural networks for time-series forecasting</chapter-title>. In: <source>Handbook of Natural Computing</source>. <publisher-name>Springer</publisher-name>, <publisher-loc>Berlin, Heidelberg</publisher-loc>, pp. <fpage>461</fpage>–<lpage>477</lpage>.</mixed-citation>
</ref>
<ref id="j_info1201_ref_056">
<mixed-citation publication-type="chapter"><string-name><surname>Zhang</surname>, <given-names>C.</given-names></string-name>, <string-name><surname>Wei</surname>, <given-names>H.</given-names></string-name>, <string-name><surname>Liu</surname>, <given-names>T.</given-names></string-name>, <string-name><surname>Zhu</surname>, <given-names>T.</given-names></string-name>, <string-name><surname>Zhang</surname>, <given-names>K.</given-names></string-name> (<year>2015</year>). <chapter-title>Short-term wind speed forecasting using a multi-model ensemble</chapter-title>. In: <source>Advances in Neural Networks – ISNN 2015</source>. <publisher-name>Springer International Publishing</publisher-name>, pp. <fpage>398</fpage>–<lpage>406</lpage>.</mixed-citation>
</ref>
</ref-list>
</back>
</article>