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
相关论文
共 50 条
  • [1] ALGORITHM FOR FINDING NEAREST NEIGHBORS
    DELANNOY, C
    RAIRO-INFORMATIQUE-COMPUTER SCIENCE, 1980, 14 (03): : 275 - 286
  • [2] wNeighbors: A Method for Finding k Nearest Neighbors in Weighted Regions
    Li, Chuanwen
    Gu, Yu
    Yu, Ge
    Li, Fangfang
    DATABASE SYSTEMS FOR ADVANCED APPLICATIONS, PT II, 2011, 6588 : 134 - 148
  • [3] Improved Euclidean Distance in the K Nearest Neighbors Method
    Boucetta, Cherifa
    Hussenet, Laurent
    Herbin, Michel
    INNOVATIONS FOR COMMUNITY SERVICES, I4CS 2023, 2023, 1876 : 315 - 324
  • [4] Finding reverse nearest neighbors by region
    Adhinugraha, Kiki Maulana
    Taniar, David
    Indrawan, Maria
    CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2014, 26 (05): : 1142 - 1156
  • [5] FINDING NEAREST NEIGHBORS WITH VORONOI TESSELLATIONS
    MURPHY, OJ
    SELKOW, SM
    INFORMATION PROCESSING LETTERS, 1990, 34 (01) : 37 - 41
  • [6] Finding Nearest Neighbors in Crystallography with NearTree
    Andrews, L.
    Bernstein, H.
    ACTA CRYSTALLOGRAPHICA A-FOUNDATION AND ADVANCES, 2020, 76 : A140 - A140
  • [7] Efficient bounds in finding Aggregate Nearest Neighbors
    Namnandorj, Sansarkhuu
    Chen, Hanxiong
    Furuse, Kazutaka
    Ohbo, Nobuo
    DATABASE AND EXPERT SYSTEMS APPLICATIONS, PROCEEDINGS, 2008, 5181 : 693 - 700
  • [8] ITERATED NEAREST NEIGHBORS AND FINDING MINIMAL POLYTOPES
    EPPSTEIN, D
    ERICKSON, J
    DISCRETE & COMPUTATIONAL GEOMETRY, 1994, 11 (03) : 321 - 350
  • [9] Algorithm for finding all k nearest neighbors
    Piegl, LA
    Tiller, W
    COMPUTER-AIDED DESIGN, 2002, 34 (02) : 167 - 172
  • [10] A Clustering Method Based on Improved Density Estimation and Shared Nearest Neighbors
    Guan, Ying
    Li, Yaru
    Li, Bin
    Lu, Yonggang
    INTELLIGENT COMPUTING METHODOLOGIES, PT III, 2022, 13395 : 18 - 31
12345