Memetic Pareto Evolutionary Artificial Neural Networks for the determination of growth limits of Listeria Monocytogenes

The main objective of this work is to automatically design neural network models with sigmoidal basis units for classification tasks, so that classifiers are obtained in the most balanced way possible in terms of CCR and Sensitivity (given by the lowest percentage of examples correctly predicted to belong to each class). We present a Memetic Pareto Evolutionary NSGA2 (MPENSGA2) approach based on the Pareto-NSGAII evolution (PNSGAII) algorithm. We propose to augmente it with a local search using the improved Rprop—IRprop algorithm for the prediction of growth/no growth of L. monocytogenes as a function of the storage temperature, pH, citric (CA) and ascorbic acid (AA). The results obtained show that the generalization ability can be more efficiently improved within a framework that is multi-objective instead of a within a single-objective one

A Constrained Multi-Objective Learning Algorithm for Feed-Forward Neural Network Classifiers

This paper proposes a new approach to address the optimal design of a Feed-forward Neural Network (FNN) based classifier. The originality of the proposed methodology, called CMOA, lie in the use of a new constraint handling technique based on a self-adaptive penalty procedure in order to direct the entire search effort towards finding only Pareto optimal solutions that are acceptable. Neurons and connections of the FNN Classifier are dynamically built during the learning process. The approach includes differential evolution to create new individuals and then keeps only the non-dominated ones as the basis for the next generation. The designed FNN Classifier is applied to six binary classification benchmark problems, obtained from the UCI repository, and results indicated the advantages of the proposed approach over other existing multi-objective evolutionary neural networks classifiers reported recently in the literature

Metaheuristic design of feedforward neural networks: a review of two decades of research

Over the past two decades, the feedforward neural network (FNN) optimization has been a key interest among the researchers and practitioners of multiple disciplines. The FNN optimization is often viewed from the various perspectives: the optimization of weights, network architecture, activation nodes, learning parameters, learning environment, etc. Researchers adopted such different viewpoints mainly to improve the FNN's generalization ability. The gradient-descent algorithm such as backpropagation has been widely applied to optimize the FNNs. Its success is evident from the FNN's application to numerous real-world problems. However, due to the limitations of the gradient-based optimization methods, the metaheuristic algorithms including the evolutionary algorithms, swarm intelligence, etc., are still being widely explored by the researchers aiming to obtain generalized FNN for a given problem. This article attempts to summarize a broad spectrum of FNN optimization methodologies including conventional and metaheuristic approaches. This article also tries to connect various research directions emerged out of the FNN optimization practices, such as evolving neural network (NN), cooperative coevolution NN, complex-valued NN, deep learning, extreme learning machine, quantum NN, etc. Additionally, it provides interesting research challenges for future research to cope-up with the present information processing era

Hybrib NSGA-II optimization for improving the three-term BP network for multiclass classification problems

Recently, hybrid algorithms have received considerable attention from a number of researchers. This paper presents a hybrid of the multiobjective evolutionary algorithm to gain a better accuracy of the fi nal solutions.The aim of using the hybrid algorithm is to improve the multiobjective evolutionary algorithm performance in terms of the enhancement of all the individuals in the population and increase the quality of the Pareto optimal solutions.The multiobjective evolutionary algorithm used in this study is a nondominated sorting genetic algorithm-II (NSGA-II) together with its hybrid, the backpropagation algorithm (BP), which is used as a local search algorithm to optimize the accuracy and complexity of the three-term backpropagation (TBP) network. The outcome positively demonstrates that the hybrid algorithm is able to improve the classification performance with a smaller number of hidden nodes and is effective in multiclass classifi cation problems.Furthermore, the results indicate that the proposed hybrid method is a potentially useful classifi er for enhancing the classification process ability when compared with the multiobjective genetic algorithm based on the TBP network (MOGATBP) and certain other methods found in the literature

Microbiología predictiva: una ciencia en auge

En las últimas dos décadas, para el estudio de la microbiología de alimentos, se han incluido como herramientas de análisis, el uso  de la matemática y la estadística; tales conocimientos se combinan para desarrollar modelos matemáticos que describan la evolución de los microorganismos en los alimentos [1]. Para los modelos predictivos hay una gran variedad de estudios aplicados en diferentes matrices e industrias alimenticias [2-4]; estos buscan determinar a priori las condiciones de proceso (pH, la temperatura, la actividad de agua, el tiempo de agitación, entre otros), en las cuales hay activación, desactivación, crecimiento o muerte de los microorganismos que pueden ser perjudiciales tanto para el ser humano como para las propiedades organolépticas y nutricionales de un alimento [5, 6], de esta manera establecer puntos de control que eviten tales resultados [7, 8]. Los modelos matemáticos incluyen ecuaciones de diversos tipos como las polinómicas, logarítmicas, exponenciales, diferenciales, hasta llegar a modelos que incluyan ecuaciones de  redes neuronales artificiales; también se clasifican en modelos primarios, secundarios o terciarios; que después de ser consolidados y aplicados logran unas predicciones robustas y seguras; sobre el comportamiento de los microorganismos en alimentos [9]

A Neuro-Evolutionary Approach to Electrocardiographic Signal Classification

International audienceThis chapter presents an evolutionary Artificial Neural Networks (ANN) classifier system as a heartbeat classification algorithm designed according to the rules of the PhysioNet/Computing in Cardiology Challenge 2011 (Moody, Comput Cardiol Challenge 38:273-276, 2011), whose aim is to develop an efficient algorithm able to run within a mobile phone that can provide useful feedback when acquiring a diagnostically useful 12-lead Electrocardiography (ECG) recording. The method used to solve this problem is a very powerful natural computing analysis tool, namely evolutionary neural networks, based on the joint evolution of the topology and the connection weights relying on a novel similarity-based crossover. The chapter focuses on discerning between usable and unusable electrocardiograms tele-medically acquired from mobile embedded devices. A preprocessing algorithm based on the Discrete Fourier Transform has been applied before the evolutionary approach in order to extract an ECG feature dataset in the frequency domain. Finally, a series of tests has been carried out in order to evaluate the performance and the accuracy of the classifier system for such a challenge

Validación de las redes neuronales artificiales como metodología para la asignación donante-receptor en el trasplante hepático

1. Introducción o motivación de la tesis. El trasplante hepático constituye la mejor opción terapéutica para un gran número de patologías hepáticas en fase terminal. Desafortunadamente, existe un disbalance entre el número de candidatos y el número de donantes disponibles, lo que conlleva a muertes y exclusiones en lista de espera. En los últimos años se han realizado numerosos esfuerzos para incrementar el pool de donantes, así como para optimizar la priorización en lista de los posibles receptores. Entre ellos, destacan la utilización de los denominados “donantes con criterios extendidos” (ECD, extended criteria donors) y la adopción de un sistema de priorización mediante un score basado en la gravedad del candidato (MELD, Mayo Model for End Stage Liver Disease). La asignación donante-receptor es un factor determinante en los resultados del trasplante hepático, para lo cual se han propuesto múltiples “scores” en la literatura. Sin embargo, ninguno de ellos se considera óptimo para realizar este emparejamiento. En 2014, nuestro grupo publicó la utilidad de las redes neuronales artificiales (RNA) como una herramienta óptima para el matching donante-receptor en el trasplante hepático. Para ello se realizó un estudio multicéntrico a nivel nacional, en el que se demostró la superioridad de este modelo para predecir la supervivencia post-trasplante. El objetivo de nuestro estudio es analizar si las redes neuronales tienen un comportamiento similar al demostrado en España en un sistema de salud diferente, y si son una herramienta superior a los modelos actuales utilizados para el matching donante-receptor. 2. Contenido de la investigación. Se recogieron 822 pares donante-receptor (D-R) de trasplantes hepáticos realizados de forma consecutiva en el hospital King’s College de Londres durante los años 2002 a 2010, teniendo en cuenta variables del donante, del receptor y del trasplante. Para cada par, se calcularon dos probabilidades: la probabilidad de supervivencia (CCR) y la probabilidad de pérdida del injerto (MS) a los 3 meses del trasplante. Para ello se construyeron dos modelos de redes neuronales artificiales diferentes y no complementarios: el modelo de aceptación y el modelo de rechazo. Se construyeron varios modelos: 1) Entrenamiento y generalización con los pares D-R del hospital británico (a 3 y a 12 meses post-trasplante) , 2) Entrenamiento con pares D-R españoles y generalización con los británicos y 3) Modelo combinado: entrena y generaliza con pares españoles y británicos. Además, para ayudar en la toma de decisiones según los resultados obtenidos por la red neuronal, se construyó un sistema basado en reglas. Los modelos diseñados para el hospital King’s College demostraron una excelente capacidad de predicción para ambos: 3 meses (CCR-AUC=0,9375; MS-AUC=0,9374) y 12 meses (CCR-AUC=0,7833; MS-AUC=0,8153), casi un 15% superior a la mejor capacidad de predicción obtenida por otros scores como MELD o BAR (Balance of Risk). Además, estos resultados mejoran los publicados previamente en el modelo multicéntrico español. Sin embargo, esta capacidad de predicción no es tan buena cuando el modelo entrena y generaliza con pares D-R procedentes de sistemas de salud diferentes, ni tampoco en el modelo combinado. 3.Conclusiones. 1. El empleo de Redes Neuronales Artificiales para la Asignación Donante-Receptor en el Trasplante Hepático ha demostrado excelentes capacidades de predicción de Supervivencia y No Supervivencia del injerto, al ser validadas en un sistema de salud distinto de otro país, por lo tanto la metodología de la Inteligencia Artificial ha quedado claramente validada como herramienta óptima para el “matching D-R”. 2. Nuestros resultados apoyan que los distintos equipos de Trasplante Hepático consideren las Redes Neuronales Artificiales como el método más exhaustivo y objetivo descrito hasta la fecha para el manejo de la lista de espera del Trasplante Hepático, evitando criterios subjetivos y arbitrarios y maximizando los principios de equidad, utilidad y eficiencia. 3. Nuestro modelo de validación, es decir, la RNA generada con pares D-R del Hospital King’s College de Londres ha logrado la máxima capacidad de predicción, superando el resto de modelos y apoyando el hecho de que cada RNA debe ser entrenada, testada y optimizada para un propósito específico, en una única población. Así, cada programa de TH debería disponer de su propio modelo construido con sus propios datos, para apoyar la decisión del “matching D-R”. 4. El modelo de Asignación D-R generado por las RNAs combina lo mejor del sistema MELD con el Beneficio de Supervivencia Global, usando para ello un sistema basado en reglas, maximizando la utilidad de los injertos disponibles. Esto los convierte en sistemas complementarios para un mismo fin, en lugar de considerarlos competitivos

The Analysis and Application of Artificial Neural Networks for Early Warning Systems in Hydrology and the Environment

Final PhD thesis submissionArtificial Neural Networks (ANNs) have been comprehensively researched, both from a computer scientific perspective and with regard to their use for predictive modelling in a wide variety of applications including hydrology and the environment. Yet their adoption for live, real-time systems remains on the whole sporadic and experimental. A plausible hypothesis is that this may be at least in part due to their treatment heretofore as “black boxes” that implicitly contain something that is unknown, or even unknowable. It is understandable that many of those responsible for delivering Early Warning Systems (EWS) might not wish to take the risk of implementing solutions perceived as containing unknown elements, despite the computational advantages that ANNs offer. This thesis therefore builds on existing efforts to open the box and develop tools and techniques that visualise, analyse and use ANN weights and biases especially from the viewpoint of neural pathways from inputs to outputs of feedforward networks. In so doing, it aims to demonstrate novel approaches to self-improving predictive model construction for both regression and classification problems. This includes Neural Pathway Strength Feature Selection (NPSFS), which uses ensembles of ANNs trained on differing subsets of data and analysis of the learnt weights to infer degrees of relevance of the input features and so build simplified models with reduced input feature sets. Case studies are carried out for prediction of flooding at multiple nodes in urban drainage networks located in three urban catchments in the UK, which demonstrate rapid, accurate prediction of flooding both for regression and classification. Predictive skill is shown to reduce beyond the time of concentration of each sewer node, when actual rainfall is used as input to the models. Further case studies model and predict statutory bacteria count exceedances for bathing water quality compliance at 5 beaches in Southwest England. An illustrative case study using a forest fires dataset from the UCI machine learning repository is also included. Results from these model ensembles generally exhibit improved performance, when compared with single ANN models. Also ensembles with reduced input feature sets, using NPSFS, demonstrate as good or improved performance when compared with the full feature set models. Conclusions are drawn about a new set of tools and techniques, including NPSFS and visualisation techniques for inspection of ANN weights, the adoption of which it is hoped may lead to improved confidence in the use of ANN for live real-time EWS applications.EPSRCUKWIRThe Environment Agenc

Inductive Pattern Formation

With the extended computational limits of algorithmic recursion, scientific investigation is transitioning away from computationally decidable problems and beginning to address computationally undecidable complexity. The analysis of deductive inference in structure-property models are yielding to the synthesis of inductive inference in process-structure simulations. Process-structure modeling has examined external order parameters of inductive pattern formation, but investigation of the internal order parameters of self-organization have been hampered by the lack of a mathematical formalism with the ability to quantitatively define a specific configuration of points. This investigation addressed this issue of quantitative synthesis. Local space was developed by the Poincare inflation of a set of points to construct neighborhood intersections, defining topological distance and introducing situated Boolean topology as a local replacement for point-set topology. Parallel development of the local semi-metric topological space, the local semi-metric probability space, and the local metric space of a set of points provides a triangulation of connectivity measures to define the quantitative architectural identity of a configuration and structure independent axes of a structural configuration space. The recursive sequence of intersections constructs a probabilistic discrete spacetime model of interacting fields to define the internal order parameters of self-organization, with order parameters external to the configuration modeled by adjusting the morphological parameters of individual neighborhoods and the interplay of excitatory and inhibitory point sets. The evolutionary trajectory of a configuration maps the development of specific hierarchical structure that is emergent from a specific set of initial conditions, with nested boundaries signaling the nonlinear properties of local causative configurations. This exploration of architectural configuration space concluded with initial process-structure-property models of deductive and inductive inference spaces. In the computationally undecidable problem of human niche construction, an adaptive-inductive pattern formation model with predictive control organized the bipartite recursion between an information structure and its physical expression as hierarchical ensembles of artificial neural network-like structures. The union of architectural identity and bipartite recursion generates a predictive structural model of an evolutionary design process, offering an alternative to the limitations of cognitive descriptive modeling. The low computational complexity of these models enable them to be embedded in physical constructions to create the artificial life forms of a real-time autonomously adaptive human habitat