3250 search results - page 375 / 650 » Parameterized Learning Complexity |
157
click to vote
ICML
2008
IEEE
16 years 5 months ago
2008
IEEE
Deep Belief Networks (DBN's) are generative models that contain many layers of hidden variables. Efficient greedy algorithms for learning and approximate inference have allow...
128
Voted
KDD
2009
ACM
16 years 5 months ago
2009
ACM
Given multiple time sequences with missing values, we propose DynaMMo which summarizes, compresses, and finds latent variables. The idea is to discover hidden variables and learn ...
144
click to vote
ALT
2005
Springer
16 years 1 months ago
2005
Springer
Within learning theory teaching has been studied in various ways. In a common variant the teacher has to teach all learners that are restricted to output only consistent hypotheses...
142
Voted
ALT
2004
Springer
16 years 1 months ago
2004
Springer
A revision algorithm is a learning algorithm that identifies the target concept, starting from an initial concept. Such an algorithm is considered efficient if its complexity (in ...
133
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
Many successful applications have proven the potential of Learning Classifier Systems and the XCS classifier system in particular in datamining, reinforcement learning, and func...