By Topic

Improving Training Speed of Support Vector Machines by Creating Exploitable Trends of Lagrangian Variables: An Application to DNA Splice Site Detection

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Li, J. ; DMME, Melbourne Univ., Melbourne, VIC ; Halgamuge, S.

Support vector machines are state-of-the-art machine learning algorithms that can be used for classification problems such as DNA splice site identification. However, the large number of samples in biological data sets can often lead to slow training speed. The training speed can be improved by removing non-support vectors prior to training. This paper proposes a method to predict non-support vectors with high accuracy by the use of strict- constrained gradient ascent optimisation. Unlike other data preselection methods, the proposed gradient based method is itself a training algorithm for SVM, and is also very simple to implement. Experiments with comparable results are conducted on a DNA splice-site detection problem. Results show significant speed improvements over other algorithms. The relationship between speed improvement and cache memory size is also exploited. Generalisation capability of the proposed algorithm is also shown to be better than some other reformulated SVMs.

Published in:

Frontiers in the Convergence of Bioscience and Information Technologies, 2007. FBIT 2007

Date of Conference:

11-13 Oct. 2007