3050 search results - page 455 / 610 » On-line Algorithms in Machine Learning |
150
click to vote
COLT
2005
Springer
15 years 6 months ago
2005
Springer
External regret compares the performance of an online algorithm, selecting among N actions, to the performance of the best of those actions in hindsight. Internal regret compares ...
159
click to vote
MLDM
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. In supervised learning, discretization of the continuous explanatory attributes enhances the accuracy of decision tree induction algorithms and naive Bayes classifier. M...
142
click to vote
COLT
1999
Springer
15 years 9 months ago
1999
Springer
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
158
click to vote
ML
2000
ACM
15 years 4 months ago
2000
ACM
This paper shows that the accuracy of learned text classifiers can be improved by augmenting a small number of labeled training documents with a large pool of unlabeled documents. ...
151
Voted
IJON
1998
15 years 4 months ago
1998
Bayesian Kullback Ying—Yang dependence reduction system and theory is presented. Via stochastic approximation, implementable algorithms and criteria are given for parameter lear...