Name
Abstract | ||
|---|---|---|
We define and study a learning paradigm that sits between identification in the limit and classification. More precisely, we expect that a learner be able to identify in the limit which members of a set D of n possible data belong to a target language, where n and D are arbitrary. We show that Ex- and BC-learning are often more difficult than performing this classification task, taking into account desirable constraints on how the learner behaves, such as bounding the number of mind changes and being conservative. Special attention is given to various forms of consistency. We provide a fairly comprehensive set of results that demonstrate the fruitfulness of the approach and the richness of the paradigm. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1007/978-3-642-24412-4_9 | ALT |
Keywords | Field | DocType |
special attention,comprehensive set,classification task,various form,target language,mind change,account desirable constraint,set d,n possible data | Inductive reasoning,Computer science,Initial segment,Artificial intelligence,Recursive functions,Machine learning,Bounding overwatch | Conference |
Volume | ISSN | Citations |
6925 | 0302-9743 | 0 |
PageRank | References | Authors |
0.34 | 17 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sanjay Jain | 1 | 1647 | 177.87 |
| Eric Martin | 2 | 65 | 13.85 |
| Frank Stephan | 3 | 215 | 39.36 |