Sciweavers

986 search results - page 34 / 198
» Zero-data Learning of New Tasks
Sort
View
AAAI
2011
13 years 9 months ago
An Online Spectral Learning Algorithm for Partially Observable Nonlinear Dynamical Systems
Recently, a number of researchers have proposed spectral algorithms for learning models of dynamical systems—for example, Hidden Markov Models (HMMs), Partially Observable Marko...
Byron Boots, Geoffrey J. Gordon
KDD
2006
ACM
272views Data Mining» more  KDD 2006»
15 years 10 months ago
YALE: rapid prototyping for complex data mining tasks
KDD is a complex and demanding task. While a large number of methods has been established for numerous problems, many challenges remain to be solved. New tasks emerge requiring th...
Ingo Mierswa, Michael Wurst, Ralf Klinkenberg, Mar...
ESANN
2007
14 years 11 months ago
Replacing eligibility trace for action-value learning with function approximation
The eligibility trace is one of the most used mechanisms to speed up reinforcement learning. Earlier reported experiments seem to indicate that replacing eligibility traces would p...
Kary Främling
GCA
2009
14 years 7 months ago
A Learning Approach to Mechanism Design in Grid Resource Allocation
In this article a new algorithm for grid resource allocation based upon the theory of Algorithmic Mechanism Design (AMD) is presented. This algorithm is targeted at minimizing cost...
Mahmoud Moravej, Saeed Parsa
KDD
1994
ACM
140views Data Mining» more  KDD 1994»
15 years 1 months ago
A Comparison of Pruning Methods for Relational Concept Learning
Pre-Pruning and Post-Pruning are two standard methods of dealing with noise in concept learning. Pre-Pruning methods are very efficient, while Post-Pruning methods typically are m...
Johannes Fürnkranz