Sciweavers

1728 search results - page 285 / 346
» Advanced empirical testing
Sort
View
IJAR
2010
130views more  IJAR 2010»
15 years 3 months ago
Learning locally minimax optimal Bayesian networks
We consider the problem of learning Bayesian network models in a non-informative setting, where the only available information is a set of observational data, and no background kn...
Tomi Silander, Teemu Roos, Petri Myllymäki
IR
2010
15 years 3 months ago
Adapting boosting for information retrieval measures
Abstract We present a new ranking algorithm that combines the strengths of two previous methods: boosted tree classification, and LambdaRank, which has been shown to be empiricall...
Qiang Wu, Christopher J. C. Burges, Krysta Marie S...
IVA
2010
Springer
15 years 3 months ago
Speed Dating with an Affective Virtual Agent - Developing a Testbed for Emotion Models
In earlier studies, user involvement with an embodied software agent and willingness to use that agent were partially determined by the aesthetics of the design and the moral fiber...
Matthijs Pontier, Ghazanfar F. Siddiqui, Johan F. ...
124
Voted
JAIR
2010
153views more  JAIR 2010»
15 years 3 months ago
Algorithms for Closed Under Rational Behavior (CURB) Sets
We provide a series of algorithms demonstrating that solutions according to the fundamental game-theoretic solution concept of closed under rational behavior (CURB) sets in two-pl...
Michael Benisch, George B. Davis, Tuomas Sandholm
JMLR
2010
155views more  JMLR 2010»
15 years 3 months ago
Approximate Tree Kernels
Convolution kernels for trees provide simple means for learning with tree-structured data. The computation time of tree kernels is quadratic in the size of the trees, since all pa...
Konrad Rieck, Tammo Krueger, Ulf Brefeld, Klaus-Ro...