Sciweavers

1269 search results - page 105 / 254
» Learning Correction Grammars
Sort
View
COLT
2003
Springer
15 years 10 months ago
Lower Bounds on the Sample Complexity of Exploration in the Multi-armed Bandit Problem
We consider the Multi-armed bandit problem under the PAC (“probably approximately correct”) model. It was shown by Even-Dar et al. [5] that given n arms, it suffices to play th...
Shie Mannor, John N. Tsitsiklis
IJCNN
2000
IEEE
15 years 9 months ago
Extracting Distributed Representations of Concepts and Relations from Positive and Negative Propositions
Linear Relational Embedding (LRE) was introduced (Paccanaro and Hinton, 1999) as a means of extracting a distributed representation of concepts from relational data. The original ...
Alberto Paccanaro, Geoffrey E. Hinton
ECML
2001
Springer
15 years 9 months ago
Comparing the Bayes and Typicalness Frameworks
When correct priors are known, Bayesian algorithms give optimal decisions, and accurate confidence values for predictions can be obtained. If the prior is incorrect however, these...
Thomas Melluish, Craig Saunders, Ilia Nouretdinov,...
143
Voted
FLAIRS
2008
15 years 7 months ago
Diagnosing Natural Language Answers to Support Adaptive Tutoring
Understanding answers to open-ended explanation questions is important in intelligent tutoring systems. Existing systems use natural language techniques in essay analysis, but rev...
Myroslava Dzikovska, Gwendolyn E. Campbell, Charle...
ICPR
2002
IEEE
16 years 6 months ago
Comparative Study on Mirror Image Learning (MIL) and GLVQ
In this paper the effectiveness of a corrective learning algorithm MIL (Mirror Image Learning) [1], [2] is comparatively studied with that of GLVQ (Generalized Learning Vector Qua...
Meng Shi, Tetsushi Wakabayashi, Wataru Ohyama, Fum...