#### Abstract

With the popularization of the Internet and the widespread application of mobile terminal, travelers are increasingly dependent on traffic information. It is particularly important to construct and develop more accurate discrete traffic state prediction models. Considering that most of the previous studies about traffic state prediction are essentially a prediction of specific parameters, this paper proposes a generalized fractional difference (GFD)-auto regressive moving average (ARMA)-Fisher combined model that can directly predict the discrete traffic state. First, using the original historical traffic flow data as training samples for cluster analysis, we obtain different traffic state classification samples. Then, using the Fisher discriminant method, we develop a discrete traffic state recognition model based on the traffic state classification samples. The model can help us identify the discrete state of the future traffic flow when we input a set of predicted traffic parameters to it. In order to improve the accuracy of the model prediction, this paper creatively proposes to apply the GFD method to the stabilization of original traffic flow data and then develop an ARMA model to predict the traffic parameters processed by GFD (GFD-ARMA). Last, we obtain the predicted discrete traffic state using the calibrated Fisher discrimination model whose inputs are the parameters predicted by the GFD-ARMA. The proposed method is tested using field data from CHangzhou, China. The results suggest that the developed GFD-ARMA-FISHER method shows a higher accuracy for traffic state prediction and is better than other similar methods.

#### 1. Introduction

With the rapid development of the social economy and the constant expansion of the size of cities, people’s demands regarding the quality and quantity of transportation have been increasingly growing and, developing a fast and green traffic system has become the main focus of current research. Facing increasingly severe traffic congestion pressure, various countries around the world have adopted a variety of countermeasures, the most important of which is the development of intelligent transportation systems (ITSs) [1, 2]. Traffic flow parameter prediction, as the basis of an ITS, is the prerequisite and basis for traffic flow control and induced management [2–4]. Traffic flow parameter prediction refers to the estimation of traffic parameters in the future based on historical survey data. At present, the main methods used for traffic parameter prediction can be divided into three categories: nonparametric prediction methods, parameter prediction methods, and combinations of these methods.

Nonparametric prediction methods are new methods that have gradually been widely studied due to the rapid development of artificial intelligence and big data in recent years. These methods borrow the basic idea of artificial intelligence and mainly achieve predictions by training a model using observation samples. Nonparametric prediction methods mainly include the nearest neighbor method [5–7], neural networks [8, 9], the support vector machine [10–13], machine learning [14, 15], grey theory [16–18], and simulation methods [19]. Parameter prediction methods are based on the potential change in law in historical traffic data. The development of a parametric prediction model requires developing a parametric logical model, estimating the unknown parameters of the model, and testing the reliability of the unknown parameters. Parametric prediction methods mainly involve the historical averaging method, the smoothing algorithm, the Bayesian combination method [20], the filtering method [21], time series prediction [22], and spectral analysis [23, 24].

The most classic and widely used parameter prediction method is the autoregressive linear analysis method, which mainly includes the auto regression (AR) model, the moving average (MA) model, the auto regression moving average (ARMA) model [25–27], the auto regression integrated moving average (ARIMA) model [9, 28], ARIMAX [29], the auto regression conditional heteroscedasticity (ARCH) model, the generalized auto regression conditional heteroscedasticity (GARCH) model [30, 31], and the combination of these models [32–35]. The ARMA and ARCH family models are based on stationary time series. It means that the ARMA model and ARCH model, which are traditional time series analysis tools, are all based “fully or almost independently” between two observations that are far apart in a time series. A stationary time series is a short memory time series with an autocorrelation coefficient decaying at an exponential rate. If a time series is not stable, the series should be stabilized first, and then it is possible to perform ARMA/ARCH modeling on it. In general, the most common method for stabilizing a time series is to calculate integer order differences. However, although integer order differences can stabilize nonstationary time series, the integer difference process also makes the original time series lose useful information, and this information may be able to help develop more accurate models [36]. Therefore, how to stabilize the original data with as much useful information as possible is a core issue studied in this paper. This paper considers introducing the generalized fractional difference (GFD) method into the prediction process of urban road traffic states.

Moreover, although there are many studies on “traffic state” estimation or prediction, the “traffic state” mentioned in these studies is actually a generalized concept characterized by various traffic parameters, including the volume [37], travel time, speed [38], capacity [39], density, cumulative number of vehicles [40], and so on. Therefore, “traffic state” prediction is actually the prediction of these parameters. These prediction parameters are useful and important for determining the degree of traffic congestion, but they are not intuitive and easily accepted parameters for travelers especially for people who are used to relying on traffic guidance information. Therefore, in this paper, we propose a method that can directly predict the discrete traffic state that reflects the degree of traffic congestion. In other words, the traffic state mentioned in this paper is a narrow-sense traffic state, which is characterized by smooth flows, general congestion, severe congestion, etc. The method proposed in this paper can directly use historical traffic parameters to make predictions about future discrete traffic congestion states. Following these ideas, first, this paper extracts the traffic flow time series parameters for a day on a fixed section of a road. Then, a traffic flow parameter prediction model based on the GFD-ARMA is developed. Next, using the historical data as training samples, a traffic state recognition model based on the Fisher discriminant is developed. The predicted traffic state can finally be obtained by organically combining these two models.

The highlights of this paper are as follows: First, this paper creatively proposes to apply the GFD method to the stabilization of original traffic flow data which can not only stabilize the original data but also make the stabilized data retain more effective information as much as possible. This practice provides a prerequisite for developing a more accurate prediction model. Second, different from the goal of only predicting traffic parameters in the past, this paper proposes a method that can directly predict discrete traffic states which is easy to adopt in practice. Finally, the new traffic state prediction method proposed in this paper combines the ideas of cluster analysis and discriminant analysis and cleverly uses the results of the cluster analysis as training samples for the calibration process of the discriminant analysis model, making full use of the effective information contained in the original data.

The rest of this paper is organized as follows. Section 2 mainly describes the GFD-ARMA-FISHER analytical framework. Section 3 introduces the data used in this paper; Section 4 gives the calibration process of the GFD-ARMA-FISHER combined model and the prediction results of the model; and finally, Section 5 gives the main conclusions and discussion.

#### 2. GFD-ARMA-FISHER Analytical Framework

##### 2.1. GFD-ARMA

###### 2.1.1. The Model

For a time series , define as the *k*th step ( is a positive integer parameter) difference of . It can be calculated as follows:

Let be the delay operator. Then, for the time series , define . Then, we can obtain the following equation:

Define as the *d*-order difference of . When is a positive integer parameter greater than or equal to 1, it can be calculated as follows:

When , .

It is clear that can be written equivalently as follows:

According to the polynomial expansion rule, can also be written as follows:

We refer to the above methods (equations (4) and (5)) to calculate the difference in a time series as the integer difference method. However, when is not just a positive integer but is also a general positive fractional parameter, can be written as follows:where is a preset positive integer and represents the memory length of the time series. We refer to the above method (equations (4) and (6)) to calculate the difference in a time series as the generalized fractional difference (GFD) method.

We state that a nonstationary time series can be fitted by the GFD-ARMA model if it can be fitted by the ARMA after it is stabilized by the GFD. The whole GFD-ARMA model can be expressed as follows:

is a white noise series , and is a constant. In the actual modeling process, whether the model contains depends on whether *c* is a constant. In the actual modeling process, whether is included in the model depends on the needs of the model (especially the impact on the goodness of fit of the model). , is the lag order of the auto regression, is the parameter of the lag term , , is the lag order of the moving average, and is the parameter of the moving average lag term .

The unknown parameters that need to be estimated in Model (7) include . However, before estimating the parameters, we must first determine the lag term of the model. In this paper, we first estimate parameter , then determine the lag term of the model, and finally, estimate parameters and . These parameters can be estimated as follows.

###### 2.1.2. Parameter Estimation

Estimate parameter .

First: Initialize , and set a small step size , such as .

Second: Test the stationarity of the sequence (for a time series , differentiate it using the GFD method (equations (4) and (6)). If it is stable, then and end the process; otherwise, let .

Third: Test the stationarity of the new sequence . If it is stable, then and end the process; otherwise, let and repeat the third step.

Determination of the lag terms of the model: Generally speaking, in practice, it is difficult to determine the lag terms of the model accurately due to the complexity of the actual data. Although the Box-Jenkins method [41] is used to estimate the lag terms in many studies, this paper believes that the Box-Jenkins method error may increase for data with greater noise. Therefore, based on the Box-Jenkins method, this paper proposes a method to determine the lag terms, which is suitable for the data in this paper. The process is as follows. First: For a stationary time series , calculate its autocorrelation coefficient (AC) and partial autocorrelation coefficient (PAC) and test its significance. Let the set of all terms with significant AC parameters be (there are terms that are significant) and the set of all terms with significant PAC parameters be (there are terms that are significant). Second: Develop sparse models, where and are subsets of and , respectively. Third: Test the residual sequences of these models. Discard the model if its residual series are correlated. Fourth: Compare the fit goodness of the remaining models. The model with the best fit will be selected as the final model. If the two models have an equal goodness of fit, then choose the model with the smaller AIC value. Then, and can be determined.

The current estimation methods for parameters and are relatively mature, and the related details of the estimation methods can be found in reference [42, 43]. This paper estimates these parameters using the Eviews10.

##### 2.2. Fisher Discriminant Analysis Method

The Fisher discriminant analysis method is a supervised classification method that is based on the idea of projection (or dimensional reduction). The Fisher discriminant analysis method uses a few linear combinations of variables () (called discriminants), where (generally, is significantly smaller than ), to replace the original variables () to achieve dimensionality reduction. Moreover, using the discriminants , the assignment of samples is discriminated. It is supposed that the -dimensional observed values of group are , where and , which are projected to a -dimensional constant vector . This process obtains the projection points that separately correspond to the linear combinations , where and . In this way, all the -dimensional observed values are simplified into one-dimensional observed values. Let denote the mean of in group and stand for the mean of all *s* in group ; that is,where , , and . The specific process of Fisher discriminant analysis is as follows. Step 1: Calculate the sum of squares and the cross product sums of between groups: . Step 2: Calculate the sum of squares and cross product sums of within a group: . (if ). Step 3: Calculate the total nonzero eigenvalues of , which are separately displayed as and separately correspond to the eigenvectors . Therefore, discriminants (, ) can be acquired. Step 4: Calculate the group mean of the discriminant . Step 5: Calculate the cumulative contribution of the first discriminants. If the cumulative contribution of the first discriminants reaches a high proportion, then the first discriminants can be used for discrimination. The discrimination rule is shown as follows:

##### 2.3. The Combined Analytical Framework

The discrete traffic state prediction process studied in this paper is shown in Figure 1. First, this paper extracts historic traffic flow time series parameters to develop the traffic parameter prediction model using the GFD-RAMA method. In addition, the traffic state training samples are obtained by the *k*-means cluster method. Then, using the traffic state training samples, we develop the traffic state recognition model using the Fisher discriminant analysis method. Last, the new traffic state can be predicted via the comprehensive application of these two models.

#### 3. Data Preparation and Preprocessing

##### 3.1. Traffic Parameter Data

The data used in this paper are from a section of Bo’ai road in the center of Changzhou city from 7/10/2008∼9/10/2008. The data include four types of traffic parameters (average quantity, average speed, average occupancy and average headway). These four types of parameters are denoted as , , and , respectively, in this paper. The data are divided into two types: one type is used to calibrate the model, and the other type is used to validate the model. The model is calibrated with data from 7/10/2008 (Tuesday, a workday), and the model is validated with data from 8/10/2008 and 9/10/2008. The descriptive statistics of all the data are shown in Table 1.

##### 3.2. Traffic State Sample

The premise of developing a traffic state recognition model is to have a large number of traffic state classification samples. However, it is well known that, in practice, although traffic flow parameter data are usually easy to obtain, traffic state data are usually not easy to obtain for the following reasons. First, the traffic state parameter is not a parameter that can be directly collected. The traffic state parameter is secondary data after processing the original traffic flow parameters. In addition, different cities and regions have different standards for the definition and classification of traffic states (for example, some cities use speed as the only criterion for classifying traffic conditions, and some cities use manual judgment results as judgment criteria). Second, because different roads have different attributes and different travelers have different perceptions of traffic conditions, it is almost impossible to construct a unified and absolute classification standard for traffic states. Although an absolute traffic state classification is not easy to obtain, we can still obtain relative traffic state classifications using some methods (such as classification methods based on unsupervised learning). This paper applies *K*-means clustering to unsupervised learning and the classification of traffic states. The purpose is to obtain classification samples, lay the foundation for developing the recognition model, and verify the accuracy of the state prediction model. In our opinion, this classification method is more general and objective. The classification of the traffic states of a road by the model can indicate the relative congestion of the road. Considering that this paper mainly hopes to use classification samples to build a traffic state prediction model and discuss the accuracy of the state prediction model, it divides the relative traffic state into 3 classes and 5 classes (that is, for *K*-means clustering, set the number of classifications to 3 and 5, respectively, in advance). The accuracy of the model prediction results under different numbers of classifications is discussed separately as well. According to the clustering process below, we can obtain the classification results of the traffic state. Step 1: Determine the number of classes that need to be clustered, that is, the number of clusters. Step 2: Initialize the cluster center. Choose data randomly as the initial classes. Obviously, each datum is also the cluster center of each class. Step 3: For each datum, calculate its distance from each cluster center (Euclidean distance). A datum will be divided into a certain class if it is closest to the cluster center of this class. Then, new classes are generated. Step 4: Calculate the mean value of each new class as the new cluster center. Step 5: Terminate the process. If the distance between the new clustering center and the original clustering center is less than a certain threshold, then terminate the process; otherwise, repeat Steps 3 to 5.

Preset the number of categories to 3 and 5, respectively (clustering the traffic congestion status into 3 and 5 categories, respectively), using the *K*-Means clustering method, we can get the classification results of the road traffic states samples, Table 2 shows the cluster centers of three states and five states.

As shown in Table 2, State 2 has the smallest average , the largest average , and the smallest average compared to the other states. State 3 has the largest average , the smallest average , and the largest average compared to the other states. State 1 lies between states 1 and 3. Therefore, state 2 can be interpreted as the smoothest state, state 3 is the most crowded state compared to state 2, and state 1 is between state 2 and state 3. According to the same reason, we can arrange the states in Table 2 from smooth to crowded in the following order: state 5, state 3, state 1, state 2, and state 4. This shows that the state clustering obtained by the *K*-means clustering method can be used as a method of discrete traffic state classification (Table 3).

##### 3.3. Stabilize the Data

The stability test is the premise of developing a stationary time series model, which can effectively avoid a spurious regression. This paper uses the ADF test method to test the stationarity of the traffic parameters. The results are shown in Table 4.

As seen from the above table, the *T* statistics of the ADF test of the four types of parameters are all greater than the *T* values at the significance levels of 1%, 5%, and 10%, which means that the four types of parameters are unstable. Therefore, the parameters should be stabilized before modeling and analysis.

According to the process given in 2.1.2 the parameter can be estimated. At a significance level of = 0.05, the estimated value of can be obtained (,, and *).* The data processed by the GFD method are shown in Figure 2. (The parameters processed by the GFD method are denoted as , and ).

The stability test results are shown in Table 5. As seen from Table 4, after GFD processing, at the 1% significance level, all types of parameters passed the ADF test.

#### 4. Model Calibration and Prediction Results

##### 4.1. Estimate Parameters and

Using the estimation method described in 2.1.2, after a large number of model comparisons and analyses, we finally determine the lag terms of the three types of parameters and then estimate the parameters and *.* The results are shown in Table 6*.*

It can be seen from Table 6 that the AR lag terms of the ARMA model of the traffic flow parameter are the 1^{st}, 2^{nd}, 3^{rd}, and 4^{th} terms, and that the MA lag terms are the first and second terms, respectively. Using the lag term as the explanatory variable to develop the parameter-predicted ARMA model, each item is significant at the 0.05 significance level according to *t*-tests (the corresponding significance probabilities of the terms are all less than 0.05). In the same way, it can be seen that the AR lag terms and the MA lag term of are the 1^{st}, 9^{th}, 10^{th}, and 12^{th} terms and the 1^{st} term, respectively, and that the AR lag terms and the MA lag term of are the 1^{st}, 2^{th}, 3^{th}, 6^{th}, 7^{th}, and 8^{th} terms and the 1st term, respectively. To test the effect of the developed model, we performed a serial correlation test on the residuals of the model. The test results of the residual sequence correlation are shown in Figure 3. As seen from Figure 3, the residual sequences of the three types of parameters all show sequence independence (the Prob values of the statistics are all greater than 0.05), so it can be considered that the developed model can fully extract the regular information included in the original data. The data fitted by the model (Table 5) are compared with the original data, as shown in Figure 4. It can be seen from Figure 4 that the law of the data after fitting are basically consistent with the original data, which shows that the model can better fit the original data.

##### 4.2. Parameter Prediction Model

Using the collected historical data (such as ,,*, and*), the GFD series (including ,,, and ), and the calibrated model (shown in Table 4), the flow parameters at the future time can be predicted. The prediction model is expressed as follows:where

Using the parameter prediction model (10), the traffic flow parameters on 8/10/2008 and 9/10/2008 are predicted. The predicted results are measured by the inde*x*, as shown in formula (12), and the results are displayed in Table 7. Moreover, the predicted results are shown in Figure 5.

##### 4.3. FISHER Recognition Model Calibration

In Section 3.2, we take the traffic flow parameters from 7/10/2018 as the sample data and use *K*-means clustering analysis to obtain the classification results of the traffic state. Next, we use this classification result as a training sample and use the Fisher discrimination introduced in Section 2.2 to calibrate the traffic state recognition model.

*Case 1. *3 traffic states

As seen from Figure 6, ,,, and . Let ,, and denote the parameter samples of traffic state 1, traffic state 2, and traffic state 3, respectively: ,,, and *.*

Calculate the sum of squares and cross product sums between groups:Calculate the sum of squares and cross product sums within a group:Calculate the total nonzero eigenvalues of . Then, we can obtain the eigenvalues . The corresponding eigenvectors are .

Since is already a very high value, it is sufficient for us to choose the first discriminants. Therefore, the centralized discriminant is as follows:The group mean of the discriminant is as follows:The final recognition model can be expressed as an unknown traffic state (it is characterized by the three parameters of ). If can satisfy the following conditions, then it belongs to state .

*Case 2. *5 traffic states

In the same way, the recognition model in five states can be obtained, such as formulas (18) and (19).

The group mean of the discriminant is as follows:The final recognition model can be expressed as an unknown traffic state , If can satisfy the following conditions, then it belongs to state *.*

##### 4.4. Discrete Traffic States Prediction Results

Using the traffic flow parameter prediction data obtained in Section 4.2 (8/10/2008 and 9/10/2008) and the identification models of (17) and (19), the corresponding traffic conditions can be predicted. The prediction results are shown in Table 3, Figures 6 and 7. Figure 6 shows the prediction results for three classification states, and Figure 7 shows the prediction results for five classification states. We also compared the state prediction results with the original state. The results show that in the three states, the prediction accuracy for 8/10/2008 can reach 83.33% and the prediction accuracy for 9/10/2008 can reach 84.58%. Under the three states situation, the highest prediction accuracy is State 2 (the smoothest state), and the accuracies reached 92.81% and 92.49% for the prediction results on 8/10/2008 and 9/10/2008, respectively. The prediction results for the same dates in the five state situations are also confirmed. The highest prediction accuracy is state 5 (the smoothest state), and the accuracies are 94.69% and 92.85%, respectively. We speculate that this result may be caused by the most obvious state being different from other states. In the five states situation, the prediction accuracy for 8/10/2008 can reach 66.25% and the prediction accuracy for 9/10/2008 can reach 70.83%, which are significantly lower than the prediction accuracies of the three-state situations. This is because more states result in less obvious the differences between these states, leading to a high misjudgment of each state.

##### 4.5. Result Analyses

In order to evaluate the effectiveness of the prediction model proposed in this paper, we compare the prediction results with those of previous similar prediction methods. These methods mainly include parameter prediction methods, such as ARIMA [28], ARIMA-GARCH [35], ARIMAX [29], and hybrid methods such as ARIMA-ANN [9]. The principles and details of these models can be referred to in the relevant literature and will not be described here. Here, we first compare the parameter prediction results with GFD-ARMA and then compare the state prediction results using the GFD-ARMA-FISHER analytical framework. The parameters of ARIMA (, *d*, *q*) is set by ARIMA (3, 1, 2) (for Quantity)\ARIMA (4, 1, 1) (for Speed)\ARIMA (5, 1, 1) (for Occupancy). The parameters of ARIMA-GARCH is set by ARIMA (3, 1, 2)-GARCH (1, 1) (for Quantity)\ARIMA (4, 1, 1)-GARCH (1, 1) (for Speed)\ARIMA (5, 1, 1)-GARCH (1, 1) (for Occupancy). The input variable of the ARIMAX is Headway, the parameters is set by ARIMAX (3, 1, 1). Specific details of ARIMA-ANN prediction model are shown in the literature [9], and the ANN part adopts the BP neural network with double hidden layers (the network structure is 5 × 6 × 4 × 1), 5 inputs and 1 output are designed. The number of double hidden layer neurons is 6 and 4, respectively. The results of parameter prediction and state identification are shown in Tables 8 and 9, respectively.

As can be seen from Tables 8 and 9: (1) For the quantity parameter, the GFD-ARMA model performs better than ARIMA-GARCH and ARIMAX, but worse than ARIMA-ANN model. (2) For the speed and occupancy, the GFD-ARMA model performs better than all of other models. (3) Although ARIMA-ANN has better prediction results for individual parameters (Quantity) than GFD-ARMA, GFD-ARMA -Fisher shows best in predicting traffic state. This also shows the advantages of GFD-ARMA-Fisher prediction framework in traffic state prediction.

#### 5. Conclusions

The accurate prediction of traffic states is of great significance for traffic information managers to monitor road traffic conditions, provide traffic guidance information, and assist traffic engineering departments in planning and improving traffic control systems. Based on the analysis of previous studies, this paper proposes decomposing the traffic states prediction into two parts: the prediction of traffic parameters and the identification of traffic states. Based on this idea, this paper proposes a discrete traffic state prediction model based on the GFD-ARMA-FISHER analytical framework. The prediction results show that in the three states situation, the prediction accuracy for 8/10/2008 and 9/10/2008 can reach 83.33% and 84.58%, respectively. In the five states situation, the prediction accuracies for 8/10/2008 and 9/10/2008 can reach 66.25% and 70.83%, respectively, which are significantly lower than the prediction accuracies in the three states situation. We speculate that this is because having more states results in less obvious differences between these states, leading to a high misjudgment of each state. We also compare the prediction method proposed in this paper with the existing research results, and the results show that the method proposed in this paper has obvious advantages in the prediction of the final traffic state.

#### Data Availability

The data of this article can be obtained by contacting the author’s e-mail ([email protected]).

#### Conflicts of Interest

The authors declare that there are no conflicts of interest.

#### Acknowledgments

This paper is supported by the Innovation Project of University of Shanghai for Science and Technology (XJ2022151).