Sciweavers

16093 search results - page 3058 / 3219
» On the optimality of the neighbor-joining algorithm
Sort
View
PKDD
2010
Springer
169views Data Mining» more  PKDD 2010»
15 years 4 months ago
Efficient and Numerically Stable Sparse Learning
We consider the problem of numerical stability and model density growth when training a sparse linear model from massive data. We focus on scalable algorithms that optimize certain...
Sihong Xie, Wei Fan, Olivier Verscheure, Jiangtao ...
PKDD
2010
Springer
164views Data Mining» more  PKDD 2010»
15 years 4 months ago
Efficient Planning in Large POMDPs through Policy Graph Based Factorized Approximations
Partially observable Markov decision processes (POMDPs) are widely used for planning under uncertainty. In many applications, the huge size of the POMDP state space makes straightf...
Joni Pajarinen, Jaakko Peltonen, Ari Hottinen, Mik...
PKDD
2010
Springer
179views Data Mining» more  PKDD 2010»
15 years 4 months ago
Gaussian Processes for Sample Efficient Reinforcement Learning with RMAX-Like Exploration
Abstract. We present an implementation of model-based online reinforcement learning (RL) for continuous domains with deterministic transitions that is specifically designed to achi...
Tobias Jung, Peter Stone
PPSN
2010
Springer
15 years 4 months ago
Feature Selection for Multi-purpose Predictive Models: A Many-Objective Task
The target of machine learning is a predictive model that performs well on unseen data. Often, such a model has multiple intended uses, related to different points in the tradeoff ...
Alan P. Reynolds, David W. Corne, Michael J. Chant...
QEST
2010
IEEE
15 years 4 months ago
Fortuna: Model Checking Priced Probabilistic Timed Automata
We introduce Fortuna, the first tool for model checking priced probabilistic timed automata (PPTAs). Fortuna can handle the combination of real-time, probabilistic and cost feature...
Jasper Berendsen, David N. Jansen, Frits W. Vaandr...
« Prev « First page 3058 / 3219 Last » Next »