A FAST K NEAREST NEIGHBOR FINDING ALGORITHM BASED ON THE ORDERED PARTITION

被引：68

作者：

KIM, BS ^{[1
]}

PARK, SB ^{[1
]}

机构：

[1] KOREA ADV INST SCI & TECHNOL,DEPT ELECT ENGN,SEOUL 131,SOUTH KOREA

来源：

关键词：

D O I：

10.1109/TPAMI.1986.4767859

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

引用

页码：761 / 766

页数：6

共 8 条

[1] NEAREST NEIGHBOR PATTERN CLASSIFICATION [J].

COVER, TM ;

HART, PE .

[2]

FISCHER FP, 1970 P NEC, P481

[3]

Friedman J. H., 1977, ACM Transactions on Mathematical Software, V3, P209, DOI 10.1145/355744.355745

[4]

FRIEDMAN JH, 1975, IEEE T COMPUT, V24, P1000, DOI 10.1109/T-C.1975.224110

[5]

KIM BS, 1985, THESIS KOREA ADV I S

[6] A NONPARAMETRIC ESTIMATE OF A MULTIVARIATE DENSITY-FUNCTION [J].

LOFTSGAARDEN, DO ;

QUESENBERRY, CP .

ANNALS OF MATHEMATICAL STATISTICS, 1965, 36 (03) :1049-1051

[7] CONVERGENCE OF NEAREST NEIGHBOR RULE [J].

WAGNER, TJ .

[8] TECHNIQUE TO IDENTIFY NEAREST NEIGHBORS [J].

YUNCK, TP .

IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1976, 6 (10) :678-683