RESULTS ON LEARNABILITY AND THE VAPNIK-CHERVONENKIS DIMENSION

被引:27
作者
LINIAL, N
MANSOUR, Y
RIVEST, RL
机构
[1] HEBREW UNIV JERUSALEM,DEPT COMP SCI,JERUSALEM,ISRAEL
[2] MIT,COMP SCI LAB,CAMBRIDGE,MA 02139
基金
美国国家科学基金会;
关键词
D O I
10.1016/0890-5401(91)90058-A
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We consider the problem of learning a concept from examples in the distribution-free model by Valiant. (An essentially equivalent model, if one ignores issues of computational difficulty, was studied by Vapnik and Chervonenkis.) We introduce the notion of dynamic sampling, wherein the number of examples examined may increase with the complexity of the target concept. This method is used to establish the learnability of various concept classes with an infinite Vapnik-Chervonenkis dimension. We also discuss an important variation on the problem of learning from examples, called approximating from examples. Here we do not assume that the target concept T is a member of the concept class C from which approximations are chosen. This problem takes on particular interest when the VC dimension of C is infinite. Finally, we discuss the problem of computing the VC dimension of a finite concept set defined on a finite domain and consider the structure of classes of a fixed small dimension. © 1991.
引用
收藏
页码:33 / 49
页数:17
相关论文
共 17 条
[1]  
ANGLUIN D, 1986, YALEUDCSTR479 YAL U
[2]  
BENEDEK GM, 1988, ICALP JUL, P82
[3]  
BENEDEK GM, 1988, THESIS
[4]   LEARNABILITY AND THE VAPNIK-CHERVONENKIS DIMENSION [J].
BLUMER, A ;
EHRENFEUCHT, A ;
HAUSSLER, D ;
WARMUTH, MK .
JOURNAL OF THE ACM, 1989, 36 (04) :929-965
[5]  
BLUMER A, 1986, 18TH P ACM S THEOR C, P273
[6]   A GENERAL LOWER BOUND ON THE NUMBER OF EXAMPLES NEEDED FOR LEARNING [J].
EHRENFEUCHT, A ;
HAUSSLER, D ;
KEARNS, M ;
VALIANT, L .
INFORMATION AND COMPUTATION, 1989, 82 (03) :247-261
[7]  
HAUSSLE D, IN PRESS INFORM COMP
[8]  
KEARNS M, 1987, 4TH P INT WORKSH MAC, P337
[9]  
KEARNS M, 1987, 19TH P ACM S THEOR C, P285
[10]   ON FINDING A MINIMUM DOMINATING SET IN A TOURNAMENT [J].
MEGIDDO, N ;
VISHKIN, U .
THEORETICAL COMPUTER SCIENCE, 1988, 61 (2-3) :307-316