Natural neighborhood graph-based instance reduction algorithm without parameters.

Applied Soft Computing(2018)

引用 25|浏览17
暂无评分
摘要
•It proposes a natural neighborhood graph-based instance reduction algorithm.•It solves the parameter selection problem because the proposed algorithm does not need any parameters.•It significantly improves the reduction rate, while maintaining or even improving classification accuracy.•It can reduce the number of training set greatly, and the fluctuation of reduction rates is small for different kinds of datasets.
更多
查看译文
关键词
Instance reduction,Instance-based learning,Natural neighbor,Natural neighborhood graph,K-nearest neighbor
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要