Learnability theory
β Scribed by Fulop, Sean A.; Chater, Nick
- Book ID
- 120165572
- Publisher
- Wiley (John Wiley & Sons)
- Year
- 2013
- Tongue
- English
- Weight
- 124 KB
- Volume
- 4
- Category
- Article
- ISSN
- 1939-5078
- DOI
- 10.1002/wcs.1228
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We present positive PAC-learning results for the nonmonotonic inductive logic programming setting. In particular, we show that first-order range-restricted clausal theories that consist of clauses with up to k literals of size at most j each are polynomial-sample polynomial-time PAC-learnable with o
The learning model of Valiant is extended to allow the number of examples required for learning to depend on the particular concept to be learned, instead of requiring a uniform bound for all concepts of a concept class. This extension, called nonuniform learning, enables learning many concept class