3250 search results - page 215 / 650 » Parameterized Learning Complexity |
177
click to vote
ICDM
2006
IEEE
16 years 18 days ago
2006
IEEE
Kernel methods have been shown to be very effective for applications requiring the modeling of structured objects. However kernels for structures usually are too computational dem...
186
click to vote
KDD
2009
ACM
15 years 11 months ago
2009
ACM
Inductive Logic Programming (ILP) systems have been successfully applied to solve complex problems in bioinformatics by viewing them as binary classification tasks. It remains an...
171
click to vote
MICCAI
1999
Springer
15 years 10 months ago
1999
Springer
We present a new metaphor for learning anatomy - the 3d puzzle. With this metaphor students learn anatomic relations by assembling a geometric model themselves. For this purpose, a...
168
Voted
NIPS
2007
15 years 8 months ago
2007
We present a general boosting method extending functional gradient boosting to optimize complex loss functions that are encountered in many machine learning problems. Our approach...
152
click to vote
JMLR
2002
15 years 6 months ago
2002
We extend the VC theory of statistical learning to data dependent spaces of classifiers. This theory can be viewed as a decomposition of classifier design into two components; the...