Learning families of closed sets in matroids

DOI10.1007/978-3-642-27654-5_10zbMATH Open1353.68150OpenAlexW89574568MaRDI QIDQ2891307FDOQ2891307

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

Recommendations

• scientific article
• 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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (9)

• Title not available (Why is that?)
• Learning algebraic structures with the help of Borel equivalence relations
• Calculating the mind change complexity of learning algebraic structures
• Confident and consistent partial learning of recursive functions
• Independence and port oracles for matroids, with an application to computational learning theory
• On learning for families of algebraic structures
• On learning families of ideals in lattices and Boolean algebras
• Partial learning of recursively enumerable languages
• On learning down-sets in quasi-orders, and ideals in Boolean algebras

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)