演化算法中适应度函数选择的数据包络分析应用于时间序列预测问题

Gabriela I. L. Alves, D. A. Silva, Emeson J. S. Pereira, T. Ferreira
{"title":"演化算法中适应度函数选择的数据包络分析应用于时间序列预测问题","authors":"Gabriela I. L. Alves, D. A. Silva, Emeson J. S. Pereira, T. Ferreira","doi":"10.1109/BRICS-CCI-CBIC.2013.94","DOIUrl":null,"url":null,"abstract":"Artificial Neural Networks (ANN) have been widely used in time series forecasting problem. However, a more promising approach is the combination of ANN with other intelligent techniques, such as genetic algorithms, evolutionary strategies, etc, where these evolutionary algorithms have the objective of train and adjust all parameter of the ANN. In the evolutionary process is necessary define a fitness function to guide the evolve process. Thus, for a set of possibles fitness function, how to determine the function more efficient? This paper aims to select the efficient fitness functions, through the use of Data Envelopment Analysis. This tool determines the relative efficiency of each unit under review, comparing it with each other and considering the relationship between inputs and outputs. Two different times series were used to benchmark the set of twenty fitness functions. The preliminary results show the proposed method is a promising approach for efficient selecting the fitness function.","PeriodicalId":306195,"journal":{"name":"2013 BRICS Congress on Computational Intelligence and 11th Brazilian Congress on Computational Intelligence","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2013-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Data Envelopment Analysis for Selection of the Fitness Function in Evolutionary Algorithms Applied to Time Series Forecasting Problem\",\"authors\":\"Gabriela I. L. Alves, D. A. Silva, Emeson J. S. Pereira, T. Ferreira\",\"doi\":\"10.1109/BRICS-CCI-CBIC.2013.94\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Artificial Neural Networks (ANN) have been widely used in time series forecasting problem. However, a more promising approach is the combination of ANN with other intelligent techniques, such as genetic algorithms, evolutionary strategies, etc, where these evolutionary algorithms have the objective of train and adjust all parameter of the ANN. In the evolutionary process is necessary define a fitness function to guide the evolve process. Thus, for a set of possibles fitness function, how to determine the function more efficient? This paper aims to select the efficient fitness functions, through the use of Data Envelopment Analysis. This tool determines the relative efficiency of each unit under review, comparing it with each other and considering the relationship between inputs and outputs. Two different times series were used to benchmark the set of twenty fitness functions. The preliminary results show the proposed method is a promising approach for efficient selecting the fitness function.\",\"PeriodicalId\":306195,\"journal\":{\"name\":\"2013 BRICS Congress on Computational Intelligence and 11th Brazilian Congress on Computational Intelligence\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-09-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 BRICS Congress on Computational Intelligence and 11th Brazilian Congress on Computational Intelligence\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/BRICS-CCI-CBIC.2013.94\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 BRICS Congress on Computational Intelligence and 11th Brazilian Congress on Computational Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BRICS-CCI-CBIC.2013.94","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

人工神经网络(ANN)在时间序列预测中得到了广泛的应用。然而,一种更有前途的方法是将人工神经网络与其他智能技术相结合,如遗传算法、进化策略等,这些进化算法的目标是训练和调整人工神经网络的所有参数。在进化过程中有必要定义适应度函数来指导进化过程。那么,对于一组可能的适应度函数,如何确定该函数更有效呢?本文旨在通过数据包络分析选择有效的适应度函数。该工具确定每个审查单位的相对效率,将其相互比较并考虑投入和产出之间的关系。使用两个不同的时间序列对20个适应度函数集进行基准测试。初步结果表明,该方法是一种有效选择适应度函数的方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Data Envelopment Analysis for Selection of the Fitness Function in Evolutionary Algorithms Applied to Time Series Forecasting Problem
Artificial Neural Networks (ANN) have been widely used in time series forecasting problem. However, a more promising approach is the combination of ANN with other intelligent techniques, such as genetic algorithms, evolutionary strategies, etc, where these evolutionary algorithms have the objective of train and adjust all parameter of the ANN. In the evolutionary process is necessary define a fitness function to guide the evolve process. Thus, for a set of possibles fitness function, how to determine the function more efficient? This paper aims to select the efficient fitness functions, through the use of Data Envelopment Analysis. This tool determines the relative efficiency of each unit under review, comparing it with each other and considering the relationship between inputs and outputs. Two different times series were used to benchmark the set of twenty fitness functions. The preliminary results show the proposed method is a promising approach for efficient selecting the fitness function.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信