412 search results - page 51 / 83 » Algorithmic Complexity Bounds on Future Prediction Errors |
103
click to vote
JMLR
2002
14 years 11 months ago
2002
When constructing a classifier, the probability of correct classification of future data points should be maximized. We consider a binary classification problem where the mean and...
JMLR
2002
14 years 11 months ago
2002
We extend the classical algorithms of Valiant and Haussler for learning compact conjunctions and disjunctions of Boolean attributes to allow features that are constructed from the...
FUZZIEEE
2007
IEEE
15 years 6 months ago
2007
IEEE
The algorithm of on-line predictor from input-output data pairs will be proposed. In this paper, it proposed an approach to generate fuzzy rules of predictor from real-time input-o...
FGR
2004
IEEE
15 years 3 months ago
2004
IEEE
An extension of the AdaBoost learning algorithm is proposed and brought to bear on the face detection problem. In each weak classifier selection cycle, the novel totally correctiv...
ICALP
2007
Springer
15 years 6 months ago
2007
Springer
We consider the problem of constructing efficient locally decodable codes in the presence of a computationally bounded adversary. Assuming the existence of one-way functions, we c...