Learning in the limit with lattice-structured hypothesis spaces

DOI10.1016/J.TCS.2012.07.017zbMATH Open1253.68188OpenAlexW1980910815MaRDI QIDQ714848FDOQ714848

Authors: 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

Recommendations

• String extension learning using lattices
• Learning and classifying
• Simple flat languages: a learnable class in the limit from positive data
• Learning and classifying
• Language learning from texts: Degrees of intrinsic complexity and their characterizations

zbMATH Keywords

lattice theorylearning from positive data

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (4)

• Learning Integer Lattices
• Topological separations in inductive inference
• String extension learning using lattices
• Robust identification in the limit from incomplete positive data

This page was built for publication: Learning in the limit with lattice-structured hypothesis spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q714848)