首页> 外文OA文献 >Application of Genetic Programming for Multicategory Pattern Classification
【2h】

Application of Genetic Programming for Multicategory Pattern Classification

机译:遗传规划在多类别模式分类中的应用

摘要

This paper explores the feasibility of applying genetic programming (GP) to multicategory pattern classification problem for the first time. GP can discover relationships among observed data and express them mathematically. Multicategory pattern classification has been done traditionally by using the maximum likelihood classifier (MLC). GP-based techniques have an advantage over statistical methods because they are distribution free, i.e., no prior knowledge is needed about the statistical distribution of the data. GP also has the ability to automatically discover the discriminant features for a class. GP has been applied for two-category (class) pattern classification, In this paper, a methodology for GP-based n- class pattern classification is developed. The given n-class problem is modeled as n two-class problems, and a genetic programming classifier expression (GPCE) is evolved as a discriminant function for each class, The GPCE is trained to recognize samples belonging to its own class and reject samples belonging to other classes. A strength of association (SA) measure is computed for each GPCE to indicate the degree to which it can recognize samples belonging to its own class. The higher the value of SA, the better is the ability of a GPCE to recognize samples belonging to its own class and reject samples belonging to other classes. The SA measure is used for uniquely assigning a class to an input Feature vector. Heuristic rules are used to prevent a GPCE with a higher SA from swamping a GPCE with a lower SA, Experimental results are presented to demonstrate the applicability of CP for multicategory pattern classification, and the results obtained are found to be satisfactory, and are compared with those of the MLC, We also discuss the various issues that arise in our approach to GP- based classification, such as the creation of training sets, the role of incremental learning, and the choice of function set in the evolution of GPCEs, as well as conflict resolution for uniquely assigning a class.
机译:本文首次探讨了将遗传程序设计(GP)应用于多类别模式分类问题的可行性。 GP可以发现观察到的数据之间的关系,并以数学方式表达它们。传统上,通过使用最大似然分类器(MLC)进行了多类别模式分类。基于GP的技术相对于统计方法具有优势,因为它们是无分布的,即不需要有关数据统计分布的先验知识。 GP还具有自动发现类的判别功能的能力。 GP已经被应用于两类(类)模式分类,在本文中,开发了一种基于GP的n类模式分类的方法。给定的n类问题被建模为n个两类问题,并且遗传编程分类器表达式(GPCE)被演化为每个类的判别函数,该GPCE经过训练以识别属于其自身类的样本并拒绝属于该类的样本其他班级为每个GPCE计算关联强度(SA)量度,以指示其可以识别属于自己类别的样本的程度。 SA的值越高,GPCE识别属于其自己类别的样本并拒绝属于其他类别的样本的能力就越好。 SA度量用于将类唯一地分配给输入的特征向量。使用启发式规则来防止具有较高SA的GPCE淹没具有较低SA的GPCE,并提供实验结果以证明CP在多类别模式分类中的适用性,并且发现获得的结果令人满意,并且与我们还将讨论在基于GP的分类方法中出现的各种问题,例如,训练集的创建,增量学习的作用以及功能集在GPCE演变中的选择,以及作为唯一分配类的冲突解决方案。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号