Please use this identifier to cite or link to this item:
Title: A fast coreset minimum enclosing ball kernel machines
Authors: Wei, X
Law, R 
Zhang, L
Feng, Y
Dong, Y
Li, Y
Keywords: Support vector machines
Issue Date: 2008
Publisher: IEEE
Source: IEEE International Joint Conference on Neural Networks, 2008 : IJCNN 2008 : (IEEE World Congress on Computational Intelligence), 1-8 June 2008, Hong Kong, p. 3366-3373 How to cite?
Abstract: A fast coreset minimum enclosing ball kernel algorithm was proposed. First, it transfers the kernel methods to a center-constrained minimum enclosing ball problem, and subsequently it trains the kernel methods using the proposed MEB algorithm, and the primal variables of the kernel methods are recovered via KKT conditions. Then, detailed theoretical analysis and rigid proofs of our new algorithm are given. After that, experiments are investigated via using several typical classification datasets from UCI machine learning benchmark datasets. Moreover, performances compared with standard support vector machines are seriously considered. It is concluded that our proposed algorithm owns comparable even superior performances yet with rather fast converging speed in the experiments studied in this paper. Finally, comments about the existing problems and future development directions are discussed.
ISBN: 978-1-4244-1820-6
978-1-4244-1821-3 (E-ISBN)
ISSN: 1098-7576
DOI: 10.1109/IJCNN.2008.4634276
Appears in Collections:Conference Paper

View full-text via PolyU eLinks SFX Query
Show full item record


Last Week
Last month
Citations as of Jul 29, 2018

Page view(s)

Last Week
Last month
Citations as of Aug 14, 2018

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.