Ignoring data may be the only way to learn efficiently
From MaRDI portal
Publication:4290134
DOI10.1080/09528139408953785zbMath0803.68109OpenAlexW2013541926MaRDI QIDQ4290134
Rolf Wiehagen, Thomas Zeugmann
Publication date: 3 May 1994
Published in: Journal of Experimental & Theoretical Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/09528139408953785
Related Items (24)
Robust learning -- rich and poor ⋮ Revisiting Shinohara's algorithm for computing descriptive patterns ⋮ From learning in the limit to stochastic finite learning ⋮ Inferring descriptive generalisations of formal languages ⋮ Learning Efficiency of Very Simple Grammars from Positive Data ⋮ Learning recursive functions: A survey ⋮ Quantum inductive inference by finite automata ⋮ 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 ⋮ Non-U-shaped vacillatory and team learning ⋮ Monotonic and dual monotonic language learning ⋮ Learning languages from positive data and a limited number of short counterexamples ⋮ Consistent and coherent learning with \(\delta \)-delay ⋮ Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries ⋮ On families of categorial grammars of bounded value, their learnability and related complexity questions ⋮ Learning efficiency of very simple grammars from positive data ⋮ Set-driven and rearrangement-independent learning of recursive languages ⋮ An average-case optimal one-variable pattern language learner ⋮ On learning unions of pattern languages and tree patterns in the mistake bound model. ⋮ Incremental concept learning for bounded data mining. ⋮ Inductive inference of approximations for recursive concepts ⋮ On the interplay between inductive inference of recursive functions, complexity theory and recursive numberings ⋮ A non-learnable class of E-pattern languages
Cites Work
- Unnamed Item
- Unnamed Item
- Polynomial-time inference of arbitrary pattern languages
- Saving the phenomena: Requirements that inductive inference machines not contradict known data
- Finding patterns common to a set of strings
- Nonmonotonic and inductive logic. 1st international workshop, Karlsruhe, Germany, December 4--7, 1990. Proceedings
- Toward a mathematical theory of inductive inference
- A Machine-Independent Theory of the Complexity of Recursive Functions
- Limiting recursion
- A formal theory of inductive inference. Part I
- Language identification in the limit
This page was built for publication: Ignoring data may be the only way to learn efficiently
