3250 search results - page 323 / 650 » Parameterized Learning Complexity |
157
Voted
ML
2002
ACM
15 years 4 months ago
2002
ACM
The choice of the kernel function is crucial to most applications of support vector machines. In this paper, however, we show that in the case of text classification, term-frequenc...
191
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
Distributed representations of words are attractive since they provide a means for measuring word similarity. However, most approaches to learning distributed representations are ...
145
click to vote
CVPR
2005
IEEE
16 years 6 months ago
2005
IEEE
In this work we propose a model for video scenes that contain temporal variability in shape and appearance. We propose a conditionally linear model akin to a dynamic extension of ...
132
click to vote
ICML
2006
IEEE
16 years 5 months ago
2006
IEEE
In many applications, unlabelled examples are inexpensive and easy to obtain. Semisupervised approaches try to utilise such examples to reduce the predictive error. In this paper,...
122
click to vote
KDD
2006
ACM
16 years 5 months ago
2006
ACM
Often the best performing supervised learning models are ensembles of hundreds or thousands of base-level classifiers. Unfortunately, the space required to store this many classif...