Using Directed Acyclic Graph Support Vector Machines with Tabu Search for Classifying Faulty Product Types

Author(s):  
Ping-Feng Pai ◽  
Yu-Ying Huang
2012 ◽  
Vol 8 (1) ◽  
pp. 18
Author(s):  
Azis Wisnu Widhi Nugraha ◽  
Widhiatmoko Hery Purnomo

<p>Feature extraction is one of the most improtant step on characters recognition system. Transition features is one from many features used on characters recognition system. This paper report a research on handwritten basic Jawanesse characters recognition system to found the proper numbers of transitions used on transition features. To recognize the characters,the Multiclass Support Vector Machines were used. The Directed Acyclic Graph (DAG) SVM were used for multiclass classification strategy and to map each input vector to a higher dimention space, the Gaussian Radial Basis Function (RBF) kernel with parameter 1were used. It can be shown, for basicJawanesse characters recognition system, the optimal numbers of transitions used for transition features is 4 (a half of maximum numbers of transition on all patterns).</p>


2012 ◽  
Vol 229-231 ◽  
pp. 2002-2006
Author(s):  
Qing Ai ◽  
Ji Zhao ◽  
Yu Ping Qin

For disadvantage of the methods that are used to evaluate inter-cluster separability measure, a novel separability measure is proposed and applied to directed acyclic graph support vector machine. The distance between cluster centers and distribution of samples in feature space are both considered by the algorithm. Firstly, use hyper-sphere support vector machine to obtain minimal bounding hyper-sphere of each cluster, according to the radius and centers of minimal bounding hyper-spheres, introduce the concept of inter-cluster separability measure in feature space, get the matrix of inter-cluster separability measure according to the concept, finally construct the directed acyclic graph according to the matrix. The experimental results show that the algorithm has higher classification precision, comparing with old directed acyclic graph support vector machine.


2008 ◽  
Vol 18 (01) ◽  
pp. 19-31 ◽  
Author(s):  
GILLES LEBRUN ◽  
CHRISTOPHE CHARRIER ◽  
OLIVIER LEZORAY ◽  
HUBERT CARDOT

A model selection method based on tabu search is proposed to build support vector machines (binary decision functions) of reduced complexity and efficient generalization. The aim is to build a fast and efficient support vector machines classifier. A criterion is defined to evaluate the decision function quality which blends recognition rate and the complexity of a binary decision functions together. The selection of the simplification level by vector quantization, of a feature subset and of support vector machines hyperparameters are performed by tabu search method to optimize the defined decision function quality criterion in order to find a good sub-optimal model on tractable times.


Sign in / Sign up

Export Citation Format

Share Document