DISTRIBUTION-FREE EXPONENTIAL ERROR BOUND FOR NEAREST NEIGHBOR PATTERN-CLASSIFICATION

被引:39
作者
FRITZ, J [1 ]
机构
[1] HUNGARIAN ACAD SCI,MATH INST,BUDAPEST,HUNGARY
关键词
D O I
10.1109/TIT.1975.1055443
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:552 / 557
页数:6
相关论文
共 7 条
[1]   NEAREST NEIGHBOR PATTERN CLASSIFICATION [J].
COVER, TM ;
HART, PE .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1967, 13 (01) :21-+
[2]  
Feller W., 1966, INTRO PROBABILITY TH, V2
[3]  
Loeve M., 1977, PROBABILITY THEORY
[4]  
REJTO L, 1973, PROBL CONTROL INFORM, V2, P67
[5]  
Rogers C. A., 1963, MATHEMATIKA, V10, P157, DOI [DOI 10.1112/S0025579300004083, 10.1112/S0025579300004083]
[6]  
WAGNER T, 1969, IEEE T INFORM THEORY, V15, P258
[7]   CONVERGENCE OF NEAREST NEIGHBOR RULE [J].
WAGNER, TJ .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1971, 17 (05) :566-+