Learning in the limit with lattice-structured hypothesis spaces

DOI10.1016/j.tcs.2012.07.017zbMath1253.68188OpenAlexW1980910815MaRDI QIDQ714848

Jeffrey Heinz, Anna Kasprzik, Timo Kötzing

Publication date: 11 October 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.07.017

zbMATH Keywords

lattice theorylearning from positive data

Mathematics Subject Classification ID

Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45) Continuous lattices and posets, applications (06B35)

Related Items

Topological separations in inductive inference

Cites Work

• Aural pattern recognition experiments and the subregular hierarchy
• Multi-pattern languages
• Polynomial-time inference of arbitrary pattern languages
• Learning indexed families of recursive languages from positive data: A survey
• Learning regular sets from queries and counterexamples
• Finding patterns common to a set of strings
• Rich classes inferable from positive data: Length-bounded elementary formal systems
• Identification of function distinguishable languages.
• Incremental concept learning for bounded data mining.
• Polynomial-time identification of very simple grammars from positive data.
• Eilenberg's theorem for positive varieties of languages
• Some natural conditions on incremental learning
• Learnability and the Vapnik-Chervonenkis dimension
• Duality and Equational Theory of Regular Languages
• On Languages Piecewise Testable in the Strict Sense
• Difficulties in Forcing Fairness of Polynomial Time Inductive Inference
• A theory of the learnable
• Inductive inference of formal languages from positive data
• Inference of Reversible Languages
• Toward a mathematical theory of inductive inference
• On Context-Free Languages
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• Language identification in the limit
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item