7978 search results - page 686 / 1596 » Combining shared-coin algorithms |
204
Voted
ICML
2009
IEEE
16 years 8 months ago
2009
IEEE
An anytime algorithm is capable of returning a response to the given task at essentially any time; typically the quality of the response improves as the time increases. Here, we c...
187
Voted
ICML
2008
IEEE
16 years 8 months ago
2008
IEEE
We introduce confidence-weighted linear classifiers, which add parameter confidence information to linear classifiers. Online learners in this setting update both classifier param...
184
click to vote
ICML
2000
IEEE
16 years 8 months ago
2000
IEEE
This paper investigates how the splitting criteria and pruning methods of decision tree learning algorithms are influenced by misclassification costs or changes to the class distr...
232
Voted
ICML
2000
IEEE
16 years 8 months ago
2000
IEEE
As opposed to traditional supervised learning, multiple-instance learning concerns the problem of classifying a bag of instances, given bags that are labeled by a teacher as being...
194
click to vote
ICML
1995
IEEE
16 years 8 months ago
1995
IEEE
The success ofreinforcement learninginpractical problems depends on the ability to combine function approximation with temporal di erence methods such as value iteration. Experime...