Learn More
— This paper compares three different fitness diversity adaptations in Multimeme Algorithms (MmAs). These diversity indexes have been integrated within a MmA present in literature, namely Fast Adaptive Memetic Algorithm. Numerical results show that it is not possible to establish a superiority of one of these adaptive schemes over the others and choice of a(More)
Data clustering is an unsupervised data analysis and data mining technique, which offers refined and more abstract views to the inherent structure of a data set by partitioning it into a number of disjoint or overlapping (fuzzy) groups. Hundreds of clustering algorithms have been developed by researchers from a number of different scientific disciplines.(More)
This article proposes an Enhanced Memetic Differential Evolution (EMDE) for designing digital filters which aim at detecting defects of the paper produced during an industrial process. Defect detection is handled by means of two Gabor filters and their design is performed by the EMDE. The EMDE is a novel adaptive evolutionary algorithm which combines the(More)
We compared the efficiency of the independent component analysis (ICA) decomposition procedure against the difference wave (DW) and optimal digital filtering (ODF) procedures in the analysis of the mismatch negativity (MMN). The comparison was made in a group of 54 children aged 8-16 years. The MMN was elicited in a passive oddball protocol presenting(More)
A simple and general calculus for the sensitivity analysis of a feedforward MLP network in a layer-wise form is presented. Based on the local optimality conditions, some consequences for the least-means-squares learning problem are stated and further discussed. Numerical experiments with formulation and comparison of different weight decay techniques are(More)
The purpose of this paper is twofold: First aim is to seek for a proper formulation for recovering both sharp edges and smooth surfaces from a given, noisy, image. The formulations proposed here can be diierentiable, but as our numerical experiments show, so close to a nonsmooth problem that ordinary optimization methods for smooth problems, like the(More)