3250 search results - page 168 / 650 » Parameterized Learning Complexity |
170
click to vote
ICCV
2009
IEEE
15 years 4 months ago
2009
IEEE
The use of Mercer kernel methods in statistical learning theory provides for strong learning capabilities, as seen in kernel principal component analysis and support vector machin...
172
click to vote
AAAI
2000
15 years 7 months ago
2000
As applications for artificially intelligent agents increase in complexity we can no longer rely on clever heuristics and hand-tuned behaviors to develop their programming. Even t...
191
click to vote
ICML
2008
IEEE
16 years 7 months ago
2008
IEEE
In this paper we show how common speech recognition training criteria such as the Minimum Phone Error criterion or the Maximum Mutual Information criterion can be extended to inco...
167
click to vote
AAAI
2010
15 years 8 months ago
2010
In many real world applications, labeled data are usually expensive to get, while there may be a large amount of unlabeled data. To reduce the labeling cost, active learning attem...
187
click to vote
NIPS
2001
15 years 7 months ago
2001
High dimensional data that lies on or near a low dimensional manifold can be described by a collection of local linear models. Such a description, however, does not provide a glob...