Sciweavers

798 search results - page 18 / 160
» Perceptual Learning and Abstraction in Machine Learning
Sort
View
ICML
2007
IEEE
14 years 9 months ago
Automatic shaping and decomposition of reward functions
This paper investigates the problem of automatically learning how to restructure the reward function of a Markov decision process so as to speed up reinforcement learning. We begi...
Bhaskara Marthi
MLG
2007
Springer
14 years 2 months ago
Graphs, Hypergraphs, and Inductive Logic Programming
Abstract. There are many connections between graph mining and inductive logic programming (ILP), or more generally relational learning. Up till now these connections have mostly be...
Hendrik Blockeel, Tijn Witsenburg, Joost N. Kok
ICAISC
2004
Springer
14 years 2 months ago
Comparison of Instances Seletion Algorithms I. Algorithms Survey
Abstract. Several methods were proposed to reduce the number of instances (vectors) in the learning set. Some of them extract only bad vectors while others try to remove as many in...
Norbert Jankowski, Marek Grochowski
SEAL
1998
Springer
14 years 25 days ago
Co-evolution, Determinism and Robustness
Abstract. Robustness has long been recognised as a critical issue for coevolutionary learning. It has been achieved in a number of cases, though usually in domains which involve so...
Alan D. Blair, Elizabeth Sklar, Pablo Funes
CORR
2010
Springer
153views Education» more  CORR 2010»
13 years 8 months ago
GraphLab: A New Framework for Parallel Machine Learning
Designing and implementing efficient, provably correct parallel machine learning (ML) algorithms is challenging. Existing high-level parallel abstractions like MapReduce are insuf...
Yucheng Low, Joseph Gonzalez, Aapo Kyrola, Danny B...