Sciweavers

2295 search results - page 168 / 459
» Learning Overcomplete Representations
Sort
View
106
Voted
ACL
2010
14 years 11 months ago
Learning Script Knowledge with Web Experiments
We describe a novel approach to unsupervised learning of the events that make up a script, along with constraints on their temporal ordering. We collect naturallanguage descriptio...
Michaela Regneri, Alexander Koller, Manfred Pinkal
88
Voted
ACL
2009
14 years 10 months ago
Learning Semantic Correspondences with Less Supervision
A central problem in grounded language acquisition is learning the correspondences between a rich world state and a stream of text which references that world state. To deal with ...
Percy Liang, Michael I. Jordan, Dan Klein
94
Voted
GECCO
2009
Springer
15 years 7 months ago
On the scalability of XCS(F)
Many successful applications have proven the potential of Learning Classifier Systems and the XCS classifier system in particular in datamining, reinforcement learning, and func...
Patrick O. Stalph, Martin V. Butz, David E. Goldbe...
93
Voted
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
15 years 7 months ago
Evolving problem heuristics with on-line ACGP
Genetic Programming uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees. ...
Cezary Z. Janikow
107
Voted
ECML
2004
Springer
15 years 6 months ago
Conditional Independence Trees
It has been observed that traditional decision trees produce poor probability estimates. In many applications, however, a probability estimation tree (PET) with accurate probabilit...
Harry Zhang, Jiang Su