Hypothesis Spaces for Learning

DOI10.1007/978-3-642-00982-2_4MaRDI QIDQ3618566zbMATH OpenOpenAlexFDO

Authors Sanjay Jain

Publication date 2 April 2009

Published in Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.150.7964

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Recommendations

• Hypothesis spaces for learning
• Changing the inference type -- keeping the hypothesis space
• scientific article; zbMATH DE number 791077
• An inductive inference approach to classification
• Control structures in hypothesis spaces: The influence on learning

Cites work

• A general comparison of language learning from examples and from queries
• Algorithmic Learning Theory
• Characterizations of monotonic and dual monotonic language learning
• Comparison of identification criteria for machine inductive inference
• Control structures in hypothesis spaces: The influence on learning
• Finding patterns common to a set of strings
• scientific article; zbMATH DE number 3932417 (Why is no real title available?)
• scientific article; zbMATH DE number 3681743 (Why is no real title available?)
• scientific article; zbMATH DE number 3539202 (Why is no real title available?)
• scientific article; zbMATH DE number 517033 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• Incremental learning from positive data
• Inductive Inference and Computable One‐One Numberings
• Inductive inference of formal languages from positive data
• Language identification in the limit
• Learning in Friedberg numberings
• Learning recursive functions: A survey
• LEARNING RECURSIVE LANGUAGES WITH BOUNDED MIND CHANGES
• Learning strategies
• Learning with the knowledge of an upper bound on program size
• Monotonic and dual monotonic language learning
• Monotonic and non-monotonic inductive inference
• Numberings Optimal for Learning
• Prescribed learning of indexed families
• Prescribed Learning of R.E. Classes
• Prudence and other conditions on formal language learning
• Set-driven and rearrangement-independent learning of recursive languages
• The Power of Vacillation in Language Learning
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
• Toward a mathematical theory of inductive inference
• When unlearning helps

Cited in

(6)

• Learning from a population of hypotheses
• Parametric version space approach to concept learning
• Learning Modal Theories
• Hypothesis spaces for learning
• Changing the inference type -- keeping the hypothesis space
• Control structures in hypothesis spaces: The influence on learning

This page was built for publication: Hypothesis Spaces for Learning

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