Learning families of closed sets in matroids
作者： Ziyuan Gao , Frank Stephan , Guohua Wu , Akihiro Yamamoto , None
DOI: 10.1007/978-3-642-27654-5_10
关键词:
摘要: In this paper it is studied for which oracles A and types of A-r.e. matroids the class all closed sets in matroid learnable by an unrelativised learner. The learning criteria considered comprise particular more general than behaviourally correct learning, namely from recursive texts, partial reliably learning. For various natural classes criteria, characterisations learnability are obtained.
springer.com
sci-hub.st 参考文章(33)
Daniel N. Osherson, James S. Royer, Sanjay Jain, Arun Sharma, Systems That Learn: An Introduction to Learning Theory ,(1999)
Piergiorgio Odifreddi, Classical recursion theory ,(1989)
Maxime Crochemore, Costas Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleń, On the Maximal Number of Cubic Runs in a String Language and Automata Theory and Applications. ,vol. 6031, pp. 227- 238 ,(2010) , 10.1007/978-3-642-13089-2_19
Carl G. Jockusch, Robert I. Soare, Π⁰₁ classes and degrees of theories Transactions of the American Mathematical Society. ,vol. 173, pp. 33- 56 ,(1972) , 10.1090/S0002-9947-1972-0316227-0
Matthew de Brecht, Masanori Kobayashi, Hiroo Tokunaga, Akihiro Yamamoto, Inferability of closed set systems from positive data JSAI'06 Proceedings of the 20th annual conference on New frontiers in artificial intelligence. pp. 265- 275 ,(2006) , 10.1007/978-3-540-69902-6_23
Matthew de Brecht, Akihiro Yamamoto, Topological Properties of Concept Spaces Lecture Notes in Computer Science. pp. 374- 388 ,(2008) , 10.1007/978-3-540-87987-9_31
Matthew Hennessy, Robin Milner, On Observing Nondeterminism and Concurrency international colloquium on automata, languages and programming. pp. 299- 309 ,(1980) , 10.1007/3-540-10003-2_79
Cristian S. Calude, Information and Randomness: An Algorithmic Perspective ,(1994)
Daniel N. Osherson, Michael Stob, Scott Weinstein, Systems That Learn: An Introduction to Learning Theory for Cognitive and Computer Scientists ,(1986)
Anna Kasprzik, Timo Kötzing, String Extension Learning Using Lattices Language and Automata Theory and Applications. pp. 380- 391 ,(2010) , 10.1007/978-3-642-13089-2_32