LEARNABILITY AND THE VAPNIK-CHERVONENKIS DIMENSION

被引：1003

作者：

BLUMER, A

EHRENFEUCHT, A

HAUSSLER, D

WARMUTH, MK

机构：

[1] UNIV COLORADO, DEPT COMP SCI, BOULDER, CO 80302 USA

[2] UNIV CALIF SANTA CRUZ, DEPT COMP & INFORMAT SCI, SANTA CRUZ, CA 95064 USA

来源：

JOURNAL OF THE ACM | 1989年 / 36卷 / 04期

关键词：

D O I：

10.1145/76359.76371

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：929 / 965

页数：37

共 69 条

[21]

EHRENFEUCHT A, IN PRESS INF COMPUT

[22]

Garey M. R., 1979, COMPUTERS INTRACTABI

[23] COMPUTATIONAL COMPLEXITY OF PROBABILISTIC TURING MACHINES [J].

GILL, J .

SIAM JOURNAL ON COMPUTING, 1977, 6 (04) :675-695

[24]

GINE E, 1986, LECTURE NOTES MATH, V1221

[25] HOW TO CONSTRUCT RANDOM FUNCTIONS [J].

GOLDREICH, O ;

GOLDWASSER, S ;

MICALI, S .

JOURNAL OF THE ACM, 1986, 33 (04) :792-807

[26] LINEAR FUNCTION NEURONS - STRUCTURE AND TRAINING [J].

HAMPSON, SE ;

VOLPER, DJ .

BIOLOGICAL CYBERNETICS, 1986, 53 (04) :203-217

[27]

Haussler D., 1988, 29th Annual Symposium on Foundations of Computer Science (IEEE Cat. No.88CH2652-6), P100, DOI 10.1109/SFCS.1988.21928

[28] EPSILON-NETS AND SIMPLEX RANGE QUERIES [J].

HAUSSLER, D ;

WELZL, E .

DISCRETE & COMPUTATIONAL GEOMETRY, 1987, 2 (02) :127-151

[29] QUANTIFYING INDUCTIVE BIAS - AI LEARNING ALGORITHMS AND VALIANTS LEARNING FRAMEWORK [J].

HAUSSLER, D .

ARTIFICIAL INTELLIGENCE, 1988, 36 (02) :177-221

[30]

HAUSSLER D, 1987, 4TH P INT WORKSH MAC, P324

← 1 2 3 4 5 6 7 →