An average-case optimal one-variable pattern language learner
From MaRDI portal
Recommendations
Cites work
- A theory of the learnable
- Finding patterns common to a set of strings
- scientific article; zbMATH DE number 67610 (Why is no real title available?)
- scientific article; zbMATH DE number 743586 (Why is no real title available?)
- scientific article; zbMATH DE number 801745 (Why is no real title available?)
- scientific article; zbMATH DE number 1453031 (Why is no real title available?)
- Ignoring data may be the only way to learn efficiently
- Incremental concept learning for bounded data mining.
- Incremental learning from positive data
- Lange and Wiehagen's pattern language learning algorithm: An average-case analysis with respect to its total learning time
- Language identification in the limit
- Learnability and the Vapnik-Chervonenkis dimension
- Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries
- On the complexity of inductive inference
- On the impact of forgetting on learning machines
- Polynomial-time inference of arbitrary pattern languages
- Set-driven and rearrangement-independent learning of recursive languages
Cited in
(15)- Lange and Wiehagen's pattern language learning algorithm: An average-case analysis with respect to its total learning time
- Learning erasing pattern languages with queries
- Feasible Iteration of Feasible Learning Functionals
- Inferring descriptive generalisations of formal languages
- scientific article; zbMATH DE number 67610 (Why is no real title available?)
- scientific article; zbMATH DE number 1379106 (Why is no real title available?)
- scientific article; zbMATH DE number 1372649 (Why is no real title available?)
- Patterns with bounded treewidth
- Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries
- Resource restricted computability theoretic learning: Illustrative topics and problems
- From learning in the limit to stochastic finite learning
- Learning a subclass of regular patterns in polynomial time
- Developments from enquiries into the learnability of the pattern languages from positive data
- Discontinuities in pattern inference
- Learning indexed families of recursive languages from positive data: A survey
This page was built for publication: An average-case optimal one-variable pattern language learner
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1567401)
