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

筛选
英文 中文
Multi-objective endmember extraction for hyperspectral images 高光谱图像的多目标端元提取
2017 IEEE Congress on Evolutionary Computation (CEC) Pub Date : 2017-06-05 DOI: 10.1109/CEC.2017.7969347
Hao Li, Jingjing Ma, Jia Liu, Maoguo Gong, Mingyang Zhang
{"title":"Multi-objective endmember extraction for hyperspectral images","authors":"Hao Li, Jingjing Ma, Jia Liu, Maoguo Gong, Mingyang Zhang","doi":"10.1109/CEC.2017.7969347","DOIUrl":"https://doi.org/10.1109/CEC.2017.7969347","url":null,"abstract":"Endmember extraction is a critical step of spectral unmixing. In this paper, a novel endmember extraction algorithm based on evolutionary multi-objective optimization is proposed for hyperspectral remote sensing images. In the proposed method, endmember extraction is modeled as a multi-objective optimization problem. Then the root mean square error between the original image and its remixed image and the number of endmembers are chosen as two conflicting objective functions, which are simultaneously optimized by particle swarm optimization algorithm to find the best tradeoff solutions. In order to promote diversity and speed up the convergence of the algorithm, a new particle status updating strategy and a novel method for selecting leaders are designed. The experimental results on both simulated and real hyperspectral remote sensing images confirm the performance of the proposed approach over some existing methods.","PeriodicalId":335123,"journal":{"name":"2017 IEEE Congress on Evolutionary Computation (CEC)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115463388","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
Vector representation of non-standard spellings using dynamic time warping and a denoising autoencoder 使用动态时间扭曲和去噪自动编码器的非标准拼写的矢量表示
2017 IEEE Congress on Evolutionary Computation (CEC) Pub Date : 2017-06-01 DOI: 10.1109/CEC.2017.7969473
M. B. Lazreg, M. G. Olsen, Ole-Christoffer Granmo
{"title":"Vector representation of non-standard spellings using dynamic time warping and a denoising autoencoder","authors":"M. B. Lazreg, M. G. Olsen, Ole-Christoffer Granmo","doi":"10.1109/CEC.2017.7969473","DOIUrl":"https://doi.org/10.1109/CEC.2017.7969473","url":null,"abstract":"The presence of non-standard spellings in Twitter causes challenges for many natural language processing tasks. Traditional approaches mainly regard the problem as a translation, spell checking, or speech recognition problem. This paper proposes a method that represents the stochastic relationship between words and their non-standard versions in real vectors. The method uses dynamic time warping to preprocess the non-standard spellings and autoencoder to derive the vector representation. The derived vectors encode word patterns and the Euclidean distance between the vectors represents a distance in the word space that challenges the prevailing edit distance. After training the autoencoder on 1051 different words and their non-standard versions, the results show that the new distance can be used to obtain the correct standard word among the closest five words in 89.53% of the cases compared to only 68.22% using the edit distance.","PeriodicalId":335123,"journal":{"name":"2017 IEEE Congress on Evolutionary Computation (CEC)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116994242","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
On the evolution of bent (n, m) functions 关于弯曲(n, m)函数的演化
2017 IEEE Congress on Evolutionary Computation (CEC) Pub Date : 2017-06-01 DOI: 10.1109/CEC.2017.7969563
S. Picek, Karlo Knezevic, D. Jakobović
{"title":"On the evolution of bent (n, m) functions","authors":"S. Picek, Karlo Knezevic, D. Jakobović","doi":"10.1109/CEC.2017.7969563","DOIUrl":"https://doi.org/10.1109/CEC.2017.7969563","url":null,"abstract":"Boolean functions and their generalizations, vectorial Boolean functions, are extremely active areas of research. Their applications can be found in domains such as error correcting codes, communication, and cryptography. Accordingly, various methods of obtaining Boolean functions are explored where one group belongs to heuristic techniques and, more precisely, evolutionary algorithms. In this paper we explore how to evolve (vectorial) Boolean functions with specific properties by utilizing several different algorithms and encodings. As far as we are aware, we are the first to explore the topic of evolution of vectorial Boolean functions where the output dimension is strictly smaller than the input dimension. Our results show that evolutionary algorithms can represent a valuable option to produce vectorial Boolean functions where good results are obtained for various sizes. On the other hand, as the number of outputs grows, we can observe that evolutionary algorithms are still able to obtain high quality results but with increasing difficulty.","PeriodicalId":335123,"journal":{"name":"2017 IEEE Congress on Evolutionary Computation (CEC)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127508743","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}
引用次数: 3
A comparison of probabilistic-based optimization approaches for vehicle routing problems 基于概率的车辆路径优化方法比较
2017 IEEE Congress on Evolutionary Computation (CEC) Pub Date : 2017-06-01 DOI: 10.1109/CEC.2017.7969622
Roberto Santana, G. Sirbiladze, B. Ghvaberidze, Bidzina Matsaberidze
{"title":"A comparison of probabilistic-based optimization approaches for vehicle routing problems","authors":"Roberto Santana, G. Sirbiladze, B. Ghvaberidze, Bidzina Matsaberidze","doi":"10.1109/CEC.2017.7969622","DOIUrl":"https://doi.org/10.1109/CEC.2017.7969622","url":null,"abstract":"Estimation of distribution algorithms (EDAs) are evolutionary algorithms that use probabilistic modeling to lead a more efficient search for optimal solutions. While EDAs have been applied to several types of optimization problems, they exhibit some limitations to deal with constrained optimization problems. More study and understanding of how can EDAs deal with these problems is required. In this paper we investigate the application of EDAs to a version of the vehicle routing problem in which solutions should satisfy a number of constraints involving the customers, the fleet vehicle, and the items to be delivered. For this problem, we compare two different representations of the solutions, and apply EDAs that use three probabilistic models with different characteristics. Our results show that the combination of an integer representation with tree-based probabilistic model produces the best results and is able to solve vehicle routing problems that contain over thousands of promising paths.","PeriodicalId":335123,"journal":{"name":"2017 IEEE Congress on Evolutionary Computation (CEC)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124820621","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}
引用次数: 3
Short-term traffic flow prediction with optimized Multi-kernel Support Vector Machine 基于优化多核支持向量机的短期交通流预测
2017 IEEE Congress on Evolutionary Computation (CEC) Pub Date : 2017-06-01 DOI: 10.1109/CEC.2017.7969326
Xianyao Ling, Xinxin Feng, Zhonghui Chen, Yiwen Xu, Haifeng Zheng
{"title":"Short-term traffic flow prediction with optimized Multi-kernel Support Vector Machine","authors":"Xianyao Ling, Xinxin Feng, Zhonghui Chen, Yiwen Xu, Haifeng Zheng","doi":"10.1109/CEC.2017.7969326","DOIUrl":"https://doi.org/10.1109/CEC.2017.7969326","url":null,"abstract":"Accurate prediction of the traffic state can help to solve the problem of urban traffic congestion, providing guiding advices for people's travel and traffic regulation. In this paper, we propose a novel short-term traffic flow prediction algorithm, which is based on Multi-kernel Support Vector Machine (MSVM) and Adaptive Particle Swarm Optimization (APSO). Firstly, we explore both the nonlinear and randomness characteristic of traffic flow, and hybridize Gaussian kernel and polynomial kernel to constitute the MSVM. Secondly, we optimize the parameters of MSVM with a novel APSO algorithm by considering both the historical and real-time traffic data. We evaluate our algorithm by doing thorough experiment on a large real dataset. The results show that our algorithm can do a timely and adaptive prediction even in the rush hour when the traffic conditions change rapidly. At the same time, the prediction results are more accurate compared to four baseline methods.","PeriodicalId":335123,"journal":{"name":"2017 IEEE Congress on Evolutionary Computation (CEC)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123687590","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}
引用次数: 29
Search-based requirements traceability recovery: A multi-objective approach 基于搜索的需求跟踪恢复:一种多目标方法
2017 IEEE Congress on Evolutionary Computation (CEC) Pub Date : 2017-06-01 DOI: 10.1109/CEC.2017.7969440
Adnane Ghannem, M. Hamdi, M. Kessentini, H. Ammar
{"title":"Search-based requirements traceability recovery: A multi-objective approach","authors":"Adnane Ghannem, M. Hamdi, M. Kessentini, H. Ammar","doi":"10.1109/CEC.2017.7969440","DOIUrl":"https://doi.org/10.1109/CEC.2017.7969440","url":null,"abstract":"Software systems nowadays are complex and difficult to maintain due to the necessity of continuous change and adaptation. One of the challenges in software maintenance is keeping requirements traceability up to date automatically. The process of generating requirements traceability is time-consuming and error-prone. Currently, most available tools do not support the automated recovery of traceability links. In some situations, companies accumulate the history of changes from past maintenance experiences. In this paper, we consider requirements traceability recovery as a multi objective search problem in which we seek to assign each requirement to one or many software elements (code elements, API documentation, and comments) by taking into account the recency of change, the frequency of change, and the semantic similarity between the description of the requirement and the software element. We use the Non-dominated Sorting Genetic Algorithm (NSGA-II) to find the best compromise between these three objectives. We report the results of our experiments on three open source projects.","PeriodicalId":335123,"journal":{"name":"2017 IEEE Congress on Evolutionary Computation (CEC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116023957","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
Using fuzzy automata to diagnose and predict heart problems 利用模糊自动机诊断和预测心脏问题
2017 IEEE Congress on Evolutionary Computation (CEC) Pub Date : 2017-06-01 DOI: 10.1109/CEC.2017.7969397
Maria Azahara Camacho-Magrinan, Mercedes G. Merayo, M. Núñez
{"title":"Using fuzzy automata to diagnose and predict heart problems","authors":"Maria Azahara Camacho-Magrinan, Mercedes G. Merayo, M. Núñez","doi":"10.1109/CEC.2017.7969397","DOIUrl":"https://doi.org/10.1109/CEC.2017.7969397","url":null,"abstract":"In this paper we introduce a formalism to specify the behavior of biological systems. Our formalism copes with uncertainty, via fuzzy logic constraints, an important characteristic of these systems. We present the formal syntax and semantics of our variant of fuzzy automata. The bulk of the paper is devoted to present an application of our formalism: a formal specification of the heart that can help to detect abnormal patterns of behavior. Specifically, our model analyzes the heartbeats per minute and the longitude of the RR waves of a patient. The model takes into account the age and gender of the patient, where age is considered to be a fuzzy parameter. Finally, we use real data to analyze the reliability of the model concerning the diagnosis and prediction of potential illnesses.","PeriodicalId":335123,"journal":{"name":"2017 IEEE Congress on Evolutionary Computation (CEC)","volume":"285 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114183159","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
Coral Reef Optimization for intensity-based medical image registration 基于强度的医学图像配准珊瑚礁优化
2017 IEEE Congress on Evolutionary Computation (CEC) Pub Date : 2017-06-01 DOI: 10.1109/CEC.2017.7969357
E. Bermejo, M. Chica, S. Salcedo-Sanz, O. Cordón
{"title":"Coral Reef Optimization for intensity-based medical image registration","authors":"E. Bermejo, M. Chica, S. Salcedo-Sanz, O. Cordón","doi":"10.1109/CEC.2017.7969357","DOIUrl":"https://doi.org/10.1109/CEC.2017.7969357","url":null,"abstract":"Image registration (IR) is an extended and important problem in computer vision. It involves the transformation of different sets of image data having a shared content into a common coordinate system. Specifically, we will deal with the 3D intensity-based medical IR problem where the intensity distribution of the images is considered, one of the most complex and time consuming variants. The limitations of traditional IR methods have boomed the application of evolutionary and metaheuristic-based approaches to solve the problem, aiming to improve the performance of existing methods both in terms of accuracy and efficiency. In this contribution, we consider the use of a recently proposed bio-inspired meta-heuristic: the Coral Reef Optimization Algorithm (CRO). This novel algorithm simulates the natural phenomena underlying a coral reef, where different corals grow, reproduce and fight with other corals for space in the colony. CRO has recently obtained promising results in different real-world applications and we think its operation mode can properly cope with the 3D intensity-based medical IR problem. We adapt the algorithm to the real-coding problem nature and run an experimental setup tackling sixteen real-world problem instances. The new proposal is benchmarked with recent, state-of-the-art IR techniques. The results show that the CRO-based overcomes the state-of-the-art results in terms of its robustness and time efficiency.","PeriodicalId":335123,"journal":{"name":"2017 IEEE Congress on Evolutionary Computation (CEC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128457971","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
A study on auto-configuration of Multi-Objective Particle Swarm Optimization Algorithm 多目标粒子群优化算法的自配置研究
2017 IEEE Congress on Evolutionary Computation (CEC) Pub Date : 2017-06-01 DOI: 10.1109/CEC.2017.7969381
Ricardo H. R. Lima, A. Pozo
{"title":"A study on auto-configuration of Multi-Objective Particle Swarm Optimization Algorithm","authors":"Ricardo H. R. Lima, A. Pozo","doi":"10.1109/CEC.2017.7969381","DOIUrl":"https://doi.org/10.1109/CEC.2017.7969381","url":null,"abstract":"Researches point out to the importance of automatic design of multi-objective evolutionary algorithms. Because in general, algorithms automatically designed outperform traditional multi-objective evolutionary algorithms from the literature. Nevertheless, until fairly recently, most of the researches have been focused on a small group of algorithms, often based on evolutionary algorithms. On the other hand, mono-objective Particle Swarm Optimization algorithm (PSO) have been widely used due to its flexibility and competitive results in different applications. Besides, as PSO performance depends on different aspects of design like the velocity equation, its automatic design has been targeted by many researches with encouraging results. Motivated by these issues, this work studies the automatic design of Multi-Objective Particle Swarm Optimization (MOPSO). A framework that uses a context-free grammar to guide the design of the algorithms is implemented. The framework includes a set of parameters and components of different MOPSOs, and two design algorithms: Grammatical Evolution (GE) and Iterated Racing (IRACE). Evaluation results are presented, comparing MOPSOs generated by both design algorithms. Furthermore, the generated MOPSOs are compared to the Speed-constrained MOPSO (SMPSO), a well-known algorithm using a set of Multi-Objective problems, quality indicators and statistical tests.","PeriodicalId":335123,"journal":{"name":"2017 IEEE Congress on Evolutionary Computation (CEC)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128666362","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
A comprehensive survey of brain storm optimization algorithms 头脑风暴优化算法的综合调查
2017 IEEE Congress on Evolutionary Computation (CEC) Pub Date : 2017-06-01 DOI: 10.1109/CEC.2017.7969498
Shi Cheng, Yifei Sun, Junfeng Chen, Quande Qin, Xianghua Chu, Xiu-juan Lei, Yuhui Shi
{"title":"A comprehensive survey of brain storm optimization algorithms","authors":"Shi Cheng, Yifei Sun, Junfeng Chen, Quande Qin, Xianghua Chu, Xiu-juan Lei, Yuhui Shi","doi":"10.1109/CEC.2017.7969498","DOIUrl":"https://doi.org/10.1109/CEC.2017.7969498","url":null,"abstract":"The development, implementation, variant, and future directions of a new swarm intelligence algorithm, brain storm optimization (BSO) algorithm, are comprehensively surveyed. Brain storm optimization algorithm is a new and promising swarm intelligence algorithm, which simulates the human brainstorming process. Through the convergent operation and divergent operation, individuals in BSO are grouped and diverged in the search space/objective space. To the best of our knowledge, there are 75 papers, 8 theses, and 5 patents in total on the development and application of the BSO algorithm. Every individual in the BSO algorithm is not only a solution to the problem to be optimized, but also a data point to reveal the landscape of the problem. Based on the developments of brain storm optimization algorithms, different kinds of optimization problems and real-world applications could be solved.","PeriodicalId":335123,"journal":{"name":"2017 IEEE Congress on Evolutionary Computation (CEC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129236893","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}
引用次数: 31
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学术官方微信