2015 IEEE Congress on Evolutionary Computation (CEC)最新文献

筛选
英文 中文
Solving CEC 2015 multi-modal competition problems using neighborhood based speciation differential evolution 基于邻域的物种差异进化求解CEC 2015多模态竞争问题
2015 IEEE Congress on Evolutionary Computation (CEC) Pub Date : 2015-05-25 DOI: 10.1109/CEC.2015.7257291
B. Qu, Jing J. Liang, Z. Wang, D. M. Liu
{"title":"Solving CEC 2015 multi-modal competition problems using neighborhood based speciation differential evolution","authors":"B. Qu, Jing J. Liang, Z. Wang, D. M. Liu","doi":"10.1109/CEC.2015.7257291","DOIUrl":"https://doi.org/10.1109/CEC.2015.7257291","url":null,"abstract":"In this article, a recently proposed niching algorithm called neighborhood based speciation Differential Evolution (NSDE) is used to solve CEC 2015 multi-modal competition problems. Although DE algorithm is effective in solving single global optimal, the result is not acceptalbe when solving multi-optima problems. NSDE was proposed to enable DE with the ability of handling multi-modal optimization problems. In NSDE, the mutation is performed within each Euclidean neighborhood. During the evolution the population of NSDE will evolve toward the respective global/local optimum and the neighborhood mutation can maintain the multiple optima found. The performance of NSDE is compared with the original SDE. From the simulation results, we can observe that NSDE is effective in solving multi-modal optimization problems.","PeriodicalId":403666,"journal":{"name":"2015 IEEE Congress on Evolutionary Computation (CEC)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124467585","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Nonlinear equation systems solved by many-objective Hype 用多目标Hype求解非线性方程组
2015 IEEE Congress on Evolutionary Computation (CEC) Pub Date : 2015-05-25 DOI: 10.1109/CEC.2015.7257222
Sha Qin, Sanyou Zeng, Wei Dong, Xi Li
{"title":"Nonlinear equation systems solved by many-objective Hype","authors":"Sha Qin, Sanyou Zeng, Wei Dong, Xi Li","doi":"10.1109/CEC.2015.7257222","DOIUrl":"https://doi.org/10.1109/CEC.2015.7257222","url":null,"abstract":"A difficulty in solving nonlinear equation systems (NESs) stays in finding all the solutions for NES. This paper uses multi-objective evolutionary techniques to overcome it. We converted the NES into a multi-objective optimization problem (MOP) with a parameter C. The Pareto-optimal set of the MOP becomes the solutions of the NES when the parameter C gets to infinity. Next, a multi-objective evolutionary algorithm (MOEA) is used to solve the transformed MOP, during which C is gradually approaching infinity. A significant feature of this algorithm is that there is one-to-one relationship between the Pareto optimal set and the Pareto front, which suggests that different solutions have different objective values in the MOP. Thus the MOEA can find multi-solutions of the NES in a single run. Since the MOP is a multi-objective problem in many cases, this paper applies an advanced multi-objective evolutionary algorithm (i.e., Hype algorithm) to solve NES. Our experiment shows better results than or competitive to the four mentioned single-objective optimization in a set of test cases.","PeriodicalId":403666,"journal":{"name":"2015 IEEE Congress on Evolutionary Computation (CEC)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126394050","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 14
An artificial bee colony algorithm with a memory scheme for dynamic optimization problems 动态优化问题的一种具有记忆方案的人工蜂群算法
2015 IEEE Congress on Evolutionary Computation (CEC) Pub Date : 2015-05-25 DOI: 10.1109/CEC.2015.7257217
H. Nakano, Masataka Kojima, A. Miyauchi
{"title":"An artificial bee colony algorithm with a memory scheme for dynamic optimization problems","authors":"H. Nakano, Masataka Kojima, A. Miyauchi","doi":"10.1109/CEC.2015.7257217","DOIUrl":"https://doi.org/10.1109/CEC.2015.7257217","url":null,"abstract":"In Dynamic Optimization Problems (DOPs), the characteristics of the problems change dynamically due to various kinds of factors. In these problems, basic optimization algorithms decrease the searching performances, because the effective solutions obtained in the past search process change into ineffective ones. For high-order dimensional DOPs, we have proposed an Improved ABC (IABC) algorithm. In this paper, the IABC algorithm is farther modified in order to develop the searching performances for DOPs. In the proposed algorithm, basically, two schemes are added to the conventional IABC: a simple memory scheme and a simple detection scheme for dynamic changes. By performing the numerical experiments, the effectiveness of the proposed algorithm is confirmed.","PeriodicalId":403666,"journal":{"name":"2015 IEEE Congress on Evolutionary Computation (CEC)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128015507","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 17
Ring optimization with extinction 消光环优化
2015 IEEE Congress on Evolutionary Computation (CEC) Pub Date : 2015-05-25 DOI: 10.1109/CEC.2015.7257040
D. Ashlock, Sierra Gillis, G. Fogel
{"title":"Ring optimization with extinction","authors":"D. Ashlock, Sierra Gillis, G. Fogel","doi":"10.1109/CEC.2015.7257040","DOIUrl":"https://doi.org/10.1109/CEC.2015.7257040","url":null,"abstract":"Extinction is a natural process that drives biological evolution. In this study the impact of introducing extinction operators into ring optimization was examined. Ring optimizers are spatially structured evolutionary optimizers inspired by the biological phenomenon of a ring species. A small initial population is introduced into a ring-structured space and spreads, using the spatial structure to manage the exploration/exploitation trade-off of the algorithm. Extinction operators eliminate a substantial fraction of the current population, in effect resetting the algorithm to a more exploratory state. Two types of extinction operators are tested and compared. The “deluge operator” removes population members with lower fitness while the “asteroid operator” removes population members in a contiguous block of the ring. Three benchmark functions were used, one a discrete simulation and the other two open-ended continuous real functions. The behavior of the extinction operators are different for each of the benchmark functions. The differences in behavior of the extinction operators are explained in terms of the fitness landscapes of the benchmark functions.","PeriodicalId":403666,"journal":{"name":"2015 IEEE Congress on Evolutionary Computation (CEC)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125419952","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Mining group stock portfolio by using grouping genetic algorithms 利用分组遗传算法挖掘组股组合
2015 IEEE Congress on Evolutionary Computation (CEC) Pub Date : 2015-05-25 DOI: 10.1109/CEC.2015.7256964
Chun-Hao Chen, Cheng-Bon Lin, Chao-Chun Chen
{"title":"Mining group stock portfolio by using grouping genetic algorithms","authors":"Chun-Hao Chen, Cheng-Bon Lin, Chao-Chun Chen","doi":"10.1109/CEC.2015.7256964","DOIUrl":"https://doi.org/10.1109/CEC.2015.7256964","url":null,"abstract":"In this paper, a grouping genetic algorithm based approach is proposed for dividing stocks into groups and mining a set of stock portfolios, namely group stock portfolio. Each chromosome consists of three parts. Grouping and stock parts are used to indicate how to divide stocks into groups. Stock portfolio part is used to represent the purchased stocks and their purchased units. The fitness of each chromosome is evaluated by the group balance and the portfolio satisfaction. The group balance is utilized to make the groups represented by the chromosome have as similar number of stocks as possible. The portfolio satisfaction is used to evaluate the goodness of profits and satisfaction of investor's requests of all possible portfolio combinations that can generate from a chromosome. Experiments on a real data were also made to show the effectiveness of the proposed approach.","PeriodicalId":403666,"journal":{"name":"2015 IEEE Congress on Evolutionary Computation (CEC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125579451","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 17
Bacterial Foraging Optimization for intensity-based medical image registration 基于强度的医学图像配准细菌觅食优化
2015 IEEE Congress on Evolutionary Computation (CEC) Pub Date : 2015-05-25 DOI: 10.1109/CEC.2015.7257187
E. Bermejo, A. Valsecchi, S. Damas, O. Cordón
{"title":"Bacterial Foraging Optimization for intensity-based medical image registration","authors":"E. Bermejo, A. Valsecchi, S. Damas, O. Cordón","doi":"10.1109/CEC.2015.7257187","DOIUrl":"https://doi.org/10.1109/CEC.2015.7257187","url":null,"abstract":"Image registration (IR) or image alignment is a fundamental step in medical image analysis when multiple images are involved. In most of such applications, the registration is performed following the intensity-based approach, which turns IR into a complex, computationally expensive, continuous optimization problem. In this paper, we introduce a new technique for intensity-based medical IR using the Bacterial Foraging Optimization Algorithm (BFOA), a novel bio-inspired metaheuristic. BFOA has recently obtained promising results in many real-world applications, including feature-based IR. The new algorithm is compared on a complex medical IR application against recent, outstanding IR techniques both traditional and based on meta-heuristics. The results show that our proposal is competitive with the state of the art, making BFOA a promising solution to tackle other complex, real-world optimization problems.","PeriodicalId":403666,"journal":{"name":"2015 IEEE Congress on Evolutionary Computation (CEC)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125971299","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Evolutionary semi-supervised ordinal regression using weighted kernel Fisher discriminant analysis 基于加权核Fisher判别分析的进化半监督有序回归
2015 IEEE Congress on Evolutionary Computation (CEC) Pub Date : 2015-05-25 DOI: 10.1109/CEC.2015.7257300
Yuzhou Wu, Yu Sun, Xinle Liang, K. Tang, Zixing Cai
{"title":"Evolutionary semi-supervised ordinal regression using weighted kernel Fisher discriminant analysis","authors":"Yuzhou Wu, Yu Sun, Xinle Liang, K. Tang, Zixing Cai","doi":"10.1109/CEC.2015.7257300","DOIUrl":"https://doi.org/10.1109/CEC.2015.7257300","url":null,"abstract":"Ordinal regression has a wide range of applications, while it is intractable to be solved when lacking sufficient labeled data. In this paper, we propose an evolutionary semi-supervised kernel Fisher discriminant approach for ordinal regression. The proposed algorithm obtains the projection and thresholds by incorporating the unlabeled data with a weighting scheme, where the weights indicate the degrees of contributions to the class distribution by different training instances. The projection maps the original data to a one-dimensional space, and the thresholds are used for the prediction. The weights are computed with a label propagation method first. However, it is not always accurate. In order to further tune the weights to be more accurate, the differential evolution algorithm is applied here in this work. By a delicate weight update rule, the weights can be evolved indirectly. This tuning scheme makes the size of evolutionary individual just associated with the number of ranks rather than the number of instances. The experimental studies demonstrate that our algorithm can effectively use unlabeled data and yield satisfactory learning performance.","PeriodicalId":403666,"journal":{"name":"2015 IEEE Congress on Evolutionary Computation (CEC)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127932945","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
A double swarm methodology for parameter estimation in oscillating Gene Regulatory Networks 振荡基因调控网络参数估计的双群方法
2015 IEEE Congress on Evolutionary Computation (CEC) Pub Date : 2015-05-25 DOI: 10.1109/CEC.2015.7257179
Marco S. Nobile, H. Iba
{"title":"A double swarm methodology for parameter estimation in oscillating Gene Regulatory Networks","authors":"Marco S. Nobile, H. Iba","doi":"10.1109/CEC.2015.7257179","DOIUrl":"https://doi.org/10.1109/CEC.2015.7257179","url":null,"abstract":"S-systems are mathematical models based on the power-law formalism, which are widely employed for the investigation of Gene Regulatory Networks (GRNs). Because of their complex dynamics - characterized by multi-modality and nonlinearity-the parameterization of S-systems is far from straightforward, demanding global optimization techniques. The problem of parameter estimation of S-systems is further complicated when the desired dynamics is characterized by oscillations. In this work, we describe a novel methodology based on Particle Swarm Optimization for the automatic parameterization of oscillating Ssystems. In this methodology, two swarms perform independent optimizations, and cooperate by periodically exchanging the best particles. The two swarms exploit two different fitness functions: a traditional point-to-point distance, and a spectra-based fitness function. We show that this cooperative approach allows the double swarm to outperform the common methodology, based on a single swarm exploiting a single fitness function. We demonstrate the effectiveness of our method using a GRN of five genes, performing tests of increasing complexity, up to the simultaneous inference of 17 parameters.","PeriodicalId":403666,"journal":{"name":"2015 IEEE Congress on Evolutionary Computation (CEC)","volume":"360 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115902601","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
Deep community detection based on memetic algorithm 基于模因算法的深度社区检测
2015 IEEE Congress on Evolutionary Computation (CEC) Pub Date : 2015-05-25 DOI: 10.1109/CEC.2015.7256952
Shanfeng Wang, Maoguo Gong, Bo Shen, Zhao Wang, Qing Cai, L. Jiao
{"title":"Deep community detection based on memetic algorithm","authors":"Shanfeng Wang, Maoguo Gong, Bo Shen, Zhao Wang, Qing Cai, L. Jiao","doi":"10.1109/CEC.2015.7256952","DOIUrl":"https://doi.org/10.1109/CEC.2015.7256952","url":null,"abstract":"Deep community can be detected by removing noise nodes or edges from a network. A centrality measure, named local Fiedler vector centrality is proposed for deep community detection. Algorithms to optimize local Fiedler vector centrality are either with high computation complexity or difficult to find the optimal solution of local Fiedler vector centrality. In this paper, a novel memetic algorithm is proposed to maximize local Fiedler vector centrality for deep community detection. Experiments of our proposed memetic algorithm on four real world networks demonstrate that our algorithm can find optimal solution of local Fiedler vector centrality and is effective to discover deep communities.","PeriodicalId":403666,"journal":{"name":"2015 IEEE Congress on Evolutionary Computation (CEC)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132240567","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Interactive differential evolution using time information required for user's selection: In a case of optimizing fragrance composition 使用用户选择所需的时间信息的交互式差分进化:在优化香水成分的情况下
2015 IEEE Congress on Evolutionary Computation (CEC) Pub Date : 2015-05-25 DOI: 10.1109/CEC.2015.7257155
M. Fukumoto, M. Inoue, Shimpei Koga, Jun-ichi Imai
{"title":"Interactive differential evolution using time information required for user's selection: In a case of optimizing fragrance composition","authors":"M. Fukumoto, M. Inoue, Shimpei Koga, Jun-ichi Imai","doi":"10.1109/CEC.2015.7257155","DOIUrl":"https://doi.org/10.1109/CEC.2015.7257155","url":null,"abstract":"Interactive Evolutionary Computation (IEC) spreads its area of applications. As an example of the applications, we have already proposed an IEC that optimizes fragrance composition suited to each user's feelings by using Interactive Differential Evolution (IDE). To create the fragrance, six aroma sources were mixed, and the intensity of them were target of optimization. Paired comparison was employed as subjective evaluation method. To enhance searching ability of the IDE method, this study proposes a new IDE utilizing both of evolution level of DE's vector (solution candidate) and time information required in user's selection in the paired comparison. In other words, shorter time duration required in the selection is considered as there is larger difference of fitness level between two vectors. Winner vector tended to have chance to evolve itself. These schemes in the proposed method are expected to accelerate searching better solutions. In this study, we constructed an IDE system optimizing fragrances based on the proposed method. Furthermore, with the IDE system, we conducted smelling experiments for investigating the fundamental efficiency of the proposed method. Target of creation was relaxing fragrance. The experimental results showed that obtained fragrances in the last generation was evaluated better than fragrances in initial generation significantly (P<;0.01).","PeriodicalId":403666,"journal":{"name":"2015 IEEE Congress on Evolutionary Computation (CEC)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132564341","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 12
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信