首页> 外文会议>International Conference on Computational Intelligence and Security >A Prototype Selection Algorithm Based on Extended Near Neighbor and Affinity Change
【24h】

A Prototype Selection Algorithm Based on Extended Near Neighbor and Affinity Change

机译:基于邻近邻近邻近近邻和亲和力变化的原型选择算法

获取原文

摘要

The condensed nearest neighbor algorithm(CNN) is susceptible to pattern read sequence, abnormal patterns and so on. To deal with the above problems, through the analysis of the relationship between the whole dataset and the individual patterns, a new prototype selection algorithm is proposed based on the extended near neighbor relationship and the affinity changes. First, the proposed algorithm can obtain the detail location information according to the extended near neighbors and affinity value of each pattern. Second, by making full use of these information, the proposed algorithm adjusts the prototype selection strategy. Finally, the prototype updating strategies are adopted to achieve dynamic periodic update of the prototype set. Experimental results show that the final prototype set obtained by the proposed algorithm can better reflect the distribution of the original dataset. Moreover, the proposed algorithm can improve the average reduction ratio while maintaining the better classification accuracy and faster running time than those compared algorithms.
机译:冷凝最近邻算法(CNN)易于模式读取序列,异常模式等。为了处理上述问题,通过分析整个数据集与各个模式之间的关系,基于扩展近邻关系和亲和力变化提出了一种新的原型选择算法。首先,所提出的算法可以根据每个图案的延伸邻近邻居和亲和力值获得详细位置信息。其次,通过充分利用这些信息,所提出的算法调整了原型选择策略。最后,采用原型更新策略来实现原型定期更新的原型定期更新。实验结果表明,通过所提出的算法获得的最终原型集可以更好地反映原始数据集的分布。此外,所提出的算法可以提高平均减小率,同时保持比较更好的分类精度和比比较算法更快的运行时间。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号