5,096 research outputs found
Reduction of the size of datasets by using evolutionary feature selection: the case of noise in a modern city
Smart city initiatives have emerged to mitigate the negative effects of a very fast growth of urban areas. Most of the population in our cities are exposed to high levels of noise that generate discomfort and different health problems. These issues may be mitigated by applying different smart cities solutions, some of them require high accurate noise information to provide the best quality of serve possible. In this study, we have designed a machine learning approach based on genetic algorithms to analyze noise data captured in the university campus. This method reduces the amount of data required to classify the noise by addressing a feature selection optimization problem. The experimental results have shown that our approach improved the accuracy in 20% (achieving an accuracy of 87% with a reduction of up to 85% on the original dataset).Universidad de Málaga. Campus de Excelencia Internacional Andalucía Tech.
This research has been partially funded by the Spanish MINECO and FEDER projects TIN2016-81766-REDT (http://cirti.es), and TIN2017-88213-R (http://6city.lcc.uma.es)
On the design of an ECOC-compliant genetic algorithm
Genetic Algorithms (GA) have been previously applied to Error-Correcting Output Codes (ECOC) in state-of-the-art works in order to find a suitable coding matrix. Nevertheless, none of the presented techniques directly take into account the properties of the ECOC matrix. As a result the considered search space is unnecessarily large. In this paper, a novel Genetic strategy to optimize the ECOC coding step is presented. This novel strategy redefines the usual crossover and mutation operators in order to take into account the theoretical properties of the ECOC framework. Thus, it reduces the search space and lets the algorithm to converge faster. In addition, a novel operator that is able to enlarge the code in a smart way is introduced. The novel methodology is tested on several UCI datasets and four challenging computer vision problems. Furthermore, the analysis of the results done in terms of performance, code length and number of Support Vectors shows that the optimization process is able to find very efficient codes, in terms of the trade-off between classification performance and the number of classifiers. Finally, classification performance per dichotomizer results shows that the novel proposal is able to obtain similar or even better results while defining a more compact number of dichotomies and SVs compared to state-of-the-art approaches
Bio-Inspired Resource Allocation for Relay-Aided Device-to-Device Communications
The Device-to-Device (D2D) communication principle is a key enabler of direct
localized communication between mobile nodes and is expected to propel a
plethora of novel multimedia services. However, even though it offers a wide
set of capabilities mainly due to the proximity and resource reuse gains,
interference must be carefully controlled to maximize the achievable rate for
coexisting cellular and D2D users. The scope of this work is to provide an
interference-aware real-time resource allocation (RA) framework for relay-aided
D2D communications that underlay cellular networks. The main objective is to
maximize the overall network throughput by guaranteeing a minimum rate
threshold for cellular and D2D links. To this direction, genetic algorithms
(GAs) are proven to be powerful and versatile methodologies that account for
not only enhanced performance but also reduced computational complexity in
emerging wireless networks. Numerical investigations highlight the performance
gains compared to baseline RA methods and especially in highly dense scenarios
which will be the case in future 5G networks.Comment: 6 pages, 6 figure
Cosmic Swarms: A search for Supermassive Black Holes in the LISA data stream with a Hybrid Evolutionary Algorithm
We describe a hybrid evolutionary algorithm that can simultaneously search
for multiple supermassive black hole binary (SMBHB) inspirals in LISA data. The
algorithm mixes evolutionary computation, Metropolis-Hastings methods and
Nested Sampling. The inspiral of SMBHBs presents an interesting problem for
gravitational wave data analysis since, due to the LISA response function, the
sources have a bi-modal sky solution. We show here that it is possible not only
to detect multiple SMBHBs in the data stream, but also to investigate
simultaneously all the various modes of the global solution. In all cases, the
algorithm returns parameter determinations within (as estimated from
the Fisher Matrix) of the true answer, for both the actual and antipodal sky
solutions.Comment: submitted to Classical & Quantum Gravity. 19 pages, 4 figure
Proposal and Comparative Study of Evolutionary Algorithms for Optimum Design of a Gear System
This paper proposes a novel metaheuristic framework using a Differential Evolution (DE) algorithm with the Non-dominated Sorting Genetic Algorithm-II (NSGA-II). Both algorithms are combined employing a collaborative strategy with sequential execution, which is called DE-NSGA-II. The DE-NSGA-II takes advantage of the exploration abilities of the multi-objective evolutionary algorithms strengthened with the ability to search global mono-objective optimum of DE, that enhances the capability of finding those extreme solutions of Pareto Optimal Front (POF) difficult to achieve. Numerous experiments and performance comparisons between different evolutionary algorithms were performed on a referent problem for the mono-objective and multi-objective literature, which consists of the design of a double reduction gear train. A preliminary study of the problem, solved in an exhaustive way, discovers the low density of solutions in the vicinity of the optimal solution (mono-objective case) as well as in some areas of the POF of potential interest to a decision maker (multi-objective case). This characteristic of the problem would explain the considerable difficulties for its resolution when exact methods and/or metaheuristics are used, especially in the multi-objective case. However, the DE-NSGA-II framework exceeds these difficulties and obtains the whole POF which significantly improves the few previous multi-objective studies.Fil: Méndez Babey, Máximo. Universidad de Las Palmas de Gran Canaria; EspañaFil: Rossit, Daniel Alejandro. Universidad Nacional del Sur. Departamento de Ingeniería; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca. Instituto de Matemática Bahía Blanca. Universidad Nacional del Sur. Departamento de Matemática. Instituto de Matemática Bahía Blanca; ArgentinaFil: González, Begoña. Universidad de Las Palmas de Gran Canaria; EspañaFil: Frutos, Mariano. Universidad Nacional del Sur. Departamento de Ingeniería; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca. Instituto de Investigaciones Económicas y Sociales del Sur. Universidad Nacional del Sur. Departamento de Economía. Instituto de Investigaciones Económicas y Sociales del Sur; Argentin
An efficient decision rule-based system for the protein residue-residue contact prediction
Protein structure prediction remains one of the
most important challenges in molecular biology. Contact maps
have been extensively used as a simplified representation of
protein structures. In this work, we propose a multi-objective
evolutionary approach for contact map prediction. The proposed
method bases the prediction on a set of physico-chemical prop erties and structural features of the amino acids, as well as
evolutionary information in the form of an amino acid position
specific scoring matrix (PSSM). The proposed technique produces
a set of decision rules that identify contacts between amino acids.
Results obtained by our approach are presented and confirm the
validity of our proposal.Junta de Andalucía P07-TIC-02611Ministerio de Educación y Ciencia TIN2011-28956-C02-0
- …