The one-inclusion graph algorithm is near-optimal for the prediction model of learning
10.1109/18.915700
Saved in:
Main Authors: | Li, Y., Long, P.M., Srinivasan, A. |
---|---|
Other Authors: | MATERIALS SCIENCE |
Format: | Others |
Published: |
2013
|
Subjects: | |
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 |
Similar Items
-
On ordinal VC-dimension and some notions of complexity
by: Martin, E., et al.
Published: (2014) -
Learning algorithm for the uniform graph partitioning problem
by: Chua, C.B., et al.
Published: (2014) -
Approximating hyper-rectangles: Learning and pseudorandom sets
by: Auer, P., et al.
Published: (2014) -
INTERACTIVE GRAPH SEARCH: ALGORITHMS AND ANALYSES
by: CONG QIANHAO
Published: (2023) -
Graph-theoretic approach to dimension witnessing
by: Ray, Maharshi, et al.
Published: (2022)