...
首页> 外文期刊>Pattern Recognition: The Journal of the Pattern Recognition Society >A novel gray-based reduced NN classification method
【24h】

A novel gray-based reduced NN classification method

机译:一种基于灰色的新约简神经网络分类方法

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

In pattern recognition, instance-based learning (also known as nearest neighbor rule) has become increasingly popular and can yield excellent performance. In instance-based learning, however, the storage of training set rises along with the number of training instances. Moreover, in such a case, a new, unseen instance takes a long time to classify because all training instances have to be considered when determining the 'nearness' or 'similarity' among instances. This study presents a novel reduced classification method for instance-based learning based on the gray relational structure. Here, only some training instances in the original training set are adopted for the pattern classification tasks. The relationships among instances are first determined according to the gray relational structure. In the relational structure, the inward edoes of each training instance, indicating how many times each instance is considered as the nearest neighbor or neighbors in determining the class labels of other instances can be obtained. This method excludes training instances with no or few inward edges for the pattern classification tasks. By using the proposed instance pruning approach, new instances can be classified with a few training instances. Nine data sets are adopted to demonstrate the performance of the proposed learning approach. Experimental results indicate that the classification accuracy can be maintained when most of the training instances are pruned before learning. Additionally, the number of remained training instances in the proposal presented here is comparable to that of other existing instance pruning techniques. (c) 2006 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.
机译:在模式识别中,基于实例的学习(也称为最近邻居规则)已变得越来越流行,并且可以产生出色的性能。但是,在基于实例的学习中,训练集的存储随着训练实例的数量而增加。此外,在这种情况下,一个新的,看不见的实例需要花费很长时间进行分类,因为在确定实例之间的“接近”或“相似”时必须考虑所有训练实例。这项研究提出了一种新颖的基于灰色关联结构的基于实例的学习的简化归类方法。在此,模式分类任务仅采用原始训练集中的一些训练实例。首先根据灰色关系结构确定实例之间的关系。在关系结构中,可以获得每个训练实例的向内的edoes,指示在确定其他实例的类别标签时,每个实例被视为最接近的邻居多少次。此方法不包括用于模式分类任务的没有或很少有向内边缘的训练实例。通过使用建议的实例修剪方法,可以将新实例与一些训练实例进行分类。通过九个数据集来证明所提出的学习方法的性能。实验结果表明,在学习之前修剪大多数训练实例时,可以保持分类精度。此外,此处提出的建议中剩余的训练实例数量与其他现有的实例修剪技术相当。 (c)2006模式识别学会。由Elsevier Ltd.出版。保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号