Efficient classification for additive kernel SVMs

We show that a class of nonlinear kernel SVMs admits approximate classifiers with runtime and memory complexity that is independent of the number of support vectors. This class of kernels, which we refer to as additive kernels, includes widely used kernels for histogram-based image comparison like i...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on pattern analysis and machine intelligence. - 1979. - 35(2013), 1 vom: 07. Jan., Seite 66-77
1. Verfasser: Maji, Subhransu (VerfasserIn)
Weitere Verfasser: Berg, Alexander C, Malik, Jitendra
Format: Online-Aufsatz
Sprache:English
Veröffentlicht: 2013
Zugriff auf das übergeordnete Werk:IEEE transactions on pattern analysis and machine intelligence
Schlagworte:Journal Article Research Support, Non-U.S. Gov't Research Support, U.S. Gov't, Non-P.H.S.
LEADER 01000naa a22002652 4500
001 NLM215963946
003 DE-627
005 20231224030651.0
007 cr uuu---uuuuu
008 231224s2013 xx |||||o 00| ||eng c
028 5 2 |a pubmed24n0720.xml 
035 |a (DE-627)NLM215963946 
035 |a (NLM)22392703 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Maji, Subhransu  |e verfasserin  |4 aut 
245 1 0 |a Efficient classification for additive kernel SVMs 
264 1 |c 2013 
336 |a Text  |b txt  |2 rdacontent 
337 |a ƒaComputermedien  |b c  |2 rdamedia 
338 |a ƒa Online-Ressource  |b cr  |2 rdacarrier 
500 |a Date Completed 11.07.2013 
500 |a Date Revised 19.11.2015 
500 |a published: Print 
500 |a Citation Status MEDLINE 
520 |a We show that a class of nonlinear kernel SVMs admits approximate classifiers with runtime and memory complexity that is independent of the number of support vectors. This class of kernels, which we refer to as additive kernels, includes widely used kernels for histogram-based image comparison like intersection and chi-squared kernels. Additive kernel SVMs can offer significant improvements in accuracy over linear SVMs on a wide variety of tasks while having the same runtime, making them practical for large-scale recognition or real-time detection tasks. We present experiments on a variety of datasets, including the INRIA person, Daimler-Chrysler pedestrians, UIUC Cars, Caltech-101, MNIST, and USPS digits, to demonstrate the effectiveness of our method for efficient evaluation of SVMs with additive kernels. Since its introduction, our method has become integral to various state-of-the-art systems for PASCAL VOC object detection/image classification, ImageNet Challenge, TRECVID, etc. The techniques we propose can also be applied to settings where evaluation of weighted additive kernels is required, which include kernelized versions of PCA, LDA, regression, k-means, as well as speeding up the inner loop of SVM classifier training algorithms 
650 4 |a Journal Article 
650 4 |a Research Support, Non-U.S. Gov't 
650 4 |a Research Support, U.S. Gov't, Non-P.H.S. 
700 1 |a Berg, Alexander C  |e verfasserin  |4 aut 
700 1 |a Malik, Jitendra  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t IEEE transactions on pattern analysis and machine intelligence  |d 1979  |g 35(2013), 1 vom: 07. Jan., Seite 66-77  |w (DE-627)NLM098212257  |x 1939-3539  |7 nnns 
773 1 8 |g volume:35  |g year:2013  |g number:1  |g day:07  |g month:01  |g pages:66-77 
912 |a GBV_USEFLAG_A 
912 |a SYSFLAG_A 
912 |a GBV_NLM 
912 |a GBV_ILN_350 
951 |a AR 
952 |d 35  |j 2013  |e 1  |b 07  |c 01  |h 66-77