Search results for "Computer Science::Neural and Evolutionary Computation"
showing 10 items of 61 documents
Particle Swarm Optimization as a New Measure of Machine Translation Efficiency
2018
The present work proposes a new approach to measuring efficiency of evolutionary algorithm-based Machine Translation. We implement some attributes of evolutionary algorithms performing cosine similarity objective function of a Particle Swarm Optimization (PSO) algorithm then, we evaluate an English text set for translation precision into the Spanish text as a simulated benchmark, and explore the backward process. Our results show that PSO algorithm can be used for translation of multiple language sentences with one identifier only, in other words the technology presented is language-pair independent. Specifically, we indicate that our cosine similarity objective function improves the veloci…
Shaping communities of local optima by perturbation strength
2017
Recent work discovered that fitness landscapes induced by Iterated Local Search (ILS) may consist of multiple clusters, denoted as funnels or communities of local optima. Such studies exist only for perturbation operators (kicks) with low strength. We examine how different strengths of the ILS perturbation operator affect the number and size of clusters. We present an empirical study based on local optima networks from NK fitness landscapes. Our results show that a properly selected perturbation strength can help overcome the effect of ILS getting trapped in clusters of local optima. This has implications for designing effective ILS approaches in practice, where traditionally only small per…
AMaLGaM IDEAs in noiseless black-box optimization benchmarking
2009
This paper describes the application of a Gaussian Estimation-of-Distribution (EDA) for real-valued optimization to the noiseless part of a benchmark introduced in 2009 called BBOB (Black-Box Optimization Benchmarking). Specifically, the EDA considered here is the recently introduced parameter-free version of the Adapted Maximum-Likelihood Gaussian Model Iterated Density-Estimation Evolutionary Algorithm (AMaLGaM-IDEA). Also the version with incremental model building (iAMaLGaM-IDEA) is considered.
A hybrid metaheuristic for the cyclic antibandwidth problem
2013
We propose a hybrid artificial bee colony algorithm for the cyclic antibandwidth problem.We present a computational comparison of different parameter settings.We derive a fine-tuning hybrid artificial bee colony algorithm.The proposal is very competitive with the state-of-the-art algorithm for the cyclic antibandwidth problem. In this paper, we propose a hybrid metaheuristic algorithm to solve the cyclic antibandwidth problem. This hard optimization problem consists of embedding an n-vertex graph into the cycle Cn, such that the minimum distance (measured in the cycle) of adjacent vertices is maximized. It constitutes a natural extension of the well-known antibandwidth problem, and can be v…
Memetic Variation Local Search vs. Life-Time Learning in Electrical Impedance Tomography
2009
In this article, various metaheuristics for a numerical optimization problem with application to Electric Impedance Tomography are tested and compared. The experimental setup is composed of a real valued Genetic Algorithm, the Differential Evolution, a self adaptive Differential Evolution recently proposed in literature, and two novel Memetic Algorithms designed for the problem under study. The two proposed algorithms employ different algorithmic philosophies in the field of Memetic Computing. The first algorithm integrates a local search into the operations of the offspring generation, while the second algorithm applies a local search to individuals already generated in the spirit of life-…
A novel abstraction for swarm intelligence: particle field optimization
2016
Particle swarm optimization (PSO) is a popular meta-heuristic for black-box optimization. In essence, within this paradigm, the system is fully defined by a swarm of "particles" each characterized by a set of features such as its position, velocity and acceleration. The consequent optimized global best solution is obtained by comparing the personal best solutions of the entire swarm. Many variations and extensions of PSO have been developed since its creation in 1995, and the algorithm remains a popular topic of research. In this work we submit a new, abstracted perspective of the PSO system, where we attempt to move away from the swarm of individual particles, but rather characterize each …
Decision Making on Pareto Front Approximations with Inherent Nondominance
2011
t Approximating the Pareto fronts of nonlinear multiobjective optimization problems is considered and a property called inherent nondominance is proposed for such approximations. It is shown that an approximation having the above property can be explored by interactively solving a multiobjective optimization problem related to it. This exploration can be performed with available interactive multiobjective optimization methods. The ideas presented are especially useful in solving computationally expensive multiobjective optimization problems with costly function value evaluations. peerReviewed
The Random Neural Network Model for the On-line Multicast Problem
2005
In this paper we propose the adoption of the Random Neural Network Model for the solution of the dynamic version of the Steiner Tree Problem in Networks (SPN). The Random Neural Network (RNN) is adopted as a heuristic capable of improving solutions achieved by previously proposed dynamic algorithms. We adapt the RNN model in order to map the network characteristics during a multicast transmission. The proposed methodology is validated by means of extensive experiments.
Demonstration of background rejection using deep convolutional neural networks in the NEXT experiment
2021
[EN] Convolutional neural networks (CNNs) are widely used state-of-the-art computer vision tools that are becoming increasingly popular in high-energy physics. In this paper, we attempt to understand the potential of CNNs for event classification in the NEXT experiment, which will search for neutrinoless double-beta decay in Xe-136. To do so, we demonstrate the usage of CNNs for the identification of electron-positron pair production events, which exhibit a topology similar to that of a neutrinoless double-beta decay event. These events were produced in the NEXT-White high-pressure xenon TPC using 2.6 MeV gamma rays from a Th-228 calibration source. We train a network on Monte Carlo-simulat…
Artificial neural networks for neutron/ γ discrimination in the neutron detectors of NEDA
2020
Three different Artificial Neural Network architectures have been applied to perform neutron/? discrimination in NEDA based on waveform and time-of-flight information. Using the coincident ?-rays from AGATA, we have been able to measure and compare on real data the performances of the Artificial Neural Networks as classifiers. While the general performances are quite similar for the data set we used, differences, in particular related to the computing times, have been highlighted. One of the Artificial Neural Network architecture has also been found more robust to time misalignment of the waveforms. Such a feature is of great interest for online processing of waveforms. Narodowe Centrum Nau…