Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600)最新文献

筛选
英文 中文
A comparison of neutral landscapes - NK, NKp and NKq 中性景观的比较——NK、NKp和NKq
N. Geard, Janet Wiles, J. Hallinan, Bradley Tonkes, B. Skellett
{"title":"A comparison of neutral landscapes - NK, NKp and NKq","authors":"N. Geard, Janet Wiles, J. Hallinan, Bradley Tonkes, B. Skellett","doi":"10.1109/CEC.2002.1006234","DOIUrl":"https://doi.org/10.1109/CEC.2002.1006234","url":null,"abstract":"Recent research in molecular evolution has raised awareness of the importance of selective neutrality. Several different models of neutrality have been proposed based on Kauffman's well-known NK landscape model. Two of these models, NKp and NKq, are investigated and found to display significantly different structural properties. The fitness distributions of these neutral landscapes reveal that their levels of correlation with non-neutral landscapes are significantly different, as are the distributions of neutral mutations. In this paper we describe a series of simulations of a hill climbing search algorithm on NK, NKp and NKq landscapes with varying levels of epistatic interaction. These simulations demonstrate differences in the way that epistatic interaction affects the 'searchability' of neutral landscapes. We conclude that the method used to implement neutrality has an impact on both the structure of the resulting landscapes and on the performance of evolutionary search algorithms on these landscapes. These model-dependent effects must be taken into consideration when modelling biological phenomena.","PeriodicalId":184547,"journal":{"name":"Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125512114","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}
引用次数: 46
Evolutionary computation approach to Wiener model identification 维纳模型识别的进化计算方法
T. Hatanaka, K. Uosaki, M. Koga
{"title":"Evolutionary computation approach to Wiener model identification","authors":"T. Hatanaka, K. Uosaki, M. Koga","doi":"10.1109/CEC.2002.1007047","DOIUrl":"https://doi.org/10.1109/CEC.2002.1007047","url":null,"abstract":"A novel approach for nonlinear dynamic system identification is addressed for Wiener models, which are composed of a linear dynamic system part followed by a nonlinear static part. Assuming the nonlinear static part is invertible, we approximate the inverse function by a piecewise linear function, which is estimated by using the evolutionary computation approach such as genetic algorithm (GA) and evolution strategies (ES), while we estimate the linear dynamic system part by the least squares method.","PeriodicalId":184547,"journal":{"name":"Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114943594","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}
引用次数: 16
Comparing a coevolutionary genetic algorithm for multiobjective optimization 比较一种多目标优化的协同进化遗传算法
J. Lohn, W. Kraus, G. Haith
{"title":"Comparing a coevolutionary genetic algorithm for multiobjective optimization","authors":"J. Lohn, W. Kraus, G. Haith","doi":"10.1109/CEC.2002.1004406","DOIUrl":"https://doi.org/10.1109/CEC.2002.1004406","url":null,"abstract":"We present results from a study comparing a recently developed coevolutionary genetic algorithm (CGA) against a set of evolutionary algorithms using a suite of multiobjective optimization benchmarks. The CGA embodies competitive coevolution and employs a simple, straightforward target population representation and fitness calculation based on developmental theory of learning. Because of these properties, setting up the additional population is trivial making implementation no more difficult than using a standard GA. Empirical results using a suite of two-objective test functions indicate that this CGA performs well at finding solutions on convex, nonconvex, discrete, and deceptive Pareto-optimal fronts, while giving respectable results on a nonuniform optimization. On a multimodal Pareto front, the CGA yields poor coverage across the Pareto front, yet finds a solution that dominates all the solutions produced by the eight other algorithms.","PeriodicalId":184547,"journal":{"name":"Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114950236","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}
引用次数: 91
OCR parameters tuning by means of evolution strategies for aircraft's tail number recognition 基于进化策略的飞机尾号识别OCR参数整定
A. Berlanga, J. G. Herrero, J. M. Molina, J. Besada, J. Portillo
{"title":"OCR parameters tuning by means of evolution strategies for aircraft's tail number recognition","authors":"A. Berlanga, J. G. Herrero, J. M. Molina, J. Besada, J. Portillo","doi":"10.1109/CEC.2002.1007045","DOIUrl":"https://doi.org/10.1109/CEC.2002.1007045","url":null,"abstract":"This paper describes the optimisation of some parameters of an optical character recognition system (OCR). The optimisation is performed by means of evolution strategies (ES) in order to maximize the pattern discrimination. The pattern set is a vectorial representation of the character set. The OCR is applied to identify the tail number of an aircraft moving on the airfield runway. The proposed approach is discussed together with some results obtained on a benchmark data set of aircraft tail numbers.","PeriodicalId":184547,"journal":{"name":"Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121879492","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
Particle swarm optimisation with spatial particle extension 具有空间粒子扩展的粒子群优化
T. Krink, J. Vesterstrom, J. Riget
{"title":"Particle swarm optimisation with spatial particle extension","authors":"T. Krink, J. Vesterstrom, J. Riget","doi":"10.1109/CEC.2002.1004460","DOIUrl":"https://doi.org/10.1109/CEC.2002.1004460","url":null,"abstract":"In this paper, we introduce spatial extension to particles in the PSO model in order to overcome premature convergence in iterative optimisation. The standard PSO and the new model (SEPSO) are compared w.r.t. performance on well-studied benchmark problems. We show that the SEPSO indeed managed to keep diversity in the search space and yielded superior results.","PeriodicalId":184547,"journal":{"name":"Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600)","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129772651","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}
引用次数: 316
Evolutionary adaptive-critic methods for reinforcement learning 强化学习的进化适应批评方法
Xin Xu, Han-gen He, D. Hu
{"title":"Evolutionary adaptive-critic methods for reinforcement learning","authors":"Xin Xu, Han-gen He, D. Hu","doi":"10.1109/CEC.2002.1004434","DOIUrl":"https://doi.org/10.1109/CEC.2002.1004434","url":null,"abstract":"In this paper, a novel hybrid learning method is proposed for reinforcement learning problems with continuous state and action spaces. The reinforcement learning problems are modeled as Markov decision processes (MDPs) and the hybrid learning method combines evolutionary algorithms with gradient-based adaptive heuristic critic (AHC) algorithms to approximate the optimal policy of MDPs. The suggested method takes the advantages of evolutionary learning and gradient-based reinforcement learning to solve reinforcement learning problems. Simulation results on the learning control of an acrobot illustrate the efficiency of the presented method.","PeriodicalId":184547,"journal":{"name":"Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129048584","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
Performance tradeoff between evolutionary computation (EC)/adaptive boosting (AB) hybrid and support vector machine breast cancer classification paradigms 进化计算(EC)/自适应增强(AB)混合算法与支持向量机乳腺癌分类范式的性能权衡
W. Land, M. Bryden, J. Lo, Daniel W. McKee, F. R. Anderson
{"title":"Performance tradeoff between evolutionary computation (EC)/adaptive boosting (AB) hybrid and support vector machine breast cancer classification paradigms","authors":"W. Land, M. Bryden, J. Lo, Daniel W. McKee, F. R. Anderson","doi":"10.1109/CEC.2002.1006231","DOIUrl":"https://doi.org/10.1109/CEC.2002.1006231","url":null,"abstract":"This paper describes a breast cancer classification performance trade-off analysis using two computational intelligence paradigms. The first, an evolutionary programming (EP)/adaptive boosting (AB) based hybrid, intelligently combines the outputs from an iteratively \"called\" weak learning algorithm (one which performs at least slightly better than random guessing) in order to \"boost\" the performance of an EP-derived weak learner. The second paradigm is support vector machines (SVMs). SVMs are new and radically different types of classifiers and learning machines that use a hypothesis space of linear functions in a high dimensional feature space. The most important advantage of a SVM, unlike neural networks, is that SVM training always finds a global minimum. Furthermore, the SVM has inherent ability to solve pattern classification without incorporating any problem-domain knowledge. In this study, the both the EP/AB hybrid and SVM were employed as pattern classifiers, operating on mammography data used for breast cancer detection. The main focus of the study was to construct and seek the best EP/AB hybrid and SVM configurations for optimum specificity and positive predictive value at very high sensitivities. Using a mammogram database of 500 biopsy-proven samples, the best performing SVM, on average, was able to achieve (under statistical 5-fold cross-validation) a specificity of 45.0% and a positive predictive value (PPV) of 50.1% at 100% sensitivity. At 97% sensitivity, a specificity of 55.8% and a PPV of 55.2% were obtained. The best performing EP/AB hybrid obtained slightly lower, but comparable, results.","PeriodicalId":184547,"journal":{"name":"Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129068837","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
Multi-agent learning via implicit opponent modeling 基于隐式对手建模的多智能体学习
Ronald V. Bjarnason, T. Peterson
{"title":"Multi-agent learning via implicit opponent modeling","authors":"Ronald V. Bjarnason, T. Peterson","doi":"10.1109/CEC.2002.1004470","DOIUrl":"https://doi.org/10.1109/CEC.2002.1004470","url":null,"abstract":"We present a learning algorithm for two player stochastic games. The algorithm generates optimal deterministic finite automata (DFA) strategies against opponents who can be modeled by probabilistic action automata. The algorithm generates dynamic history trees based on statistical tests to eliminate state aliasing. Experiments are conducted in an iterated prisoner's dilemma environment.","PeriodicalId":184547,"journal":{"name":"Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116252196","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}
引用次数: 7
Coevolutionary design of Takagi-Sugeno fuzzy systems Takagi-Sugeno模糊系统的协同进化设计
M. Delgado, F. von Zuben, F. Gomide
{"title":"Coevolutionary design of Takagi-Sugeno fuzzy systems","authors":"M. Delgado, F. von Zuben, F. Gomide","doi":"10.1109/CEC.2002.1004445","DOIUrl":"https://doi.org/10.1109/CEC.2002.1004445","url":null,"abstract":"This paper suggests a coevolutionary approach to design Takagi-Sugeno fuzzy models. The coevolutionary process induces cooperation among individuals of genetically different populations, the species. Populations from four species represent partial solutions to the fuzzy modeling problem. Cooperation is also achieved via fitness sharing, once the fitness of an individual depends on the fitness of individuals of different species. The performance of the proposed approach is evaluated using a function approximation problem with noisy data, and a classification problem.","PeriodicalId":184547,"journal":{"name":"Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126449136","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
Optimising multiple aspects of network survivability 优化网络生存能力的多个方面
W. Pullan
{"title":"Optimising multiple aspects of network survivability","authors":"W. Pullan","doi":"10.1109/CEC.2002.1006219","DOIUrl":"https://doi.org/10.1109/CEC.2002.1006219","url":null,"abstract":"It is generally accepted that survivable networks tend to consist of network elements (nodes and links) where no individual element is significantly more important than any other element. Using a traffic based network survivability metric Si, which quantifies the impact of removing network element i from a network of N elements, this paper investigates the modification of link capacities to simultaneously maximise average network survivability (1/N/spl Sigma//sub i=1//sup N/S/sub i/) and minimise the variability of Si (var(Si)). For some networks there appears to be an unique optimal set of link capacities however, for others, a number of possible optima exist. For these networks a Pareto-optimal set was generated so that a decision could be made on which link enhancements should be performed. The change in optima as a consequence of changes in the budget for link enhancements and also in changes in the required network traffic load were also investigated.","PeriodicalId":184547,"journal":{"name":"Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127956936","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}
引用次数: 8
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学术文献互助群
群 号:481959085
Book学术官方微信