A note on batch and incremental learnability (Q1271611): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Toward a mathematical theory of inductive inference / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Comparison of identification criteria for machine inductive inference / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Language identification in the limit / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3862379 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4202923 / rank | |||
Normal rank | |||
Revision as of 16:24, 28 May 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
