LEARNING NESTED DIFFERENCES OF INTERSECTION-CLOSED CONCEPT CLASSES

被引：23

作者：

HELMBOLD, D ^{[1
]}

SLOAN, R ^{[1
]}

WARMUTH, MK ^{[1
]}

机构：

[1] HARVARD UNIV,AIKEN COMPUTAT LAB,CAMBRIDGE,MA 02138

来源：

关键词：

D O I：

10.1007/BF00116036

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

引用

页码：165 / 196

页数：32

共 28 条

[1] LEARNABILITY AND THE VAPNIK-CHERVONENKIS DIMENSION
BLUMER, A
EHRENFEUCHT, A
HAUSSLER, D
WARMUTH, MK
[J]. JOURNAL OF THE ACM, 1989, 36 (04) : 929 - 965
[2] *BOARD R, 1990, 22ND P ANN ACM S THE
[3] BOUCHERON S, 1988, UNPUB LEARNABILITY P
[4] DUDLEY RM, 1984, LECTURE NOTES MATH, V1097
[5] A GENERAL LOWER BOUND ON THE NUMBER OF EXAMPLES NEEDED FOR LEARNING
EHRENFEUCHT, A
HAUSSLER, D
KEARNS, M
VALIANT, L
[J]. INFORMATION AND COMPUTATION, 1989, 82 (03) : 247 - 261
[6] EPSILON-NETS AND SIMPLEX RANGE QUERIES
HAUSSLER, D
WELZL, E
[J]. DISCRETE & COMPUTATIONAL GEOMETRY, 1987, 2 (02) : 127 - 151
[7] Haussler D., 1989, Machine Learning, V4, P7, DOI 10.1007/BF00114802
[8] HAUSSLER D, 1988, IN PRESS 29TH P ANN, P100
[9] HAUSSLER D, 1990, IN PRESS INFORMATION
[10] HELMBOLD D, 1989, 2ND P ANN WORKSH COM, P41