<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">X. Li</style></author><author><style face="normal" font="default" size="100%">M. G. Epitropakis</style></author><author><style face="normal" font="default" size="100%">K. Deb</style></author><author><style face="normal" font="default" size="100%">A. Engelbrecht</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Seeking Multiple Solutions: an Updated Survey on Niching Methods and Their Applications</style></title><secondary-title><style face="normal" font="default" size="100%">IEEE Transactions on Evolutionary Computation</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Benchmark testing</style></keyword><keyword><style  face="normal" font="default" size="100%">evolutionary computation</style></keyword><keyword><style  face="normal" font="default" size="100%">Meta-heuristics</style></keyword><keyword><style  face="normal" font="default" size="100%">Multi-modal optimization</style></keyword><keyword><style  face="normal" font="default" size="100%">Multi-solution methods</style></keyword><keyword><style  face="normal" font="default" size="100%">Niching methods</style></keyword><keyword><style  face="normal" font="default" size="100%">Optimization methods</style></keyword><keyword><style  face="normal" font="default" size="100%">Problem-solving</style></keyword><keyword><style  face="normal" font="default" size="100%">Sociology</style></keyword><keyword><style  face="normal" font="default" size="100%">Statistics</style></keyword><keyword><style  face="normal" font="default" size="100%">Swarm intelligence</style></keyword><keyword><style  face="normal" font="default" size="100%">Two dimensional displays</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2016</style></year></dates><volume><style face="normal" font="default" size="100%">PP</style></volume><pages><style face="normal" font="default" size="100%">1-1</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Multi-Modal Optimization (MMO) aiming to locate multiple optimal (or near-optimal) solutions in a single simulation run has practical relevance to problem solving across many fields. Population-based meta-heuristics have been shown particularly effective in solving MMO problems, if equipped with specificallydesigned diversity-preserving mechanisms, commonly known as niching methods. This paper provides an updated survey on niching methods. The paper first revisits the fundamental concepts about niching and its most representative schemes, then reviews the most recent development of niching methods, including novel and hybrid methods, performance measures, and benchmarks for their assessment. Furthermore, the paper surveys previous attempts at leveraging the capabilities of niching to facilitate various optimization tasks (e.g., multi-objective and dynamic optimization) and machine learning tasks (e.g., clustering, feature selection, and learning ensembles). A list of successful applications of niching methods to real-world problems is presented to demonstrate the capabilities of niching methods in providing solutions that are difficult for other optimization methods to offer. The significant practical value of niching methods is clearly exemplified through these applications. Finally, the paper poses challenges and research questions on niching that are yet to be appropriately addressed. Providing answers to these questions is crucial before we can bring more fruitful benefits of niching to real-world problem solving.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Doerr, Carola</style></author><author><style face="normal" font="default" size="100%">Bredeche, Nicolas</style></author><author><style face="normal" font="default" size="100%">Alba, Enrique</style></author><author><style face="normal" font="default" size="100%">Bartz-Beielstein, Thomas</style></author><author><style face="normal" font="default" size="100%">Brockhoff, Dimo</style></author><author><style face="normal" font="default" size="100%">Doerr, Benjamin</style></author><author><style face="normal" font="default" size="100%">Eiben, Gusz</style></author><author><style face="normal" font="default" size="100%">Epitropakis, Michael G.</style></author><author><style face="normal" font="default" size="100%">Fonseca, Carlos M.</style></author><author><style face="normal" font="default" size="100%">Guerreiro, Andreia</style></author><author><style face="normal" font="default" size="100%">Haasdijk, Evert</style></author><author><style face="normal" font="default" size="100%">Heinerman, Jacqueline</style></author><author><style face="normal" font="default" size="100%">Hubert, Julien</style></author><author><style face="normal" font="default" size="100%">Lehre, Per Kristian</style></author><author><style face="normal" font="default" size="100%">Malagò, Luigi</style></author><author><style face="normal" font="default" size="100%">Merelo, J. J.</style></author><author><style face="normal" font="default" size="100%">Miller, Julian</style></author><author><style face="normal" font="default" size="100%">Naujoks, Boris</style></author><author><style face="normal" font="default" size="100%">Oliveto, Pietro</style></author><author><style face="normal" font="default" size="100%">Picek, Stjepan</style></author><author><style face="normal" font="default" size="100%">Pillay, Nelishia</style></author><author><style face="normal" font="default" size="100%">Preuss, Mike</style></author><author><style face="normal" font="default" size="100%">Ryser-Welch, Patricia</style></author><author><style face="normal" font="default" size="100%">Squillero, Giovanni</style></author><author><style face="normal" font="default" size="100%">Stork, Jörg</style></author><author><style face="normal" font="default" size="100%">Sudholt, Dirk</style></author><author><style face="normal" font="default" size="100%">Tonda, Alberto</style></author><author><style face="normal" font="default" size="100%">Whitley, Darrell</style></author><author><style face="normal" font="default" size="100%">Zaefferer, Martin</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Handl, Julia</style></author><author><style face="normal" font="default" size="100%">Hart, Emma</style></author><author><style face="normal" font="default" size="100%">Lewis, Peter R.</style></author><author><style face="normal" font="default" size="100%">López-Ibáñez, Manuel</style></author><author><style face="normal" font="default" size="100%">Ochoa, Gabriela</style></author><author><style face="normal" font="default" size="100%">Paechter, Ben</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Tutorials at PPSN 2016</style></title><secondary-title><style face="normal" font="default" size="100%">Parallel Problem Solving from Nature – PPSN XIV: 14th International Conference, Edinburgh, UK, September 17-21, 2016, Proceedings</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2016</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1007/978-3-319-45823-6_95</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer International Publishing</style></publisher><pub-location><style face="normal" font="default" size="100%">Cham</style></pub-location><pages><style face="normal" font="default" size="100%">1012–1022</style></pages><isbn><style face="normal" font="default" size="100%">978-3-319-45823-6</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">PPSN 2016 hosts a total number of 16 tutorials covering a broad range of current research in evolutionary computation. The tutorials range from introductory to advanced and specialized but can all be attended without prior requirements. All PPSN attendees are cordially invited to take this opportunity to learn about ongoing research activities in our field!</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Michael G. Epitropakis</style></author><author><style face="normal" font="default" size="100%">Shin Yoo</style></author><author><style face="normal" font="default" size="100%">Mark Harman</style></author><author><style face="normal" font="default" size="100%">Edmund K. Burke</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Empirical Evaluation of Pareto Efficient Multi-objective Regression Test Case Prioritisation</style></title><secondary-title><style face="normal" font="default" size="100%">International Symposium on Software Testing and Analysis (ISSTA'15)</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">additional greedy algorithm</style></keyword><keyword><style  face="normal" font="default" size="100%">coverage compaction</style></keyword><keyword><style  face="normal" font="default" size="100%">multi-objective evolutionary algo- rithm</style></keyword><keyword><style  face="normal" font="default" size="100%">Test case prioritization</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2015</style></year></dates><publisher><style face="normal" font="default" size="100%">ACM</style></publisher><pub-location><style face="normal" font="default" size="100%">Baltimore, MD, USA</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">The aim of test case prioritisation is to determine an ordering of test cases that maximises the likelihood of early fault revelation. Previous prioritisation techniques have tended to be single objective, for which the additional greedy algorithm is the current state-of-the-art. Unlike test suite minimisation, multi objective test case prioritisation has not been thoroughly evaluated. This paper presents an extensive empirical study of the effectiveness of multi objective test case prioritisation, evaluating it on multiple versions of five widely-used benchmark programs and a much larger real world system of over 1 million lines of code. The paper also presents a lossless coverage compaction algorithm that dramatically scales the performance of all algorithms studied by between 2 and 4 orders of magnitude, making prioritisation practical for even very demanding problems.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>27</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Jerry Swan</style></author><author><style face="normal" font="default" size="100%">Michael G. Epitropakis</style></author><author><style face="normal" font="default" size="100%">John R. Woodward</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Gen-O-Fix: An embeddable framework for Dynamic Adaptive Genetic Improvement Programming</style></title></titles><dates><year><style  face="normal" font="default" size="100%">2014</style></year><pub-dates><date><style  face="normal" font="default" size="100%">01/2014</style></date></pub-dates></dates><number><style face="normal" font="default" size="100%">CSM-195</style></number><publisher><style face="normal" font="default" size="100%">Computing Science and Mathematics, University of Stirling</style></publisher><pub-location><style face="normal" font="default" size="100%">Stirling FK9 4LA, Scotland</style></pub-location><pages><style face="normal" font="default" size="100%">1-12</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Genetic Improvement Programming (GIP) is concerned with automating the burden of software maintenance, the most costly phase of the software lifecycle. We describe Gen-O-Fix, a GIP framework which allows a software system hosted on the Java Virtual Machine to be continually improved (e.g. make better predictions; pass more regression tests; reduce power consumption). It is the first exemplar of a dynamic adaptive GIP framework, i.e. it can improve a system as it runs. It is written in the Scala programming language and uses reflection to yield source-to-source transformation. One of the design goals for Gen-O-Fix was to create a tool that is user-centric rather than researcher-centric: the end-user is required only to provide a measure of system quality and the URL of the source code to be improved. We discuss potential applications to predictive, embedded and high-performance systems.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>27</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Michael G. Epitropakis</style></author><author><style face="normal" font="default" size="100%">Shin Yoo</style></author><author><style face="normal" font="default" size="100%">Mark Harman</style></author><author><style face="normal" font="default" size="100%">Edmund K. Burke</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Pareto Efficient Multi-Objective Regression Test Suite Prioritisation</style></title></titles><dates><year><style  face="normal" font="default" size="100%">2014</style></year><pub-dates><date><style  face="normal" font="default" size="100%">04/2014</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">Department of Computer Science, University College London</style></publisher><pub-location><style face="normal" font="default" size="100%">Gower Street, London</style></pub-location><pages><style face="normal" font="default" size="100%">1--16</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Test suite prioritisation seeks a test case ordering that maximises the likelihood of early fault revelation. Previous prioritisation techniques have tended to be single objective, for which the additional greedy algorithm is the current state-of-the-art. We study multi objective test suite prioritisation, evaluating it on multiple versions of five widely-used benchmark programs and a much larger real world system of over 1MLoC. Our multi objective algorithms find faults significantly faster and with large effect size for 20 of the 22 versions. We also introduce a non-lossy coverage compact algorithm that dramatically scales the performance of all algorithms studied by between 2 and 4 orders of magnitude, making prioritisation practical for even very demanding problems.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Kocsis, Zoltan A.</style></author><author><style face="normal" font="default" size="100%">Neumann, Geoff</style></author><author><style face="normal" font="default" size="100%">Swan, Jerry</style></author><author><style face="normal" font="default" size="100%">Epitropakis, Michael G.</style></author><author><style face="normal" font="default" size="100%">Brownlee, Alexander E. I.</style></author><author><style face="normal" font="default" size="100%">Haraldsson, Sami O.</style></author><author><style face="normal" font="default" size="100%">Bowles, Edward</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Le Goues, Claire</style></author><author><style face="normal" font="default" size="100%">Yoo, Shin</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Repairing and Optimizing Hadoop hashCode Implementations</style></title><secondary-title><style face="normal" font="default" size="100%">Search-Based Software Engineering: 6th International Symposium, SSBSE 2014, Fortaleza, Brazil, August 26-29, 2014. Proceedings</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2014</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1007/978-3-319-09940-8_22</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer International Publishing</style></publisher><pub-location><style face="normal" font="default" size="100%">Cham</style></pub-location><pages><style face="normal" font="default" size="100%">259–264</style></pages><isbn><style face="normal" font="default" size="100%">978-3-319-09940-8</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">We describe how contract violations in Java TM hashCode methods can be repaired using novel combination of semantics-preserving and generative methods, the latter being achieved via Automatic Improvement Programming. The method described is universally applicable. When applied to the Hadoop platform, it was established that it produces hashCode functions that are at least as good as the original, broken method as well as those produced by a widely-used alternative method from the ‘Apache Commons’ library.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Epitropakis, M.G.</style></author><author><style face="normal" font="default" size="100%">Caraffini, F.</style></author><author><style face="normal" font="default" size="100%">Neri, F.</style></author><author><style face="normal" font="default" size="100%">Burke, E.K.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A Separability Prototype for Automatic Memes with Adaptive Operator Selection</style></title><secondary-title><style face="normal" font="default" size="100%">Foundations of Computational Intelligence (FOCI), 2014 IEEE Symposium on</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Adaptation models</style></keyword><keyword><style  face="normal" font="default" size="100%">adaptive model</style></keyword><keyword><style  face="normal" font="default" size="100%">adaptive operator selection</style></keyword><keyword><style  face="normal" font="default" size="100%">Algorithm design and analysis</style></keyword><keyword><style  face="normal" font="default" size="100%">algorithmics</style></keyword><keyword><style  face="normal" font="default" size="100%">automatic design</style></keyword><keyword><style  face="normal" font="default" size="100%">Benchmark testing</style></keyword><keyword><style  face="normal" font="default" size="100%">hyper-heuristics</style></keyword><keyword><style  face="normal" font="default" size="100%">memetic computing</style></keyword><keyword><style  face="normal" font="default" size="100%">optimisation</style></keyword><keyword><style  face="normal" font="default" size="100%">optimization</style></keyword><keyword><style  face="normal" font="default" size="100%">optimization problems</style></keyword><keyword><style  face="normal" font="default" size="100%">Prototypes</style></keyword><keyword><style  face="normal" font="default" size="100%">search algorithms</style></keyword><keyword><style  face="normal" font="default" size="100%">search problems</style></keyword><keyword><style  face="normal" font="default" size="100%">search process</style></keyword><keyword><style  face="normal" font="default" size="100%">separability prototype for automatic memes</style></keyword><keyword><style  face="normal" font="default" size="100%">Software algorithms</style></keyword><keyword><style  face="normal" font="default" size="100%">software prototype</style></keyword><keyword><style  face="normal" font="default" size="100%">software prototyping</style></keyword><keyword><style  face="normal" font="default" size="100%">SPAM-AOS</style></keyword><keyword><style  face="normal" font="default" size="100%">Unsolicited electronic mail</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2014</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Dec</style></date></pub-dates></dates><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">One of the main challenges in algorithmics in general, and in Memetic Computing, in particular, is the automatic design of search algorithms. A recent advance in this direction (in terms of continuous problems) is the development of a software prototype that builds up an algorithm based upon a problem analysis of its separability. This prototype has been called the Separability Prototype for Automatic Memes (SPAM). This article modifies the SPAM by incorporating within it an adaptive model used in hyper-heuristics for tackling optimization problems. This model, namely Adaptive Operator Selection (AOS), rewards at run time the most promising heuristics/memes so that they are more likely to be used in the following stages of the search process. The resulting framework, here referred to as SPAM-AOS, has been tested on various benchmark problems and compared with modern algorithms representing the-state-of-the-art of search for continuous problems. Numerical results show that the proposed SPAM-AOS is a promising framework that outperforms the original SPAM and other modern algorithms. Most importantly, this study shows how certain areas of Memetic Computing and Hyper-heuristics are very closely related topics and it also shows that their combination can lead to the development of powerful algorithmic frameworks.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>27</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Xiaodong Li</style></author><author><style face="normal" font="default" size="100%">Andries Engelbrecht</style></author><author><style face="normal" font="default" size="100%">M. G. Epitropakis</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Benchmark Functions for CEC'2013 Special Session and Competition on Niching Methods for Multimodal Function Optimization'</style></title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://goanna.cs.rmit.edu.au/~xiaodong/cec13-niching/competition/</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Evolutionary Computation and Machine Learning Group, RMIT University</style></publisher><pub-location><style face="normal" font="default" size="100%">Melbourne, Australia</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">M. A. Kaliakatsos-Papakostas</style></author><author><style face="normal" font="default" size="100%">M. G. Epitropakis</style></author><author><style face="normal" font="default" size="100%">A. Floros</style></author><author><style face="normal" font="default" size="100%">M. N. Vrahatis</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Chaos and Music: From time series analysis to evolutionary composition</style></title><secondary-title><style face="normal" font="default" size="100%">International Journal of Bifurcation and Chaos (IJBC)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.worldscientific.com/doi/abs/10.1142/S0218127413501812</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">23</style></volume><pages><style face="normal" font="default" size="100%">1350181</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Music is an amalgam of logic and emotion, order and dissonance, along with many combinations of contradicting notions which allude to deterministic chaos. Therefore, it comes as no surprise that several research works have examined the utilization of dynamical systems for symbolic music composition. The main motivation of the paper at hand is the analysis of the tonal composition potentialities of several discrete dynamical systems, in comparison to genuine human compositions. Therefore, a set of human musical compositions is utilized to provide ``compositional guidelines'' to several dynamical systems, the parameters of which are properly adjusted through evolutionary computation. This procedure exposes the extent to which a system is capable of composing tonal sequences that resemble human composition. In parallel, a time series analysis on the genuine compositions is performed, which firstly provides an overview of their dynamical characteristics and secondly, allows a comparative analysis with the dynamics of the artificial compositions. The results expose the tonal composition capabilities of the examined iterative maps, providing specific references to the tonal characteristics that they can capture.</style></abstract><issue><style face="normal" font="default" size="100%">11</style></issue></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>10</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">M. G. Epitropakis</style></author><author><style face="normal" font="default" size="100%">Xiaodong Li</style></author><author><style face="normal" font="default" size="100%">Edmund K. Burke</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A Dynamic Archive Niching Differential Evolution Algorithm for Multimodal Optimization</style></title><secondary-title><style face="normal" font="default" size="100%">IEEE Congress on Evolutionary Computation, 2013. CEC 2013</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year><pub-dates><date><style  face="normal" font="default" size="100%">June</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=6557556</style></url></web-urls></urls><pub-location><style face="normal" font="default" size="100%">Cancun, Mexico</style></pub-location><pages><style face="normal" font="default" size="100%">79-86</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Highly multimodal landscapes with multiple local/global optima represent common characteristics in real-world applications. Many niching algorithms have been proposed in the literature which aim to search such landscapes in an attempt to locate as many global optima as possible. However, to locate and maintain a large number of global solutions, these algorithms are substantially influenced by their parameter values, such as a large population size. Here, we propose a new niching Differential Evolution algorithm that attempts to overcome the population size influence and produce good performance almost independently of its population size. To this end, we incorporate two mechanisms into the algorithm: a control parameter adaptation technique and an external dynamic archive along with a reinitialization mechanism. The first mechanism is designed to efficiently adapt the control parameters of the algorithm, whilst the second one is responsible for enabling the algorithm to investigate unexplored regions of the search space and simultaneously keep the best solutions found by the algorithm. The proposed approach is compared with two Differential Evolution variants on a recently proposed benchmark suite. Empirical results indicate that the proposed niching algorithm is competitive and very promising. It exhibits a robust and stable behavior, whilst the incorporation of the dynamic archive seems to tackle the population size influence effectively. Moreover, it alleviates the problem of having to fine-tune the population size parameter in a niching algorithm.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">M. A. Kaliakatsos–Papakostas</style></author><author><style face="normal" font="default" size="100%">M. G. Epitropakis</style></author><author><style face="normal" font="default" size="100%">A. Floros</style></author><author><style face="normal" font="default" size="100%">M. N. Vrahatis</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Controlling interactive evolution of 8-bit melodies with genetic programming</style></title><secondary-title><style face="normal" font="default" size="100%">Soft Computing - A Fusion of Foundations, Methodologies and Applications</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year></dates><volume><style face="normal" font="default" size="100%">16</style></volume><pages><style face="normal" font="default" size="100%">1997-2008</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Automatic music composition and sound synthesis is a field of study that gains continuously increasing attention. The introduction of evolutionary computation has further boosted the research towards exploring ways to incorporate human supervision and guidance in the automatic evolution of melodies and sounds. This kind of human–machine interaction belongs to a larger methodological context called interactive evolution (IE). For the automatic creation of art and especially for music synthesis, user fatigue requires that the evolutionary process produces interesting content that evolves fast. This paper addresses this issue by presenting an IE system that evolves melodies using genetic programming (GP). A modification of the GP operators is proposed that allows the user to have control on the randomness of the evolutionary process. The results obtained by subjective tests indicate that the utilization of the proposed genetic operators drives the evolution to more user-preferable sounds.
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">S. K. Tasoulis</style></author><author><style face="normal" font="default" size="100%">M. G. Epitropakis</style></author><author><style face="normal" font="default" size="100%">V. P. Plagianakos</style></author><author><style face="normal" font="default" size="100%">D. K. Tasoulis</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Density Based Projection Pursuit Clustering</style></title><secondary-title><style face="normal" font="default" size="100%">IEEE Congress on Evolutionary Computation, 2012. CEC 2012. (IEEE World Congress on Computational Intelligence)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year><pub-dates><date><style  face="normal" font="default" size="100%">June</style></date></pub-dates></dates><pub-location><style face="normal" font="default" size="100%">Brisbane, Australia</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Clustering of high dimensional data is a very important task in Data Mining. In dealing with such data, we typically need to use methods like Principal Component Analysis and Projection Pursuit, to find interesting lower dimensional directions to project the data and hence reduce their dimensionality in a manageable size. In this work, we propose a new criterion of direction interestingness, which incorporates information from the density of the projected data. Subsequently, we utilize the Differential Evolution algorithm to perform optimization over the space of the projections and hence construct a new hierarchical clustering algorithmic scheme. The new algorithm shows promising performance over a series of real and simulated data.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">M. G. Epitropakis</style></author><author><style face="normal" font="default" size="100%">V. P. Plagianakos</style></author><author><style face="normal" font="default" size="100%">M. N. Vrahatis</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Evolving cognitive and social experience in Particle Swarm Optimization through Differential Evolution: A hybrid approach</style></title><secondary-title><style face="normal" font="default" size="100%">Information Sciences</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year></dates><volume><style face="normal" font="default" size="100%">216</style></volume><pages><style face="normal" font="default" size="100%">50-92</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">In recent years, the Particle Swarm Optimization has rapidly gained increasing popularity and many variants and hybrid approaches have been proposed to improve it. In this paper, motivated by the behavior and the spatial characteristics of the social and cognitive experience of each particle in the swarm, we develop a hybrid framework that combines the Particle Swarm Optimization and the Differential Evolution algorithm. Particle Swarm Optimization has the tendency to distribute the best personal positions of the swarm particles near to the vicinity of problem’s optima. In an attempt to efficiently guide the evolution and enhance the convergence, we evolve the personal experience or memory of the particles with the Differential Evolution algorithm, without destroying the search capabilities of the algorithm. The proposed framework can be applied to any Particle Swarm Optimization algorithm with minimal effort. To evaluate the performance and highlight the different aspects of the proposed framework, we initially incorporate six classic Differential Evolution mutation strategies in the canonical Particle Swarm Optimization, while afterwards we employ five state-of-the-art Particle Swarm Optimization variants and four popular Differential Evolution algorithms. Extensive experimental results on 25 high dimensional multimodal benchmark functions along with the corresponding statistical analysis, suggest that the hybrid variants are very promising and significantly improve the original algorithms in the majority of the studied cases.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">M. A. Kaliakatsos–Papakostas</style></author><author><style face="normal" font="default" size="100%">M. G. Epitropakis</style></author><author><style face="normal" font="default" size="100%">A. Floros</style></author><author><style face="normal" font="default" size="100%">M. N. Vrahatis</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Penousal Machado</style></author><author><style face="normal" font="default" size="100%">Juan Romero</style></author><author><style face="normal" font="default" size="100%">Adrian Carballal</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Interactive Evolution of 8–Bit Melodies with Genetic Programming towards Finding Aesthetic Measures for Sound</style></title><secondary-title><style face="normal" font="default" size="100%">Evolutionary and Biologically Inspired Music, Sound, Art and Design</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">Lecture Notes in Computer Science</style></tertiary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year></dates><publisher><style face="normal" font="default" size="100%">Springer Berlin / Heidelberg</style></publisher><volume><style face="normal" font="default" size="100%">7247</style></volume><pages><style face="normal" font="default" size="100%">141-152</style></pages><isbn><style face="normal" font="default" size="100%">978-3-642-29141-8</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">The efficient specification of aesthetic measures for music as a part of modelling human conception of sound is a challenging task and has motivated several research works. It is not only targeted to the creation of automatic music composers and raters, but also reinforces the research for a deeper understanding of human noesis. The aim of this work is twofold: first, it proposes an Interactive Evolution system that uses Genetic Programming to evolve simple 8–bit melodies. The results obtained by subjective tests indicate that evolution is driven towards more user–preferable sounds. In turn, by monitoring features of the melodies in different evolution stages, indications are provided that some sound features may subsume information about aesthetic criteria. The results are promising and signify that further study of aesthetic preference through Interactive Evolution may accelerate the progress towards defining aesthetic measures for sound and music.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">M. G. Epitropakis</style></author><author><style face="normal" font="default" size="100%">V. P. Plagianakos</style></author><author><style face="normal" font="default" size="100%">M. N. Vrahatis</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Multimodal Optimization Using Niching Differential Evolution with Index-based Neighborhoods</style></title><secondary-title><style face="normal" font="default" size="100%">IEEE Congress on Evolutionary Computation, 2012. CEC 2012. (IEEE World Congress on Computational Intelligence)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year><pub-dates><date><style  face="normal" font="default" size="100%">June</style></date></pub-dates></dates><pub-location><style face="normal" font="default" size="100%">Brisbane, Australia</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">A new family of Differential Evolution mutation strategies (DE/nrand) that are able to handle multimodal functions, have been recently proposed. The DE/nrand family incorporates information regarding the real nearest neighborhood of each potential solution, which aids them to accurately locate and maintain many global optimizers simultaneously, without the need of additional parameters. However, these strategies have increased computational cost. To alleviate this problem, instead of computing the real nearest neighbor, we incorporate an index-based neighborhood into the mutation strategies. The new mutation strategies are evaluated on eight well-known and widely used multimodal problems and their performance is compared against five state-of-the-art algorithms. Simulation results suggest that the proposed strategies are promising and exhibit competitive behavior, since with a substantial lower computational cost they are able to locate and maintain many global optima throughout the evolution process.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">M. G. Epitropakis</style></author><author><style face="normal" font="default" size="100%">D. K. Tasoulis</style></author><author><style face="normal" font="default" size="100%">N. G. Pavlidis</style></author><author><style face="normal" font="default" size="100%">V. P. Plagianakos</style></author><author><style face="normal" font="default" size="100%">M. N. Vrahatis</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Ilias Maglogiannis</style></author><author><style face="normal" font="default" size="100%">Vassilis P. Plagianakos</style></author><author><style face="normal" font="default" size="100%">Ioannis Vlahavas</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Tracking Differential Evolution Algorithms: An Adaptive Approach through Multinomial Distribution Tracking with Exponential Forgetting</style></title><secondary-title><style face="normal" font="default" size="100%">Artificial Intelligence: Theories and Applications</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">Lecture Notes in Computer Science</style></tertiary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year></dates><publisher><style face="normal" font="default" size="100%">Springer Berlin / Heidelberg</style></publisher><volume><style face="normal" font="default" size="100%">7297</style></volume><pages><style face="normal" font="default" size="100%">214-222</style></pages><isbn><style face="normal" font="default" size="100%">978-3-642-30447-7</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Several Differential Evolution variants with modified search dynamics have been recently proposed, to improve the performance of the method. This work borrows ideas from adaptive filter theory to develop an “online” algorithmic adaptation framework. The proposed framework is based on tracking the parameters of a multinomial distribution to reflect changes in the evolutionary process. As such, we design a multinomial distribution tracker to capture the successful evolution movements of three Differential Evolution algorithms, in an attempt to aggregate their characteristics and their search dynamics. Experimental results on ten benchmark functions and comparisons with five state-of-the-art algorithms indicate that the proposed framework is competitive and very promising.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">M. G. Epitropakis</style></author><author><style face="normal" font="default" size="100%">D. K. Tasoulis</style></author><author><style face="normal" font="default" size="100%">N. G. Pavlidis</style></author><author><style face="normal" font="default" size="100%">V. P. Plagianakos</style></author><author><style face="normal" font="default" size="100%">M. N. Vrahatis</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Tracking Particle Swarm Optimizers: An adaptive approach through multinomial distribution tracking with exponential forgetting</style></title><secondary-title><style face="normal" font="default" size="100%">IEEE Congress on Evolutionary Computation, 2012. CEC 2012. (IEEE World Congress on Computational Intelligence)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year><pub-dates><date><style  face="normal" font="default" size="100%">June</style></date></pub-dates></dates><pub-location><style face="normal" font="default" size="100%">Brisbane, Australia</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">An active research direction in Particle Swarm Optimization (PSO) is the integration of PSO variants in adaptive, or self-adaptive schemes, in an attempt to aggregate their characteristics and their search dynamics. In this work we borrow ideas from adaptive filter theory to develop an “online” algorithm adaptation framework. The proposed framework is based on tracking the parameters of a multinomial distribution to capture changes in the evolutionary process. As such, we design a multinomial distribution tracker to capture the successful evolution movements of three PSO variants. Extensive experimental results on ten benchmark functions and comparisons with five state-of-the-art algorithms indicate that the proposed framework is competitive and very promising. On the majority of tested cases, the proposed framework achieves substantial performance gain, while it seems to identify accurately the most appropriate algorithm for the problem at hand.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">M. G. Epitropakis</style></author><author><style face="normal" font="default" size="100%">D. K. Tasoulis</style></author><author><style face="normal" font="default" size="100%">N. G. Pavlidis</style></author><author><style face="normal" font="default" size="100%">V. P. Plagianakos</style></author><author><style face="normal" font="default" size="100%">M. N. Vrahatis</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Enhancing Differential Evolution Utilizing Proximity-based Mutation Operators</style></title><secondary-title><style face="normal" font="default" size="100%">IEEE Transactions on Evolutionary Computation</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2011</style></year></dates><volume><style face="normal" font="default" size="100%">15</style></volume><pages><style face="normal" font="default" size="100%">99-119</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Differential evolution is a very popular optimization algorithm and considerable research has been devoted to the development of efficient search operators. Motivated by the different manner in which various search operators behave, we propose a novel framework based on the proximity characteristics among the individual solutions as they evolve. Our framework incorporates information of neighboring individuals, in an attempt to efficiently guide the evolution of the population toward the global optimum, without sacrificing the search capabilities of the algorithm. More specifically, the random selection of parents during mutation is modified, by assigning to each individual a probability of selection that is inversely proportional to its distance from the mutated individual. The proposed framework can be applied to any mutation strategy with minimal changes. In this paper, we incorporate this framework in the original differential evolution algorithm, as well as other recently proposed differential evolution variants. Through an extensive experimental study, we show that the proposed framework results in enhanced performance for the majority of the benchmark problems studied.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">M. A. Kaliakatsos-Papakostas</style></author><author><style face="normal" font="default" size="100%">M. G. Epitropakis</style></author><author><style face="normal" font="default" size="100%">M. N. Vrahatis</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Agon, Carlos</style></author><author><style face="normal" font="default" size="100%">Andreatta, Moreno</style></author><author><style face="normal" font="default" size="100%">Assayag, Gérard</style></author><author><style face="normal" font="default" size="100%">Amiot, Emmanuel</style></author><author><style face="normal" font="default" size="100%">Bresson, Jean</style></author><author><style face="normal" font="default" size="100%">Mandereau, John</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Feature Extraction Using Pitch Class Profile Information Entropy</style></title><secondary-title><style face="normal" font="default" size="100%">Mathematics and Computation in Music</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">Lecture Notes in Computer Science</style></tertiary-title></titles><dates><year><style  face="normal" font="default" size="100%">2011</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1007/978-3-642-21590-2_32</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer Berlin / Heidelberg</style></publisher><volume><style face="normal" font="default" size="100%">6726</style></volume><pages><style face="normal" font="default" size="100%">354-357</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Computer aided musical analysis has led a research stream to explore the description of an entire musical piece by a single value. Combinations of such values, often called global features, have been used for several identification tasks on pieces with symbolic music representation. In this work we extend some ideas that estimate information entropy of sections of musical pieces, to utilize the Pitch Class Profile information entropy for global feature extraction. Two approaches are proposed and tested, the first approach considers musical sections as overlapping sliding onset windows, while the second one as non-overlapping fixed-length time windows.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">M. G. Epitropakis</style></author><author><style face="normal" font="default" size="100%">V. P. Plagianakos</style></author><author><style face="normal" font="default" size="100%">M. N. Vrahatis</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Finding Multiple Global Optima Exploiting Differential Evolution’s Niching Capability</style></title><secondary-title><style face="normal" font="default" size="100%">IEEE Symposium on Differential Evolution, 2011. SDE 2011. (IEEE Symposium Series on Computational Intelligence)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2011</style></year><pub-dates><date><style  face="normal" font="default" size="100%">April</style></date></pub-dates></dates><pub-location><style face="normal" font="default" size="100%">Paris, France</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Handling multimodal functions is a very important and challenging task in evolutionary computation community, since most of the real-world applications exhibit highly multi-modal landscapes. Motivated by the dynamics and the proximity characteristics of Differential Evolution's mutation strategies tending to distribute the individuals of the population to the vicinity of the problem's minima, we introduce two new Differential Evolution mutation strategies. The new mutation strategies incorporate spatial information about the neighborhood of each potential solution and exhibit a niching formation, without incorporating any additional parameter. Experimental results on eight well known multimodal functions and comparisons with some state-of-the-art algorithms indicate that the proposed mutation strategies are competitive and very promising, since they are able to reliably locate and maintain many global optima throughout the evolution process.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">M. G. Epitropakis</style></author><author><style face="normal" font="default" size="100%">M. N. Vrahatis</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Studying the basin of convergence of methods for computing periodic orbits</style></title><secondary-title><style face="normal" font="default" size="100%">International Journal of Bifurcation and Chaos (IJBC)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2011</style></year></dates><volume><style face="normal" font="default" size="100%">21</style></volume><pages><style face="normal" font="default" size="100%">1-28</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Starting from the well-known Newton's fractal which is formed by the basin of convergence of Newton's method applied to a cubic equation in one variable in the field ℂ, we were able to find methods for which the corresponding basins of convergence do not exhibit a fractal-like structure. Using this approach we are able to distinguish reliable and robust methods for tackling a specific problem. Also, our approach is illustrated here for methods for computing periodic orbits of nonlinear mappings as well as for fixed points of the Poincaré map on a surface of section.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">M. A. Kaliakatsos-Papakostas</style></author><author><style face="normal" font="default" size="100%">M. G. Epitropakis</style></author><author><style face="normal" font="default" size="100%">M. N. Vrahatis</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Di Chio, Cecilia</style></author><author><style face="normal" font="default" size="100%">Brabazon, Anthony</style></author><author><style face="normal" font="default" size="100%">Di Caro, Gianni</style></author><author><style face="normal" font="default" size="100%">Drechsler, Rolf</style></author><author><style face="normal" font="default" size="100%">Farooq, Muddassar</style></author><author><style face="normal" font="default" size="100%">Grahl, Jörn</style></author><author><style face="normal" font="default" size="100%">Greenfield, Gary</style></author><author><style face="normal" font="default" size="100%">Prins, Christian</style></author><author><style face="normal" font="default" size="100%">Romero, Juan</style></author><author><style face="normal" font="default" size="100%">Squillero, Giovanni</style></author><author><style face="normal" font="default" size="100%">Tarantino, Ernesto</style></author><author><style face="normal" font="default" size="100%">Tettamanzi, Andrea</style></author><author><style face="normal" font="default" size="100%">Urquhart, Neil</style></author><author><style face="normal" font="default" size="100%">Uyar, A.</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Weighted Markov Chain Model for Musical Composer Identification</style></title><secondary-title><style face="normal" font="default" size="100%">Applications of Evolutionary Computation</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2011</style></year></dates><publisher><style face="normal" font="default" size="100%">Springer Berlin / Heidelberg</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Several approaches based on the ‘Markov chain model’ have been proposed to tackle the composer identification task. In the paper at hand, we propose to capture phrasing structural information from inter onset and pitch intervals of pairs of consecutive notes in a musical piece, by incorporating this information into a weighted variation of a first order Markov chain model. Additionally, we propose an evolutionary procedure that automatically tunes the introduced weights and exploits the full potential of the proposed model for tackling the composer identification task between two composers. Initial experimental results on string quartets of Haydn, Mozart and Beethoven suggest that the proposed model performs well and can provide insights on the inter onset and pitch intervals on the considered musical collection.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">M. G. Epitropakis</style></author><author><style face="normal" font="default" size="100%">V. P. Plagianakos</style></author><author><style face="normal" font="default" size="100%">M. N. Vrahatis</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Evolving cognitive and social experience in Particle Swarm Optimization through Differential Evolution</style></title><secondary-title><style face="normal" font="default" size="100%">IEEE Congress on Evolutionary Computation, 2010. CEC 2010. (IEEE World Congress on Computational Intelligence)</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">cognitive experience</style></keyword><keyword><style  face="normal" font="default" size="100%">convergence</style></keyword><keyword><style  face="normal" font="default" size="100%">differential evolution</style></keyword><keyword><style  face="normal" font="default" size="100%">evolutionary computation</style></keyword><keyword><style  face="normal" font="default" size="100%">particle swarm optimisation</style></keyword><keyword><style  face="normal" font="default" size="100%">particle swarm optimization</style></keyword><keyword><style  face="normal" font="default" size="100%">social experience</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2010</style></year><pub-dates><date><style  face="normal" font="default" size="100%">July</style></date></pub-dates></dates><pub-location><style face="normal" font="default" size="100%">Barcelona, Spain</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">In recent years, the Particle Swarm Optimization has rapidly gained increasing popularity and many variants and hybrid approaches have been proposed to improve it. Motivated by the behavior and the proximity characteristics of the social and cognitive experience of each particle in the swarm, we develop a hybrid approach that combines the Particle Swarm Optimization and the Differential Evolution algorithm. Particle Swarm Optimization has the tendency to distribute the best personal positions of the swarm near to the vicinity of problem’s optima. In an attempt to efficiently guide the evolution and enhance the convergence, we evolve the personal experience of the swarm with the Differential Evolution algorithm. Extensive experimental results on twelve high dimensional multimodal benchmark functions indicate that the hybrid variants are very promising and improve the original algorithm.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">M. G. Epitropakis</style></author><author><style face="normal" font="default" size="100%">V. P. Plagianakos</style></author><author><style face="normal" font="default" size="100%">M. N. Vrahatis</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Hardware-Friendly Higher-Order Neural Network Training Using Distributed Evolutionary Algorithms</style></title><secondary-title><style face="normal" font="default" size="100%">Applied Soft Computing</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Higher-Order Neural Networks</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2010</style></year></dates><volume><style face="normal" font="default" size="100%">10</style></volume><pages><style face="normal" font="default" size="100%">398-408</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">In this paper, we study the class of Higher-Order Neural Networks and especially the Pi-Sigma Networks. The performance of Pi-Sigma Networks is evaluated through several well known Neural Network Training benchmarks. In the experiments reported here, Distributed Evolutionary Algorithms are implemented for Pi-Sigma neural networks training. More specifically the distributed versions of the Differential Evolution and the Particle Swarm Optimization algorithms have been employed. To this end, each processor is assigned a subpopulation of potential solutions. The subpopulations are independently evolved in parallel and occasional migration is employed to allow cooperation between them. The proposed approach is applied to train Pi-Sigma Networks using threshold activation functions. Moreover, the weights and biases were confined to a narrow band of integers, constrained in the range [-32,32]. Thus, the trained Pi-Sigma neural networks can be represented by using 6 bits. Such networks are better suited than the real weight ones for hardware implementation and to some extend are immune to low amplitude noise that possibly contaminates the training data. Experimental results suggest that the proposed training process is fast, stable and reliable and the distributed trained Pi-Sigma Networks exhibited good generalization capabilities.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">M. A. Kaliakatsos-Papakostas</style></author><author><style face="normal" font="default" size="100%">M. G. Epitropakis</style></author><author><style face="normal" font="default" size="100%">M. N. Vrahatis</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Di Chio, Cecilia</style></author><author><style face="normal" font="default" size="100%">Brabazon, Anthony</style></author><author><style face="normal" font="default" size="100%">Di Caro, Gianni</style></author><author><style face="normal" font="default" size="100%">Ebner, Marc</style></author><author><style face="normal" font="default" size="100%">Farooq, Muddassar</style></author><author><style face="normal" font="default" size="100%">Fink, Andreas</style></author><author><style face="normal" font="default" size="100%">Grahl, Jörn</style></author><author><style face="normal" font="default" size="100%">Greenfield, Gary</style></author><author><style face="normal" font="default" size="100%">Machado, Penousal</style></author><author><style face="normal" font="default" size="100%">O’Neill, Michael</style></author><author><style face="normal" font="default" size="100%">Tarantino, Ernesto</style></author><author><style face="normal" font="default" size="100%">Urquhart, Neil</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Musical Composer Identification through Probabilistic and Feedforward Neural Networks</style></title><secondary-title><style face="normal" font="default" size="100%">Applications of Evolutionary Computation</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2010</style></year></dates><publisher><style face="normal" font="default" size="100%">Springer Berlin / Heidelberg</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">During the last decade many efforts for music information retrieval have been made utilizing Computational Intelligence methods. Here, we examine the information capacity of the Dodecaphonic Trace Vector for composer classification and identification. To this end, we utilize Probabilistic Neural Networks for the construction of a similarity matrix of different composers and analyze the Dodecaphonic Trace Vector’s ability to identify a composer through trained Feedforward Neural Networks. The training procedure is based on classical gradient-based methods as well as on the Differential Evolution algorithm. An experimental analysis on the pieces of seven classical composers is presented to gain insight about the most important strengths and weaknesses of the aforementioned approach.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">M. G. Epitropakis</style></author><author><style face="normal" font="default" size="100%">V. P. Plagianakos</style></author><author><style face="normal" font="default" size="100%">M. N. Vrahatis</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Evolutionary Adaptation of the Differential Evolution Control Parameters</style></title><secondary-title><style face="normal" font="default" size="100%">IEEE Congress on Evolutionary Computation, 2009. CEC 2009</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">adaptive control</style></keyword><keyword><style  face="normal" font="default" size="100%">differential evolution control parameter</style></keyword><keyword><style  face="normal" font="default" size="100%">evolutionary adaptation</style></keyword><keyword><style  face="normal" font="default" size="100%">evolutionary computation</style></keyword><keyword><style  face="normal" font="default" size="100%">optimisation</style></keyword><keyword><style  face="normal" font="default" size="100%">optimization</style></keyword><keyword><style  face="normal" font="default" size="100%">self-adaptive differential evolution algorithm</style></keyword><keyword><style  face="normal" font="default" size="100%">self-adjusting systems</style></keyword><keyword><style  face="normal" font="default" size="100%">user-defined parameter tuning</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2009</style></year><pub-dates><date><style  face="normal" font="default" size="100%">May</style></date></pub-dates></dates><pub-location><style face="normal" font="default" size="100%">Trondheim, Norway</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">This paper proposes a novel self-adaptive scheme for the evolution of crucial control parameters in evolutionary algorithms. More specifically, we suggest to utilize the differential evolution algorithm to endemically evolve its own control parameters. To achieve this, two simultaneous instances of Differential Evolution are used, one of which is responsible for the evolution of the crucial user-defined mutation and recombination constants. This self-adaptive differential evolution algorithm alleviates the need of tuning these user-defined parameters while maintains the convergence properties of the original algorithm. The evolutionary self-adaptive scheme is evaluated through several well-known optimization benchmark functions and the experimental results indicate that the proposed approach is promising.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">M. G. Epitropakis</style></author><author><style face="normal" font="default" size="100%">V. P. Plagianakos</style></author><author><style face="normal" font="default" size="100%">M. N. Vrahatis</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Ming Zhang</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Evolutionary Algorithm Training of Higher-Order Neural Networks</style></title><secondary-title><style face="normal" font="default" size="100%">Artificial Higher Order Neural Networks for Computer Science and Engineering: Tends for Emerging Applications</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year></dates><publisher><style face="normal" font="default" size="100%">IGI Global</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">M. G. Epitropakis</style></author><author><style face="normal" font="default" size="100%">V. P. Plagianakos</style></author><author><style face="normal" font="default" size="100%">M. N. Vrahatis</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Balancing the exploration and exploitation capabilities of the Differential Evolution Algorithm</style></title><secondary-title><style face="normal" font="default" size="100%">IEEE Congress on Evolutionary Computation, 2008. CEC 2008. (IEEE World Congress on Computational Intelligence)</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">differential evolution algorithm</style></keyword><keyword><style  face="normal" font="default" size="100%">evolutionary computation</style></keyword><keyword><style  face="normal" font="default" size="100%">optimization</style></keyword><keyword><style  face="normal" font="default" size="100%">search problems</style></keyword><keyword><style  face="normal" font="default" size="100%">self-balancing hybrid mutation operator</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2008</style></year><pub-dates><date><style  face="normal" font="default" size="100%">June</style></date></pub-dates></dates><pub-location><style face="normal" font="default" size="100%">Hong Kong</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">The hybridization and composition of different Evolutionary Algorithms to improve the quality of the solutions and to accelerate execution is a common research practice. In this paper we propose a hybrid approach that combines differential evolution mutation operators in an attempt to balance their exploration and exploitation capabilities. Additionally, a self-balancing hybrid mutation operator is presented, which favors the exploration of the search space during the first phase of the optimization, while later opts for the exploitation to aid convergence to the optimum. Extensive experimental results indicate that the proposed approaches effectively enhance DEpsilas ability to accurately locate solutions in the search space.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">M. G. Epitropakis</style></author><author><style face="normal" font="default" size="100%">V. P. Plagianakos</style></author><author><style face="normal" font="default" size="100%">M. N. Vrahatis</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Non-Monotone Differential Evolution</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the 10th annual inproceedings on Genetic evolutionary computation, GECCO 2008</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2008</style></year></dates><publisher><style face="normal" font="default" size="100%">ACM</style></publisher><pub-location><style face="normal" font="default" size="100%">New York, NY, USA</style></pub-location><isbn><style face="normal" font="default" size="100%">978-1-60558-130-9</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">The Differential Evolution algorithm uses an elitist selection, constantly pushing the population in a strict downhill search, in an attempt to guarantee the conservation of the best individuals. However, when this operator is combined with an exploitive mutation operator can lead to premature convergence to an undesired region of attraction. To alleviate this problem, we propose the Non-Monotone Differential Evolution algorithm. To this end, we allow the best individual to perform some uphill movements, greatly enhancing the exploration of the search space. This approach further aids algorithm’s ability to escape undesired regions of the search space and improves its performance. The proposed approach utilizes already computed pieces of information and does not require extra function evaluations. Experimental results indicate that the proposed approach provides stable and reliable convergence.&quot; keywords = &quot;differential evolution, evolutionary algorithms, global optimization, non-monotone differential evolution</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">N. G. Pavlidis</style></author><author><style face="normal" font="default" size="100%">E. G. Pavlidis</style></author><author><style face="normal" font="default" size="100%">M. G. Epitropakis</style></author><author><style face="normal" font="default" size="100%">V. P. Plagianakos</style></author><author><style face="normal" font="default" size="100%">M. N. Vrahatis</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Computational Intelligence Algorithms For Risk-Adjusted Trading Strategies</style></title><secondary-title><style face="normal" font="default" size="100%">IEEE Congress on Evolutionary Computation, 2007. CEC 2007</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">computational intelligence algorithm</style></keyword><keyword><style  face="normal" font="default" size="100%">differential evolution</style></keyword><keyword><style  face="normal" font="default" size="100%">financial market</style></keyword><keyword><style  face="normal" font="default" size="100%">foreign exchange market</style></keyword><keyword><style  face="normal" font="default" size="100%">foreign exchange trading</style></keyword><keyword><style  face="normal" font="default" size="100%">generalized moving average rule</style></keyword><keyword><style  face="normal" font="default" size="100%">genetic algorithms</style></keyword><keyword><style  face="normal" font="default" size="100%">genetic programming</style></keyword><keyword><style  face="normal" font="default" size="100%">optimization</style></keyword><keyword><style  face="normal" font="default" size="100%">pattern detection</style></keyword><keyword><style  face="normal" font="default" size="100%">risk analysis</style></keyword><keyword><style  face="normal" font="default" size="100%">risk-adjusted trading strategy</style></keyword><keyword><style  face="normal" font="default" size="100%">statistical testing</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2007</style></year><pub-dates><date><style  face="normal" font="default" size="100%">September</style></date></pub-dates></dates><pub-location><style face="normal" font="default" size="100%">Singapore</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">This paper investigates the performance of trading strategies identified through computational intelligence techniques. We focus on trading rules derived by genetic programming, as well as, generalized moving average rules optimized through differential evolution. The performance of these rules is investigated using recently proposed risk-adjusted evaluation measures and statistical testing is carried out through simulation. Overall, the moving average rules proved to be more robust, but genetic programming seems more promising in terms of generating higher profits and detecting novel patterns in the data.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">M. G. Epitropakis</style></author><author><style face="normal" font="default" size="100%">V. P. Plagianakos</style></author><author><style face="normal" font="default" size="100%">M. N. Vrahatis</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Higher-Order Neural Networks Training Using Differential Evolution</style></title><secondary-title><style face="normal" font="default" size="100%">International Conference of Numerical Analysis and Applied Mathematics</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2006</style></year></dates><publisher><style face="normal" font="default" size="100%">Wiley-VCH</style></publisher><pub-location><style face="normal" font="default" size="100%">Hersonissos, Crete, Greece</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">M. G. Epitropakis</style></author><author><style face="normal" font="default" size="100%">V. P. Plagianakos</style></author><author><style face="normal" font="default" size="100%">M. N. Vrahatis</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Integer Weight Higher-Order Neural Network Training Using Distributed Differential Evolution</style></title><secondary-title><style face="normal" font="default" size="100%">International Conference of Computational Methods in Sciences and Engineering</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2006</style></year></dates><publisher><style face="normal" font="default" size="100%">LSCCS</style></publisher><pub-location><style face="normal" font="default" size="100%">Crete, Greece</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">M. G. Epitropakis</style></author><author><style face="normal" font="default" size="100%">M. N. Vrahatis</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Root finding and approximation approaches through neural networks</style></title><secondary-title><style face="normal" font="default" size="100%">ACM SIGSAM Bulleting</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2005</style></year></dates><volume><style face="normal" font="default" size="100%">39</style></volume><pages><style face="normal" font="default" size="100%">118-121</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">In this paper, we propose two approaches to approximate high order multivariate polynomials and to estimate the number of roots of high order univariate polynomials. We employ high order neural networks such as Ridge Polynomial Networks and Pi -- Sigma Networks, respectively. To train the networks efficiently and effectively, we recommend the application of stochastic global optimization techniques. Finally, we propose a two step neural network based technique, to estimate the number of roots of a high order univariate polynomial.
</style></abstract></record></records></xml>