首页> 外文会议>International Conference on Information Technology and Computer Science >Quick Recognition and Relative Minimum Distances Filtering Assisted Recognition based on Noisy-robust Rough Set
【24h】

Quick Recognition and Relative Minimum Distances Filtering Assisted Recognition based on Noisy-robust Rough Set

机译:快速识别和相对最小距离基于嘈杂鲁棒粗糙集的辅助识别

获取原文

摘要

With the development of rough set theory and it's strengths and weaknesses in the recognition field, the rule and recognition fusing method of noisy-robust rough set (NRRS) are proposed based on full normalized deposal, the nonuniform companding and simple dynamic clustering coding. The robustness of NRRS is improved by weighted reliability during training and recognition to dispose the accidental samples and conflict samples. At the same time, this paper gives the quick recognition and relative minimum distances between classes filtering assisted recognition algorithm based on NRRS. The recognition simulation shows that the method has a good anti-noise performance, processing efficiency and recognition effect.
机译:随着粗糙集理论的发展和识别领域的优势和弱点,基于完全归一化仪表,非均匀强度和简单的动态聚类编码,提出了嘈杂鲁棒粗糙集(NRRS)的规则和识别融合方法。在训练和识别期间,NRRS的稳健性得到了加权可靠性,以处理意外样品和冲突样本。与此同时,本文为基于NRRS的类过滤辅助识别算法之间提供了快速识别和相对最小距离。识别仿真表明,该方法具有良好的抗噪声性能,加工效率和识别效果。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号