Sciweavers

97 search results - page 5 / 20
» Polynomial to Linear: Efficient Classification with Conjunct...
Sort
View
CVPR
2008
IEEE
14 years 9 months ago
Classification using intersection kernel support vector machines is efficient
Straightforward classification using kernelized SVMs requires evaluating the kernel for a test vector and each of the support vectors. For a class of kernels we show that one can ...
Subhransu Maji, Alexander C. Berg, Jitendra Malik
KDD
2006
ACM
179views Data Mining» more  KDD 2006»
14 years 7 months ago
Extracting key-substring-group features for text classification
In many text classification applications, it is appealing to take every document as a string of characters rather than a bag of words. Previous research studies in this area mostl...
Dell Zhang, Wee Sun Lee
JMLR
2008
168views more  JMLR 2008»
13 years 7 months ago
Max-margin Classification of Data with Absent Features
We consider the problem of learning classifiers in structured domains, where some objects have a subset of features that are inherently absent due to complex relationships between...
Gal Chechik, Geremy Heitz, Gal Elidan, Pieter Abbe...
CVPR
2010
IEEE
14 years 3 months ago
Fast and Robust Object Segmentation with the Integral Linear Classifier
We propose an efficient method, built on the popular Bag of Features approach, that obtains robust multiclass pixellevel object segmentation of an image in less than 500ms, with...
David Aldavert, Arnau Ramisa, Ricardo Toledo, Ramo...
PRIS
2008
13 years 8 months ago
Comparison of Adaboost and ADTboost for Feature Subset Selection
Abstract. This paper addresses the problem of feature selection within classification processes. We present a comparison of a feature subset selection with respect to two boosting ...
Martin Drauschke, Wolfgang Förstner