Efficient FPGA Mapping of Gilbert's Algorithm for SVM Training on Large-Scale Classification Problems
- 👤 Speaker: Markos Papadonikolakis (Imperial College)
- 📅 Date & Time: Thursday 31 July 2008, 11:30 - 12:30
- 📍 Venue: Mahanakorn Laboratory, EEE
Abstract
Support Vector Machines (SVMs) are an effective, adaptable and widely used method for supervised classification. However, training an SVM classifier on large-scale problems is proven to be a very time-consuming task for software implementations. This paper presents a scalable high performance FPGA architecture of Gilbert’s Algorithm on SVM , which maximally utilizes the features of an FPGA device to accelerate the SVM training task for large-scale problems. Initial comparisons of the proposed architecture to the software approach of the algorithm show a speed-up factor range of three orders of magnitude for the SVM training time, regarding a wide range of data’s characteristics.
Series This talk is part of the CAS FPGA Talks series.
Included in Lists
Note: Ex-directory lists are not shown.
![[Talks.cam]](/static/images/talkslogosmall.gif)


Thursday 31 July 2008, 11:30-12:30