Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/43100
DC FieldValue
dc.titlePrescribed learning of indexed families
dc.contributor.authorJain, S.
dc.contributor.authorStephan, F.
dc.contributor.authorNan, Y.
dc.date.accessioned2013-07-23T09:24:58Z
dc.date.available2013-07-23T09:24:58Z
dc.date.issued2008
dc.identifier.citationJain, S.,Stephan, F.,Nan, Y. (2008). Prescribed learning of indexed families. Fundamenta Informaticae 83 (1-2) : 159-175. ScholarBank@NUS Repository.
dc.identifier.issn01692968
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/43100
dc.description.abstractThis work extends studies of Angluin, Lange and Zeugmann on how learnability of a language class depends on the hypothesis space used by the learner. While previous studies mainly focused on the case where the learner chooses a particular hypothesis space, the goal of this work is to investigate the case where the learner has to cope with all possible hypothesis spaces. In that sense, the present work combines the approach of Angluin, Lange and Zeugmann with the question of how a learner can be synthesized. The investigation for the case of uniformly r.e. classes has been done by Jain, Stephan and Ye [6]. This paper investigates the case for indexed families and gives a special attention to the notions of conservative and non U-shaped learning.
dc.sourceScopus
dc.subjectConservative learning
dc.subjectIndexed families
dc.subjectInductive inference
dc.subjectPrescribed learning
dc.subjectUniform learning
dc.typeArticle
dc.contributor.departmentCOMPUTER SCIENCE
dc.contributor.departmentMATHEMATICS
dc.description.sourcetitleFundamenta Informaticae
dc.description.volume83
dc.description.issue1-2
dc.description.page159-175
dc.description.codenFUINE
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.