Sciweavers

89 search results - page 1 / 18
» A Characterization of the Language Classes Learnable with Co...
Sort
View
TAMC
2007
Springer
13 years 11 months ago
A Characterization of the Language Classes Learnable with Correction Queries
Abstract. Formal language learning models have been widely investigated in the last four decades. But it was not until recently that the model of learning from corrections was intr...
Cristina Tîrnauca, Satoshi Kobayashi
DIS
1998
Springer
13 years 9 months ago
Uniform Characterizations of Polynomial-Query Learnabilities
We consider the exact learning in the query model. We deal with all types of queries introduced by Angluin: membership, equivalence, superset, subset, disjointness and exhaustivene...
Yosuke Hayashi, Satoshi Matsumoto, Ayumi Shinohara...
ALT
1997
Springer
13 years 9 months ago
Synthesizing Noise-Tolerant Language Learners
An index for an r.e. class of languages (by definition) generates a sequence of grammars defining the class. An index for an indexed family of languages (by definition) generat...
John Case, Sanjay Jain, Arun Sharma
ECML
2007
Springer
13 years 11 months ago
Learning Balls of Strings with Correction Queries
When facing the question of learning languages in realistic settings, one has to tackle several problems that do not admit simple solutions. On the one hand, languages are usually...
Leonor Becerra-Bonache, Colin de la Higuera, Jean-...
STOC
1994
ACM
128views Algorithms» more  STOC 1994»
13 years 9 months ago
Weakly learning DNF and characterizing statistical query learning using Fourier analysis
We present new results on the well-studied problem of learning DNF expressions. We prove that an algorithm due to Kushilevitz and Mansour [13] can be used to weakly learn DNF form...
Avrim Blum, Merrick L. Furst, Jeffrey C. Jackson, ...