AN IMPROVED METHOD FOR FINDING NEAREST NEIGHBORS

被引：13

作者：

JIANG, QY

ZHANG, WS

机构：

[1] Dept. of Appl. Math., Tsinghua University, Beijing

来源：

PATTERN RECOGNITION LETTERS | 1993年 / 14卷 / 07期

关键词：

NEAREST NEIGHBOR CLASSIFICATION; BRANCH-AND-BOUND ALGORITHM;

D O I：

10.1016/0167-8655(93)90101-I

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

This paper develops a more efficient branch-and-bound tree searching algorithm for finding the nearest neighbor to a new pattern in the design set, and a simplified version is given. Experimental results using samples from multi-dimensional Gaussian distributions demonstrate the efficiencies of our algorithms.

引用

页码：531 / 535

页数：5

共 7 条

[1] NEAREST NEIGHBOR PATTERN CLASSIFICATION
COVER, TM
HART, PE
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1967, 13 (01) : 21 - +
[2] DEVIJVER PA, 1980, 5TH P INT C PATT REC, P72
[3] FRIEDMAN JH, 1975, IEEE T COMPUT, V24, P1000, DOI 10.1109/T-C.1975.224110
[4] CONDENSED NEAREST NEIGHBOR RULE
HART, PE
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1968, 14 (03) : 515 - +
[5] AN IMPROVED BRANCH AND BOUND ALGORITHM FOR COMPUTING K-NEAREST NEIGHBORS
KAMGARPARSI, B
KANAL, LN
[J]. PATTERN RECOGNITION LETTERS, 1985, 3 (01) : 7 - 12
[6] AN EFFICIENT BRANCH-AND-BOUND NEAREST NEIGHBOR CLASSIFIER
NIEMANN, H
GOPPERT, R
[J]. PATTERN RECOGNITION LETTERS, 1988, 7 (02) : 67 - 72
[7] 2 MODIFICATIONS OF CNN
TOMEK, I
[J]. IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1976, 6 (11): : 769 - 772

← 1 →