Solving the slate tile classification problem using a DAGSVM multiclassification algorithm based on SVM binary classifiers with a one-versus-all approach

被引:12
|
作者
Martinez, J. [1 ]
Iglesias, C. [2 ]
Matias, J. M. [3 ]
Taboada, J. [2 ]
Araujo, M. [2 ]
机构
[1] Acad Gen Mil, Ctr Univ Def, Zaragoza 50090, Spain
[2] Univ Vigo, Dept Nat Resources & Environm Engn, Vigo 36310, Spain
[3] Univ Vigo, Dept Stat, Vigo 36310, Spain
关键词
Support vector machines; Directed acyclic graphs; One-versus-all; UCI Machine Learning Repository; Slate tile classification; SUPPORT VECTOR MACHINES;
D O I
10.1016/j.amc.2013.12.087
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
We describe a new classification methodology based on binary classifiers constructed using support vector machines and applying a one-versus-all approach supported by the use of the directed acyclic graphs. The new methodology, which is computationally less costly because a smaller number of binary classification problems have to be resolved, was validated using UCI Machine Learning Repository data sets. Results point to the improved performance of the proposed model compared to approaches based on the one-versus-one and directed acyclic graph techniques. This new multiclassification strategy successfully applied to a slate tile classification problem produced favourable results compared to other validated techniques. (C) 2013 Elsevier Inc. All rights reserved.
引用
收藏
页码:464 / 472
页数:9
相关论文
共 4 条
  • [1] A multiclass classification using one-versus-all approach with the differential partition sampling ensemble
    Gao, Xin
    He, Yang
    Zhang, Mi
    Diao, Xinping
    Jing, Xiao
    Ren, Bing
    Ji, Weijia
    [J]. ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2021, 97 (97)
  • [2] Optimization of One versus All-SVM using AdaBoost algorithm for rainfall classification and estimation from multispectral MSG data
    Belghit, Amar
    Lazri, Mourad
    Ouallouche, Fethi
    Labadi, Karim
    Ameur, Soltane
    [J]. ADVANCES IN SPACE RESEARCH, 2023, 71 (01) : 946 - 963
  • [3] An Efficient CGM-Based Parallel Algorithm for Solving the Optimal Binary Search Tree Problem Through One-to-All Shortest Paths in a Dynamic Graph
    Tchendji, Vianney Kengne
    Zeutouo, Jerry Lacmou
    [J]. DATA SCIENCE AND ENGINEERING, 2019, 4 (02) : 141 - 156
  • [4] An Efficient CGM-Based Parallel Algorithm for Solving the Optimal Binary Search Tree Problem Through One-to-All Shortest Paths in a Dynamic Graph
    Vianney Kengne Tchendji
    Jerry Lacmou Zeutouo
    [J]. Data Science and Engineering, 2019, 4 : 141 - 156