International Journal of Computational Intelligence and Applications

Mechanisms of promoting the evolution of cooperation in two-player, two-strategy evolutionary games have been discussed in great detail over the past decades. Understanding the effects of repeated interactions in n-player with n-choice is a formidable challenge. This paper presents and investigates the application of co-evolutionary training techniques based on particle swarm optimization (PSO) to evolve cooperation for the iterated prisoner's dilemma (IPD) game with multiple choices. Several issues will be addressed, which include the evolution of cooperation and the evolutionary stability in the presence of multiple choices and noise. First is using PSO approach to evolve cooperation. The second is the consideration of real-dilemma between social cohesion and individual profit. Experimental results show that the PSO approach evolves the cooperation. Agents with stronger social cognition choose higher levels of cooperation. Finally the impact of noise on the evolution of cooperation is examined. Experiments show the noise has a negative impact on the evolution of cooperation.

Most researchers of time series forecasting devote to design and develop quantitative models for pursuing high accuracy of forecasting on the numerical level. However, in real world, the numerical accuracy is sometimes not necessary for human cognition and decision-making and the numerical results of forecasting based on quantitative model are deficient in interpretability, thus the development of qualitative forecasting model of time series becomes an evident challenge. In this paper, the improved fuzzy cognitive map (IFCM) are proposed first, and then it is applied to develop qualitative model for linguistic forecasting of time series together with fuzzy c-means clustering technology and real-coded genetic algorithm (RCGA). Two real life time series are used to test the developed forecasting model and compare with another method based on FCM, whose results show the developed FCM forecasting model is more simpler and high quality on the linguistic level.

Electrocardiogram (ECG) signals represent a useful information source about the rhythm and the functioning of the heart. Any disturbance in the heart's normal rhythmic contraction is called an arrhythmia. Analysis of Electrocardiogram signals is the most effective available method for diagnosing cardiac arrhythmias. Computer based classification of ECG provides higher accuracy and offer a potential of an affordable cardiac abnormality mass screening. The empirical mode decomposition is performed on various arrhythmia signals and different levels of intrinsic mode functions (IMF) are obtained. Singular value decomposition (SVD) is used to extract features from the IMF and classification is performed using support vector machine. This method is more efficient for classification of ECG signals and at the same time provides good generalization properties.

Various methods have been presented to investigate the length of data interval and partition number of universe of discourse in fuzzy time series to achieve high level forecasting accuracy. However, the interval length is still an issue and thus, influencing the forecasting accuracy. This paper proposes a new approach using the average inter-quartile range to improve the interval length and subsequently the partition number of universe of discourse. Moreover, in forecasting method, the first-differencing data is also considered to obtain better forecast. The enrollment data of Alabama University is used as an example and the efficiency of the proposed method is compared with the previous methods. The result shows that the proposed method improves the accuracy and efficiency of the yearly enrollment forecasting opportunities.

In this study, a new genetic algorithm was developed to discover the best motifs in a set of DNA sequences. The main steps were: finding the potential positions in each sequence by using few voters (1–5 sequences), constructing the chromosomes from the potential positions, evaluating the fitness for each gene (position) and for each chromosome, calculating the new random distribution, and using the new distribution to generate the next generation. To verify the effectiveness of the proposed algorithm, several real and artificial datasets were used; the results are compared to the standard genetic algorithm, and Gibbs, MEME, and consensus algorithms. Although all the algorithms have low correlation with the correct motifs, the new algorithm exhibits higher accuracy, without sacrificing implementation time.

In this paper, a hierarchical structure based convolutional neural network is proposed to provide the ability for robust information processing. The weight sharing ability of convolutional neural networks (CNNs) is considered as a level of hierarchy in these networks. Weight sharing reduces the number of free parameters and improves the generalization ability. In the proposed structure, a small CNN which is used for feature extractor is shared between the whole input image pixels. A scalable architecture for implementing extensive CNNs is resulted using a smaller and modularized trainable network to solve a large and complicated task. The proposed structure causes less training time, fewer numbers of parameters and higher test data accuracy. The recognition accuracy for recognizing unseen data shows improvement in generalization. Also presented are application examples for face recognition. The comprehensive experiments completed on ORL, Yale and JAFFE face databases show improved classification rates and reduced training time and network parameters.