Sciweavers

481 search results - page 31 / 97
» Sequential Instance-Based Learning
Sort
View
ECAI
2006
Springer
13 years 11 months ago
Least Squares SVM for Least Squares TD Learning
Abstract. We formulate the problem of least squares temporal difference learning (LSTD) in the framework of least squares SVM (LS-SVM). To cope with the large amount (and possible ...
Tobias Jung, Daniel Polani
IPPS
2006
IEEE
14 years 1 months ago
Parallelization of module network structure learning and performance tuning on SMP
As an extension of Bayesian network, module network is an appropriate model for inferring causal network of a mass of variables from insufficient evidences. However learning such ...
Hongshan Jiang, Chunrong Lai, Wenguang Chen, Yuron...
ICML
2002
IEEE
14 years 8 months ago
IEMS - The Intelligent Email Sorter
Classification of email is an important everyday task for a large and growing number of users. This paper describes the machine learning approaches underlying the i-ems (Intellige...
Elisabeth Crawford, Judy Kay, Eric McCreath
ICML
2007
IEEE
14 years 8 months ago
CarpeDiem: an algorithm for the fast evaluation of SSL classifiers
In this paper we present a novel algorithm, CarpeDiem. It significantly improves on the time complexity of Viterbi algorithm, preserving the optimality of the result. This fact ha...
Roberto Esposito, Daniele P. Radicioni
PKDD
2009
Springer
129views Data Mining» more  PKDD 2009»
14 years 2 months ago
Considering Unseen States as Impossible in Factored Reinforcement Learning
Abstract. The Factored Markov Decision Process (FMDP) framework is a standard representation for sequential decision problems under uncertainty where the state is represented as a ...
Olga Kozlova, Olivier Sigaud, Pierre-Henri Wuillem...