<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v2.3 20070202//EN" "journalpublishing.dtd">
<?covid-19-tdm?>
<article xml:lang="EN" 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">Front. Big Data</journal-id>
<journal-title>Frontiers in Big Data</journal-title>
<abbrev-journal-title abbrev-type="pubmed">Front. Big Data</abbrev-journal-title>
<issn pub-type="epub">2624-909X</issn>
<publisher>
<publisher-name>Frontiers Media S.A.</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="doi">10.3389/fdata.2023.1081639</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Big Data</subject>
<subj-group>
<subject>Original Research</subject>
</subj-group>
</subj-group>
</article-categories>
<title-group>
<article-title>Nonstationary time series forecasting using optimized-EVDHM-ARIMA for COVID-19</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author" corresp="yes">
<name><surname>Nagvanshi</surname> <given-names>Suraj Singh</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<xref ref-type="corresp" rid="c001"><sup>&#x0002A;</sup></xref>
<uri xlink:href="http://loop.frontiersin.org/people/2071245/overview"/>
</contrib>
<contrib contrib-type="author">
<name><surname>Kaur</surname> <given-names>Inderjeet</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<xref ref-type="author-notes" rid="fn001"><sup>&#x02020;</sup></xref>
</contrib>
<contrib contrib-type="author">
<name><surname>Agarwal</surname> <given-names>Charu</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<xref ref-type="author-notes" rid="fn001"><sup>&#x02020;</sup></xref>
</contrib>
<contrib contrib-type="author">
<name><surname>Sharma</surname> <given-names>Ashish</given-names></name>
<xref ref-type="aff" rid="aff2"><sup>2</sup></xref>
<xref ref-type="author-notes" rid="fn001"><sup>&#x02020;</sup></xref>
<uri xlink:href="http://loop.frontiersin.org/people/2065784/overview"/>
</contrib>
</contrib-group>
<aff id="aff1"><sup>1</sup><institution>Department of Computer Science &#x00026; Engineering, Ajay Kumar Garg Engineering College</institution>, <addr-line>Ghaziabad, Uttar Pradesh</addr-line>, <country>India</country></aff>
<aff id="aff2"><sup>2</sup><institution>Department of Computer Science &#x00026; Engineering, Maharaja Agrasen Institute of Technology</institution>, <addr-line>New Delhi</addr-line>, <country>India</country></aff>
<author-notes>
<fn fn-type="edited-by"><p>Edited by: Shaolong Sun, Xi&#x00027;an Jiaotong University, China</p></fn>
<fn fn-type="edited-by"><p>Reviewed by: Isha Gupta, Dr. A.P.J. Abdul Kalam Technical University, India; Basheer Al-Maqaleh, Thamar University, Yemen; Mingchen Li, Chinese Academy of Sciences (CAS), China</p></fn>
<corresp id="c001">&#x0002A;Correspondence: Suraj Singh Nagvanshi <email>suraj2010012m&#x00040;akgec.ac.in</email></corresp>
<fn fn-type="equal" id="fn001"><p>&#x02020;These authors have contributed equally to this work and share last authorship</p></fn></author-notes>
<pub-date pub-type="epub">
<day>14</day>
<month>06</month>
<year>2023</year>
</pub-date>
<pub-date pub-type="collection">
<year>2023</year>
</pub-date>
<volume>6</volume>
<elocation-id>1081639</elocation-id>
<history>
<date date-type="received">
<day>27</day>
<month>10</month>
<year>2022</year>
</date>
<date date-type="accepted">
<day>18</day>
<month>04</month>
<year>2023</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#x000A9; 2023 Nagvanshi, Kaur, Agarwal and Sharma.</copyright-statement>
<copyright-year>2023</copyright-year>
<copyright-holder>Nagvanshi, Kaur, Agarwal and Sharma</copyright-holder>
<license xlink:href="http://creativecommons.org/licenses/by/4.0/"><p>This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.</p></license> </permissions>
<abstract>
<p>The Coronavirus (COVID-19) outbreak swept the world, infected millions of people, and caused many deaths. Multiple COVID-19 variations have been discovered since the initial case in December 2019, indicating that COVID-19 is highly mutable. COVID-19 variation &#x0201C;XE&#x0201D; is the most current of all COVID-19 variants found in January 2022. It is vital to detect the virus transmission rate and forecast instances of infection to be prepared for all scenarios, prepare healthcare services, and avoid deaths. Time-series forecasting helps predict future infected cases and determine the virus transmission rate to make timely decisions. A forecasting model for nonstationary time series has been created in this paper. The model comprises an optimized EigenValue Decomposition of Hankel Matrix (EVDHM) and an optimized AutoRegressive Integrated Moving Average (ARIMA). The Phillips Perron Test (PPT) has been used to determine whether a time series is nonstationary. A time series has been decomposed into components using EVDHM, and each component has been forecasted using ARIMA. The final forecasts have been formed by combining the predicted values of each component. A Genetic Algorithm (GA) to select ARIMA parameters resulting in the lowest Akaike Information Criterion (AIC) values has been used to discover the best ARIMA parameters. Another genetic algorithm has been used to optimize the decomposition results of EVDHM that ensures the minimum nonstationarity and maximal utilization of eigenvalues for each decomposed component.</p></abstract>
<kwd-group>
<kwd>time-series</kwd>
<kwd>forecasting</kwd>
<kwd>COVID-19</kwd>
<kwd>optimized-ARIMA</kwd>
<kwd>optimized-EVDHM</kwd>
<kwd>PPT</kwd>
</kwd-group>
<counts>
<fig-count count="3"/>
<table-count count="2"/>
<equation-count count="11"/>
<ref-count count="31"/>
<page-count count="9"/>
<word-count count="5621"/>
</counts>
<custom-meta-wrap>
<custom-meta>
<meta-name>section-at-acceptance</meta-name>
<meta-value>Data Science</meta-value>
</custom-meta>
</custom-meta-wrap>
</article-meta>
</front>
<body>
<sec id="s1">
<title>1. Introduction</title>
<p>Time series forecasting is a crucial area in machine learning, as it involves predicting future values of a variable or characteristic that is dependent on time and recorded at regular intervals. The ability to accurately forecast time series is essential in many fields, such as economics, finance, healthcare, transportation, and energy, to name a few. Time series forecasting helps organizations in projecting product demand, allocating resources efficiently, predicting maintenance schedules, and many other applications. Over the years, several approaches to time series forecasting have been proposed in the literature.</p>
<p>For instance, time series forecasting has been employed in various sectors, such as electricity prices (Contreras et al., <xref ref-type="bibr" rid="B3">2003</xref>), wind power generation (Wan et al., <xref ref-type="bibr" rid="B28">2014</xref>), electricity demand (Taylor and McSharry, <xref ref-type="bibr" rid="B27">2007</xref>), traffic flow (Lippi et al., <xref ref-type="bibr" rid="B14">2013</xref>), and taxi-passenger demand (Moreira-Matias et al., <xref ref-type="bibr" rid="B15">2013</xref>). Moreover, time series forecasting has also been useful in predicting the spread of epidemic diseases such as Dengue (Appice et al., <xref ref-type="bibr" rid="B2">2020</xref>) and Influenza (Saberian et al., <xref ref-type="bibr" rid="B19">2014</xref>). These studies have demonstrated the effectiveness of time series forecasting in diverse fields and have inspired further research in this area.</p>
<p>Coronavirus Disease (COVID-19) is caused by the SARS-CoV-2 virus [Coronavirus disease (COVID-19) pandemic, <xref ref-type="bibr" rid="B5">2021a</xref>]. COVID-19 was proclaimed a global pandemic on March 11th, 2020, after discovering the first known case in Wuhan, China [Coronavirus disease (COVID-19) pandemic, <xref ref-type="bibr" rid="B4">2021b</xref>]. The illness has since spread around the globe, culminating in a pandemic. Various researchers have expressed interest in developing Artificial Intelligence based solutions to assist governments and enterprises in making decisions. The past COVID-19 forecasting investigations are summarized in <xref ref-type="table" rid="T1">Table 1</xref>.</p>
<table-wrap position="float" id="T1">
<label>Table 1</label>
<caption><p>A summary of predicting models for Covid-19 forecasts.</p></caption> 
<table frame="box" rules="all">
<thead>
<tr style="background-color:#8f9496">
<th valign="top" align="left"><bold>S.no</bold></th>
<th valign="top" align="left"><bold>Year</bold></th>
<th valign="top" align="left"><bold>Author</bold></th>
<th valign="top" align="left"><bold>Investigated region(s)</bold></th>
<th valign="top" align="left"><bold>Method(s) used</bold></th>
<th valign="top" align="left"><bold>Accuracy measures</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">1</td>
<td valign="top" align="left">2020</td>
<td valign="top" align="left">Rustam et al. (<xref ref-type="bibr" rid="B18">2020</xref>)</td>
<td valign="top" align="left">Australia, Canada, Algeria, and Afghanistan</td>
<td valign="top" align="left">Support Vector Regression (SVR), Linear regression (LR), Exponential Smoothing (ES), Least Absolute Shrinkage, Selection operator (LASSO), and Linear regression (LR)</td>
<td valign="top" align="left">Mean Square Error (MSE), Root Mean Square Error (RMSE), Mean Absolute error (MAE), <italic>R</italic>-square, Adjusted <italic>R</italic>-square</td>
</tr> <tr>
<td valign="top" align="left">2</td>
<td valign="top" align="left">2020</td>
<td valign="top" align="left">Kumar and Susan (<xref ref-type="bibr" rid="B11">2020</xref>)</td>
<td valign="top" align="left">Global cases, Spain, Italy, India, France, Russia, Iran, UK, US, Turkey, Germany</td>
<td valign="top" align="left">ARIMA, PROPHET</td>
<td valign="top" align="left">MAE, RMSE, Root Relative Squared Error (RRSE), Mean Absolute Percentage Error (MAPE)</td>
</tr> <tr>
<td valign="top" align="left">3</td>
<td valign="top" align="left">2020</td>
<td valign="top" align="left">Andreas et al. (<xref ref-type="bibr" rid="B1">2020</xref>)</td>
<td valign="top" align="left">Global cases</td>
<td valign="top" align="left">Curve fitting</td>
<td valign="top" align="left"><italic>R</italic>-square</td>
</tr> <tr>
<td valign="top" align="left">4</td>
<td valign="top" align="left">2021</td>
<td valign="top" align="left">Dash et al. (<xref ref-type="bibr" rid="B8">2021</xref>)</td>
<td valign="top" align="left">Brazil, France, India, Russia, United Kingdom, US</td>
<td valign="top" align="left">ARIMA</td>
<td valign="top" align="left">RMSE, MAE, MAPE</td>
</tr> <tr>
<td valign="top" align="left">5</td>
<td valign="top" align="left">2021</td>
<td valign="top" align="left">Satu et al. (<xref ref-type="bibr" rid="B20">2021</xref>)</td>
<td valign="top" align="left">Bangladesh and Global cases</td>
<td valign="top" align="left">PROPHET, LR, Polynomial-regression (PR), SVR, Multilayer Perceptron (MLP), and Polynomial-MLP (poly-MLP)</td>
<td valign="top" align="left">RMSE, R-squared</td>
</tr> <tr>
<td valign="top" align="left">6</td>
<td valign="top" align="left">2021</td>
<td valign="top" align="left">Kurniawan and Kurniawan (<xref ref-type="bibr" rid="B12">2021</xref>)</td>
<td valign="top" align="left">Indonesia</td>
<td valign="top" align="left">Curve fitting</td>
<td valign="top" align="left">MSE</td>
</tr> <tr>
<td valign="top" align="left">7</td>
<td valign="top" align="left">2020</td>
<td valign="top" align="left">Darapaneni et al. (<xref ref-type="bibr" rid="B7">2020</xref>)</td>
<td valign="top" align="left">India</td>
<td valign="top" align="left">ARIMA</td>
<td valign="top" align="left">R-square, Bayesian Information Criteria (BIC), Akaike&#x00027;s Information Criteria (AIC), and MSE</td>
</tr> <tr>
<td valign="top" align="left">8</td>
<td valign="top" align="left">2021</td>
<td valign="top" align="left">Sharma et al. (<xref ref-type="bibr" rid="B24">2021</xref>)</td>
<td valign="top" align="left">India, USA, Brazil</td>
<td valign="top" align="left">ARIMA</td>
<td valign="top" align="left">RMSE</td>
</tr> <tr>
<td valign="top" align="left">9</td>
<td valign="top" align="left">2020</td>
<td valign="top" align="left">Mustafa and Fareed (<xref ref-type="bibr" rid="B16">2020</xref>)</td>
<td valign="top" align="left">Iraq</td>
<td valign="top" align="left">ARIMA</td>
<td valign="top" align="left">MSE and MAE</td>
</tr> <tr>
<td valign="top" align="left">10</td>
<td valign="top" align="left">2021</td>
<td valign="top" align="left">Kumar and Kaur (<xref ref-type="bibr" rid="B10">2021</xref>)</td>
<td valign="top" align="left">Delhi (India)</td>
<td valign="top" align="left">ARIMA, Gaussian Process Regression (GPR), LR, M5 Rule MLP, Support Vector Regression, Multi-Criteria Decision Making (MCDM), and Self-organized maps and fuzzy time series (SOMFTS)</td>
<td valign="top" align="left">Normalized-RMSE, Mean Magnitude of Forecasting Error (MMFE) Square root of the variance of the magnitude of residual errors (SdARE), The proportion of anticipated instances with a relative error magnitude of &#x0003C; 0.20</td>
</tr> <tr>
<td valign="top" align="left">11</td>
<td valign="top" align="left">2021</td>
<td valign="top" align="left">Iqbal et al. (<xref ref-type="bibr" rid="B9">2021</xref>)</td>
<td valign="top" align="left">Pakistan</td>
<td valign="top" align="left">Long short-term memory (LSTM)</td>
<td valign="top" align="left">MAPE</td>
</tr> <tr>
<td valign="top" align="left">12</td>
<td valign="top" align="left">2021</td>
<td valign="top" align="left">Zhan et al. (<xref ref-type="bibr" rid="B31">2021</xref>)</td>
<td valign="top" align="left">24 North American countries, 11 South American countries, 45 Asian countries, 46 European countries, 54 African countries, and 4 Oceanian countries</td>
<td valign="top" align="left">Gated Recurrent Unit (GRU), LSTM, Artificial Neural Network (ANN), Particle swarm optimization broad learning system (PSO- BLS)</td>
<td valign="top" align="left">R-square, MAE, RMSE</td>
</tr></tbody>
</table>
</table-wrap>
<p>ARIMA is a time-series forecasting model that is one of the most often utilized approaches. ARIMA-based models are commonly employed in stationary time-series analysis (Wilson, <xref ref-type="bibr" rid="B29">2016</xref>), although the standard ARIMA-based approach is inefficient in real-world settings for time series with nonstationary properties (Li and Chiang, <xref ref-type="bibr" rid="B13">2013</xref>; Yang and Lin, <xref ref-type="bibr" rid="B30">2016</xref>). EVDHM is a modern approach for nonstationary time series forecasting that may be combined with ARIMA (Sharma et al., <xref ref-type="bibr" rid="B24">2021</xref>).</p>
<p>The COVID-19 pandemic has brought about an urgent need for accurate forecasting of the spread of the disease, to inform decision-making and public health interventions. As shown in <xref ref-type="table" rid="T1">Table 1</xref>, multiple studies have explored the use of machine learning (ML) and time series forecasting models in predicting the spread of COVID-19. These studies have highlighted the potential of ML and time series forecasting models in guiding decision-making and administrations. For instance, Rustam et al. (<xref ref-type="bibr" rid="B18">2020</xref>) employed a supervised ML model to predict the number of COVID-19 cases, deaths, and recoveries and discovered that exponential smoothing outperformed other models. Similarly, Kumar and Susan (<xref ref-type="bibr" rid="B11">2020</xref>) used ARIMA and Prophet time series forecasting models and found that the ARIMA model was more effective in forecasting COVID-19 prevalence. Andreas et al. (<xref ref-type="bibr" rid="B1">2020</xref>) proposed an improved mathematical forecasting framework based on ML and cloud computing that uses real-time data to accurately predict the progress of the curve. Satu et al. (<xref ref-type="bibr" rid="B20">2021</xref>) developed a web portal that provides real-time information on COVID-19 cases in Bangladesh and worldwide, including an ML-based short-term forecasting tool. Other researchers, such as Darapaneni et al. (<xref ref-type="bibr" rid="B7">2020</xref>) and Kurniawan and Kurniawan (<xref ref-type="bibr" rid="B12">2021</xref>), have also presented models for forecasting COVID-19 prevalence in Indonesia and India, respectively. Finally, Sharma et al. (<xref ref-type="bibr" rid="B24">2021</xref>) proposed a new method for time-series forecasting of nonstationary data using a combination of EVDHM and ARIMA models.</p>
<p>Although these studies have shown promising results, the models used by the researchers are not completely automated and require manual analysis of the data to provide inputs to the models. This makes it difficult for non-technical individuals to use these models, and analysis of the data can be time-consuming and prone to human error. To address this limitation, this paper proposes an optimized EVDHM approach combined with the ARIMA model for automated nonstationary time series forecasting.</p>
<p>The proposed model is fully automated and requires no manual input, which makes it easy, efficient, and time-saving for forecasting COVID-19 cases. This model can be used by non-technical individuals and is less prone to human error. The optimized EVDHM approach is used to capture the nonstationarity of the COVID-19 time series data, while the ARIMA model is used to capture the autocorrelation in the data. The proposed model is optimized using a grid search algorithm to select the best hyperparameters. The performance of the proposed model is evaluated using RMSE and compared with the performance of the traditional ARIMA model.</p>
<p>In conclusion, the proposed automated nonstationary time series forecasting model has the potential to provide accurate and timely predictions of the spread of COVID-19. The model is easy to use, efficient, and less prone to human error, and can be used by non-technical individuals.</p>
<p>The remainder of this article is structured as follows. Section 2 covers the datasets used in this study. Section 3 introduces EVDHM and ARIMA, Section 4 provides the proposed model and the stage outcomes, Section 5 compares EVDHM and Optimized EVDHM, and Section 6 summarizes the findings. Finally, section 7 brings the article to an end.</p></sec>
<sec id="s2">
<title>2. Dataset used</title>
<p>The data set for COVID-19 new cases in India has been utilized in this research. Data from January 22nd to May 10th, 2020, has been used for training, and data from the 11th to the 30th of May 2020 has been used for testing to analyze the proposed model. The data set has been given by Johns Hopkins University&#x00027;s Center for Systems Science and Engineering (CSSE) and is accessible online (CSSE, <xref ref-type="bibr" rid="B6">2021</xref>).</p></sec>
<sec id="s3">
<title>3. Methods used</title>
<sec>
<title>3.1. EVDHM</title>
<p>In linear algebra, the Hankel matrix is a square matrix with skew-diagonals that are constants. A Hankel matrix is represented as follows (Sharma and Pachori, <xref ref-type="bibr" rid="B22">2017</xref>):</p>
<disp-formula id="E1"><label>(1)</label><mml:math id="M1"><mml:mi>A</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mtable><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi>A</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:msub><mml:mi>A</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:msub><mml:mi>A</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:mrow></mml:mtd><mml:mtd><mml:mo>.</mml:mo></mml:mtd><mml:mtd><mml:mo>.</mml:mo></mml:mtd><mml:mtd><mml:mo>.</mml:mo></mml:mtd><mml:mtd><mml:mrow><mml:msub><mml:mi>A</mml:mi><mml:mi>N</mml:mi></mml:msub></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi>A</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:msub><mml:mi>A</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:mrow></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mo>.</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi>A</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:mrow></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mo>.</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>.</mml:mo></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mo>.</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>.</mml:mo></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mrow><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mn>2</mml:mn><mml:mi>N</mml:mi><mml:mo>&#x02212;</mml:mo><mml:mn>3</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>.</mml:mo></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mrow><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mn>2</mml:mn><mml:mi>N</mml:mi><mml:mo>&#x02212;</mml:mo><mml:mn>3</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mn>2</mml:mn><mml:mi>N</mml:mi><mml:mo>&#x02212;</mml:mo><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi>A</mml:mi><mml:mi>N</mml:mi></mml:msub></mml:mrow></mml:mtd><mml:mtd><mml:mo>.</mml:mo></mml:mtd><mml:mtd><mml:mo>.</mml:mo></mml:mtd><mml:mtd><mml:mo>.</mml:mo></mml:mtd><mml:mtd><mml:mrow><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mn>2</mml:mn><mml:mi>N</mml:mi><mml:mo>&#x02212;</mml:mo><mml:mn>3</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mn>2</mml:mn><mml:mi>N</mml:mi><mml:mo>&#x02212;</mml:mo><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mn>2</mml:mn><mml:mi>N</mml:mi><mml:mo>&#x02212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></disp-formula>
<p>Eigenvalue Decomposition may be used to decompose a square matrix into its eigenvalues and eigenvectors. In terms of eigenvalues and eigenvectors, matrix <italic>A</italic> may be written as follows (Sharma and Pachori, <xref ref-type="bibr" rid="B22">2017</xref>):</p>
<disp-formula id="E2"><label>(2)</label><mml:math id="M2"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mi>A</mml:mi><mml:mo>=</mml:mo><mml:mi>V</mml:mi><mml:mi>&#x003BB;</mml:mi><mml:msup><mml:mrow><mml:mi>V</mml:mi></mml:mrow><mml:mrow><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup><mml:mtext>&#x000A0;</mml:mtext></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p><italic>V</italic>, &#x003BB;, and <italic>V</italic><sup>&#x02212;1</sup> are the eigenvector matrix, eigenvalue matrix, and inverse eigenvalue matrix, respectively. A stationary time series with statistical features such as mean and variance is either time-invariant or has a reasonable variation. Because of the significant variance, forecasting a nonstationary time series is often more difficult or complex than forecasting a stationary time series. Therefore, it is usually processed to reduce the time series&#x00027; nonstationarity when working with nonstationary time series. EVDHM is an algorithm that can be utilized for analyzing nonstationary time series. It decomposes a time series into components with changing trends, noise, and oscillating patterns (Sharma and Pachori, <xref ref-type="bibr" rid="B22">2017</xref>). Other applications of EVDHM include cardiovascular signal analysis (Sharma and Pachori, <xref ref-type="bibr" rid="B26">2018b</xref>; Sharma et al., <xref ref-type="bibr" rid="B25">2019</xref>), muscle signal analysis (Sharma et al., <xref ref-type="bibr" rid="B21">2019</xref>), and complex data processing (Sharma and Pachori, <xref ref-type="bibr" rid="B23">2018a</xref>).</p>
<p>A time-series <italic>S</italic><sub>t</sub> = <italic>t</italic><sub>1</sub>, <italic>t</italic><sub>2</sub>, <italic>t</italic><sub>3</sub>,... <italic>t</italic><sub>2N &#x02212; 1</sub> can be written as a Hankel matrix <italic>H</italic> of size <italic>N</italic> &#x000D7; <italic>N</italic> as follows (Sharma and Pachori, <xref ref-type="bibr" rid="B22">2017</xref>):</p>
<disp-formula id="E3"><label>(3)</label><mml:math id="M3"><mml:mi>H</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mtable><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:mrow></mml:mtd><mml:mtd><mml:mo>.</mml:mo></mml:mtd><mml:mtd><mml:mo>.</mml:mo></mml:mtd><mml:mtd><mml:mo>.</mml:mo></mml:mtd><mml:mtd><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mi>N</mml:mi></mml:msub></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:mrow></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mo>.</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:mrow></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mo>.</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>.</mml:mo></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mo>.</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>.</mml:mo></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mn>2</mml:mn><mml:mi>N</mml:mi><mml:mo>&#x02212;</mml:mo><mml:mn>3</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>.</mml:mo></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mn>2</mml:mn><mml:mi>N</mml:mi><mml:mo>&#x02212;</mml:mo><mml:mn>3</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mn>2</mml:mn><mml:mi>N</mml:mi><mml:mo>&#x02212;</mml:mo><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mi>N</mml:mi></mml:msub></mml:mrow></mml:mtd><mml:mtd><mml:mo>.</mml:mo></mml:mtd><mml:mtd><mml:mo>.</mml:mo></mml:mtd><mml:mtd><mml:mo>.</mml:mo></mml:mtd><mml:mtd><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mn>2</mml:mn><mml:mi>N</mml:mi><mml:mo>&#x02212;</mml:mo><mml:mn>3</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mn>2</mml:mn><mml:mi>N</mml:mi><mml:mo>&#x02212;</mml:mo><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mn>2</mml:mn><mml:mi>N</mml:mi><mml:mo>&#x02212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></disp-formula>
<p>Then <italic>H</italic> can be expressed as follows (Sharma and Pachori, <xref ref-type="bibr" rid="B22">2017</xref>):</p>
<disp-formula id="E4"><label>(4)</label><mml:math id="M4"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mi>H</mml:mi><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mi>V</mml:mi></mml:mrow><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msub><mml:mi>&#x003BB;</mml:mi><mml:msubsup><mml:mrow><mml:mi>V</mml:mi></mml:mrow><mml:mrow><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mtext>&#x000A0;</mml:mtext></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>where eigenvalue matrix &#x003BB; can be expressed as follows (Sharma and Pachori, <xref ref-type="bibr" rid="B22">2017</xref>).</p>
<disp-formula id="E5"><label>(5)</label><mml:math id="M5"><mml:mtext>&#x003BB;</mml:mtext><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mtable><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mtext>&#x003BB;</mml:mtext><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:mtd><mml:mtd><mml:mn>0</mml:mn></mml:mtd><mml:mtd><mml:mn>0</mml:mn></mml:mtd><mml:mtd><mml:mo>.</mml:mo></mml:mtd><mml:mtd><mml:mo>.</mml:mo></mml:mtd><mml:mtd><mml:mo>.</mml:mo></mml:mtd><mml:mtd><mml:mn>0</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>0</mml:mn></mml:mtd><mml:mtd><mml:mrow><mml:msub><mml:mtext>&#x003BB;</mml:mtext><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mo>.</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>0</mml:mn></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mo>.</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>.</mml:mo></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mo>.</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>.</mml:mo></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mn>0</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>.</mml:mo></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mtext>&#x000A0;</mml:mtext></mml:mtd><mml:mtd><mml:mrow><mml:msub><mml:mtext>&#x003BB;</mml:mtext><mml:mrow><mml:mi>N</mml:mi><mml:mo>&#x02212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:mtd><mml:mtd><mml:mn>0</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>0</mml:mn></mml:mtd><mml:mtd><mml:mo>.</mml:mo></mml:mtd><mml:mtd><mml:mo>.</mml:mo></mml:mtd><mml:mtd><mml:mo>.</mml:mo></mml:mtd><mml:mtd><mml:mn>0</mml:mn></mml:mtd><mml:mtd><mml:mn>0</mml:mn></mml:mtd><mml:mtd><mml:mrow><mml:msub><mml:mtext>&#x003BB;</mml:mtext><mml:mi>N</mml:mi></mml:msub></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mo>&#x000A0;</mml:mo></mml:math></disp-formula>
<p>All of the values in the eigenvalue matrix are zero, except for the diagonal elements, which have eigenvalues ranging from &#x003BB;<sub>1</sub> to &#x003BB;<sub>N</sub>. The decomposition of the time series relies heavily on this eigenvalue matrix. It may be written as a sum of matrices with one or more distinct eigenvalues.</p>
<disp-formula id="E6"><label>(6)</label><mml:math id="M6"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mi>&#x003BB;</mml:mi><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mi>&#x003BB;</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>&#x0002B;</mml:mo><mml:msub><mml:mrow><mml:mi>&#x003BB;</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>&#x0002B;</mml:mo><mml:mo>&#x02026;</mml:mo><mml:mo>&#x0002B;</mml:mo><mml:msub><mml:mrow><mml:mi>&#x003BB;</mml:mi></mml:mrow><mml:mrow><mml:mi>M</mml:mi></mml:mrow></mml:msub></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>(6)</p>
<p>Now, <italic>H</italic> becomes</p>
<disp-formula id="E7"><label>(7)</label><mml:math id="M7"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mi>H</mml:mi><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mi>V</mml:mi></mml:mrow><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mrow><mml:mi>&#x003BB;</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:msubsup><mml:mrow><mml:mi>V</mml:mi></mml:mrow><mml:mrow><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mo>&#x0002B;</mml:mo><mml:msub><mml:mrow><mml:mi>V</mml:mi></mml:mrow><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mrow><mml:mi>&#x003BB;</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:msubsup><mml:mrow><mml:mi>V</mml:mi></mml:mrow><mml:mrow><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mo>&#x0002B;</mml:mo><mml:mo>.</mml:mo><mml:mo>.</mml:mo><mml:mo>.</mml:mo><mml:mo>&#x0002B;</mml:mo><mml:msub><mml:mrow><mml:mi>V</mml:mi></mml:mrow><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mrow><mml:mi>&#x003BB;</mml:mi></mml:mrow><mml:mrow><mml:mi>M</mml:mi></mml:mrow></mml:msub><mml:msubsup><mml:mrow><mml:mi>V</mml:mi></mml:mrow><mml:mrow><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mtext>&#x000A0;</mml:mtext></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>Let,</p>
<disp-formula id="E8"><label>(8)</label><mml:math id="M8"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mi>H</mml:mi><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mi>H</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>&#x0002B;</mml:mo><mml:msub><mml:mrow><mml:mi>H</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>&#x0002B;</mml:mo><mml:mo>&#x02026;</mml:mo><mml:mo>&#x0002B;</mml:mo><mml:msub><mml:mrow><mml:mi>H</mml:mi></mml:mrow><mml:mrow><mml:mi>M</mml:mi></mml:mrow></mml:msub></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>The first decomposed component <inline-formula><mml:math id="M9"><mml:msubsup><mml:mrow><mml:mi>S</mml:mi></mml:mrow><mml:mrow><mml:mtext>t</mml:mtext></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msubsup></mml:math></inline-formula> is computed using the mean of the skew-diagonal elements of the matrix <italic>H</italic><sub>1</sub>. The remaining components are computed in the same way, using the <italic>H</italic><sub>i</sub> matrices <italic>i</italic> &#x003F5; {2,3, ..., <italic>M</italic>}.</p>
</sec>
<sec>
<title>3.2. ARIMA</title>
<p>ARIMA comprises Autoregressive (AR), Moving Average (MA), and Integration (I) models combined. The Autoregressive (AR) model is a regression-based model whose current value is determined by previous values. The lagged forecast errors create the moving average (MA) model. It makes the next forecast based on prior errors. To model a nonstationary series, ARIMA employs differencing, which is represented by the letter I in ARIMA. An ARIMA model having parameters <italic>p, d</italic>, and <italic>q</italic>, if applied on time series <italic>S</italic><sub>t</sub> = {<italic>s</italic><sub>1</sub>, <italic>s</italic><sub>2</sub>, <italic>s</italic><sub>3</sub>, &#x02026;} then, it will be expressed as follows (Wilson, <xref ref-type="bibr" rid="B29">2016</xref>):</p>
<disp-formula id="E9"><label>(9)</label><mml:math id="M10"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>-</mml:mo><mml:mstyle displaystyle="true"><mml:munderover accentunder="false" accent="false"><mml:mrow><mml:mo>&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mi>n</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:munderover></mml:mstyle><mml:msub><mml:mrow><mml:mi>&#x003D5;</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:msup><mml:mrow><mml:mi>&#x003B2;</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msup></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:msup><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>-</mml:mo><mml:mi>&#x003B2;</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:msup><mml:msub><mml:mrow><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msup><mml:mrow><mml:mi>&#x003B8;</mml:mi></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msup><mml:mo>&#x0002B;</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>&#x0002B;</mml:mo><mml:mstyle displaystyle="true"><mml:munderover accentunder="false" accent="false"><mml:mrow><mml:mo>&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mi>n</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>q</mml:mi></mml:mrow></mml:munderover></mml:mstyle><mml:msup><mml:mrow><mml:mi>&#x003B8;</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msup><mml:msup><mml:mrow><mml:mi>&#x003B2;</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msup></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:msub><mml:mrow><mml:mi>e</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>where <italic>p</italic> is the AR component&#x00027;s order and <italic>q</italic> is the MA component&#x00027;s order, <italic>p</italic> and <italic>q</italic> are positive integers. The backshift operator &#x003B2; is interpreted as &#x003B2;<sup>n</sup> s<sub>t</sub> = s<sub>t&#x02212;<italic>n</italic></sub>, where <italic>d</italic> is the needed degree of differencing to keep the time series stationary. The deterministic trend term is denoted by the number &#x003B8;<sup>0</sup>. <italic>e</italic><sub>t</sub> is the white Gaussian noise with zero mean and <inline-formula><mml:math id="M11"><mml:msubsup><mml:mrow><mml:mi>&#x003C3;</mml:mi></mml:mrow><mml:mrow><mml:mtext>e</mml:mtext></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup></mml:math></inline-formula> variance.</p></sec></sec>
<sec id="s4">
<title>4. Optimized EVDHM and ARIMA based model</title>
<p>ARIMA does not work well with nonstationary time series. It has a parameter <italic>d</italic> that takes the lagged series to cope with nonstationarity in the time series. However, it cannot be estimated successfully for nonlinear time series (Sharma et al., <xref ref-type="bibr" rid="B24">2021</xref>). Compared to the original series, the EVDHM decomposes the actual time series into numerous components with high stationarity. Because the components are stationary, this breakdown strategy helps decrease predicting errors since the components are stationary.</p>
<p>The EVDHM-ARIMA-based model has been used for time series forecasting (Sharma et al., <xref ref-type="bibr" rid="B24">2021</xref>). In this work, an optimized EVDHM and ARIMA-based hybrid model has been used to create a time series forecasting model that is both efficient and automated. The Phillips Perron Test (PPT) test has been initially used to test for the stationarity of the time series. Then, EVDHM is applied to the time series in case of failure of PPT that results in the decomposed components. EVDHM employs a genetic algorithm to select the eigenvalues to decompose the series. The genetic algorithm aims to increase the number of eigenvalues selected while minimizing the series&#x00027; nonstationarity.</p>
<p>The decomposition of a time series into components using EVDHM are completely reliant on the matrix &#x003BB; and how its <italic>N</italic> eigenvalues are split among the matrices &#x003BB;<sup>1</sup>, &#x003BB;<sup>2</sup>, ... &#x003BB;<sup>M</sup> Eq. (7). The simplest approach is to divide <italic>N</italic> eigenvalues for <italic>N</italic> matrices to get <italic>N</italic> components, but in this case, all of the components will not be stationary, and the number of components will be large, causing the proposed model to take a long time to forecast because each component will be fitted to ARIMA for individual component forecasting. To deal with this, a genetic algorithm has been used. The goal of this GA is to distribute <italic>N</italic> eigenvalues among M matrices in such a way that the majority of the components are stationary and the number of components is as low as possible Eq. (6). The following parameters and their values have been used by this genetic algorithm number of iterations = 50, number of bits (n_bits) = <italic>M</italic> (number of Eigenvalues), population size = 100, crossover rate = 0.9, mutation rate = 1.0/(n_bits).</p>
<p>An <italic>M</italic>-digit binary number is used to represent individuals in this evolutionary method. For each binary digit, 1 and 0 denote the relevant eigenvalue selection or rejection. The goal of the genetic algorithm is to find the best possible combination of eigenvalues, including the maximum possible eigenvalues both at the same time that give a nonstationary component. The best possible combination of eigenvalues is picked after all iterations. With the remaining eigenvalues, this process is continued until no more stationary components are feasible. Because of the genetic algorithm, the generated components have a low count and are also stationary. Finally, the components are subjected to ARIMA, and ARIMA parameters are tuned using another genetic algorithm. <xref ref-type="fig" rid="F1">Figure 1</xref> depicts the proposed model&#x00027;s block diagram and also the stages of the optimized EVDHM and ARIMA-based model. The performance of the proposed model has been compared with the EVDHM-ARIMA-based model (Sharma et al., <xref ref-type="bibr" rid="B24">2021</xref>). As indicated in Section 2, the data set from January 22nd to May 10th, 2020, is used for training, and the data set from May 11th to May 30th, 2020 is used for testing. The proposed model mainly consists of 4 stages PPT, Optimized EVDHM, Optimized ARIMA, and Aggregate forecast. A detailed explanation of each stage is given in the upcoming subsections.</p>
<fig id="F1" position="float">
<label>Figure 1</label>
<caption><p>Model&#x00027;s block diagram based on O-EVDHM and O-ARIMA.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fdata-06-1081639-g0001.tif"/>
</fig>
<sec>
<title>4.1. Phillips Perron Test</title>
<p>The study employs the Phillips Perron test, which is a unit root test utilized to determine the stationarity of a time series. This test is distinct from other unit root tests such as the Dickey-Fuller test (DFT) and Augmented Dickey-Fuller test (ADFT) since it addresses serial correlation and heteroskedasticity in the errors. The automated features of PPT make it a better option than DFT and ADFT for this study (Patterson, <xref ref-type="bibr" rid="B17">2011</xref>). In this study, the Boolean decision vector for the PPT is denoted by <italic>h</italic>, and the <italic>p</italic>-score is a left-tailed probability ranging from 0 to 1. The null hypothesis (<italic>h</italic> = 0) assumes that the underlying time series is non-stationary, while the alternative hypothesis (<italic>h</italic> = 1) asserts that it is stationary. A <italic>p</italic>-score &#x0003C; 0.05 leads to the rejection of the null hypothesis, indicating that the time series is nonstationary. Conversely, a <italic>p</italic>-score &#x0003E;0.05 leads to the acceptance of the null hypothesis and the rejection of the alternative hypothesis, indicating that the time series is stationary. The results of applying PPT to the training dataset in this study reveal that the dataset is nonstationary since the <italic>h</italic> and <italic>p</italic> scores are 0 and 1, respectively.</p>
</sec>
<sec>
<title>4.2. Optimized-EVDHM</title>
<p>EVDHM transforms a data series into a Hankel matrix <italic>H</italic> and then decomposes the Hankel matrix into its eigenvalues and eigenvectors, as shown in Eq. (4). The eigenvalue matrix &#x003BB; is decomposed into <italic>M</italic> matrices such that each matrix has one or more distinct eigenvalues of the matrix <italic>H</italic>. For an effective and efficient decomposition of a data series, the decomposed components should be less in count, and all the components should be stationary. The number of components should be less because ARIMA is applied to each component. Therefore, a high number of components will increase the running time of ARIMA. Moreover, the stationarity of the component will help the ARIMA for better predictions. A genetic algorithm has been used in the proposed model to decompose the eigenvalue matrix &#x003BB; into &#x003BB;<sub>1</sub>, &#x003BB;<sub>2</sub>, . . ., &#x003BB;<sub>M</sub> matrices. The objective of this genetic algorithm is to select the eigenvalues of &#x003BB; for &#x003BB;<sub>1</sub> such that it will try to maximize the eigenvalues utilization and minimize the nonstationarity of the component formed with &#x003BB;<sub>1</sub>. Similarly, subsequent &#x003BB;&#x00027;s are calculated. The resultant two components and the actual data series are shown in <xref ref-type="fig" rid="F2">Figure 2</xref>.</p>
<fig id="F2" position="float">
<label>Figure 2</label>
<caption><p>Trend (Component 1) and Variability (Component 2) of the actual series.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fdata-06-1081639-g0002.tif"/>
</fig>
</sec>
<sec>
<title>4.3. Optimized ARIMA</title>
<p>ARIMA needs three parameters: <italic>p, q</italic>, and <italic>d</italic> for each decomposed component to fit the model. A genetic algorithm has been used in this research to automate parameter selection. The genetic algorithm (GA) selects the model&#x00027;s variables <italic>p, q</italic>, and <italic>d</italic>, having the lowest Akaike information criteria (AIC) value. The AIC is a mathematical tool for determining if a model sufficiently fits the data. Generally, the best fitting models are considered good. Therefore, the GA has been set to use 0&#x02013;5 for all three parameters to find out the best set of parameters with the lowest AIC value. The derived parameters for each component have been fitted into the ARIMA model, and the fitted model was used to anticipate future values from May 10th through May 30th, 2020.</p>
</sec>
<sec>
<title>4.4. Aggregate forecast</title>
<p>The ARIMA&#x00027;s separate component predictions have been combined to get the final projection. <xref ref-type="fig" rid="F3">Figure 3</xref> depicts the final forecast.</p>
<fig id="F3" position="float">
<label>Figure 3</label>
<caption><p>Final forecast from May 11, 2020 to May 30, 2020.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fdata-06-1081639-g0003.tif"/>
</fig>
</sec>
<sec>
<title>4.5. Performance of O-EVDHM</title>
<p>In this study, the performance of the Optimized EVDHM approach has been evaluated by calculating the sum of squared (SS) scores for all the decomposed components. The SS score is an important metric that measures the strength of the decomposition of the time series. The formula for calculating the SS score has been given in Eq. (10).</p>
<disp-formula id="E10"><label>(10)</label><mml:math id="M12"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mi>S</mml:mi><mml:mi>S</mml:mi><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:munderover accentunder="false" accent="false"><mml:mrow><mml:mo>&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:munderover></mml:mstyle><mml:msup><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>where <italic>t</italic><sub>i</sub> is an <italic>n</italic>-sample data series with <italic>i</italic> being a positive integer less than or equal to <italic>n</italic>.</p>
<p>The SS scores for the decomposed components have been presented in <xref ref-type="table" rid="T2">Table 2</xref>. From the table, it can be observed that the SS score for the main signal is 1.47 &#x000D7; 10<sup>8</sup>, while the SS values for C<sub>1</sub> and C<sub>2</sub> are 2.40 &#x000D7; 10<sup>7</sup> and 5.91 &#x000D7; 10<sup>7</sup>, respectively. The stationary component C<sub>1</sub> captures the variability of the actual series, whereas the trend component C<sub>2</sub> is nonstationary. Therefore, no further decomposition is required beyond C<sub>2</sub>.</p>
<table-wrap position="float" id="T2">
<label>Table 2</label>
<caption><p><italic>h</italic>-score, <italic>p</italic>-score, and SS score of decomposed components.</p></caption> 
<table frame="box" rules="all">
<thead>
<tr style="background-color:#8f9496">
<th/>
<th valign="top" align="center" colspan="10"><bold>EVDHM (first iteration)</bold></th>
<th valign="top" align="center" colspan="2"><bold>Optimized EVDHM</bold></th>
</tr>
</thead>
<tbody>
<tr style="background-color:#8f9496">
<td valign="top" align="left"><bold>Components</bold></td>
<td valign="top" align="center"><bold>C</bold><sub>1</sub></td>
<td valign="top" align="center"><bold>C</bold><sub>2</sub></td>
<td valign="top" align="center"><bold>C</bold><sub>3</sub></td>
<td valign="top" align="center"><bold>C</bold><sub>4</sub></td>
<td valign="top" align="center"><bold>C</bold><sub>5</sub></td>
<td valign="top" align="center"><bold>C</bold><sub>6</sub></td>
<td valign="top" align="center"><bold>C</bold><sub>7</sub></td>
<td valign="top" align="center"><bold>C</bold><sub>8</sub></td>
<td valign="top" align="center"><bold>C</bold><sub>9</sub></td>
<td valign="top" align="center"><bold>C</bold><sub>10</sub></td>
<td valign="top" align="center"><bold>C</bold><sub>1</sub></td>
<td valign="top" align="center"><bold>C</bold><sub>2</sub></td>
</tr> <tr>
<td valign="top" align="left"><italic>h</italic> score</td>
<td valign="top" align="center">0</td>
<td valign="top" align="center">0</td>
<td valign="top" align="center">1</td>
<td valign="top" align="center">1</td>
<td valign="top" align="center">1</td>
<td valign="top" align="center">1</td>
<td valign="top" align="center">1</td>
<td valign="top" align="center">1</td>
<td valign="top" align="center">1</td>
<td valign="top" align="center">1</td>
<td valign="top" align="center">1</td>
<td valign="top" align="center">0</td>
</tr> <tr>
<td valign="top" align="left"><italic>p</italic> score</td>
<td valign="top" align="center">0.9990</td>
<td valign="top" align="center">0.0764</td>
<td valign="top" align="center">0.0010</td>
<td valign="top" align="center">0.0010</td>
<td valign="top" align="center">0.0010</td>
<td valign="top" align="center">0.0010</td>
<td valign="top" align="center">0.0010</td>
<td valign="top" align="center">0.0010</td>
<td valign="top" align="center">0.0010</td>
<td valign="top" align="center">0.0010</td>
<td valign="top" align="center">0.04114</td>
<td valign="top" align="center">1</td>
</tr> <tr>
<td valign="top" align="left">SS score</td>
<td valign="top" align="center">1.46 &#x000D7; 10<sup>8</sup></td>
<td valign="top" align="center">7.5 10<sup>5</sup></td>
<td valign="top" align="center">7.64 &#x000D7; 10<sup>5</sup></td>
<td valign="top" align="center">4.6 &#x000D7; 10<sup>5</sup></td>
<td valign="top" align="center">1.09 &#x000D7; 10<sup>5</sup></td>
<td valign="top" align="center">8.03 &#x000D7; 10<sup>4</sup></td>
<td valign="top" align="center">1.07 &#x000D7; 10<sup>5</sup></td>
<td valign="top" align="center">6.38 &#x000D7; 10<sup>4</sup></td>
<td valign="top" align="center">2.5 &#x000D7; 10<sup>4</sup></td>
<td valign="top" align="center">9.6 &#x000D7; 10<sup>3</sup></td>
<td valign="top" align="center">2.40 &#x000D7; 10<sup>7</sup></td>
<td valign="top" align="center">5.91 &#x000D7; 10<sup>7</sup></td>
</tr></tbody>
</table>
</table-wrap>
<p>The performance of the proposed approach has been further assessed by comparing it with the EVDHM-based approach. As mentioned earlier, the EVDHM-based approach decomposes the time series into 10 components. The SS score of the trend component C<sub>1</sub> calculated using the EVDHM technique is 1.46 &#x000D7; 10<sup>8</sup>, which is much higher than the trend component C<sub>2</sub> calculated using the Optimized EVDHM method, 5.91 &#x000D7; 10<sup>7</sup>. This indicates that the Optimized EVDHM approach is more successful in decomposing the actual nonstationary series.</p>
<p>To evaluate the forecasting accuracy of the proposed approach, the RMSE has been calculated for both the EVDHM-based ARIMA model and the Optimized EVDHM-based ARIMA model. The RMSE for the EVDHM-based ARIMA model is 702.6, whereas the RMSE for the Optimized EVDHM-based ARIMA model is 538, which is significantly lower.</p></sec></sec>
<sec id="s5">
<title>5. Comparison of EVDHM and optimized EVDHM</title>
<p>The Optimized EVDHM-based decomposition approach was developed to address the limitations of the EVDHM method used in (Sharma et al., <xref ref-type="bibr" rid="B24">2021</xref>). For measuring the performance of the Optimized EVDHM method, it was compared to the EVDHM method in terms of <italic>h</italic>-score, <italic>p</italic>-value, and SS score for the decomposed components of the actual series.</p>
<p><xref ref-type="table" rid="T2">Table 2</xref> shows the comparison of the results. After the first iteration, the EVDHM decomposes the actual series into ten components C<sub>1</sub>-C<sub>10</sub>, as shown in <xref ref-type="table" rid="T2">Table 2</xref>. Component C<sub>1</sub> has a trend, whereas the remaining components, C<sub>2</sub>-C<sub>10</sub>, have variability. The SS score of the trend component C<sub>1</sub> calculated using the EVDHM technique is 1.46 &#x000D7; 10<sup>8</sup>, which is much higher than the trend component C<sub>2</sub> calculated using the Optimized EVDHM method, 5.91 &#x000D7; 10<sup>7</sup>. This indicates that the Optimized EVDHM is more successful in decomposing actual nonstationary series.</p>
<p>Moreover, after the first iteration, the EVDHM method resulted in a total of 10 components, while the Optimized EVDHM method yielded only two. This reduction in the number of components implies that the Optimized EVDHM method can effectively and efficiently decompose nonstationary time series. In addition, the decomposition using the Optimized EVDHM does not require several iterations, making it a more suitable approach for nonstationary time series.</p>
<p>Overall, the results demonstrate that the Optimized EVDHM-based decomposition approach outperforms the EVDHM method in efficiency and effectiveness in decomposing nonstationary time series. This improvement is attributed to the use of a genetic algorithm in the process of selecting the eigenvalues best suited for each decomposition, which optimizes the decomposition process and yields better results. As such, the Optimized EVDHM method holds great promise for future applications in various fields, including finance, healthcare, and environmental studies, where nonstationary time series are ubiquitous.</p></sec>
<sec id="s6">
<title>6. Results and discussions</title>
<p>This paper presents an Optimized EVDHM and ARIMA-based time series forecasting model used to anticipate the COVID-19 Indian cases. As mentioned in section 2, 109 days of data were utilized for training the proposed model from January 22nd to May 10th, 2020. Forecasting has been done for the following 20 days till May 30th, as indicated in <xref ref-type="fig" rid="F3">Figure 3</xref>. The blue line in <xref ref-type="fig" rid="F3">Figure 3</xref> depicts the actual data series, while the red line depicts predictions from May 11th to May 30th, 2020. The gray region represents the 95% percent confidence interval. The root means squared error (RMSE) for the anticipated values has been determined to assess the suggested model&#x00027;s performance.</p>
<disp-formula id="E11"><label>(11)</label><mml:math id="M13"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mi>R</mml:mi><mml:mi>M</mml:mi><mml:mi>S</mml:mi><mml:mi>E</mml:mi><mml:mo>=</mml:mo><mml:msqrt><mml:mrow><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:mfrac><mml:mstyle displaystyle="true"><mml:munderover accentunder="false" accent="false"><mml:mrow><mml:mo>&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:munderover></mml:mstyle><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>-</mml:mo><mml:msub><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:msqrt><mml:mtext>&#x000A0;</mml:mtext></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p><italic>P</italic> and <italic>A</italic> are the series&#x00027; predicted and observed values, respectively. The RMSE of the suggested model is 538 for the 20 days of projected values, but the RMSE of the EVDHM-ARIMA-based model is 702.6, which is much higher than the RMSE of the proposed model.</p></sec>
<sec id="s7">
<title>7. Conclusions</title>
<p>In conclusion, the proposed Optimized EVDHM and ARIMA-based approach for time series forecasting is demonstrated to be effective in predicting new cases of COVID-19. The numerical comparison shows that the Optimized EVDHM-based ARIMA model outperforms the EVDHM-based ARIMA model with an RMSE of 538, indicating the practical significance of this study. The approach utilizes a genetic algorithm-based approach for decomposing nonstationary time series into its constituent components, followed by the application of ARIMA for forecasting. The proposed technique can be applied to various signals in the future, such as power load, sales forecasts, and inventory research, among others, making it a versatile tool for time series forecasting.</p>
<p>The points of innovation in this study include the use of genetic algorithms for optimizing the EVDHM decomposition method, which leads to more efficient and effective decomposition of nonstationary time series. The proposed approach also utilizes ARIMA for forecasting, which is a widely used and reliable method for time series forecasting.</p>
<p>However, there are some current shortcomings in this study. The proposed approach has only been tested on COVID-19 data, and its performance on other datasets needs to be evaluated. Additionally, the proposed approach can only be applied to univariate time series, and its extension to multivariate time series remains an area for future research. Nonetheless, the proposed Optimized EVDHM and ARIMA-based approach demonstrates promising results and can be considered a valuable addition to the existing literature on time series analysis and forecasting.</p></sec>
<sec sec-type="data-availability" id="s8">
<title>Data availability statement</title>
<p>Publicly available datasets were analyzed in this study. This data can be found at: <ext-link ext-link-type="uri" xlink:href="https://github.com/CSSEGISandData/COVID-19">https://github.com/CSSEGISandData/COVID-19</ext-link>.</p></sec>
<sec sec-type="author-contributions" id="s9">
<title>Author contributions</title>
<p>All authors listed have made a substantial, direct, and intellectual contribution to the work and approved it for publication.</p></sec>
</body>
<back>


<sec sec-type="COI-statement" id="conf1">
<title>Conflict of interest</title>
<p>The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.</p>
</sec>
<sec sec-type="disclaimer" id="s10">
<title>Publisher&#x00027;s note</title>
<p>All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.</p>
</sec>
<ref-list>
<title>References</title>
<ref id="B1">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Andreas</surname> <given-names>A.</given-names></name> <name><surname>Mavromoustakis</surname> <given-names>C. X.</given-names></name> <name><surname>Mastorakis</surname> <given-names>G.</given-names></name> <name><surname>Mumtaz</surname> <given-names>S.</given-names></name> <name><surname>Batalla</surname> <given-names>J. M.</given-names></name> <name><surname>Pallis</surname> <given-names>E.</given-names></name> <etal/></person-group>. (<year>2020</year>). <article-title>&#x0201C;Modified machine learning technique for curve fitting on regression models for COVID-19 projections,&#x0201D;</article-title> in <source>2020 IEEE 25th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks (CAMAD)</source> (<publisher-loc>Pisa</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>1</fpage>&#x02013;<lpage>6</lpage>. <pub-id pub-id-type="doi">10.1109/CAMAD50429.2020.9209264</pub-id></citation>
</ref>
<ref id="B2">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Appice</surname> <given-names>A.</given-names></name> <name><surname>Gel</surname> <given-names>Y. R.</given-names></name> <name><surname>Iliev</surname> <given-names>I.</given-names></name> <name><surname>Lyubchich</surname> <given-names>V.</given-names></name> <name><surname>Malerba</surname> <given-names>D. A.</given-names></name></person-group> (<year>2020</year>). <article-title>Multi-stage machine learning approach to predict dengue incidence: a case study in Mexico</article-title>. <source>IEEE Access</source> <volume>8</volume>, <fpage>52713</fpage>&#x02013;<lpage>52725</lpage>. <pub-id pub-id-type="doi">10.1109/ACCESS.2020.2980634</pub-id></citation>
</ref>
<ref id="B3">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Contreras</surname> <given-names>J.</given-names></name> <name><surname>Espinola</surname> <given-names>R.</given-names></name> <name><surname>Nogales</surname> <given-names>F. J.</given-names></name> <name><surname>Conejo</surname> <given-names>A. J.</given-names></name></person-group> (<year>2003</year>). <article-title>ARIMA models to predict next-day electricity prices</article-title>. <source>IEEE Trans. Power Syst</source>. <volume>18</volume>, <fpage>1014</fpage>&#x02013;<lpage>1020</lpage>. <pub-id pub-id-type="doi">10.1109/TPWRS.2002.804943</pub-id></citation>
</ref>
<ref id="B4">
<citation citation-type="web"><person-group person-group-type="author"><collab>Coronavirus disease (COVID-19) pandemic</collab></person-group> (<year>2021b</year>). Available online at: <ext-link ext-link-type="uri" xlink:href="https://www.who.int/emergencies/diseases/novel-coronavirus-2019">https://www.who.int/emergencies/diseases/novel-coronavirus-2019</ext-link> (accessed December 07, 2021).</citation>
</ref>
<ref id="B5">
<citation citation-type="web"><person-group person-group-type="author"><collab>Coronavirus disease (COVID-19) pandemic</collab></person-group> (<year>2021a</year>). Available online at: <ext-link ext-link-type="uri" xlink:href="https://www.who.int/health-topics/coronavirus">https://www.who.int/health-topics/coronavirus</ext-link> (accessed December 07, 2021).</citation>
</ref>
<ref id="B6">
<citation citation-type="web"><person-group person-group-type="author"><collab>CSSE</collab></person-group> (<year>2021</year>). <source>Center for Systems Science and Engineering (CSSE) at Johns Hopkins University, COVID-19 Data</source>. Available online at: <ext-link ext-link-type="uri" xlink:href="https://github.com/CSSEGISandData/COVID-19">https://github.com/CSSEGISandData/COVID-19</ext-link> (accessed December 07, 2021).</citation>
</ref>
<ref id="B7">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Darapaneni</surname> <given-names>N.</given-names></name> <name><surname>Reddy</surname> <given-names>D.</given-names></name> <name><surname>Paduri</surname> <given-names>A. R.</given-names></name> <name><surname>Acharya</surname> <given-names>P.</given-names></name> <name><surname>Nithin</surname> <given-names>H. S.</given-names></name></person-group> (<year>2020</year>). <article-title>&#x0201C;Forecasting of COVID-19 in India using ARIMA model,&#x0201D;</article-title> in <source>2020 11th IEEE Annual Ubiquitous Computing, Electronics Mobile Communication Conference (UEMCON)</source> (<publisher-loc>New York, NY</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>0894</fpage>&#x02013;<lpage>0899</lpage>. <pub-id pub-id-type="doi">10.1109/UEMCON51285.2020.9298045</pub-id></citation>
</ref>
<ref id="B8">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Dash</surname> <given-names>S.</given-names></name> <name><surname>Chakraborty</surname> <given-names>C.</given-names></name> <name><surname>Giri</surname> <given-names>S. K.</given-names></name> <name><surname>Pani</surname> <given-names>S. K.</given-names></name> <name><surname>Frnda</surname> <given-names>J.</given-names></name></person-group> (<year>2021</year>). <article-title>BIFM: big-data driven intelligent forecasting model for COVID-19</article-title>. <source>IEEE Access</source> <volume>9</volume>, <fpage>97505</fpage>&#x02013;<lpage>97517</lpage>. <pub-id pub-id-type="doi">10.1109/ACCESS.2021.3094658</pub-id></citation>
</ref>
<ref id="B9">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Iqbal</surname> <given-names>M.</given-names></name> <name><surname>Al-Obeidat</surname> <given-names>F.</given-names></name> <name><surname>Maqbool</surname> <given-names>F.</given-names></name> <name><surname>Razzaq</surname> <given-names>S.</given-names></name> <name><surname>Anwar</surname> <given-names>S.</given-names></name> <name><surname>Tubaishat</surname> <given-names>A.</given-names></name> <etal/></person-group>. (<year>2021</year>). <article-title>COVID-19 patient count prediction using LSTM</article-title>. <source>IEEE Trans. Comput. Soc. Syst</source>. <volume>8</volume>, <fpage>974</fpage>&#x02013;<lpage>981</lpage>. <pub-id pub-id-type="doi">10.1109/TCSS.2021.3056769</pub-id></citation>
</ref>
<ref id="B10">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Kumar</surname> <given-names>A.</given-names></name> <name><surname>Kaur</surname> <given-names>K.</given-names></name></person-group> (<year>2021</year>). <article-title>&#x0201C;A hybrid SOM-Fuzzy time series (SOMFTS) technique for future forecasting of COVID-19 cases and MCDM based evaluation of COVID-19 forecasting models,&#x0201D;</article-title> in <source>2021 International Conference on Computing, Communication, and Intelligent Systems (ICCCIS)</source> (<publisher-loc>Greater Noida, IEEE</publisher-loc>), <fpage>612</fpage>&#x02013;<lpage>617</lpage>. <pub-id pub-id-type="doi">10.1109/ICCCIS51004.2021.9397216</pub-id></citation>
</ref>
<ref id="B11">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Kumar</surname> <given-names>N.</given-names></name> <name><surname>Susan</surname> <given-names>S.</given-names></name></person-group> (<year>2020</year>). <article-title>&#x0201C;COVID-19 pandemic prediction using time series forecasting models,&#x0201D;</article-title> in <source>2020 11th International Conference on Computing, Communication and Networking Technologies (ICCCNT)</source> (<publisher-loc>Kharagpur</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>1</fpage>&#x02013;<lpage>7</lpage>. <pub-id pub-id-type="doi">10.1109/ICCCNT49239.2020.9225319</pub-id><pub-id pub-id-type="pmid">36565344</pub-id></citation></ref>
<ref id="B12">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Kurniawan</surname> <given-names>A.</given-names></name> <name><surname>Kurniawan</surname> <given-names>F.</given-names></name></person-group> (<year>2021</year>). <article-title>&#x0201C;Time series forecasting for the spread of COVID-19 in Indonesia using curve fitting,&#x0201D;</article-title> in <source>2021 3rd East Indonesia Conference on Computer and Information Technology (EIConCIT)</source> (<publisher-loc>Surabaya</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>45</fpage>&#x02013;<lpage>48</lpage>. <pub-id pub-id-type="doi">10.1109/EIConCIT50028.2021.9431936</pub-id></citation>
</ref>
<ref id="B13">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Li</surname> <given-names>C.</given-names></name> <name><surname>Chiang</surname> <given-names>T. W.</given-names></name></person-group> (<year>2013</year>). <article-title>Complex neurofuzzy ARIMA forecasting&#x02014;a new approach using complex fuzzy sets</article-title>. <source>IEEE Trans. Fuzzy Syst</source>. <volume>21</volume>, <fpage>567</fpage>&#x02013;<lpage>584</lpage>. <pub-id pub-id-type="doi">10.1109/TFUZZ.2012.2226890</pub-id></citation>
</ref>
<ref id="B14">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Lippi</surname> <given-names>M.</given-names></name> <name><surname>Bertini</surname> <given-names>M.</given-names></name> <name><surname>Frasconi</surname> <given-names>P.</given-names></name></person-group> (<year>2013</year>). <article-title>Short-term traffic flow forecasting: an experimental comparison of time-series analysis and supervised learning</article-title>. <source>IEEE Trans. Intell. Transp. Syst</source>. <volume>14</volume>, <fpage>871</fpage>&#x02013;<lpage>882</lpage>. <pub-id pub-id-type="doi">10.1109/TITS.2013.2247040</pub-id></citation>
</ref>
<ref id="B15">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Moreira-Matias</surname> <given-names>L.</given-names></name> <name><surname>Gama</surname> <given-names>J.</given-names></name> <name><surname>Ferreira</surname> <given-names>M.</given-names></name> <name><surname>Mendes-Moreira</surname> <given-names>J.</given-names></name> <name><surname>Damas</surname> <given-names>L.</given-names></name></person-group> (<year>2013</year>). <article-title>Predicting taxi&#x02013;passenger demand using streaming data</article-title>. <source>IEEE Trans. Intell. Transp. Syst</source>. <volume>14</volume>, <fpage>1393</fpage>&#x02013;<lpage>1402</lpage>. <pub-id pub-id-type="doi">10.1109/TITS.2013.2262376</pub-id></citation>
</ref>
<ref id="B16">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Mustafa</surname> <given-names>H. I.</given-names></name> <name><surname>Fareed</surname> <given-names>N. Y.</given-names></name></person-group> (<year>2020</year>). <article-title>&#x0201C;COVID-19 cases in Iraq; Forecasting incidents using box - Jenkins ARIMA Model,&#x0201D;</article-title> in <source>2020 2nd Al-Noor International Conference for Science and Technology (NICST)</source> (<publisher-loc>Baku</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>22</fpage>&#x02013;<lpage>26</lpage>. <pub-id pub-id-type="doi">10.1109/NICST50904.2020.9280304</pub-id></citation>
</ref>
<ref id="B17">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Patterson</surname> <given-names>K.</given-names></name></person-group> (<year>2011</year>). <source>Unit Root Tests in Time Series Volume 1: Key Concepts and Problems</source>. Belfast: Kerry Patterson. <pub-id pub-id-type="doi">10.1057/9780230299306</pub-id></citation>
</ref>
<ref id="B18">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Rustam</surname> <given-names>F.</given-names></name> <name><surname>Reshi</surname> <given-names>A. A.</given-names></name> <name><surname>Mehmood</surname> <given-names>A.</given-names></name> <name><surname>Ullah</surname> <given-names>S.</given-names></name> <name><surname>On</surname> <given-names>B. W.</given-names></name> <name><surname>Aslam</surname> <given-names>W.</given-names></name> <etal/></person-group>. (<year>2020</year>). <article-title>COVID-19 future forecasting using supervised machine learning models</article-title>. <source>IEEE Access</source> <volume>8</volume>, <fpage>101489</fpage>&#x02013;<lpage>101499</lpage>. <pub-id pub-id-type="doi">10.1109/ACCESS.2020.2997311</pub-id></citation>
</ref>
<ref id="B19">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Saberian</surname> <given-names>F.</given-names></name> <name><surname>Zamani</surname> <given-names>A.</given-names></name> <name><surname>Gooya</surname> <given-names>M. M.</given-names></name> <name><surname>Hemmati</surname> <given-names>P.</given-names></name> <name><surname>Shoorehdeli</surname> <given-names>M. A.</given-names></name> <name><surname>Teshnehlab</surname> <given-names>M.</given-names></name> <etal/></person-group>. (<year>2014</year>). <article-title>&#x0201C;Prediction of seasonal influenza epidemics in Tehran using artificial neural networks,&#x0201D;</article-title> in <source>2014 22nd Iranian Conference on Electrical Engineering (ICEE)</source> (<publisher-loc>Tehran</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>1921</fpage>&#x02013;<lpage>1923</lpage>. <pub-id pub-id-type="doi">10.1109/IranianCEE.2014.6999855</pub-id></citation>
</ref>
<ref id="B20">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Satu</surname> <given-names>M. S.</given-names></name> <name><surname>Rahman</surname> <given-names>M. K.</given-names></name> <name><surname>Rony</surname> <given-names>M. A.</given-names></name> <name><surname>Shovon</surname> <given-names>A. R.</given-names></name> <name><surname>Adnan</surname> <given-names>M. J. A.</given-names></name> <name><surname>Howlader</surname> <given-names>K. C.</given-names></name> <etal/></person-group>. (<year>2021</year>). <article-title>&#x0201C;COVID-19: update, forecast and assistant - an interactive web portal to provide real-time information and forecast COVID-19 cases in Bangladesh,&#x0201D;</article-title> in <source>2021 International Conference on Information and Communication Technology for Sustainable Development (ICICT4SD)</source> (<publisher-loc>Dhaka</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>456</fpage>&#x02013;<lpage>460</lpage>. <pub-id pub-id-type="doi">10.1109/ICICT4SD50815.2021.9396786</pub-id></citation>
</ref>
<ref id="B21">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Sharma</surname> <given-names>R.</given-names></name> <name><surname>Chandra</surname> <given-names>P.</given-names></name> <name><surname>Pachori</surname> <given-names>R.</given-names></name></person-group> (<year>2019</year>). <article-title>&#x0201C;Electromyogram signal analysis using eigenvalue decomposition of the hankel matrix,&#x0201D;</article-title> in <source>Intelligence and Signal Analysis. Advances in Intelligent Systems and Computing, Vol 748</source>, eds M. Tanveer and R. Pachori (<publisher-loc>Singapore</publisher-loc>: <publisher-name>Springer</publisher-name>), <fpage>671</fpage>&#x02013;<lpage>682</lpage>. <pub-id pub-id-type="doi">10.1007/978-981-13-0923-6_57</pub-id></citation>
</ref>
<ref id="B22">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Sharma</surname> <given-names>R.</given-names></name> <name><surname>Pachori</surname> <given-names>R.</given-names></name></person-group> (<year>2017</year>). <article-title>Time-frequency representation using IEVDHM-HT with application to classification of epileptic EEG signals</article-title>. <source>IET Sci. Meas. Technol</source>. 09, 12. <pub-id pub-id-type="doi">10.1049/iet-smt.2017.0058</pub-id></citation>
</ref>
<ref id="B23">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Sharma</surname> <given-names>R.</given-names></name> <name><surname>Pachori</surname> <given-names>R.</given-names></name></person-group> (<year>2018a</year>). <article-title>Eigenvalue decomposition of hankel matrix-based time-frequency representation for complex signals</article-title>. <source>Circuits, Syst. Signal Process.</source> <volume>37</volume>, <fpage>3313</fpage>&#x02013;<lpage>3329</lpage>. <pub-id pub-id-type="doi">10.1007/s00034-018-0834-4</pub-id></citation>
</ref>
<ref id="B24">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Sharma</surname> <given-names>R. R.</given-names></name> <name><surname>Kumar</surname> <given-names>M.</given-names></name> <name><surname>Maheshwari</surname> <given-names>S.</given-names></name> <name><surname>Ray</surname> <given-names>K. P.</given-names></name></person-group> (<year>2021</year>). <article-title>EVDHM-ARIMA-based time series forecasting model and its application for COVID-19 Cases</article-title>. <source>IEEE Trans. Instrum. Meas</source>. <volume>70</volume>, <fpage>1</fpage>&#x02013;<lpage>10</lpage>. <pub-id pub-id-type="doi">10.1109/TIM.2020.3041833</pub-id></citation>
</ref>
<ref id="B25">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Sharma</surname> <given-names>R. R.</given-names></name> <name><surname>Kumar</surname> <given-names>M.</given-names></name> <name><surname>Pachori</surname> <given-names>R. B.</given-names></name></person-group> (<year>2019</year>). <article-title>Joint time-frequency domain-based CAD disease sensing system using ECG signals</article-title>. <source>IEEE Sens. J</source>. <volume>19</volume>, <fpage>3912</fpage>&#x02013;<lpage>3920</lpage>. <pub-id pub-id-type="doi">10.1109/JSEN.2019.2894706</pub-id></citation>
</ref>
<ref id="B26">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Sharma</surname> <given-names>R. R.</given-names></name> <name><surname>Pachori</surname> <given-names>R. B.</given-names></name></person-group> (<year>2018b</year>). <article-title>Baseline wander and power line interference removal from ECG signals using eigenvalue de- composition</article-title>. <source>Biomed. Signal Process. Control</source>. <volume>45</volume>, <fpage>33</fpage>&#x02013;<lpage>49</lpage>. <pub-id pub-id-type="doi">10.1016/j.bspc.2018.05.002</pub-id></citation>
</ref>
<ref id="B27">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Taylor</surname> <given-names>J. W.</given-names></name> <name><surname>McSharry</surname> <given-names>P. E.</given-names></name></person-group> (<year>2007</year>). <article-title>Short-term load forecasting methods: an evaluation based on european data</article-title>. <source>IEEE Trans. Power Syst</source>. <volume>22</volume>, <fpage>2213</fpage>&#x02013;<lpage>2219</lpage>. <pub-id pub-id-type="doi">10.1109/TPWRS.2007.907583</pub-id><pub-id pub-id-type="pmid">32143371</pub-id></citation></ref>
<ref id="B28">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Wan</surname> <given-names>C.</given-names></name> <name><surname>Xu</surname> <given-names>Z.</given-names></name> <name><surname>Pinson</surname> <given-names>P.</given-names></name> <name><surname>Dong</surname> <given-names>Z. Y.</given-names></name> <name><surname>Wong</surname> <given-names>K. P.</given-names></name></person-group> (<year>2014</year>). <article-title>Probabilistic forecasting of wind power generation using extreme learning machine</article-title>. <source>IEEE Trans. Power Syst</source>. <volume>29</volume>, <fpage>1033</fpage>&#x02013;<lpage>1044</lpage>. <pub-id pub-id-type="doi">10.1109/TPWRS.2013.2287871</pub-id></citation>
</ref>
<ref id="B29">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Wilson</surname> <given-names>G. T.</given-names></name></person-group> (<year>2016</year>). <article-title>Time Series Analysis: Forecasting and Control, 5th Edition, by George E. P. Box, Gwilym M. Jenkins, Gregory C. Reinsel and Greta M. Ljung, 2015. Published by John Wiley and Sons Inc., Hoboken, New Jersey, pp. 712. ISBN: 978-1-118-67502-1</article-title>. <source>J. Time Ser. Anal.</source> <volume>37</volume>, <fpage>709</fpage>&#x02013;<lpage>711</lpage>. <pub-id pub-id-type="doi">10.1111/jtsa.12194</pub-id></citation>
</ref>
<ref id="B30">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Yang</surname> <given-names>H. L.</given-names></name> <name><surname>Lin</surname> <given-names>H. C.</given-names></name></person-group> (<year>2016</year>). <article-title>An integrated model combined ARIMA, EMD with SVR for stock indices forecasting</article-title>. <source>Int. J. Arti. Intell. Tools</source>. 25, 1650005. <pub-id pub-id-type="doi">10.1142/S0218213016500056</pub-id></citation>
</ref>
<ref id="B31">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Zhan</surname> <given-names>C.</given-names></name> <name><surname>Wu</surname> <given-names>Z.</given-names></name> <name><surname>Wen</surname> <given-names>Q.</given-names></name> <name><surname>Gao</surname> <given-names>Y.</given-names></name> <name><surname>Zhang</surname> <given-names>H.</given-names></name></person-group> (<year>2021</year>). <article-title>&#x0201C;Optimizing broad learning system hyper-parameters through particle swarm optimization for predicting COVID-19 in 184 countries,&#x0201D;</article-title> in <source>2020 IEEE International Conference on E-health Networking, Application Services (HEALTHCOM)</source> (<publisher-loc>Shenzhen</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>1</fpage>&#x02013;<lpage>6</lpage>. <pub-id pub-id-type="doi">10.1109/HEALTHCOM49281.2021.9399020</pub-id></citation>
</ref>
</ref-list> 
</back>
</article> 