A note on batch and incremental learnability (Q1271611): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: GOLEM / rank | |||
Normal rank | |||
Revision as of 09:14, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on batch and incremental learnability |
scientific article |
Statements
A note on batch and incremental learnability (English)
0 references
10 November 1998
0 references
The author presents the result that the collections of recursively enumerable languages those are finite identified from both the positive and the negative data can also be identified in the limit only from the positive data by giving an algorithmic transformation on machines. This transformation also yields an algorithm to convert a batch learning system that learns from both positive and negative data into an incremental learning system that learns from the positive data only.
0 references
recursively enumerable languages
0 references
