686 search results - page 15 / 138 » Minimax Probability Machine |
94
Voted
ICML
2002
IEEE
16 years 1 months ago
2002
IEEE
In many reinforcement learning applications, the set of possible actions can be partitioned by the programmer into subsets of similar actions. This paper presents a technique for ...
88
Voted
ECML
2007
Springer
15 years 6 months ago
2007
Springer
Given a binary classification task, a ranker sorts a set of instances from highest to lowest expectation that the instance is positive. We propose a lexicographic ranker, LexRank,...
106
click to vote
ICML
1999
IEEE
16 years 1 months ago
1999
IEEE
E cient learning of DFA is a challenging research problem in grammatical inference. Both exact and approximate (in the PAC sense) identi ability of DFA from examples is known to b...
85
Voted
COR
2006
15 years 21 days ago
2006
-- The purpose of this paper is to describe the implementation and testing of the tabu cycle method and two variants of the conditional probability method. These methods were origi...
122
Voted
ACML
2009
Springer
15 years 7 months ago
2009
Springer
Many regression schemes deliver a point estimate only, but often it is useful or even essential to quantify the uncertainty inherent in a prediction. If a conditional density estim...