Abstract
In city traffic management, traffic breakdown is a very important issue, which is defined as a speed drop of a certain amount within a dense traffic situation. In order to predict city traffic flow breakdown accurately, in this paper, we propose a novel city traffic flow breakdown prediction algorithm based on fuzzy rough set. Firstly, we illustrate the city traffic flow breakdown problem, in which three definitions are given, that is, 1) Pre-breakdown flow rate, 2) Rate, density, and speed of the traffic flow breakdown, and 3) Duration of the traffic flow breakdown. Moreover, we define a hazard function to represent the probability of the breakdown ending at a given time point. Secondly, as there are many redundant and irrelevant attributes in city flow breakdown prediction, we propose an attribute reduction algorithm using the fuzzy rough set. Thirdly, we discuss how to predict the city traffic flow breakdown based on attribute reduction and SVM classifier. Finally, experiments are conducted by collecting data from I-405 Freeway, which is located at Irvine, California. Experimental results demonstrate that the proposed algorithm is able to achieve lower average error rate of city traffic flow breakdown prediction.
1 Introduction
Intelligent transportation plays a key role in modern life, and it is closely linked to people’s daily life. From 1960s, with the rapid growth of the world economy, the requirements of fast, convenient and safe transportation have been proposed [1, 2]. Particularly, computer technology and electronic industry greatly promote the development of modern traffic. Furthermore, how to effectively manage city traffic flow is of great importance for city development [3].
With the development of economy, the number of vehicles is increasing rapidly. Therefore, we observe that there are many serious traffic problems in modern city traffic management, such as traffic congestion, environmental deterioration, and frequent traffic accidents. These problems should be paid more attention by all countries in the world [4]. Although some measures can made to solve traffic problem, such as building and expanding highway, city traffic efficiency is not satisfied by us. Under this background, people aim to solve the city traffic problem by fully utilizing all types of road and vehicle factors and computer and network technique. Then, the concept of intelligent transportation system is proposed. Currently, intelligent transportation does not have a standard definition, which contains many aspects, such as traffic specifications, traffic design, traffic management, traffic operation, and so on [5]. Generally speaking, intelligent transportation is a kind of effective operation management for city traffic.
In order to identify the current and future state of traffic flow in time and accurately and analyze the state of the road traffic flow, it is very crucial to establish the correct guidance and control measures in advance. Traffic flow breakdown refers to the case that several parameters in the model of traffic flow suddenly change. Such changes are often associated with traffic events, and reflect the features of traffic accidents. When traffic accidents or traffic jams occur, anomalous traffic flow will appear at the downstream or upstream of accident site. That is, vehicle speed in the upstream decreases due to traffic congestion, on the other hand, vehicle speed in the downstream increases due to traffic sparsity. Furthermore, we also can observe that the number of vehicles reduce in the lane where accident occurs, on the contrary, vehicles in its adjacent lanes may increase. The above qualitative analysis shows that when the traffic flow state occurs, the location of a certain time (or space) can be regarded as an interface. The traffic flow parameters are different at various sides of the interface. Utilizing this idea and analysis, many researchers have presented many traffic flow identification algorithms.
Main innovations of this paper lie in the following aspects:
We introduce three definitions to describe city traffic flow more accurately.
We propose an attribute reduction algorithm based on a fuzzy rough set, and then delete redundant and irrelevant attributes to construct the feature vector.
The rest of the paper is organized as follows. We explain the related works about traffic flow breakdown in section 2. In Section 3, we explain the city traffic flow breakdown problem. Section 4 illustrates the attribute reduction method based on a fuzzy rough set. In section 5, we present a novel city traffic flow breakdown prediction algorithm based on SVM. To testify the effectiveness of the proposed method, experiments are conducted to prove the effectiveness of our method in section 6. Finally, section 7 concludes the whole paper.
2 Related works
Traffic breakdown prediction is very crucial issue in city traffic systems, and traffic flow breakdown is usually defined as an amount of sudden drop in traffic flow speed if traffic requirements exceed capacity. In the following, we will discuss related works about traffic flow breakdown and its prediction.
Boris et al. analyzed the real field traffic data measured in 1996-2014 through road detectors installed on German freeways, and then reveal that physical features of empirical nuclei for spontaneous traffic breakdown in free flow at highway bottlenecks. Particularly, the authors proposed a microscopic stochastic three steps traffic model of the nucleation of spontaneous traffic breakdown. Experimental results of this paper demonstrated that in the most cases a nucleus for the breakdown happens through an interaction in free flow with an empirical permanent speed disturbance which occurred at a highway bottleneck [6].
Boris et al. found that a growing local speed wave of increase in speed that is able to randomly happen in synchronized flow (denoted as S) at a highway bottleneck. On the other hand, the development of such traffic flow instability leads to free flow (denoted as F) at the bottleneck. Finally, this paper concluded that the SF instability is able to happen when there is a finite time delay in driver over-acceleration [7].
Xu et al. presented a new evolution model of speed perturbations for quantifying the probability of the traffic flow breakdown on congested freeway flow. The proposed method can effectively control city traffic flow under different time headways, driver behaviors, and state transitions. Particularly, in this paper, two types of drivers, (including 1) adventurers and 2) conservatives), and two kinds of reacting behavior, that is copy and shift are used to describe driving behavior in this model [8].
Sun et al. analyzed that the main reasons about urban expressway congestion are the traffic flow breakdowns at bottlenecks. To obtain the probabilistic characteristics of breakdown at urban expressway, a novel city traffic breakdown analysis model is presented proposed based on a large scale of detector data. The main innovation of this paper lies in that breakdowns are identified in terms of speed and density thresholds [9].
Boris et al. proposed a generic physical feature of the three-phase models based on simulations with cellular automaton (denoted as CA) traffic flow models. In this work, the generic feature refers to a discontinuous character of driver over-acceleration which is inferred by an integration of two qualitatively different mechanisms of over-acceleration [10].
Dong et al. proposed a new model to produce random flow breakdowns on congested freeways and then obtain subsequent wave propagation among heterogeneous drivers. This research aimed to forecast travel time variability. Particularly, this work supposed that breakdown may possibly occur at various traffic flow levels with some probability and may sustain for a specific time duration [11].
Shiomi et al. analyzed the mechanism of city traffic breakdown and then constructed a traffic flow model to simulate the stochastic and dynamic processes of traffic flow at a bottleneck. In this work, the authors proposed two models of stochastic processes according to traffic flow dynamics [12].
Afonso et al. aimed to forecast the traffic behavior and then obtain effectiveness and productivity on the physical distribution. Particularly, this work proposed a novel algorithm to forecast the traffic behavior in a metropolitan area based on Artificial Neural Network. In particular, the proposed method utilizes Rough-Fuzzy Sets to define inference morphology for insertion of the behavior of Dynamic Routing in a structured rule basis. In this work, rough sets theory can distinguish the weight of attribute, and then choose which fuzzy relation to be added to the Rough Neuro Fuzzy Network type Multilayer Perceptron and type Radial Basis Function [13].
Wang et al. regarded the city traffic breakdown as a random event, and utilized discrete time Markov chain to describe traffic state transition path. Furthermore, the transition probability matrix is gained from empirical observations. In this work, the traffic flow breakdown probability is represented as the number of vehicles which are existed in a given freeway segment [14].
Inspired by the above works, in this paper, we introduce the fuzzy rough set theory to solve the task of attribute reduction, and then utilize SVM classifier to forecast city traffic flow breakdown.
3 Description of the city traffic flow breakdown problem
In the area of intelligent transportation, traffic flow breakdown is defined as the speed decrease over a period of time. In particular, the definition of the traffic flow breakdown refers to the absolute amount of vehicle speed decrease. Afterwards, three definitions are given as follows.
Definition 1
(Pre-breakdown flow rate): The traffic flow rate which is tested before traffic breakdown occurring.
Definition 2
(Rate, density, and speed of the traffic flow breakdown): The average flow rate, density, and speed which are measured after breakdown occurring and before traffic recovering to the normal state.
Definition 3
(Duration of the traffic flow breakdown): The time range from breakdown beginning to traffic flow becoming to normal state.
Then, the pre-breakdown traffic flow rate is defined as follows.
where the function f () refers to the probability of distribution function, pfr means the traffic flow rate of pre-breakdown, and σs, represent the scale parameter and shape parameter respectively.
Suppose that t represents a time interval, and in the traffic flow breakdown prediction problem a hazard function is defined to represent the probability of the breakdown ending in t. The hazard function is defined as follows.
where h () refers to the hazard function at t, h* () means a standard hazard function which is regarded as a baseline, parameter as and γ represent the average speed when traffic flow breakdown occurs and a coefficient respectively.
4 Attribute reduction based on fuzzy rough set
Rough set theory (denoted RST) was firstly proposed by Pawlak in 1982 as a powerful tool for data analysis through concept approximation. In the rough set theory, lower and upper approximations of concepts are established based on an indiscernibility relation. Particularly, objects which are contained in the lower approximation can be classified with a given degree. In the last three decades, RST has been attracted many researchers in many various fields. Such as Multi-source alert data understanding [15], vertex cover problem [16], Self-adaptive Extreme Learning Machine [17], Group multi-criteria design concept evaluation [18], Thyroid disease diagnosis [19], Road Safety Indicator Analysis [20], Low carbon technology integration innovation assessment [21], Outlier detection [22], Integrating agricultural sustainability into policy planning [23].
However, numerical attributes and hybrid attributes may both be used in practice. In order to tackle this issue, two feasible solutions are used. The first method is to transform numerical and hybrid attributes to categorical attributes by discretization, however, this approach can result in the information loss of original data. The second method is to process numerical or hybrid data by the fuzzy rough set [24, 25]. As is well known that fuzzy rough sets encapsulate the related but distinct concepts of vagueness and indiscernibility [26-28].
In the rough set theory, an information system is defined as (X,A), where X = {x1,x2,···,xn} and A = {a1, a2,··· , am} are two sets of objects and attributes respectively. For the set A, each element in it is corresponding to a mapping function ã: X → Va, where Va refers to the value set of element a on X. For each subset B (B∈A), the following equivalence relation is defined as follows.
Suppose that A ⊆ X, and the lower and upper approximations are obtained as follows.
In the fuzzy rough set model, a universe of objects U⊆ {x1, x2,…, xn} is represented as a fuzzy binary relation (denoted as R̃), and the membership of x i in a fuzzy rough set (denoted as
where X ∈ 𝕽(U) is satisfied, where 𝕽(U) denotes the class of all fuzzy sets in U, and U refers to the discoursed universe.
In the city flow breakdown prediction problem, there are many redundant and irrelevant attributes, and these attributes may bring adverse effects to breakdown prediction. As attribute reduction process based on fuzzy rough sets is able to prune the irrelevant attributes, in this section, we propose an attribute reduction method based on a fuzzy rough set.
For a fuzzy decision table
Based the above analysis, attribute reduction based on fuzzy rough set is defined as follows.
Definition 4
Suppose that
Condition 1
Condition 2
For ∀a ∈P, ∃y ∈ U satisfy the following equation:
Suppose that U = {x1, x2,…, xn} is satisfied, and we define a discernibility matrix M of
where π (xi) denotes the membership degree of xi belonged to the lower approximation of the corresponding decision category.
5 The proposed city traffic flow breakdown prediction algorithm
In this section, we will illustrate the city traffic flow breakdown prediction algorithm based on the above attribute reduction process. After attribute reduction, more irrelevant features are preserved to construct feature vectors. Then, the flow chart of city traffic flow breakdown prediction based on SVM classifier is given in Figure 1.
Flow chart of city traffic flow breakdown prediction based on SVM classifier
As is shown in Figure 1, the key module of the proposed city traffic flow breakdown prediction is the classification process. We regard the city traffic flow breakdown prediction problem as a classification problem.
Suppose that the training samples are defined as (xi,yi), and i ∈ {1, 2,…, l},i ∈ {1, 2, · · · , l}, xi ∈ Rn, yi ∈ {1-1} are satisfied. Then, SVM classifier solves the breakdown prediction problem by optimizing the following equation [29,30].
where xi is mapped to a high dimensional space, and β refers to a penalty parameter.
Afterwards, the classification problem is solved using the following equation [31-33].
In Figure 1, we know that performance of SVM classifier greatly relies on the kernel function selection process.
In this work, we exploit the Gaussian kernel, which is described as follows.
6 Experiment
To testify the effectiveness of the proposed algorithm, in this section, we design a series of experiments and analyze the experimental results.
6.1 Experiment settings
In this experiment, a dataset is collected from the Caltrans Performance Measurement System (http://pems.dot. ca.gov), and five-minute averages of flow, speed, and density data measured by the detector upstream from the I-405 Freeway, which is located at Irvine, California. I-405 Freeway refers to a major north–south Interstate Highway in Southern California. This freeway is a bypass of Interstate 5, running along the western and southern parts of the Greater Los Angeles Area from Irvine to San Fernando. Furthermore, this freeway is regarded as the northern segment of the San Diego Freeway.
City traffic flow breakdown is detected if a substantial speed decrease from the free mean speed happens between two consecutive time intervals. The speed decreases between two consecutive time intervals and the time duration in which the low speed remain unchanged, For example: the speed limit of I-405 is set to 65 mi/h. If the speed decreases below 55 mi/h and holds for more than fifty minutes, we can say that a city traffic breakdown occurs. Setting the minimum time interval can effectively eliminate the negative influence of traffic flow abnormal fluctuation. Particularly, 16 types of occurrences occurred in the freeway are utilized in this experiment (shown in Table 1).
All types of occurrences used in this experiment.
ID | No. 1 | No. 2 | No. 3 | No. 4 | No. 5 | No. 6 | No. 7 | No. 8 |
---|---|---|---|---|---|---|---|---|
Occurrence name | Accident victim | Foggy weather | Flooding | Loaded truck | Running over | dangerous goods | Truck broken | Icy Road |
ID | No. 9 | No. 10 | No. 11 | No. 12 | No. 13 | No.14 | No. 15 | No. 16 |
Occurrence name | Road maintenance | Falling Tree | Lack of electricity | Light off | Storm | Light flagged | Fire Vehicle | Vehicle excess |
6.2 Experimental results and analysis
The above 16 types of occurrences occurred in the freeway are utilized to test the performance of our proposed algorithm. Figure 2 shows the relationship between traffic flow rate and density observed before and after city traffic breakdown occurring. Particularly, triangle and star denote the traffic conditions before and after breakdown respectively.
Traffic flow and density scatter plots
From Figure 2, we can see that the scattering of observations demonstrates that traffic flow breakdown happens at different flow rates. When traffic breakdown occurs, congested traffic states are affected by various traffic speeds, flows, and densities.
Considering the traffic breakdown speed and duration may significantly influence a specific breakdown event, we illustrate distribution of traffic flow breakdown speed and duration in Figure 3 and Figure 4, respectively.
Distribution of traffic flow breakdown speed
Distribution of traffic flow breakdown duration
The traffic flow breakdown speed can be utilized to normalize a left truncated normal distribution function. The distribution of traffic flow breakdown speed can be extracted from travel time reliability mining.
Just like the breakdown speed, the breakdown duration data can be exploited to normalize the hazard function to represent the probability of a specific breakdown occurs at a particular time.
Next, we show the city traffic flow breakdown prediction results in four days (denoted as {Day1, Day2, Day3, Day4}), and traffic breakdown rate is sampled for each 30 minutes for 6 h to 22 h. The related experimental results are shown in Figure 5 to Figure 8.
City traffic flow breakdown prediction result for Day 1
City traffic flow breakdown prediction result for Day 2
City traffic flow breakdown prediction result for Day 3
City traffic flow breakdown prediction result for Day 4
Integrating experimental data from Figure 5 to Figure 8, it can be observed that most occurrences of traffic flow breakdown occur in the evening rush hours. On the other hand, we also find that compared with the actual observed value (ground truth), our proposed algorithm predicts city traffic flow more accurately than the method without attribute reduction. Afterwards, average error rates of city traffic flow breakdown prediction for different methods are given in Table 2.
Average error rate of city traffic flow breakdown prediction (%)
Method | Day 1 | Day 2 | Day 3 | Day 4 |
---|---|---|---|---|
Without attribute reduction | 10.57 | 11.1 | 9.49 | 9.03 |
The proposed algorithm | 2.86 | 2.48 | 3.49 | 2.99 |
Table 2 shows average error rates of city traffic flow breakdown prediction for out algorithm and the policy without attribute reduction are 2.96% and 10.05% respectively. We can see that our proposed algorithm can effectively promote the average error rate of city traffic flow breakdown prediction. The reasons lie in that 1) the proposed method converts the traffic flow breakdown prediction problem to a classification, 2) we utilize the attribute reduction to delete irrelevant or unimportant knowledge, and then classification accuracy can be promote significantly.
7 Conclusion
This paper proposes an effective city traffic flow breakdown prediction based on a fuzzy rough set. To promote the accuracy of city traffic flow breakdown prediction, we propose an attribute reduction algorithm utilizing the fuzzy rough set theory. Afterwards, we predict the city traffic flow breakdown by integrating the attribute reduction process and SVM classifier together. In the experiment, we set the minimum time interval to eliminate the negative influence of traffic flow abnormal fluctuation. Experimental results show that our proposed algorithm performs better than the method without attribute reduction.
In the future, we will try to test the performance of our proposed methods in various traffic scenes, such as pedestrian, bicycle, motor vehicle, and we will also try to optimize parameters of SVM classifier to enhance the accuracy of classification.
References
[1] Xu T.D., Hao Y., Peng Z.R., Sun L.J., Erratum to Modeling probabilistic traffic breakdown on congested freeway flow (Can. J. Civ. Eng., (2013), 40, 10(999-1008)), Can J Civil Eng., 2014, 41, 181-185.10.1139/cjce-2014-0009Search in Google Scholar
[2] Wang X., Wang W., Li W.Q., Cheng L., Interpretation of traffic flow breakdown with density-flow model, J Southwest Jiaotong Univ., 2009, 44, 141-146.Search in Google Scholar
[3] Bassan S., Ceder A., Analysis of maximum traffic flow and its breakdown on congested freeways, Physica A., 2008, 387, 4349-4366.10.1016/j.physa.2008.02.058Search in Google Scholar
[4] Wang X.Y., Jun Z.C., Piao J.N., Jia H.F., Statistical theory of change-point with local comparison and its application in studying traffic flow breakdown, J Highw Transp Res and Dev, 2002, 19, 112-112.Search in Google Scholar
[5] Liebe C., Mahnke R., Kuhne R., From traffic breakdown to energy flow analysis, Transport Res C-Emer, 2011, 19, 172-181.10.1016/j.trc.2010.05.005Search in Google Scholar
[6] Kerner B.S., Koller M., Klenov S.L., Hubert R., Michael L., The physics of empirical nuclei for spontaneous traffic breakdown in free flow at highway bottlenecks., Physica A, 2015, 438, 365-397.10.1016/j.physa.2015.05.102Search in Google Scholar
[7] Boris S.K., Microscopic etheory of traffic-flow instability governing traffic breakdown at highway bottlenecks: Growing wave of increase in speed in synchronized flow, Phys Rev E, 2015, 92, 45-53.10.1103/PhysRevE.92.062827Search in Google Scholar PubMed
[8] Xu T., Yuan H., Peng Z.R., Sun L.J., Modeling probabilistic traffic breakdown on congested freeway flow, Can J Civil Eng, 2013, 40, 999-1008e.10.1139/cjce-2012-0067Search in Google Scholar
[9] Sun J., Zhang J., Survival analyses of traffic flow breakdown at urban expressway bottlenecks, J Tongji Univ, 2013, 41, 530-535.Search in Google Scholar
[10] Kerner B.S., Klenov S.L., Hermanns G., Michael S., Effect of driver over-acceleration on traffic breakdown in three-phase cellular automaton traffic flow models, Physica A, 2013, 392, 4083-4105.10.1016/j.physa.2013.04.035Search in Google Scholar
[11] Dong J., Mahmassani H.S., Stochastic modeling of traffic flow breakdown phenomenon: Application to predicting travel time reliability, IEEE T Intell Transp, 2012, 13, 1803-1809.10.1109/ITSC.2011.6083028Search in Google Scholar
[12] Shiomi Y., Yoshii T., Kitamura R., Platoon-based traffic flow model for estimating breakdown probability at single-lane expressway bottlenecks, Transport Res B-Meth, 2011, 45, 1314-1330.10.1016/j.trb.2011.05.008Search in Google Scholar
[13] Affonso C., Sassi R.J., Ferreira R.P., Traffic flow breakdown prediction using feature reduction through Rough-Neuro fuzzy Networks, 2011 International Joint Conference on Neural Network, 2011, 1943-1947.10.1109/IJCNN.2011.6033462Search in Google Scholar
[14] Wang H.Z., Rudy K., Li J., Ni D.H., Calculation of traffic flow breakdown probability to optimize link throughput, Appl Math Model, 2010, 34, 3376-3389.10.1016/j.apm.2010.02.027Search in Google Scholar
[15] Yao Y.Y., Wang Z.Q., Gan C., Kang Q., Liu X.J., Xia Y.J., Zhang L.M., Multi-source alert data understanding for security semantic discovery based on rough set theory, Neurocomputing, 2016, 208, 39-45.10.1016/j.neucom.2015.12.127Search in Google Scholar
[16] Xu Q.Y., Tan A.H., Li J.J., A rough set method for the vertex cover problem in graph theory, J Intell Fuzzy Syst, 2016, 30, 2003-2013.10.3233/IFS-151914Search in Google Scholar
[17] Xu L., Ding S.F., Xu X.Z., Zhang N., Self-adaptive Extreme Learning Machine Optimized by Rough Set Theory and Affinity Propagation Clustering, Cogn Comp, 2016, 8, 720-728.10.1007/s12559-016-9409-5Search in Google Scholar
[18] Shidpour H., Cunha C.D., Bernard A., Group multi-criteria design concept evaluation using combined rough set theory and fuzzy set theory, Expert Syst Appl, 2016, 64, 633-644.10.1016/j.eswa.2016.08.022Search in Google Scholar
[19] Prasad V., Rao T.S., Babu M.S.P., Thyroid disease diagnosis via hybrid architecture composing rough data sets theory and machine learning algorithms, Soft Comput, 2016, 20, 1179-1189.10.1007/s00500-014-1581-5Search in Google Scholar
[20] Li T.R., Ruan D., Shen Y.J., Hermans E., Wets G., A New Weighting Approach Based on Rough Set Theory and Granular Computing for Road Safety Indicator Analysis, Comput Intell, 2016, 32, 517-534.10.1111/coin.12061Search in Google Scholar
[21] Lai X.D., Liu J.X., Georgiev G., Low carbon technology integration innovation assessment index review based on rough set theory - an evidence from construction industry in China, J Clean Prod, 2016, 126, 88-96.10.1016/j.jclepro.2016.03.035Search in Google Scholar
[22] Jiang F., Chen Y.M., Outlier detection based on granular computing and rough set theory, Appl Intell, 2015, 42, 303-322.10.1007/s10489-014-0591-4Search in Google Scholar
[23] Demartini E., Gaviglio A., Bertoni D., Integrating agricultural sustainability into policy planning: A geo-referenced framework based on Rough Set theory, Environ Sci Policy, 2015, 54, 226-239.10.1016/j.envsci.2015.07.006Search in Google Scholar
[24] Zhang Z.M., Attributes reduction based on intuitionistic fuzzy rough sets, J Intell Fuzzy Syst, 2016, 30, 1127-1137.10.3233/IFS-151835Search in Google Scholar
[25] Zhang X., Mei C.L., Chen D.G., Li J.H., Feature selection in mixed data: A method using a novel fuzzy rough set-based information entropy, Pattern Recogn, 2016, 56, 1-15.10.1016/j.patcog.2016.02.013Search in Google Scholar
[26] Zhang H.Y., Yang S.Y., Representations of typical hesitant fuzzy rough sets, J Intell Fuzzy Syst, 2016, 31, 457-468.10.3233/IFS-162159Search in Google Scholar
[27] Zhang H.D., Shu L., Liao S.L., Topological structures of interval-valued hesitant fuzzy rough set and its application, J Intell Fuzzy Syst, 2016, 30, 1029-1043.10.3233/IFS-151826Search in Google Scholar
[28] Zhang H.D., He Y.P., Xiong L.L., Multi-granulation dual hesitant fuzzy rough sets, J Intell Fuzzy Syst, 2016, 30, 623-637.10.3233/IFS-151851Search in Google Scholar
[29] Ji Y.S., Chen Y.S., Fu H.H., Yang G.W., An EnKF-based scheme to optimize hyper-parameters and features for SVM classifier, Pattern Recogn, 2017, 62, 202-213.10.1016/j.patcog.2016.08.014Search in Google Scholar
[30] Huang Y.M., Wu D., Zhang Z.F., Chen H.B., Chen S.B., EMD-based pulsed TIG welding process porosity defect detection and defect diagnosis using GA-SVM, J Mater Process Tech, 2017, 239, 92-102.10.1016/j.jmatprotec.2016.07.015Search in Google Scholar
[31] Paul S., Magdon-Ismail M., Drineas P., Feature selection for linear SVM with provable guarantees, Pattern Recogn, 2016, 60, 205-214.10.1016/j.patcog.2016.05.018Search in Google Scholar
[32] Nourisola H., Ahmadi B., Robust adaptive H controller based on GA-Wavelet-SVM for nonlinear vehicle suspension with time delay actuator, J Vib Control, 2016, 22, 4111-4120.10.1177/1077546315571445Search in Google Scholar
[33] Haddoud M., Mokhtari A., Lecroq T., Abdeddaim S., Combining supervised term-weighting metrics for SVM text classification with extended term representation, Knowl Inf Syst, 2016, 49, 909-931.10.1007/s10115-016-0924-1Search in Google Scholar
[34] Caraballo T., Diop M.A., Mane A., Controllability for neutral stochastic functional integro differential equations with infinite delay, Appl Math Nonl Sci, 2016, 1, 493-506.10.21042/AMNS.2016.2.00039Search in Google Scholar
[35] Awati V., Jyoti M., Homotopy analysis method for the solution of lubrication of a long porous slider, Appl Math Nonl Sci, 2016, 1, 507-516.10.21042/AMNS.2016.2.00040Search in Google Scholar
© 2017 X. Yang et al.
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.