Please use this identifier to cite or link to this item:
|Title:||Learning languages from positive data and negative counterexamples|
|Authors:||Jain, S. |
|Citation:||Jain, S.,Kinber, E. (2004). Learning languages from positive data and negative counterexamples. Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) 3244 : 54-68. ScholarBank@NUS Repository.|
|Abstract:||A paradigm for learning in the limit of potentially infinite languages from all positive data and negative data counterexamples, provided in response to the conjectures made by the learner, is proposed. The computational models where, a learner gets the least negative counterexamples, the size of a negative counterexample must be bounded by the size of the positive data, and counterexample may be delayed, are considered for the paradigm. Learning power, limitation of these models, as well as their relationships with classical paradigms for learning languages in the limit are also discussed. The results show that sometimes positive data and negative counterexamples provided by teacher are not enough to compensate for full positive and negative data.|
|Source Title:||Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Feb 2, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.