Construct support vector machine ensemble to detect traffic incident

被引:106
作者
Chen, Shuyan [1 ,2 ]
Wang, Wei [1 ]
van Zuylen, Henk [2 ]
机构
[1] Southeast Univ, Coll Transportat, Nanjing 210096, Peoples R China
[2] Delft Univ Technol, NL-2600 GA Delft, Netherlands
关键词
Traffic incident detection; Support vector machines; Ensemble learning; Combine based on certainty; Performance index; Wilcoxon signed ranks test;
D O I
10.1016/j.eswa.2009.02.039
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This study presents the applicability of support vector machine (SVM) ensemble for traffic incident detection. The SVM has been proposed to solve the problem of traffic incident detection, because it is adapted to produce a nonlinear classifier with maximum generality, and it has exhibited good performance as neural networks. However, the classification result of the practically implemented SVM depends on the choosing of kernel function and parameters. To avoid the burden of choosing kernel functions and tuning the parameters, furthermore, to improve the limited classification performance of the real SVM, and enhance the detection performance, we propose to use the SVM ensembles to detect incident. In addition, we also propose a new aggregation method to combine SVM classifiers based on certainty. Moreover. we proposed a reasonable hybrid performance index (PI) to evaluate the performance of SVM ensemble for detecting incident by combining the common criteria, detection rate (DR), false alarm rate (FAR), mean time to detection (MTTD), and classification rate (CR). Several SVM ensembles have been developed based on bagging, boosting and cross-validation committees with different combining approaches, and the SVM ensemble has been tested on one real data collected at the 1-880 Freeway in California. The experimental results show that the SVM ensembles outperform a single SVM based AID in terms of DR, FAR, MTTD, CR and PI. We used one non-parametric test, the Wilcoxon signed ranks test, to make a comparison among six combining schemes. Our proposed combining method performs as well as majority vote and weighted vote. Finally, we also investigated the influence of the size of ensemble on detection performance. (C) 2009 Elsevier Ltd. All rights reserved.
引用
收藏
页码:10976 / 10986
页数:11
相关论文
共 29 条
  • [1] Bauer Eric., 1998, MACH LEARN, P1
  • [2] Random forests
    Breiman, L
    [J]. MACHINE LEARNING, 2001, 45 (01) : 5 - 32
  • [3] LIBSVM: A Library for Support Vector Machines
    Chang, Chih-Chung
    Lin, Chih-Jen
    [J]. ACM TRANSACTIONS ON INTELLIGENT SYSTEMS AND TECHNOLOGY, 2011, 2 (03)
  • [4] Chen CH, 2008, J FOOD DRUG ANAL, V16, P54
  • [5] Cherkassky V, 1997, IEEE Trans Neural Netw, V8, P1564, DOI 10.1109/TNN.1997.641482
  • [6] Cheu RL, 2003, 2003 IEEE INTELLIGENT TRANSPORTATION SYSTEMS PROCEEDINGS, VOLS. 1 & 2, P238
  • [7] Demsar J, 2006, J MACH LEARN RES, V7, P1
  • [8] Dietterich TG, 1997, AI MAG, V18, P97
  • [9] Ensemble methods in machine learning
    Dietterich, TG
    [J]. MULTIPLE CLASSIFIER SYSTEMS, 2000, 1857 : 1 - 15
  • [10] Aggregation algorithms for neural network ensemble construction
    Granitto, PM
    Verdes, PF
    Navone, HD
    Ceccatto, HA
    [J]. VII BRAZILIAN SYMPOSIUM ON NEURAL NETWORKS, PROCEEDINGS, 2002, : 178 - 183