Sciweavers

1400 search results - page 106 / 280
» Post-Analysis of Learned Rules
Sort
View
ANLP
1992
116views more  ANLP 1992»
15 years 5 months ago
Automatic Learning for Semantic Collocation
The real di culty in development of practical NLP systems comes from the fact that we do not have e ective means for gathering \knowledge". In this paper, we propose an algor...
Satoshi Sekine, Jeremy J. Carroll, Sophia Ananiado...
ICML
2009
IEEE
16 years 5 months ago
Approximate inference for planning in stochastic relational worlds
Relational world models that can be learned from experience in stochastic domains have received significant attention recently. However, efficient planning using these models rema...
Tobias Lang, Marc Toussaint
ICML
2008
IEEE
16 years 5 months ago
Empirical Bernstein stopping
Sampling is a popular way of scaling up machine learning algorithms to large datasets. The question often is how many samples are needed. Adaptive stopping algorithms monitor the ...
Csaba Szepesvári, Jean-Yves Audibert, Volod...
NIPS
2000
15 years 5 months ago
An Information Maximization Approach to Overcomplete and Recurrent Representations
The principle of maximizing mutual information is applied to learning overcomplete and recurrent representations. The underlying model consists of a network of input units driving...
Oren Shriki, Haim Sompolinsky, Daniel D. Lee
GECCO
2009
Springer
150views Optimization» more  GECCO 2009»
15 years 11 months ago
Discrete dynamical genetic programming in XCS
A number of representation schemes have been presented for use within Learning Classifier Systems, ranging from binary encodings to neural networks. This paper presents results fr...
Richard Preen, Larry Bull