97 search results - page 9 / 20 » Polynomial to Linear: Efficient Classification with Conjunct... |
111
click to vote
JMLR
2008
14 years 11 months ago
2008
We show that the relevant information of a supervised learning problem is contained up to negligible error in a finite number of leading kernel PCA components if the kernel matche...
JMLR
2008
14 years 11 months ago
2008
Linear support vector machines (SVM) are useful for classifying large-scale sparse data. Problems with sparse features are common in applications such as document classification a...
GECCO
2003
Springer
15 years 4 months ago
2003
Springer
Abstract. Page-based Linear Genetic Programming (GP) is proposed and implemented with two-layer Subset Selection to address a two-class intrusion detection classification problem a...
CVPR
2010
IEEE
14 years 9 months ago
2010
IEEE
We address the problem of computing joint sparse representation of visual signal across multiple kernel-based representations. Such a problem arises naturally in supervised visual...
104
click to vote
ICCV
2007
IEEE
16 years 1 months ago
2007
IEEE
Boosting is a remarkably simple and flexible classification algorithm with widespread applications in computer vision. However, the application of boosting to nonEuclidean, infini...