Prescribed Learning of Indexed Families.
Saved in:
| Title: | Prescribed Learning of Indexed Families. |
|---|---|
| Authors: | Jain, Sanjay1 sanjay@comp.nus.edu.sg, Stephan, Frank2 fstephan@comp.nus.edu.sg, Ye Nan1 g0701171@nus.edu.sg |
| Source: | Fundamenta Informaticae. 2008, Vol. 83 Issue 1-2, p159-175. 17p. |
| Subjects: | Induction (Logic), Inductive teaching, Learning, Education, Comprehension |
| Abstract: | This 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. [ABSTRACT FROM AUTHOR] |
| Copyright of Fundamenta Informaticae is the property of Polskie Towarzystwo Matematyczne and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
| FullText | Links: – Type: pdflink Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 32191721 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Prescribed Learning of Indexed Families. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Jain%2C+Sanjay%22">Jain, Sanjay</searchLink><relatesTo>1</relatesTo><i> sanjay@comp.nus.edu.sg</i><br /><searchLink fieldCode="AR" term="%22Stephan%2C+Frank%22">Stephan, Frank</searchLink><relatesTo>2</relatesTo><i> fstephan@comp.nus.edu.sg</i><br /><searchLink fieldCode="AR" term="%22Ye+Nan%22">Ye Nan</searchLink><relatesTo>1</relatesTo><i> g0701171@nus.edu.sg</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Fundamenta+Informaticae%22">Fundamenta Informaticae</searchLink>. 2008, Vol. 83 Issue 1-2, p159-175. 17p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Induction+%28Logic%29%22">Induction (Logic)</searchLink><br /><searchLink fieldCode="DE" term="%22Inductive+teaching%22">Inductive teaching</searchLink><br /><searchLink fieldCode="DE" term="%22Learning%22">Learning</searchLink><br /><searchLink fieldCode="DE" term="%22Education%22">Education</searchLink><br /><searchLink fieldCode="DE" term="%22Comprehension%22">Comprehension</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: This 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. [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of Fundamenta Informaticae is the property of Polskie Towarzystwo Matematyczne and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=32191721 |
| RecordInfo | BibRecord: BibEntity: Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 17 StartPage: 159 Subjects: – SubjectFull: Induction (Logic) Type: general – SubjectFull: Inductive teaching Type: general – SubjectFull: Learning Type: general – SubjectFull: Education Type: general – SubjectFull: Comprehension Type: general Titles: – TitleFull: Prescribed Learning of Indexed Families. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Jain, Sanjay – PersonEntity: Name: NameFull: Stephan, Frank – PersonEntity: Name: NameFull: Ye Nan IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 03 Text: 2008 Type: published Y: 2008 Identifiers: – Type: issn-print Value: 01692968 Numbering: – Type: volume Value: 83 – Type: issue Value: 1-2 Titles: – TitleFull: Fundamenta Informaticae Type: main |
| ResultId | 1 |
