一种具有动态邻域特点的自适应最近邻居算法  

Adaptive Nearest Neighbor Algorithm with Dynamic Neighborhood

作　　者：冯骥 张程 朱庆生[1,2] FENG Ji;ZHANG Cheng;ZHU Qing-sheng(College of Computer and Information Science,Chongqing Normal University,Chongqing 401331,China;Chongqing Key Laboratory of Software Theory & Technology,Chongqing University,Chongqing 400044,China)

机构地区：[1]重庆师范大学计算机与信息科学学院,重庆401331 [2]重庆大学软件理论与技术重庆市重点实验室,重庆400044

出　　处：《计算机科学》2017年第12期194-201,共8页Computer Science

基　　金：重庆市自然科学基金(cstc2013jcyjA40049);重庆师范大学基金项目(17XLB003)资助

摘　　要：传统的最近邻居算法主要分为k-最近邻居和逆最近邻居,然而二者均在邻域参数选择问题中饱受困扰。在这两种思想的基础上,提出一种具有动态邻域特点的最近邻居算法——自然邻居,并围绕其概念与特性形成了一套有效的方法。该算法从根本上克服了传统最近邻居思想在任意形状(如流型)数据集中参数选择的难题,摆脱了传统方法的参数依赖,并且取得了极佳的效果。自然邻居思想具有完善的理论模型和详细的实现算法,并且经验证其具有很强的鲁棒性和适应性。Traditional nearest neighbor algorithm includes k-nearest neighbor(KNN)and reverse nearest neighbor(RNN),and they have been proposed in the literature,but most of them are vulnerable to their parameter choice.In this paper,a novel algorithm of nearest neighbor was proposed,named natural neighbor(NaN).In contrast to KNN and RNN,it is a scale-free nearest neighbor,and it can be used in any dataset effectually,especially data on manifold.This article discussed the theoretical model and its detailed implementation algorithm of natural neighbor in a different field,and the related questions of NaN concepts were discussed by the experimental tests.

关 键 词：最近邻居 自然邻居算法 动态邻域 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]