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

id	sg-nus-scholar.10635-43369
record_format	dspace
spelling	sg-nus-scholar.10635-433692023-10-30T22:37:24Z The one-inclusion graph algorithm is near-optimal for the prediction model of learning Li, Y. Long, P.M. Srinivasan, A. MATERIALS SCIENCE COMPUTER SCIENCE Computational learning One-inclusion graph algorithm Prediction model Sample complexity Vapnik-Chervonenkis (VC) dimension 10.1109/18.915700 IEEE Transactions on Information Theory 47 3 1257-1261 IETTA 2013-07-23T09:32:11Z 2013-07-23T09:32:11Z 2001 Others Li, Y., Long, P.M., Srinivasan, A. (2001). The one-inclusion graph algorithm is near-optimal for the prediction model of learning. IEEE Transactions on Information Theory 47 (3) : 1257-1261. ScholarBank@NUS Repository. https://doi.org/10.1109/18.915700 00189448 http://scholarbank.nus.edu.sg/handle/10635/43369 000167956600040 Scopus
institution	National University of Singapore
building	NUS Library
continent	Asia
country	Singapore Singapore
content_provider	NUS Library
collection	ScholarBank@NUS
topic	Computational learning One-inclusion graph algorithm Prediction model Sample complexity Vapnik-Chervonenkis (VC) dimension
spellingShingle	Computational learning One-inclusion graph algorithm Prediction model Sample complexity Vapnik-Chervonenkis (VC) dimension Li, Y. Long, P.M. Srinivasan, A. The one-inclusion graph algorithm is near-optimal for the prediction model of learning
description	10.1109/18.915700
author2	MATERIALS SCIENCE
author_facet	MATERIALS SCIENCE Li, Y. Long, P.M. Srinivasan, A.
format	Others
author	Li, Y. Long, P.M. Srinivasan, A.
author_sort	Li, Y.
title	The one-inclusion graph algorithm is near-optimal for the prediction model of learning
title_short	The one-inclusion graph algorithm is near-optimal for the prediction model of learning
title_full	The one-inclusion graph algorithm is near-optimal for the prediction model of learning
title_fullStr	The one-inclusion graph algorithm is near-optimal for the prediction model of learning
title_full_unstemmed	The one-inclusion graph algorithm is near-optimal for the prediction model of learning
title_sort	one-inclusion graph algorithm is near-optimal for the prediction model of learning
publishDate	2013
url	http://scholarbank.nus.edu.sg/handle/10635/43369
_version_	1781411217498177536

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

Similar Items