Trees and learning

DOI10.1016/J.JCSS.2003.08.001MaRDI QIDQ1878683zbMATH OpenOpenAlexFDO

Authors Wolfgang Merkle, Frank Stephan

Publication date 8 September 2004

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jcss.2003.08.001

zbMATH Keywords

EX-learningteam learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Hierarchies of probabilistic and team FIN-learning
• Input-dependence in function-learning
• On exact learning of unordered tree patterns
• scientific article; zbMATH DE number 1104340
• Robust learning with infinite additional information

Cites work

• Classical recursion theory. The theory of functions and sets of natural numbers
• Classical recursion theory. Vol. II
• Comparison of identification criteria for machine inductive inference
• scientific article; zbMATH DE number 3681743 (Why is no real title available?)
• scientific article; zbMATH DE number 194103 (Why is no real title available?)
• scientific article; zbMATH DE number 3518782 (Why is no real title available?)
• scientific article; zbMATH DE number 3536063 (Why is no real title available?)
• scientific article; zbMATH DE number 3566828 (Why is no real title available?)
• scientific article; zbMATH DE number 1351096 (Why is no real title available?)
• scientific article; zbMATH DE number 517033 (Why is no real title available?)
• scientific article; zbMATH DE number 2077161 (Why is no real title available?)
• scientific article; zbMATH DE number 2080664 (Why is no real title available?)
• Language identification in the limit
• Learning recursive functions from approximations
• On learning of functions refutably.
• On the structure of degrees of inferability.
• Probability and plurality for aggregations of learning machines
• Refuting learning revisited.
• Some natural properties of strong-identification in inductive inference
• Toward a mathematical theory of inductive inference
• Towards a mathematical theory of machine discovery from facts

Cited in

(9)

• Calculating the mind change complexity of learning algebraic structures
• Learning families of algebraic structures from informant
• Learning algebraic structures with the help of Borel equivalence relations
• Marrying Words and Trees
• Marrying Words and Trees
• Robust learning with infinite additional information
• On learning for families of algebraic structures
• Classifying different criteria for learning algebraic structures
• Limit learning equivalence structures

This page was built for publication: Trees and learning

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