DocumentCode :
2611691
Title :
Linearly and quadratically separable classifiers using adaptive approach
Author :
Abd El Kawy, M.S. ; Abo-Bakr, R.M.
Author_Institution :
Comput. Sci. Dept., Zagazig Univ., Zagazig, Egypt
fYear :
2010
fDate :
27-28 Dec. 2010
Firstpage :
89
Lastpage :
96
Abstract :
This paper presents a fast adaptive iterative algorithm to solve linearly separable classification problems in Rn. In each iteration, a subset of the sampling data (n-points) is adaptively chosen and a hyperplane is constructed such that it separates the n-points at a margin ∈ and it best classifies the remaining points. The classification problem is formulated and three different algorithms are presented. Numerical results show that few iterations are sufficient for convergence. Further, the algorithm is extended to solve quadratically separable classification problems. The basic idea is based on mapping the physical space to another larger one where the problem becomes linearly separable.
Keywords :
iterative methods; pattern classification; sampling methods; adaptive iterative algorithm; sampling data; separable classification problems; Support vector machine classification; Training; Vectors;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Engineering Conference (ICENCO), 2010 International
Conference_Location :
Giza
Print_ISBN :
978-1-61284-184-7
Type :
conf
DOI :
10.1109/ICENCO.2010.5720433
Filename :
5720433
Link To Document :
بازگشت