The one-inclusion graph algorithm is near-optimal for the prediction model of learning

The one-inclusion graph algorithm is near-optimal for the prediction model of learning

10.1109/18.915700

Saved in:
Bibliographic Details
Main Authors: Li, Y., Long, P.M., Srinivasan, A.
Other Authors: MATERIALS SCIENCE
Format: Others
Published: 2013
Subjects:
Computational learning
One-inclusion graph algorithm
Prediction model
Sample complexity
Vapnik-Chervonenkis (VC) dimension
Online Access:http://scholarbank.nus.edu.sg/handle/10635/43369
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: National University of Singapore

Internet

http://scholarbank.nus.edu.sg/handle/10635/43369

Similar Items