A New GA-Based Decision Search for DAG-SVM
For an N-cIass problem, the decision directed acyclic support vector machines (DAG-SVM) construct N(N-1)/2 classifiers, one for each pair of classes. But the generalization performance of the original DAG-SVM depends a lot on the nodes sequence of the directed acyclic graph. To get a good generalization performance, genetic algorithm is used to permute searching nodes in a DAG. For any test sample, the decision process is intelligent based on the searching sequence obtaining from genetic algorithm. Experiments show the efficiency and feasibility of the new approach.
decision directed acyclic graph support vector machines generalization performance genetic algorithm search sequence
Shuang Liu Jian Yun Peng Chen
College of Computer Science & Engineering Dalian Nationalities University Dalian, China Department of Computer Science & Technology Neusoft Institute of Information Dalian, China
国际会议
太原
英文
650-653
2010-10-22(万方平台首次上网日期,不代表论文的发表时间)