WHEN SHOULD A LEARNING MACHINE ASK FOR HELP

被引:2
作者
COOPER, DB [1 ]
机构
[1] BROWN UNIV, DIV ENGN, PROVIDENCE, RI 02912 USA
关键词
D O I
10.1109/TIT.1974.1055259
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:455 / 471
页数:17
相关论文
共 26 条
[1]  
ABRAMSON N, 1962, IEEE T INFORM THEORY, VIT8, pS58
[2]  
ALENS N, 1967, 61512 STANF U STANF
[3]  
BELLMAN R, 1960, INTRO MATRIX ANALYSI
[4]  
Bickel P. J., 1967, 5 BERK S MATH STAT P, P401
[5]   ASYMPTOTICALLY OPTIMAL BAYES AND MINIMAX PROCEDURES IN SEQUENTIAL ESTIMATION [J].
BICKEL, PJ ;
YAHAV, JA .
ANNALS OF MATHEMATICAL STATISTICS, 1968, 39 (02) :442-&
[6]  
Breiman L., 1968, PROBABILITY
[7]  
CHEN CH, 1969, IEEE T SYST SCI CYB, VSSC5, P30
[8]   NONSUPERVISED ADAPTIVE SIGNAL DETECTION + PATTERN RECOGNITION [J].
COOPER, DB ;
COOPER, PW .
INFORMATION AND CONTROL, 1964, 7 (03) :416-&
[9]   ON SUITABLE CONDITIONS FOR STATISTICAL PATTERN RECOGNITION WITHOUT SUPERVISION [J].
COOPER, DB ;
SCHWARZ, RJ .
SIAM JOURNAL ON APPLIED MATHEMATICS, 1969, 17 (05) :872-&
[10]  
COOPER DB, 1970, IEEE T COMP, VC19, P1055