Feature subspace SVMs (FS-SVMs) for high dimensional handwritten digit recognition

Vikas K. Garg and M.N. Murty

International Journal of Data Mining, Modelling and Management, 2009, vol. 1, issue 4, 411-436

Abstract: Training SVMs on high dimensional feature vectors in one shot incurs high computational cost. A low dimensional representation reduces computational overhead and improves the classification speed. Low dimensionality also reduces the risk of over-fitting and tends to improve the generalisation ability of classification algorithms. For many important applications, the dimensionality may remain prohibitively high despite feature selection. In this paper, we address these issues primarily in the context of handwritten digit data. In particular, we make the following contributions: 1) we introduce the α-minimum feature over (α-MFC) problem and prove it to be NP-hard; 2) investigate the efficacy of a divide-and-conquer ensemble method for SVMs based on segmentation of the feature space (FS-SVMs); 3) propose a greedy algorithm for finding an approximate α-MFC using FS-SVMs.

Keywords: dimensionality reduction; classification; greedy algorithms; support vector machines; SVMs; approximation algorithms; feature selection; feature subspace; handwritten digits; digit recognition; handwriting. (search for similar items in EconPapers)
Date: 2009
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=29034 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijdmmm:v:1:y:2009:i:4:p:411-436

Access Statistics for this article

More articles in International Journal of Data Mining, Modelling and Management from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().