Multi-class Support Vector Machines Based on Arranged Decision Graphs and Particle Swarm Optimization for Model Selection

Abstract. The use of support vector machines for multi-category problems is still an open field to research. Most of the published works use the one-against-rest strategy, but with a one-against-one approach results can be improved. To avoid testing with all the binary classifiers there are some methods like the Decision Directed Acyclic Graph based on a decision tree. In this work we propose an optimization method to improve the performance of the binary classifiers using Particle Swarm Optimization and an automatic method to build the graph that improves the average number of operations needed in the test phase. Results show a good behavior when both ideas are used.

• Type: Conference
• Year: 2007
• Where: ICANNGA
• Authors: Javier Acevedo, Saturnino Maldonado-Bascón, Philip Siegmann, Sergio Lafuente-Arroyo, Pedro Gil-Jiménez
• Keywords: Algorithms, Binary Classifiers, Directed Acyclic Graph, ICANNGA 2007, Support Vector Machines