BRANCH AND BOUND ALGORITHM FOR COMPUTING K-NEAREST NEIGHBORS

被引：407

作者：

FUKUNAGA, K ^{[1
]}

NARENDRA, PM ^{[1
]}

机构：

[1] PURDUE UNIV,SCH ELECT ENGN,W LAFAYETTE,IN 47907

来源：

关键词：

D O I：

10.1109/T-C.1975.224297

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：750 / 753

页数：4

共 9 条

[1]

Ball GH, 1965, ISODATA NOVEL METHOD

[2] NEAREST NEIGHBOR PATTERN CLASSIFICATION [J].

COVER, TM ;

HART, PE .

[3]

FISCHER FP, 1970, DEC P NAT EL C, V26, P481

[4] BACKTRACK PROGRAMMING [J].

GOLOMB, SW ;

BAUMERT, LD .

[5] CONDENSED NEAREST NEIGHBOR RULE [J].

HART, PE .

[6]

LAWLER EL, 1966, OPER RES, V149

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

LOFTSGAARDEN, DO ;

QUESENBERRY, CP .

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

[8]

MacQueen J., 1967, P 5 BERK S MATH STAT, P281

[9]

NILSSON NJ, 1971, PROBLEM SOLVING METH, pCH3