Please use this identifier to cite or link to this item:
|Title:||Learning families of closed sets in matroids||Authors:||Gao, Z.
|Issue Date:||2012||Citation:||Gao, Z.,Stephan, F.,Wu, G.,Yamamoto, A. (2012). Learning families of closed sets in matroids. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 7160 LNCS : 120-139. ScholarBank@NUS Repository. https://doi.org/10.1007/978-3-642-27654-5_10||Abstract:||In this paper it is studied for which oracles A and which types of A-r.e. matroids the class of all A-r.e. closed sets in the matroid is learnable by an unrelativised learner. The learning criteria considered comprise in particular criteria more general than behaviourally correct learning, namely behaviourally correct learning from recursive texts, partial learning and reliably partial learning. For various natural classes of matroids and learning criteria, characterisations of learnability are obtained. © 2012 Springer-Verlag.||Source Title:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)||URI:||http://scholarbank.nus.edu.sg/handle/10635/104583||ISBN:||9783642276538||ISSN:||03029743||DOI:||10.1007/978-3-642-27654-5_10|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Apr 2, 2020
checked on Mar 28, 2020
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.