Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/41126
DC FieldValue
dc.titleTowards a better understanding of incremental learning
dc.contributor.authorJain, S.
dc.contributor.authorLange, S.
dc.contributor.authorZilles, S.
dc.date.accessioned2013-07-04T08:20:13Z
dc.date.available2013-07-04T08:20:13Z
dc.date.issued2006
dc.identifier.citationJain, S.,Lange, S.,Zilles, S. (2006). Towards a better understanding of incremental learning. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 4264 LNAI : 169-183. ScholarBank@NUS Repository.
dc.identifier.isbn3540466495
dc.identifier.issn03029743
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/41126
dc.description.abstractThe present study aims at insights into the nature of incremental learning in the context of Gold's model of identification in the limit. With a focus on natural requirements such as consistency and conservativeness, incremental learning is analysed both for learning from positive examples and for learning from positive and negative examples. The results obtained illustrate in which way different consistency and conservativeness demands can affect the capabilities of incremental learners. These results may serve as a first step towards characterising the structure of typical classes learnable incrementally and thus towards elaborating uniform incremental learning methods. © Springer-Verlag Berlin Heidelberg 2006.
dc.sourceScopus
dc.typeConference Paper
dc.contributor.departmentCOMPUTER SCIENCE
dc.description.sourcetitleLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
dc.description.volume4264 LNAI
dc.description.page169-183
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

Altmetric


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