【24h】

Recurrent genetic programming

机译:经常性遗传编程

获取原文
获取外文期刊封面目录资料

摘要

A typical pattern recognition system consists of two stages: the pre-processing stage to extract features from the data, and the classification stage to assign the feature vector a class label. There are two kinds of feature extraction techniques with respect to the kind of data: the fixed number of features per sample generating a fixed length feature vector, and the fixed number of features per sample generating a variable length feature vector due to variable number of sub-samples (frames) for each input pattern. The first kind is the most commonly used feature vector for classification methods. The second kind is usually extracted in domains where the input sample is time-variant. Examples for such domains are speech recognition, on-line handwriting recognition, time-series data and click-stream analysis in web-mining. Traditionally a separate class of machine learning algorithms consisting of Hidden Markov Models, Recurrent-Neural Networks, etc. have been employed for classification of time variant signals. Evolutionary computation techniques like genetic algorithms and genetic programming have also been used previously to optimize the architecture for HMMs or learning the weights for recurrent-neural networks. It is difficult to model such problems using genetic programming because traditional implementation of genetic programming requires a fixed length feature vector. A trivial solution is to pre-compute the cardinality of the feature vector and pad-up the empty features by a constant and use the feature vector as input to the classifier. This severely affects the learning performance of genetic programming since the temporal variation (which is the most important aspect in these applications) is difficult to represent. In this paper we describe a recurrent frarnework for genetic programming(GP). This framework helps place GP in the class of machine learning algorithms alongside recurrent neural networks and hidden Markov models. We describe the application of recurrent genetic programming (henceforth called R-GP) for the classification of on-line handwritten numerals obtained from tablet-based input.
机译:典型的模式识别系统由两个阶段组成:预处理阶段,用于从数据中提取特征,以及分类阶段为分配特征矢量A类标签。关于数据类型的特征提取技术有两种特征提取技术:每个样本产生固定长度特征向量的固定数量,以及由于变量数量的子数,每个样本产生可变长度特征向量的固定数量的特征-Samples(帧)用于每个输入模式。第一种是分类方法最常用的特征向量。第二种通常在输入样本是时变的域中提取。此类域的示例是语音识别,在线手写识别,时间序列数据和Web挖掘中的单击流分析。传统上,由隐马尔可夫模型,反复性 - 神经网络等组成的单独的机器学习算法已经用于分类时间变量信号。此前,还使用了遗传算法和遗传编程等进化计算技术,以优化用于HMM的架构或学习反复性神经网络的权重。难以使用遗传编程模拟这些问题,因为传统的遗传编程的实现需要固定长度特征向量。琐碎的解决方案是预先计算特征向量的基数,并通过常量填充空特征,并使用要素矢量作为输入到分类器。这严重影响了基因编程的学习性能,因为难以表示时间变化(这是这些应用中最重要的方面)。在本文中,我们描述了一种用于遗传编程(GP)的经常性Frarnework。该框架有助于将GP放置在机器学习算法中,伴随着复发性神经网络和隐藏的马尔可夫模型。我们描述了复发性遗传编程(以后称为R-GP)的应用,用于从基于片剂的输入获得的在线手写数字的分类。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号