Sciweavers

449 search results - page 22 / 90
» Finding Structure in Reinforcement Learning
Sort
View
122
Voted
SSPR
2004
Springer
15 years 9 months ago
Finding Clusters and Components by Unsupervised Learning
We present a tutorial survey on some recent approaches to unsupervised machine learning in the context of statistical pattern recognition. In statistical PR, there are two classica...
Erkki Oja
136
Voted
ICANN
2010
Springer
15 years 3 months ago
Tumble Tree - Reducing Complexity of the Growing Cells Approach
We propose a data structure that decreases complexity of unsupervised competitive learning algorithms which are based on the growing cells structures approach. The idea is based on...
Hendrik Annuth, Christian-A. Bohn
138
Voted
GECCO
2010
Springer
153views Optimization» more  GECCO 2010»
15 years 6 months ago
Multi-task evolutionary shaping without pre-specified representations
Shaping functions can be used in multi-task reinforcement learning (RL) to incorporate knowledge from previously experienced tasks to speed up learning on a new task. So far, rese...
Matthijs Snel, Shimon Whiteson
ICML
2003
IEEE
16 years 4 months ago
Finding Underlying Connections: A Fast Graph-Based Method for Link Analysis and Collaboration Queries
Many techniques in the social sciences and graph theory deal with the problem of examining and analyzing patterns found in the underlying structure and associations of a group of ...
Jeremy Kubica, Andrew W. Moore, David Cohn, Jeff G...
145
Voted
FGR
2004
IEEE
133views Biometrics» more  FGR 2004»
15 years 7 months ago
Finding Temporal Patterns by Data Decomposition
We present a new unsupervised learning technique for the discovery of temporal clusters in large data sets. Our method performs hierarchical decomposition of the data to find stru...
David C. Minnen, Christopher Richard Wren