Learning Families of Closed Sets in Matroids

DOI10.1007/978-3-642-27654-5_10zbMath1353.68150MaRDI QIDQ2891307

Akihiro Yamamoto, Ziyuan Gao, Guohua Wu, Frank Stephan

Publication date: 15 June 2012

Published in: Computation, Physics and Beyond (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-27654-5_10

Mathematics Subject Classification ID

68Q32: Computational learning theory

05B35: Combinatorial aspects of matroids and geometric lattices

Related Items

Partial learning of recursively enumerable languages, Confident and consistent partial learning of recursive functions, Calculating the mind change complexity of learning algebraic structures, Learning algebraic structures with the help of Borel equivalence relations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Comparison of identification criteria for machine inductive inference
• On the learnability of vector spaces
• Prudence and other conditions on formal language learning
• Topological properties of concept spaces (full version)
• Recursion theory on fields and abstract dependence
• Relativized topological size of sets of partial recursive functions
• Classical recursion theory. The theory of functions and sets of natural numbers
• Some natural properties of strong-identification in inductive inference
• Classical recursion theory. Vol. II
• \(\Pi_1^0\) classes and minimal degrees
• String Extension Learning Using Lattices
• Inductive inference of formal languages from positive data
• Maximal vector spaces under automorphisms of the lattice of recursively enumerable vector spaces
• Recursively enumerable vector spaces
• Criteria of language learning
• Degrees in Which the Recursive Sets are Uniformly Recursive
• Language identification in the limit
• ∏ 0 1 Classes and Degrees of Theories
• Synthesizing learners tolerating computable noisy data
• Learning algebraic structures from text