ON THE PERFORMANCE OF EDITED NEAREST NEIGHBOR RULES IN HIGH DIMENSIONS

被引：6

作者：

BRODER, AZ

BRUCKSTEIN, AM

KOPLOWITZ, J

机构：

[1] STANFORD UNIV,DEPT ELECT ENGN,STANFORD,CA 94305

[2] CLARKSON COLL TECHNOL,DEPT ELECT & COMP ENGN,POTSDAM,NY 13676

来源：

IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS | 1985年 / 15卷 / 01期

关键词：

D O I：

10.1109/TSMC.1985.6313401

中图分类号：

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

学科分类号：

0812 [计算机科学与技术];

摘要：

引用

页码：136 / 139

页数：4

共 9 条

[1]

NEAREST NEIGHBOR PATTERN CLASSIFICATION [J].

COVER, TM ;

HART, PE .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1967, 13 (01) :21-+

[2]

DEBRUIJN NG, 1970, ASYMPTOTIC METHODS

[3]

DEVIJVER PA, 1980, 5TH P INT C PATT REC, P72

[4]

KARLIN S, 1981, 2ND COURSE STOCHASTI

[5]

ON THE RELATION OF PERFORMANCE TO EDITING IN NEAREST NEIGHBOR RULES [J].

KOPLOWITZ, J ;

BROWN, TA .

PATTERN RECOGNITION, 1981, 13 (03) :251-255

[6]

PENROD CS, 1977, IEEE T SYST MAN CYB, V7, P92

[7]

Sommerville D. M. Y, 1929, INTRO GEOMETRY N DIM

[8]

GENERALIZATION OF K-NN RULE [J].

TOMEK, I .

IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1976, 6 (02) :121-126

[9]

ASYMPTOTIC PROPERTIES OF NEAREST NEIGHBOR RULES USING EDITED DATA [J].

WILSON, DL .

IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1972, SMC2 (03) :408-&

← 1 →