Sciweavers

1222 search results - page 25 / 245
» Machine Learning of Temporal Relations
Sort
View
ICML
2002
IEEE
15 years 10 months ago
Discovering Hierarchy in Reinforcement Learning with HEXQ
An open problem in reinforcement learning is discovering hierarchical structure. HEXQ, an algorithm which automatically attempts to decompose and solve a model-free factored MDP h...
Bernhard Hengst
ALT
2011
Springer
13 years 9 months ago
On Noise-Tolerant Learning of Sparse Parities and Related Problems
We consider the problem of learning sparse parities in the presence of noise. For learning parities on r out of n variables, we give an algorithm that runs in time poly log 1 δ , ...
Elena Grigorescu, Lev Reyzin, Santosh Vempala
KDD
1995
ACM
148views Data Mining» more  KDD 1995»
15 years 1 months ago
Learning Arbiter and Combiner Trees from Partitioned Data for Scaling Machine Learning
Knowledge discovery in databases has become an increasingly important research topic with the advent of wide area network computing. One of the crucial problems we study in this p...
Philip K. Chan, Salvatore J. Stolfo
ATAL
2007
Springer
15 years 3 months ago
A framework for agent-based distributed machine learning and data mining
This paper proposes a framework for agent-based distributed machine learning and data mining based on (i) the exchange of meta-level descriptions of individual learning processes ...
Jan Tozicka, Michael Rovatsos, Michal Pechoucek
ICML
2005
IEEE
15 years 10 months ago
Dirichlet enhanced relational learning
We apply nonparametric hierarchical Bayesian modelling to relational learning. In a hierarchical Bayesian approach, model parameters can be "personalized", i.e., owned b...
Zhao Xu, Volker Tresp, Kai Yu, Shipeng Yu, Hans-Pe...