k-最近邻算法
计算机科学
非参数统计
灵敏度(控制系统)
航程(航空)
样品(材料)
人工智能
机器学习
算法
数据挖掘
理论计算机科学
数学
计量经济学
工程类
色谱法
电子工程
航空航天工程
化学
作者
Francesc J. Ferri,J. Albert,Enrique Vidal
出处
期刊:IEEE transactions on systems, man, and cybernetics
[Institute of Electrical and Electronics Engineers]
日期:1999-01-01
卷期号:29 (5): 667-672
被引量:69
摘要
The edited nearest neighbor classification rules constitute a valid alternative to k-NN rules and other nonparametric classifiers. Experimental results with synthetic and real data from various domains and from different researchers and practitioners suggest that some editing algorithms (especially, the optimal ones) are very sensitive to the total number of prototypes considered. This paper investigates the possibility of modifying optimal editing to cope with a broader range of practical situations. Most previously introduced editing algorithms are presented in a unified form and their different properties (acid not just their asymptotic behavior) are intuitively analyzed. The results show the relative limits in the applicability of different editing algorithms.
科研通智能强力驱动
Strongly Powered by AbleSci AI