Learning and evolution are two fundamental forms of adaptation. There has been a great interest in combining learning and evolution with artificial neural networks (ANNs) in recent years. This paper: 1) reviews different combinations between ANNs and evolutionary algorithms (EAs), including using EAs to evolve ANN connection weights, architectures, learning rules, and input features; 2) discusses different search operators which have been used in various EAs; and 3) points out possible future research directions. It is shown, through a considerably large literature review, that combinations between ANNs and EAs can lead to significantly better intelligent systems than relying on ANNs or EAs alone.

/pdf/evolving-artificial-neural-networks-4kzrbu7pkn.pdf

Evolving artificial neural networks

The Artificial Intelligence field continues to be plagued by what can only be described as ‘bold promises for the future syndrome’, often perpetrated by researchers who should know better. While impartial assessment can point to concrete contributions over the past 50 years (such as automated theorem proving, games strategies, the LISP and Prolog high-level computer languages, Automatic Speech Recognition, Natural Language Processing, mobile robot path planning, unmanned vehicles, humanoid robots, data mining, and more), the more cynical argue that AI has witnessed more than its fair share of ‘unmitigated disasters’ during this time – see, for example [3,58,107,125,186]. The general public becomes rapidly jaded with such ‘bold predictions’ that fail to live up to their original hype, and which ultimately render the zealots’ promises as counter-productive.

Computational Intelligence: An Introduction

The generic denomination of ‘Memetic Algorithms’ (MAs) is used to encompass a broad class of metaheuristics (i.e. general purpose methods aimed to guide an underlying heuristic). The method is based on a population of agents and proved to be of practical success in a variety of problem domains and in particular for the approximate solution of NP Optimization problems. Unlike traditional Evolutionary Computation (EC) methods, MAs are intrinsically concerned with exploiting all available knowledge about the problem under study. The incorporation of problem domain knowledge is not an optional mechanism, but a fundamental feature that characterizes MAs. This functioning philosophy is perfectly illustrated by the term “memetic”. Coined by R. Dawkins [52], the word ‘meme’ denotes an analogous to the gene in the context of cultural evolution [154]. In Dawkins’ words:

/pdf/a-gentle-introduction-to-memetic-algorithms-44dcqfqqiz.pdf

A Gentle Introduction to Memetic Algorithms

Data Mining is one of the most motivating area of research that is become increasingly popular in health organization. Data Mining plays an important role for uncovering new trends in healthcare organization which in turn helpful for all the parties associated with this field. This survey explores the utility of various Data Mining techniques such as classification, clustering, association, regression in health domain. In this paper, we present a brief introduction of these techniques and their advantages and disadvantages. This survey also highlights applications, challenges and future issues of Data Mining in healthcare. Recommendation regarding the suitable choice of available Data Mining technique is also discussed in this paper.

/pdf/a-survey-on-data-mining-approaches-for-healthcare-qrw5pk91bb.pdf

A survey on Data Mining approaches for Healthcare

The Triune Brain in Evolution: Role in Paleocerebml Functions

Invoking Emotions in a Dialog System based on Word-Impressions

Nowadays, with the increasing attention being paid to social media, a huge number of georeferenced documents, which include location information, are posted on social media sites. People transmit and collect information over the Internet through these georeferenced documents. Georeferenced documents are usually related to not only personal topics but also local topics and events. Therefore, extracting bursty areas associated with local topics and events from georeferenced documents is one of the most important challenges in different application domains. In this paper, a novel spatiotemporal clustering algorithm, called the (ϵ,τ)-density-based spatiotemporal clustering algorithm, for extracting bursty areas from georeferenced documents is proposed. The proposed clustering algorithm can recognize not only temporally-separated but also spatially-separated clusters. To evaluate our proposed clustering algorithm, geo-tagged tweets posted on the Twitter site are used. The experimental results show that the (ϵ,τ)-density-based spatiotemporal clustering algorithm can extract bursty areas as (ϵ,τ)-density-based spatiotemporal clusters associated with local topics and events.

Density-Based Spatiotemporal Clustering Algorithm for Extracting Bursty Areas from Georeferenced Documents

Deep Belief Network (DBN) has a deep architecture that represents multiple features of input patterns hierarchically with the pre-trained Restricted Boltzmann Machines (RBM). A traditional RBM or DBN model cannot change its network structure during the learning phase. Our proposed adaptive learning method can discover the optimal number of hidden neurons and weights and/or layers according to the input space. The model is an important method to take account of the computational cost and the model stability. The regularities to hold the sparse structure of network is considerable problem, since the extraction of explicit knowledge from the trained network should be required. In our previous research, we have developed the hybrid method of adaptive structural learning method of RBM and Learning Forgetting method to the trained RBM. In this paper, we propose the adaptive learning method of DBN that can determine the optimal number of layers during the learning. We evaluated our proposed model on some benchmark data sets.

An adaptive learning method of Deep Belief Network by layer generation algorithm

Restricted Boltzmann Machine (RBM) is a generative stochastic energy-based model of artificial neural network for unsupervised learning. Recently, RBM is well known to be a pre-training method of Deep Learning. In addition to visible and hidden neurons, the structure of RBM has a number of parameters such as the weights between neurons and the coefficients for them. Therefore, we may meet some difficulties to determine an optimal network structure to analyze big data. In order to evade the problem, we investigated the variance of parameters to find an optimal structure during learning. For the reason, we should check the variance of parameters to cause the fluctuation for energy function in RBM model. In this paper, we propose the adaptive learning method of RBM that can discover an optimal number of hidden neurons according to the training situation by applying the neuron generation and annihilation algorithm. In this method, a new hidden neuron is generated if the energy function is not still converged and the variance of the parameters is large. Moreover, the inactivated hidden neuron will be annihilated if the neuron does not affect the learning situation. The experimental results for some benchmark data sets were discussed in this paper.

An adaptive learning method of Restricted Boltzmann Machine by neuron generation and annihilation algorithm

We developed the Coronary Heart Disease Database for the purpose of evaluating prognostic systems. The database consists of four training data-sets and one testing dataset, each of which includes more than ten thousand records related to the development of coronary heart disease.

Takumi Ichimura

Papers

Invoking Emotions in a Dialog System based on Word-Impressions

Density-Based Spatiotemporal Clustering Algorithm for Extracting Bursty Areas from Georeferenced Documents

An adaptive learning method of Deep Belief Network by layer generation algorithm

An adaptive learning method of Restricted Boltzmann Machine by neuron generation and annihilation algorithm

Development of Coronary Heart Disease Database