Learning families of closed sets in matroids

DOI10.1007/978-3-642-27654-5_10MaRDI QIDQ2891307zbMATH OpenOpenAlexFDO

Authors Ziyuan Gao, Akihiro Yamamoto, Frank Stephan, Guohua Wu

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

Combinatorial aspects of matroids and geometric lattices (05B35) Computational learning theory (68Q32)

Recommendations

• scientific article; zbMATH DE number 1003264
• Learning theory in the arithmetic hierarchy
• Independence and port oracles for matroids, with an application to computational learning theory
• Learning Bounded Unions of Noetherian Closed Set Systems Via Characteristic Sets
• scientific article; zbMATH DE number 3878912

Cites work

• \(\Pi_1^0\) classes and minimal degrees
• ∏ 0 1 Classes and Degrees of Theories
• 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
• Criteria of language learning
• Degrees in Which the Recursive Sets are Uniformly Recursive
• scientific article; zbMATH DE number 5354053 (Why is no real title available?)
• scientific article; zbMATH DE number 3932417 (Why is no real title available?)
• scientific article; zbMATH DE number 4091484 (Why is no real title available?)
• scientific article; zbMATH DE number 1911266 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• Inductive inference of formal languages from positive data
• Language identification in the limit
• Learning algebraic structures from text
• Maximal vector spaces under automorphisms of the lattice of recursively enumerable vector spaces
• On the learnability of vector spaces
• Prudence and other conditions on formal language learning
• Recursion theory on fields and abstract dependence
• Recursively enumerable vector spaces
• Relativized topological size of sets of partial recursive functions
• Some natural properties of strong-identification in inductive inference
• String extension learning using lattices
• Synthesizing learners tolerating computable noisy data
• Topological properties of concept spaces (full version)

Cited in

(13)

• Independence and port oracles for matroids, with an application to computational learning theory
• Calculating the mind change complexity of learning algebraic structures
• Learning algebraic structures with the help of Borel equivalence relations
• scientific article; zbMATH DE number 3878912 (Why is no real title available?)
• Confident and consistent partial learning of recursive functions
• Partial learning of recursively enumerable languages
• On learning for families of algebraic structures
• On learning families of ideals in lattices and Boolean algebras
• On learning down-sets in quasi-orders, and ideals in Boolean algebras
• Syntactic characterization of learnability of structures with mind changes
• On learning existentially definable subsets in a computable structure
• Classifying different criteria for learning algebraic structures
• Learning families of algebraic structures from text

This page was built for publication: Learning families of closed sets in matroids

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