THE STRENGTH OF WEAK LEARNABILITY

被引：1426

作者：

SCHAPIRE, RE

机构：

来源：

MACHINE LEARNING | 1990年 / 5卷 / 02期

关键词：

D O I：

10.1007/BF00116037

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

引用

页码：197 / 227

页数：31

共 25 条

[1] FINDING PATTERNS COMMON TO A SET OF STRINGS [J].

ANGLUIN, D .

JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1980, 21 (01) :46-62

[2]

Angluin D., 1988, Machine Learning, V2, P319, DOI 10.1023/A:1022821128753

[3] FAST PROBABILISTIC ALGORITHMS FOR HAMILTONIAN CIRCUITS AND MATCHINGS [J].

ANGLUIN, D ;

VALIANT, LG .

JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1979, 18 (02) :155-193

[4]

BAUM EB, 1989, UNPUB LEARNING UNION

[5] OCCAM RAZOR [J].

BLUMER, A ;

EHRENFEUCHT, A ;

HAUSSLER, D ;

WARMUTH, MK .

INFORMATION PROCESSING LETTERS, 1987, 24 (06) :377-380

[6] LEARNABILITY AND THE VAPNIK-CHERVONENKIS DIMENSION [J].

BLUMER, A ;

EHRENFEUCHT, A ;

HAUSSLER, D ;

WARMUTH, MK .

JOURNAL OF THE ACM, 1989, 36 (04) :929-965

[7]

BOARD R, 1990, 22ND P ANN ACM S THE

[8]

BOUCHERON S, 1988, 1988 P WORKSH COMP L, P125

[9] LEARNING DECISION TREES FROM RANDOM EXAMPLES [J].

EHRENFEUCHT, A ;

HAUSSLER, D .

INFORMATION AND COMPUTATION, 1989, 82 (03) :231-246

[10]

FLOYD S, 1989, 2ND P ANN WORKSH COM, P349

← 1 2 3 →