Research Article  Open Access
Zhijin Wang, Yaohui Huang, Bingyan He, Ting Luo, Yongming Wang, Yonggang Fu, "ShortTerm Infectious Diarrhea Prediction Using Weather and Search Data in Xiamen, China", Scientific Programming, vol. 2020, Article ID 8814222, 12 pages, 2020. https://doi.org/10.1155/2020/8814222
ShortTerm Infectious Diarrhea Prediction Using Weather and Search Data in Xiamen, China
Abstract
Infectious diarrhea has high morbidity and mortality around the world. For this reason, diarrhea prediction has emerged as an important problem to prevent and control outbreaks. Numerous studies have built disease prediction models using largescale data. However, these methods perform poorly on diarrhea data. To address this issue, this paper proposes a parsimonious model (PM), which takes historical outpatient visit counts, meteorological factors (MFs) and Baidu search indices (BSIs) as inputs to perform prediction. An experimental evaluation was done to compare the shortterm prediction performance of ten algorithms for four groups of inputs, using data collected in Xiamen, China. Results show that the proposed method is effective in improving the prediction accuracy.
1. Introduction
To keep up with the pace of income growth, urbanization, and globalization, risk management of infectious diseases in public has become a critical task [1]. Infectious diarrhea (ID) [2] is one of the most common infectious diseases in the world, which infects more than 1 billion persons. It became the 37th legally notifiable disease in the China’s National Notifiable Disease Reporting and Surveillance System, and any new case must be reported within 24 hours of diagnosis [3].
Early warning techniques [4] have been developed to monitor the status of infectious diseases and the demand for healthcare and health services. These techniques can support decision making for medical intervention strategies [5], by preinforming people, health service providers, and the government.
The problem of predicting upcoming diarrhea outpatient visits can be viewed as time series prediction problem. In past decades, numerous studies have used autoregression (AR), autoregressive integrated moving average model (ARIMA), and machine learning methods to predict upcoming values based on past observations. The widely used machine learning methods are multiple linear regression (MLR), support vector regression (SVR), and random forest regression (RFR) [6–8]. A famous autoregression method is that of Box and Jenkins [9], which has been applied in many fields [10], such as for electricity load forecasting and stock price prediction. Another famous statistical method is spline interpolation [11], which learns and uses a cubic spline interpolation to predict future values. But the performance of these methods degrades when dealing with nonstationary and chaotic time series, such as those of diarrhea outpatients.
Recently, to alleviate the uncertainty of a time series, exogenous data have been collected and fused into machine learning methods to achieve better predictions [12–14]. Hereto, the methods using exogenous data are called NARX [15]. According to the structure of NARX, we categorize them into wide models and deep models.
A wide model commonly builds more than two components in a layer. To capture the sequential features of a time series, a recurrent neural network (RNN) [16] is adopted to process exogenous data. To discriminatively process exogenous data and historical observations, the encoderdecoder framework [17] is introduced to undertake predictions. Meanwhile, the gated recursive unit (GRU) [18] is used to replace RNN in the framework, which captures long and shortterm memory (LSTM) [19]. Moreover, an attention mechanism is designed to adjust the values of exogenous inputs and historical inputs in the stage of encoding and decoding, respectively [20–22].
The deep model consecutively connects components from inputs to outputs using more than two neural network layers. For example, DL4Epi in [23] consists of a CNN layer, a RNN layer, and a residual link layer. DilatedRNN in [24] dilated three RNN layers from input to predict glucose incidence rate. TPALSTM in [25] uses a temporal pattern attention layer to deepen a model as well.
However, not only wide models but also deep models suffer from the problem of needing numerous samples. Given a time series of weekly or monthly diarrhea outpatients, the number of training samples is usually in hundreds. If a model has lots of parameters and the training samples are few, the learned model has a poor generalization performance. In the following, we call a model having many parameters a heavy model. In reality, heavy models remember almost the training samples and thus perform poorly for predicting unknown inputs.
How to build a parsimonious model, which has few parameters and learns from hundreds of samples? Observations about from previous models reveal that models assign weights to input elements, and then weights are passed and transformed into the target. Can the weights of elements be reduced? Can the reduced weights be passed to the output?
To address the issues, we propose a parsimonious model (PM). The proposed model first assigns a vector to each input dimension, and then the vectors are connected to the target.
The rest of this paper is organized as follows. Section 2 briefly introduces the study area and data sources. Section 3 illustrates the defined problem and presents the proposed method. Section 4 describes the experimental setting and related benchmarks. Section 5 compares different methods and analyses their sensitiveness. Finally, a conclusion is drawn in Section 6.
2. Study Materials
This section first introduces the study area, i.e., Xiamen city. Then, it briefly describes meteorological factors and search behavior in this city using basic descriptive statistics.
The basic statistical variables of inputs and the target are listed in Table 1.
 
“STD” denotes standard deviation. ^{∗∗} indicates that value is less than , which means significant correlation. 
The reasons for choosing meteorological factor (MF) data and Baidu search index (BSI) data as exogenous data are that those data are significantly correlated to the infectious diseases. MF data have been proved to be associated with the incidence of infectious diseases [26, 27], such as ID and “hand, foot, and mouth disease” (HFMD). As an important entrance for users to obtain digital information resources on the Internet, the search engine provides lots of useful information. The search index of specific keywords directly reflects the social attention on infectious diseases [28–30]. Hence, MF data and BSI data are considered as exogenous inputs to models.
In order to determine the relationships between exogenous variables and the target variable, the Person correlation coefficient (PCC) values are figured out in the last column of Table 1. All of the exogenous factors are significantly correlated to weekly outpaitent counts except weekly maximum temperature. is used as an important input, since humidity is considered as an important factor [27].
2.1. Study Areas
Xiamen is a developing city, which has a population of around 4 million permanent residents and around 4 million temporary residents as of 2018. It is an important special economic zone in China since 1980 and is located in southeast China. It covered a land area of 1,699.39 and a sea area of over 390 in 2017. Xiamen has a monsoonal humid subtropical climate, characterised by long, hot, and humid summers (but moderate compared to much of the rest of the province) and short, mild, and dry winters, and the annual mean temperature is 20.7°C [31].
Herein, the detailed population from 2012 to 2016 is listed in Table 2 as a background for this study. The annual growth of its population is between 1.3% and 2.1%, which is relatively stable. Morbidity and mortality are influenced by disease trends within a period. Meanwhile, infectious diarrhea is the most common infectious disease. Hence, the number of infectious diarrhea outpatient visits is key to monitor the status of infectious diseases in a city.

2.2. Meteorological Factor (MF)
The MF data from January 1, 2012, to December 31, 2016, were collected from Weather Underground (http://www.wunderground.com), which is a popular personal weather website. Those data from meteorological monitoring sites provide globally comprehensive, timely, and reliable meteorological data. At the moment, this website provides webbased application program interfaces for users to download data or develop thirdparty applications.
The provided weather information is formatted in days. We calculate 261 weekly weather information pairs by those daily records. The selected weather information in weeks consists of 12 factors, e.g., highest temperature (°C), average dew point (°C), lowest atmospheric pressure , and average relative humidity . Thus, we get 12 groups of exogenous data to describe weather conditions.
2.3. Baidu Search Index (BSI)
Baidu is the most widely used search engine (http://index.baidu.com) in China, and it is also the largest Chinese search platform. People in Xiamen, China, are accustomed to using that search engine as well. Baidu search index records the search volume of many terms, which are queried by users since January 2011, and it is publicly available. BSI has been used to monitor the incidence of influenza epidemics [33], analyse regional infectious diseases, and perform realtime monitoring and prevention [28].
A major concern to acquire query data (search indices) is to find proper query words [29], which reflects user behavior about searching for infectious diarrhea. The engine returns daily counts of a given keyword, which can be conditioned by a region and a platform. Six time series of each query word are downloaded by choosing a region from {Xiamen, countrywide} and a platform from {mobile, PC, total}, respectively. Those data pairs are calculated in weeks. We have six groups of search indices, and they are used as exogenous data for each keyword. A correlation coefficient analysis is carried out on those input indices and target output (i.e., the number of cases). We found that the indices of the keyword “腹泻” (i.e., ID) have significant correlation, while others do not. Hence, we adopt the six group indices as inputs of models.
3. Approach
This section first defines the problem of time series prediction using exogenous data and then introduces data preprocessing and postprocessing. Finally, the proposed method is presented.
3.1. Problem Formulation
The epidemic prediction problem can be viewed as a time series forecasting task [10]. A time series is defined as a sequence of observation values with consecutive identical interval lengths.
Let denote the observation measured at time and denote the exogenous data measured at time , where is the number of input series. Furthermore, let be a time window size. The known exogenous series with window size is symbolized as , and the historical target observations are denoted as .
The goal is to predict the value of a future time point , given historical observations and exogenous series. In detail, a nonlinear mapping is applied into the predictive formula:
Moreover, let denote the available training data in a timespan of size and be the recent historical outpatient visit counts.
3.2. OneStep Forward Split and Normalization
3.2.1. OneStep Forward Split
A time series cannot be directly used as input of regression models. Hence, we conduct onestep forward split to transform a time series to supervised data. The formula of the onestep split is shown as follows:where is the length of inputted time series and is the window size.
3.2.2. Normalization
It is a process of rescaling the data from the original range so that all values are within a given range [34], usually within 0 and 1 or 0.05 and 0.95. Both minmax normalization and standard (i.e., zscore) normalization methods are commonly applied to normalize time series data.
Minmax normalization scales data in the [0, 1] interval by using the bounds of the minimum and maximum values. Standardizing a dataset involves rescaling the distribution of values, so that the mean of observed values is 0 and the standard deviation is 1. The mean and standard deviation estimates of a dataset can be more robust to new data than the minimum and maximum.
We choose standard normalization to rescale inputs and the target, since we regard the outpatient visit counts as Gaussian distribution, and the standardization fits a Gaussian distribution well. The standard normalization of inputs is formulated and recovered aswhere denotes a feature of observed samples, is the number of observed samples, is the normalized data, is the mean value of , and is the standard variation of . The recovered formula is applied on model outputs in the postprocessing stage. Because normalization is only applied on exogenous data, the recovery action can be skipped while generating predictions.
3.3. Parsimony Model (PM)
The diagram of the proposed PM is shown in Figure 1. This diagram consists of three stages: data preprocessing, PM, and postprocessing. In the preprocessing stage, the exogenous time series is normalized and combined with target time series to split the supervised data using onestep forward. In the PM processing stage, a parameter layer is exploited to extract pattern features from heterogeneous inputs. The outputs of the model are generated by linear summarization of the intermediate state result.
The left bottom part of Figure 1 gives toy examples of the structure of the parsimonious method with respect to inputs and weights. The yellow solid circle denotes exogenous inputs, such as meteorological factor or Baidu search index. The blue solid rectangle denotes historical observed outpatient visits, and red solid rectangle is the target. The yellow solid rectangles are weights to be learned. The goal is to reduce these complex models and find a parsimonious model to learn and predict well on the diarrhea data collections.
Therefore, the weights of the first layer in a neural network are exploited to reconsider model structures. The left bottom part of Figure 1 gives inputs of exogenous data (i.e., MF, BSI, or MF + BSI) and historical cases, and the right part indicates the weights and connections among them (arrows between circles and rectangles). The two following definitions are introduced to provide clearer explanations.
Definition 1. A weight is assigned to each input element.
Definition 1 is formulated as follows:where is the input of a given sample (i.e., input matrix), is the target of this sample, which means the outpatient visit counts of the upcoming week, is the weight corresponding to the inputs (i.e., weight matrix), and is a linear or nonlinear mapping from input and weight matrices to target.
Both wide models and deep models in the research field of epidemic prediction are based on this definition. A wide model processes and in different components. For example, the encoderdecoder structure encodes , passes a code to the decoder, and the decoder processes the code and to make predictions. A deep model adds layers on the sequence of , such as CNN and RNN.
When learning with a small number of samples, the number of samples is usually in hundreds, and these models have a burden of parameter training. In reality, the number of parameters is greater than the number of samples times the number of exogenous factors. Hence, these trained models would remember all the training samples and have a value of loss close to 0, but they poorly predict upcoming events.
Therefore, the wide model and the deep model are condensed into a light neural network by setting as a linear function or nonlinear function, such as sigmoid function. But the condensed light neural network has many parameters as well. Thus, we try to use two vectors to restore weight in equation (4). The aim is not only to have fewer parameters during the training stage but also to obtain better performance at the predicting stage.
Definition 2. A weight is assigned to each input dimension.
Definition 2 is formulated as follows:where is the input matrix, and is the prediction target (i.e., the upcoming week outpatient counts), and are the weights corresponding to two input dimensions (i.e., weight vectors), and is a linear function or a nonlinear mapping from input and weight matrices to the target.
There are limitations in accurately capturing the input matrix of a sample solely on the basis of using two vectors, whose lengths are the same as the size of input matrix. Hence, we exploit two ways to recover in equation (4) using and : the addition method and the multiplication method.
For each element in , it can be recovered using the addition method. The addition recovery formula iswhere is the recovered value, denotes the th element of , and denotes th element of vector , respectively. Equation (6) shows that a matrix can be recovered by two vectors, which would reduce the training parameters.
Another recovery method is the multiplication method. For each element in , it can be recovered using the multiplication method. The multiplication recovery formula iswhere is the recovered value, denotes the th element of , and denotes th element of vector , respectively. Equation (7) shows that a matrix can be recovered by two vectors, which would reduce the training parameters as well.
To benefit the recovery effects from the both methods, we add them together and getAccording to equations (8) and (5), we havewhere . Lots of methods applied to equation (5) can be used to equation (6) as well, whereas the goal of this paper is trying to find a parsimony method to fit well with smallscale datasets. Hence, in equation (9) should be as simple as possible.
We adopt the summarization and sigmoid activate function to replace and make it be simple. The prediction function is formulated aswhere denotes the element in the th row and th column of input matrix . Equation (10) is called the prediction function of the proposed PM.
4. Experimental Settings
This section first describes the exogenous feature selection, experimental settings, and relevant related work, which are compared with our proposed method. Finally, an analysis of the comparable results is provided.
4.1. Experimental Configuration
The disease data collection is divided into two subsets: the first part, from the 1st week of 2012 to the 52nd week of 2015, is used to build and train model; the remaining part, from the 1st to the 52nd week of 2016, is utilized to assess the learned models.
All neural models are trained using the Adam optimizer [35]. The batch size is set to 32. Their learning rate is set to 0.001, and mean squared error (MSE) is chosen as the loss function. For RNN and LSTM, the number of hidden neurons is set to {64, 128}.
We ran each method five times and reported the median. The optimal RMSE values of models at given and input data are in bold types. DARNN [20] and DL4Epi [23] have been applied on the four groups of inputs, and they are not converged in training stage. Hence, their results are not listed and compared.
4.2. Evaluation Metrics
A number of performance evaluation criterion have been employed to evaluate and compare the performance of models, but there is a no uniform standard. Therefore, we evaluate models based on error metrics, which are commonly adopted in regression performance evaluation.
The evaluation criterion consists of the mean absolute error (MAE), the root mean square error (RMSE), and the coefficient of determination . These metrics are expressed as the following mathematical expressions:where is an actual value at week (relative time) in the test set, is a predicted value at week (relative time) , is the mean value in the test set, and is the number of weeks in the test period. The model providing the smallest MAE and RMSE and the largest is considered to have the best performance.
4.3. Comparable Methods
According to the type of input variables, the prediction methods are categorized into univariate models and multivariate models. We choose models which can work with multiple inputs and unstable series and keep ARIMA as a baseline.
4.3.1. Multiple Linear Regression (MLR)
It is widely adopted to model the connection between several independent variables and dependent variables. The prediction model of MLR based on generalized MLR analysis formula is given below:where and are weights and bias to be learned, is the size of the historical data, represents the random error term, and .
We extend MLR to model exogenous inputs and target as follows:where denotes weights of exogenous inputs and historical data at past time intervals.
4.3.2. Random Forest Regression (RFR)
It is a CART [36] method. It has been used to predict the death characteristics of patients, postoperative prognosis of hepatocellular carcinoma, and other data [37]. Random forest regression (RFR) consists of a collection of unpruned regression trees using different bootstrap samples of the training data. In each bootstrap sample, a random sample with replacement and with the same length, some of the data are repeated, and the leftout samples are called out of bag (OOB). In practice, the number of trees and the size of the variable subset should be optimized to reach the ideal forest by minimizing the OOB error. The values of the parameters and were optimized simultaneously by using the gridsearch method ranging from 10 to 1000 (with step size 10) and from 1 to 9 (with step size 1), respectively. The parameter values which give the lowest RMSE of the OOB data were selected as an indicator for the performance.
4.3.3. Support Vector Regression (SVR)
It is a nonlinear kernelbased regression method, which tries to find the best regression hyperplane with smallest structural risk in a high dimensional feature space. It has been used in many medical related applications, such as diagnosis of the incidence of infectious diarrhea [26]. The relationship between input (or inputs) and output is formulated aswhere denotes kernel function, is a vector of inputs at time , and is a bias term. Radial basis function expressed as was used as a kernel function because of its advantages and simple implementation only one tuning parameter.
4.3.4. Gradient Boosting Regression (GBR)
It is a powerful regression model that enhances the decision tree model using gradient boosting, which produces a regression model by combining a series of weak prediction models [38].
GBR iteratively constructs decision trees, and the newly added decision tree is trained according to the negative gradient information of the loss function from the current model. The goal of GBR is to learn an optimal model that minimizes for a specified loss function . The optimal model of GBR can be calculated as follows:where is the first built decision tree, is the number of iterations, represents the shrinkage parameter that controls the learning rate of GBR, denotes the tree trained in the th iteration, and is the weight of . The generated optimal model is used for testing.
4.3.5. Extreme Gradient Boosting Regression (XGBoost)
It is an improvement on the gradient boosting algorithm [39]. XGBoost adds the regularization terms during the decision tree construction phase. The loss function iswhere represents the prediction of the th training sample and is the regularization term. The regularization term is calculated as follows:where is the number of leaf nodes, is the vector formed by all leaf node values of the decision tree, and and are manually set parameters. Similar to GBR, the goal of XGBoost is also to minimize the loss function. Besides, XGBoost uses weight shrinkage and column sampling techniques to resist overfitting.
4.3.6. Convolutional Neural Networks (CNN1d)
CNN [40] consists of convolutional layers that are based on the convolutional operation. Filtering with kernel window function gives an advantage of image or series processing to CNN architectures with fewer parameters, which are beneficial for computing and storage [41–43]. The basic convolution operation is shown as follows:where denotes mapped space and denotes kernel. CNN has been verified to have good accuracy results when applied to pattern recognition [44].
4.3.7. Neural Network Regression (NNR)
On account of the neural network (NN) approximation and generalization property, NNbased prediction is widely used. Recurrent neural network is a type of deep neural network specially designed for sequence modelling [16]. The main idea of RNN is to provide a weighted feedback connection between layers of neurons and add time significance to the entire artificial NN. But RNN may face the problem of vanishing gradient or gradient explosion during backpropagation. LSTM was proposed by Hochreiter and Schmidhuber in [45].
We adopt a lite RNN model like NARX in [15], which consists of an input layer, an RNN layer, and an output layer, to test its performance. The nonlinear sequential layer can be a LSTM layer or a gated recurrent unit (GRU) [18] layer as well.
5. Experimental Results and Analyses
This section presents the results of intensive experiments to evaluate algorithms over four kinds of inputs and analyses them. Figure 2 shows the performance of PM with varying window size . Figure 3 shows the evaluation results of all the methods over all the inputs for all metrics. Figure 4 gives the visual comparison of PM methods over four groups of inputs.
(a)
(b)
(c)
(a)
(b)
(c)
(a)
(b)
(c)
(d)
5.1. The Impact of Window Size
Parameter sensitivity is a significant part of experimental analysis. In time series prediction study, is the most interesting parameter of time delay. Different window sizes will affect the parameter complexity and the overall prediction performance of the methods. In addition, window size is an important indicator to reveal the incubation period of infectious diseases. Therefore, this study visualized the influence of different window sizes on the proposed model. The performance of PM with varying window size in terms of MAE, RMSE, and R^{2} is plotted in Figure 2.
According to the results, when we vary and keep other parameters fixed, it is easily observed that the performance of PM degraded when increases from 4 to 20, and the performance tends to get worse as the length of delay time steps continues to increase. A possible reason is that the longer lagged time delay leads to larger feature dimension of the inputs, which causes an increase in the complexity of the regression function in the training process and directly influences the weighted parameter representation for smallscale sample, resulting in the regression function unable to accurately fit the input. By setting , we notice that PM usually achieves the best performance, which possibly suggests that the diarrhea infection cycle pattern lags about four days in Xiamen. This is an important artificial parameter required by the predictive model.
5.2. The Performance of Time Series Prediction
The optimal performance of the benchmark and proposed methods is found at . Hence, the evaluation results of all the comparable methods are shown in Figure 2 when is fixed at 4.
Several important observations are made about these results:(1)By benefiting from MF and BSI data, the PM model obtains the best performance in terms of three metrics(2)The performances of MLR and GBR are better than some complex RNN methods, and ARIMA cannot perform well under unstable time series(3)CNN1d and RNN methods can achieve stable performance when processing each type of inputs(4)Both MF and BSI data can improve the prediction accuracy of diarrhea outpatient counts in upcoming weeks.
To demonstrate the effectiveness of PM, we compare the performance of PM against some common methods for the same prediction tasks. The comparable experiments choose MLR, GBR, RFR, SVR, and XGBoost as the representative of the traditional methods and three other deep learning methods. The deep learning methods include CNN, RNN and LSTM with {64, 128} hidden nodes.
Comparing the performances of all the methods over the four inputs, according to the results of predictions based on historical cases, we can observe that the PM method shows the best performance, and CNN1d, RNN, GBR, and MLR also have good results. The performance of MLR is better than the performance of deep learning methods when the inputs are solely on the basis of historical cases. A possible reason is that the smallscale data collections cannot train deep learning methods well, especially the LSTM method, either overfitting or underfitting. According to the results of predictions based on cases+BSI, we can observe that the traditional m`ts that common learning methods cannot extract sufficient features from high dimensional inputs to predict the upcoming values. According to the results of predictions based on historical cases and BSI, we can observe that the performance of all the methods has degraded, which suggests that too many missing values will greatly affect the prediction performance of the model. However, PM has ability to adapt to input and to deal with missing values, which is significantly stronger than other models. According to the the inputs are solely on the basis of predictions based on cases+MF+BSI, we can observe that PM obtains the best results. Compared to the CNN1d method, it is difficult for traditional learning models to give stable performance with exogenous inputs. The prediction accuracy of the LSTM method has a slight improvment when compared with MLR. The prediction effect of the RNN method fluctuates significantly. It is suggested that exogenous inputs can effectively improve model performance, but it also related to the adaptability of the model’s structure to exogenous inputs.
There are two potential reasons for the improvements in the PM method. On the one hand, the RNN models only consider the temporal dynamics of exogenous inputs. With smallscale samples, these models cannot extract sufficient features to predict the target. The traditional machine learning methods are easily converged and have worse performance in predicting the upcoming values with exogenous inputs. A possible reason is that these methods cannot capture the correlations among different components of the inputs. The proposed method has ability to learn the interactions of different exogenous factors by introducing the weighted layers, which can effectively improve model performance in smallscale data collections through more concise feature representation. On the other hand, and two weights for each input element greatly decreases the need of parameters, which can be updated by the training process, and the two weighted vectors are adopted to learn temporal weights and factor weights.
When compared with CNN1d, the proposed method exploits the multiplication and addition of two vectors to generate predictions instead of using a kernel matrix to calculate the inputted 2d data to get output values. When is small, the convolution kernel of CNN has poor performance, since the kernel size should smaller than input size. Moreover, not only wide or deep models but also machine learning models have abilities in overcoming overfitting using decay weights (i.e., regularization items) in their loss functions. The key concern is that more parameters will lead to hard training on smallscale data collections. Therefore, PM is more concise and effective, which has better results and better adaption on broad inputs.
Another considerable result is that the performance differences in results among the methods are enlarged with complicated inputs. For example, when only considering the outpatient cases with , PM’s performance is similar to other models. But the performance differences become larger when fusing exogenous inputs, since the mined patterns from heterogeneous data are more complex than those found in only outpatient case data. PM has a better ability to handle smallscale heterogeneous input data. The results of correlation experiments also show that it is completely feasible to use exogenous factors to predict the incidence of infectious diarrhea in Xiamen.
5.3. The Visualization Analysis of Predictions
In time series prediction, it is sometimes more interesting to compare the performance on capturing the socalled extreme events, e.g., an oscillation after a stable growth or decay, or a huge sudden change during oscillations. Thus, a visualization comparing real values and PM predictions is presented in Figure 4. The red dashed lines mark the 10^{th} and 23^{rd} week, whose values follow the highest and lowest real values, respectively.
The prediction of time series extreme events has been proposed by previous studies [46]. We can see that the number of outpatients peaked at 9^{th} week and 10^{th} week, and their outpatient counts significantly dropped. In this situation, PM models with BSI + MF fit the real value better than other methods, which illustrates the ability of weighted layers in summarizing the interactions of exogenous inputs, and the heterogeneous data fusion is an effective method to improve prediction accuracy. The advantage is also retained in the method with MF and BSI. It also should be noted that at 9^{th} week, the number of cases reaches the peak values, and MF effectively improves the accuracy in this timestamp, which makes up for the loss of accuracy of fusion of BSI and historical data in the forecast at that time. Historical cases and MF have slightly fluctuated at 13^{th} week. By incorporating BSI data, the influence of random disturbance in this timestamp is obviously reduced for prediction results. When the value at 23^{rd} week followed the lowest real value, the performance of the PM model with all heterogeneous data fusion is not stable.
Moreover, the predicted value using MF or BSI of 45^{th} week is obviously higher, and the situation is reflected in the fusion of MF and BSI. A possible reason is that the internal random disturbance of exogenous data has not been completely eliminated in the preprocessing stage. Therefore, the extreme weather conditions or special events and degrade the prediction performance.
6. Conclusions
In this paper, we focus on predicting the number of infectious diarrhea outpatient visits in the upcoming week. A parsimonious model (PM) is proposed by condensing previous prediction models. The benchmarks of ten algorithms with four groups of inputs show the advantage of our method. It achieves better prediction performance by consolidating MF data and BSI data.
In the future, we will try to investigate the prediction of other cities and improve the robustness of PM in predicting those cities. Moreover, the simultaneous forecast of multiple cities would be our future research direction.
Data Availability
The data used to support the findings of this study are available from the corresponding author upon request.
Conflicts of Interest
The authors declare that they have no conflicts of interest.
Acknowledgments
The authors would like to thank Xiamen Centre for Disease Control and Prevention for sharing the data. This study was supported in part by the Natural Science Foundation of Fujian Province of China (nos. 2018J01539 and 2019J01713) and the Science Project of Xiamen City (no. 2019SH400060).
References
 T. Wu, C. Perrings, A. Kinzig, J. P. Collins, B. A. Minteer, and P. Daszak, “Economic growth, urbanization, globalization, and the risks of emerging infectious diseases in China: a review,” Ambio, vol. 46, no. 1, pp. 18–29, 2017. View at: Publisher Site  Google Scholar
 P. Kelly, “Infectious diarrhoea,” Medicine, vol. 47, no. 6, pp. 341–346, 2019. View at: Publisher Site  Google Scholar
 L. Wang, L. Jin, and W. Xiong, “Chapter 2—infectious disease surveillance in China,,” in Early Warning for Infectious Disease Outbreak, W. Yang, Ed., pp. 23–33, Academic Press, Cambridge, MA, USA, 2017. View at: Google Scholar
 Y. Lan, D. Zhou, H. Zhang, and S. Lai, “Chapter 3 development of early warning models,,” in Early Warning for Infectious Disease Outbreak, W. Yang, Ed., pp. 35–74, Academic Press, Cambridge, MA, USA, 2017. View at: Google Scholar
 I. N. Soyiri and D. D. Reidpath, “An overview of health forecasting,” Environmental Health and Preventive Medicine, vol. 18, no. 1, pp. 1–9, 2013. View at: Publisher Site  Google Scholar
 L. Yu, L. Zhou, L. Tan et al., “Application of multiple seasonal arima model in forecasting incidence of hfmd in Wuhan, China,” International Journal of Infectious Diseases, vol. 21, p. 271, 2014. View at: Publisher Site  Google Scholar
 P. Zhang, S. Shu, and M. Zhou, “An online fault detection model and strategies based on SVMgrid in clouds,” IEEE/CAA Journal of Automatica Sinica, vol. 5, no. 2, pp. 445–456, 2018. View at: Publisher Site  Google Scholar
 J. Cai, K. Xu, Y. Zhu, F. Hu, and L. Li, “Prediction and analysis of net ecosystem carbon exchange based on gradient boosting regression and random forest,” Applied Energy, vol. 262, Article ID 114566, 2020. View at: Publisher Site  Google Scholar
 R. Oppenheim, “Forecasting via the boxjenkins method,” Journal of the Academy of Marketing Science, vol. 6, no. 3, pp. 206–221, 1978. View at: Publisher Site  Google Scholar
 G. Mahalakshmi, S. Sridevi, and S. Rajaram, “A survey on forecasting of time series data,” in Proceedings of the 2016 International Conference on Computing Technologies and Intelligent Data Engineering (ICCTIDE’16), pp. 1–8, Kovilpatti, India, January 2016. View at: Publisher Site  Google Scholar
 S. Chen, X. Liu, Y. Wu et al., “The application of meteorological data and search index data in improving the prediction of HFMD: a study of two cities in Guangdong province, China,” Science of The Total Environment, vol. 652, pp. 1013–1021, 2019. View at: Publisher Site  Google Scholar
 R. Adhikari and R. K. Agrawal, “An introductory study on time series modeling and forecasting,” 2013, https://arxiv.org/abs/1302.6613. View at: Google Scholar
 H. Liu, M. Zhou, and Q. Liu, “An embedded feature selection method for imbalanced data classification,” IEEE/CAA Journal of Automatica Sinica, vol. 6, no. 3, pp. 703–715, 2019. View at: Publisher Site  Google Scholar
 S. Gao, M. Zhou, Y. Wang, J. Cheng, H. Yachi, and J. Wang, “Dendritic neuron model with effective learning algorithms for classification, approximation, and prediction,” IEEE Transactions on Neural Networks and Learning Systems, vol. 30, no. 2, pp. 601–614, 2019. View at: Publisher Site  Google Scholar
 E. Diaconescu, “The use of NARX neural networks to predict chaotic time series,” WSEAS Transactions on Computer Research, vol. 3, 2008. View at: Google Scholar
 R. Williams and D. Zipser, “A learning algorithm for continually running fully recurrent neural networks,” Neural Comput, vol. 1, pp. 270–280, 1998. View at: Publisher Site  Google Scholar
 I. Sutskever, O. Vinyals, and Q. V. Le, “Sequence to sequence learning with neural networks,” 2014, https://arxiv.org/abs/1409.3215. View at: Google Scholar
 K. Cho, B. Merrienboer, Y. Bengio et al., “On the properties of neural machine translation: encoderdecoder approaches,” 2014, https://arxiv.org/abs/1409.1259. View at: Google Scholar
 Z. C. Lipton, “A critical review of recurrent neural networks for sequence learning,” 2015, https://arxiv.org/abs/1506.00019. View at: Google Scholar
 Y. Qin, D. Song, H. Chen et al., “A dualstage attentionbased recurrent neural network for time series prediction,” in Proceedings of the TwentySixth International Joint Conference on Artificial Intelligence IJCAI2017, pp. 2627–2633, Melbourne, Australia, August 2017. View at: Publisher Site  Google Scholar
 G. Lai, W. Chang, and Y. Yang, “Modeling long and shortterm temporal patterns with deep neural networks,” in Proceedings of the The 41st International ACM SIGIR Conference on Research & Development in Information Retrieval, 2018. View at: Publisher Site  Google Scholar
 Y. Chang, F. Sun, Y. H. Wu et al., “A memorynetwork based solution for multivariate timeseries forecasting,” 2018, https://arxiv.org/abs/1809.02105. View at: Google Scholar
 Y. Wu, Y. Yang, H. Nishiura et al., “Deep learning for epidemiological predictions,” in Proceedings of the The 41st International ACM SIGIR Conference on Research & Development in Information Retrieval SIGIR2018, pp. 1085–1088, Ann Arbor, MI, USA, June 2018. View at: Publisher Site  Google Scholar
 J. Chen, K. Li, P. Herrero et al., “Dilated recurrent neural network for shorttime prediction of glucose concentration,” in Proceedings of the 41st International ACM SIGIR Conference on Research & Development in Information Retrieval SIGIR2018, pp. 95–103, Ann Arbor, MI, USA, June 2018. View at: Publisher Site  Google Scholar
 S. Shih, F. Sun, and H. Lee, “Temporal pattern attention for multivariate time series forecasting,” Machine Learning, vol. 108, no. 89, pp. 1421–1441, 2019. View at: Publisher Site  Google Scholar
 Y. Wang, J. Gu, Z. Zhou, and Z. Wang, “Diarrhoea outpatient visits prediction based on time series decomposition and multilocal predictor fusion,” KnowledgeBased Systems, vol. 88, pp. 12–23, 2015. View at: Publisher Site  Google Scholar
 Y. Wang, J. Li, J. Gu, Z. Zhou, and Z. Wang, “Artificial neural networks for infectious diarrhea prediction using meteorological factors in shanghai (China),” Applied Soft Computing, vol. 35, pp. 280–290, 2015. View at: Publisher Site  Google Scholar
 S. Li, T. Chen, L. Wang, and C. Ming, “Effective tourist volume forecasting supported by PCA and improved BPNN using Baidu index,” Tourism Management, vol. 68, pp. 116–126, 2018. View at: Publisher Site  Google Scholar
 Z. Li, T. Liu, G. Zhu et al., “Dengue Baidu search index data can improve the prediction of local dengue epidemic: a case study in Guangzhou, China,” PLoS Neglected Tropical Diseases, vol. 11, no. 3, pp. 1–13, 2017. View at: Publisher Site  Google Scholar
 Z. Wang, Y. Huang, B. He et al., “TDDF.: HFMD outpatients prediction based on time series decomposition and heterogenous data fusion in Xiamen, China,” in Proceedings of the 15th International Conference, ADMA 2019, pp. 658–667, Dalian, China, November 2019. View at: Google Scholar
 “Xiamen” from Wikipedia, 2020, https://en.wikipedia.org/wiki/Xiamen.
 Xiamen Statistics Bureau, 2018, http://tjj.xm.gov.cn/tjnj/2018/.
 K. Liu, T. Wang, Z. Yang et al., “Using Baidu search index to predict dengue outbreak in China,” Scientific Reports, vol. 6, p. 38040, 2016. View at: Publisher Site  Google Scholar
 J. Brownlee, “Long shortterm memory networks with python: develop sequence prediction models with deep learning,” Machine Learning Mastery, 2017, https://machinelearningmastery.com. View at: Google Scholar
 D. P. Kingma and J. Ba, “Adam: a method for stochastic optimization,” 2015, https://arxiv.org/abs/1412.6980. View at: Google Scholar
 L. Breiman, “Random forests,” Machine Learning, vol. 45, no. 1, pp. 5–32, 2001. View at: Publisher Site  Google Scholar
 C. C. R. Sady and A. L. P. Ribeiro, “Symbolic features and classification via support vector machine for predicting death in patients with Chagas disease,” Computers in Biology and Medicine, vol. 70, pp. 220–227, 2016. View at: Publisher Site  Google Scholar
 H. F. Jerome, “Greedy function approximation: a gradient boosting machine,” The Annals of Statistics, vol. 29, no. 5, pp. 1189–1232, 2001. View at: Google Scholar
 T. Chen and C. Guestrin, “Xgboost: a scalable tree boosting system,” in Proceedings of the Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, August 2016. View at: Publisher Site  Google Scholar
 Y. Lecun, Y. Bengio, and P. Haffner, “Gradientbased learning applied to document recognition,” Proceedings of the IEEE, vol. 86, no. 11, pp. 2278–2324, 1998. View at: Publisher Site  Google Scholar
 S. Bai, J. Z. Kolter, and V. Koltun, “An empirical evaluation of generic convolutional and recurrent networks for sequence modeling,” 2018, https://arxiv.org/abs/1803.01271. View at: Google Scholar
 S. Barra, S. M. Carta, A. Corriga, A. S. Podda, and D. R. Recupero, “Deep learning and time seriestoimage encoding for financial forecasting,” IEEE/CAA Journal of Automatica Sinica, vol. 7, no. 3, pp. 683–692, 2020. View at: Publisher Site  Google Scholar
 M. M. Hassan, A. Gumaei, G. Aloi, G. Fortino, and M. Zhou, “A smartphoneenabled fall detection framework for elderly people in connected home healthcare,” IEEE Network, vol. 33, no. 6, pp. 58–63, 2019. View at: Publisher Site  Google Scholar
 D. FreireObregón, F. Narducci, S. Barra, and M. CastrillónSantana, “Deep learning for source camera identification on mobile devices,” Pattern Recognition Letters, vol. 126, pp. 86–91, 2019. View at: Publisher Site  Google Scholar
 S. Hochreiter and J. Schmidhuber, “Long shortterm memory,” Neural Computation, vol. 9, no. 8, pp. 1735–1780, 1997. View at: Publisher Site  Google Scholar
 D. Ding, M. Zhang, X. Pan et al., “Modeling extreme events in time series prediction,” in Proceedings of the Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 1114–1122, July 2019. View at: Publisher Site  Google Scholar
Copyright
Copyright © 2020 Zhijin Wang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.