k-最近邻算法
最佳垃圾箱优先
大边距最近邻
最近邻搜索
最近邻链算法
最近邻图
计算机科学
趋同(经济学)
数据挖掘
贝叶斯定理
决策规则
朴素贝叶斯分类器
模式识别(心理学)
人工智能
贝叶斯概率
支持向量机
相关聚类
树冠聚类算法
聚类分析
经济增长
经济
出处
期刊:IEEE Transactions on Systems, Man, and Cybernetics
[Institute of Electrical and Electronics Engineers]
日期:1972-07-01
卷期号:SMC-2 (3): 408-421
被引量:1901
标识
DOI:10.1109/tsmc.1972.4309137
摘要
The convergence properties of a nearest neighbor rule that uses an editing procedure to reduce the number of preclassified samples and to improve the performance of the rule are developed. Editing of the preclassified samples using the three-nearest neighbor rule followed by classification using the single-nearest neighbor rule with the remaining preclassified samples appears to produce a decision procedure whose risk approaches the Bayes' risk quite closely in many problems with only a few preclassified samples. The asymptotic risk of the nearest neighbor rules and the nearest neighbor rules using edited preclassified samples is calculated for several problems.
科研通智能强力驱动
Strongly Powered by AbleSci AI