4457 search results - page 269 / 892 » Tests of Machine Intelligence |
162
click to vote
COLT
2007
Springer
16 years 27 days ago
2007
Springer
Abstract. We establish a generic theoretical tool to construct probabilistic bounds for algorithms where the output is a subset of objects from an initial pool of candidates (or mo...
184
click to vote
ASM
2005
ASM
16 years 8 days ago
2005
ASM
Abstract. Exploration algorithms are relevant to the industrial practice of gentest cases from an abstract state machine whose runs define the predicted behavior of the software s...
147
click to vote
ECML
1993
Springer
15 years 10 months ago
1993
Springer
This paper addresses the problem of classifying observations when features are context-sensitive, specifically when the testing set involves a context that is different from the t...
186
click to vote
COLT
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We develop a new error bound for transductive learning algorithms. The slack term in the new bound is a function of a relaxed notion of transductive stability, which meas...
168
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
This paper points out that many machine learning problems in IR should be and can be formalized in a novel way, referred to as `group-based learning'. In group-based learning...