Learning in the limit with lattice-structured hypothesis spaces

DOI10.1016/J.TCS.2012.07.017MaRDI QIDQ714848zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

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

Cited in

(4)

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

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)