590 search results - page 80 / 118 » Can We Learn to Beat the Best Stock |
JMLR
2002
14 years 9 months ago
2002
Shallow parsers are usually assumed to be trained on noise-free material, drawn from the same distribution as the testing material. However, when either the training set is noisy ...
AAAI
2012
13 years 4 days ago
2012
Hashing, which tries to learn similarity-preserving binary codes for data representation, has been widely used for efficient nearest neighbor search in massive databases due to i...
ICML
2008
IEEE
15 years 10 months ago
2008
IEEE
We propose a new stopping condition for a Support Vector Machine (SVM) solver which precisely reflects the objective of the Leave-OneOut error computation. The stopping condition ...
EVOW
2010
Springer
15 years 4 months ago
2010
Springer
We propose a novel distance based method for phylogenetic tree reconstruction. Our method is based on a conceptual clustering method that extends the well-known decision tree learn...
AAAI
2004
14 years 11 months ago
2004
This paper deals with automatically learning the spatial distribution of a set of images. That is, given a sequence of images acquired from well-separated locations, how can they ...