Anda belum login :: 07 Jun 2023 00:12 WIB
A Fast Iterative Nearest Point Algorithm for Support Vector Machine Classifier Design
Keerthi, S. S.
Shevade, S. K.
Murthy, K. R. K.
Article from Journal - ilmiah internasional
IEEE Transactions on Neural Networks vol. 11 no. 1 (2000)
Perpustakaan Pusat (Semanggi)
1 (dapat dipinjam: 0)
Lihat Detail Induk
In this paper we give a new fast iterative algorithm for support vector machine (SVM) classifier design. The basic problem treated is one that does not allow classification violations. The problem is converted to a problem of computing the nearest point between two convex polytopes. The suitability of two classical nearest point algorithms, due to Gilbert, and Mitchell et al., is studied. Ideas from both these algorithms are combined and modified to derive our fast algorithm. For problems which require classification violations to be allowed, the violations are quadratically penalized and an idea due to Cortes and Vapnik and Friess is used to convert it to a problem in which there are no classification violations. Comparative computational evaluation of our algorithm against powerful SVM methods such as Platt's sequential minimal optimization shows that our algorithm is very competitive.
Klik untuk menuliskan opini Anda tentang koleksi ini!
Copyright © 2006, 2007
Unika Atma Jaya
, all rights reserved
Process time: 0.03125 second(s)