A novel algorithm for feature selection using Harmony Search and its application for non-technical losses detection

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Feature selection through gravitational search algorithm

In this paper we deal with the problem of feature selection by introducing a new approach based on Gravitational Search Algorithm (GSA). The proposed algorithm combines the optimization behavior of GSA together with the speed of Optimum-Path Forest (OPF) classifier in order to provide a fast and accurate framework for feature selection. Experiments on datasets obtained from a wide range of applications, such as vowel recognition, image classification and fraud detection in power distribution systems are conducted in order to asses the robustness of the proposed technique against Principal Component Analysis (PCA), Linear Discriminant Analysis (LDA) and a Particle Swarm Optimization (PSO)-based algorithm for feature selection.

Economic viability and selection of irrigation systems using simulation and stochastic dominance

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Search for supersymmetry in final states with missing transverse energy and 0, 1, 2, or ≥3 b-quark jets in 7 TeV pp collisions using the variable α T

A search for supersymmetry in final states with jets and missing transverse energy is performed in pp collisions at a centre-of-mass energy of s=7 TeV. The data sample corresponds to an integrated luminosity of 4.98 fb-1 collected by the CMS experiment at the LHC. In this search, a dimensionless kinematic variable, α T, is used as the main discriminator between events with genuine and misreconstructed missing transverse energy. The search is performed in a signal region that is binned in the scalar sum of the transverse energy of jets and the number of jets identified as originating from a bottom quark. No excess of events over the standard model expectation is found. Exclusion limits are set in the parameter space of the constrained minimal supersymmetric extension of the standard model, and also in simplified models, with a special emphasis on compressed spectra and third-generation scenarios.[Figure not available: see fulltext.] © 2013 CERN for the benefit of the CMS Collaboration.

BCS: A Binary Cuckoo Search algorithm for feature selection

Feature selection has been actively pursued in the last years, since to find the most discriminative set of features can enhance the recognition rates and also to make feature extraction faster. In this paper, the propose a new feature selection called Binary Cuckoo Search, which is based on the behavior of cuckoo birds. The experiments were carried out in the context of theft detection in power distribution systems in two datasets obtained from a Brazilian electrical power company, and have demonstrated the robustness of the proposed technique against with several others nature-inspired optimization techniques. © 2013 IEEE.

Optimizing feature selection through binary charged system search

Feature selection aims to find the most important information from a given set of features. As this task can be seen as an optimization problem, the combinatorial growth of the possible solutions may be inviable for a exhaustive search. In this paper we propose a new nature-inspired feature selection technique based on the Charged System Search (CSS), which has never been applied to this context so far. The wrapper approach combines the power of exploration of CSS together with the speed of the Optimum-Path Forest classifier to find the set of features that maximizes the accuracy in a validating set. Experiments conducted in four public datasets have demonstrated the validity of the proposed approach can outperform some well-known swarm-based techniques. © 2013 Springer-Verlag.

Eluding oblivion with smart stochastic selection of synaptic updates

The variables involved in the equations that describe realistic synaptic dynamics always vary in a limited range. Their boundedness makes the synapses forgetful, not for the mere passage of time, but because new experiences overwrite old memories. The forgetting rate depends on how many synapses are modified by each new experience: many changes means fast learning and fast forgetting, whereas few changes means slow learning and long memory retention. Reducing the average number of modified synapses can extend the memory span at the price of a reduced amount of information stored when a new experience is memorized. Every trick which allows to slow down the learning process in a smart way can improve the memory performance. We review some of the tricks that allow to elude fast forgetting (oblivion). They are based on the stochastic selection of the synapses whose modifications are actually consolidated following each new experience. In practice only a randomly selected, small fraction of the synapses eligible for an update are actually modified. This allows to acquire the amount of information necessary to retrieve the memory without compromising the retention of old experiences. The fraction of modified synapses can be further reduced in a smart way by changing synapses only when it is really necessary, i.e. when the post-synaptic neuron does not respond as desired. Finally we show that such a stochastic selection emerges naturally from spike driven synaptic dynamics which read noisy pre and post-synaptic neural activities. These activities can actually be generated by a chaotic system.

A Cooperative and Adaptive Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows

In this paper we propose two cooperation schemes to compose new parallel variants of the Variable Neighborhood Search (VNS). On the one hand, a coarse-grained cooperation scheme is introduced which is well suited for being enhanced with a solution warehouse to store and manage the so far best found solutions and a self-adapting mechanism for the most important search parameters. This makes an a priori parameter tuning obsolete. On the other hand, a fine-grained scheme was designed to reproduce the successful properties of the sequential VNS. In combination with the use of parallel exploration threads all of the best solutions and 11 out of 20 new best solutions for the Multi Depot Vehicle Routing Problem with Time Windows were found.

Comparison of metaheuristic strategies for peakbin selection in proteomic mass spectrometry data

Mass spectrometry (MS) data provide a promising strategy for biomarker discovery. For this purpose, the detection of relevant peakbins in MS data is currently under intense research. Data from mass spectrometry are challenging to analyze because of their high dimensionality and the generally low number of samples available. To tackle this problem, the scientific community is becoming increasingly interested in applying feature subset selection techniques based on specialized machine learning algorithms. In this paper, we present a performance comparison of some metaheuristics: best first (BF), genetic algorithm (GA), scatter search (SS) and variable neighborhood search (VNS). Up to now, all the algorithms, except for GA, have been first applied to detect relevant peakbins in MS data. All these metaheuristic searches are embedded in two different filter and wrapper schemes coupled with Naive Bayes and SVM classifiers.

Bayesian model selection methodology for road safety

Road accidents are a very relevant issue in many countries and macroeconomic models are very frequently applied by academia and administrations to reduce their frequency and consequences. The selection of explanatory variables and response transformation parameter within the Bayesian framework for the selection of the set of explanatory variables a TIM and 3IM (two input and three input models) procedures are proposed. The procedure also uses the DIC and pseudo -R2 goodness of fit criteria. The model to which the methodology is applied is a dynamic regression model with Box-Cox transformation (BCT) for the explanatory variables and autorgressive (AR) structure for the response. The initial set of 22 explanatory variables are identified. The effects of these factors on the fatal accident frequency in Spain, during 2000-2012, are estimated. The dependent variable is constructed considering the stochastic trend component.

Human Search for a Target on a Textured Background is Consistent with a Stochastic Model

This research was supported by the James S. McDonnell Foundation (ARH). Early version was supported by EPSRC grants EP/F02553X/1 and EP/D059364/1.

B lymphocyte involvement in ankylosing spondylitis: the heavy chain variable segment gene repertoire of B lymphocytes from germinal center-like foci in the synovial membrane indicates antigen selection

The synovial membrane (SM) of affected joints in ankylosing spondylitis (AS) is infiltrated by germinal center-like aggregates (foci) of lymphocytes similar to rheumatoid arthritis (RA). We characterized the rearranged heavy chain variable segment (VH) genes in the SM for gene usage and the mutational pattern to elucidate the B lymphocyte involvement in AS.

Improved solutions to dynamic and stochastic maritime pick-up and delivery problems using local search.

Heuristics for stochastic and dynamic vehicle routing problems are often kept relatively simple, in part due to the high computational burden resulting from having to consider stochastic information in some form. In this work, three existing heuristics are extended by three different local search variations: a first improvement descent using stochastic information, a tabu search using stochastic information when updating the incumbent solution, and a tabu search using stochastic information when selecting moves based on a list of moves determined through a proxy evaluation. In particular, the three local search variations are designed to utilize stochastic information in the form of sampled scenarios. The results indicate that adding local search using stochastic information to the existing heuristics can further reduce operating costs for shipping companies by 0.5–2 %. While the existing heuristics could produce structurally different solutions even when using similar stochastic information in the search, the appended local search methods seem able to make the final solutions more similar in structure.