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. |
---|---|
其他作者: | MATERIALS SCIENCE |
格式: | Others |
出版: |
2013
|
主題: | |
在線閱讀: | http://scholarbank.nus.edu.sg/handle/10635/43369 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | National University of Singapore |
相似書籍
-
On ordinal VC-dimension and some notions of complexity
由: Martin, E., et al.
出版: (2014) -
Approximating hyper-rectangles: Learning and pseudorandom sets
由: Auer, P., et al.
出版: (2014) -
Learning algorithm for the uniform graph partitioning problem
由: Chua, C.B., et al.
出版: (2014) -
Graph-theoretic approach to dimension witnessing
由: Ray, Maharshi, et al.
出版: (2022) -
INTERACTIVE GRAPH SEARCH: ALGORITHMS AND ANALYSES
由: CONG QIANHAO
出版: (2023)