改进GA-SVM在冠状动脉疾病诊断中的应用

改进的遗传算法（GA）自动优化支持向量机（SVM）参数,同步决策最优特征子集。新颖的分组多基因交叉技术保留了基因小组中的信息,而且允许后代继承更多的来自染色体的遗传信息。该算法促进可行解集中的高质量染色体信息交换,提高了解空间的搜索能力。实验结果说明：改进GA-SVM不仅可决策出与疾病相关的重要特征变量、优化SVM参数,而且可提升分类性能。与前馈BP神经网络及自适应模糊推理系统两种学习算法的比较表明,改进GA-SVM具有更好地表现。     

A hybrid genetic-neural model for predicting protein structural classes

A genetic algorithm (GA) for feature selection in conjunction with neural network was applied to predict protein structural classes based on single amino acid and all dipeptide composition frequencies. These sequence parameters were encoded as input features for a GA in feature selection procedure and classified with a three-layered neural network to predict protein structural classes. The system was established through optimization of the classification performance of neural network which was used as evaluation function. In this study, self-consistency and jackknife tests on a database containing 498 proteins were used to verify the performance of this hybrid method, and were compared with some of prior works. The adoption of a hybrid model, which encompasses genetic and neural technologies, demonstrated to be a promising approach in the task of protein structural class prediction.     

A hybrid genetic--neural algorithm for modeling the biodegradation process of DnBP in AAO system

A hybrid artificial neural network - genetic algorithm numerical technique was successfully developed to model, and to simulate the biodegradation process of di-n-butyl phthalate in an anaerobic/anoxic/oxic (AAO) system. The fate of DnBP was investigated, and a removal kinetic model including sorption and biodegradation was formulated. To correlate the experimental data with available models or some modified empirical equations, the steady state model equations describing the biodegradation process have been solved using genetic algorithm (GA) and artificial neural network (ANN) from the water quality characteristic parameters. Compared with the kinetic model, the performance of the GA-ANN for modeling the DnBP was found to be more impressive. The results show that the predicted values well fit measured concentrations, which was also supported by the relatively low RMSE (0.2724), MAPE (3.6137) and MSE (0.0742)and very high R (0.9859) values, and which illustrates the GA-ANN model predicting effluent DnBP more accurately than the mechanism model forecasting.     

Probabilistic computation by neuromine networks

In this paper, we address the question, can biologically feasible neural nets compute more than can be computed by deterministic polynomial time algorithms? Since we want to maintain a claim of plausibility and reasonableness we restrict ourselves to algorithmically easy to construct nets and we rule out infinite precision in parameters and in any analog parts of the computation. Our approach is to consider the recent advances in randomized algorithms and see if such randomized computations can be described by neural nets. We start with a pair of neurons and show that by connecting them with reciprocal inhibition and some tonic input, then the steady-state will be one neuron ON and one neuron OFF, but which neuron will be ON and which neuron will be OFF will be chosen at random (perhaps, it would be better to say that microscopic noise in the analog computation will be turned into a megascale random bit). We then show that we can build a small network that uses this random bit process to generate repeatedly random bits. This random bit generator can then be connected with a neural net representing the deterministic part of randomized algorithm. We, therefore, demonstrate that these neural nets can carry out probabilistic computation and thus be less limited than classical neural nets.     

A maximum neural network approach for N-queens problems

 A novel neural network approach using the maximum neuron model is presented for N-queens problems. The goal of the N-queens problem is to find a set of locations of N queens on an N×N chessboard such that no pair of queens commands each other. The maximum neuron model proposed by Takefuji et al. has been applied to two optimization problems where the optimization of objective functions is requested without constraints. This paper demonstrates the effectiveness of the maximum neuron model for constraint satisfaction problems through the N-queens problem. The performance is verified through simulations in up to 500-queens problems on the sequential mode, the N-parallel mode, and the N ²-parallel mode, where our maximum neural network shows the far better performance than the existing neural networks. Received: 4 June 1996/Accepted in revised form: 13 November 1996     

Genetic interference reduces the evolvability of modular and non-modular visual neural networks

The aim of this paper is to propose an interdisciplinary evolutionary connectionism approach for the study of the evolution of modularity. It is argued that neural networks as a model of the nervous system and genetic algorithms as simulative models of biological evolution would allow us to formulate a clear and operative definition of module and to simulate the different evolutionary scenarios proposed for the origin of modularity. I will present a recent model in which the evolution of primate cortical visual streams is possible starting from non-modular neural networks. Simulation results not only confirm the existence of the phenomenon of neural interference in non-modular network architectures but also, for the first time, reveal the existence of another kind of interference at the genetic level, i.e. genetic interference, a new population genetic mechanism that is independent from the network architecture. Our simulations clearly show that genetic interference reduces the evolvability of visual neural networks and sexual reproduction can at least partially solve the problem of genetic interference. Finally, it is shown that entrusting the task of finding the neural network architecture to evolution and that of finding the network connection weights to learning is a way to completely avoid the problem of genetic interference. On the basis of this evidence, it is possible to formulate a new hypothesis on the origin of structural modularity, and thus to overcome the traditional dichotomy between innatist and empiricist theories of mind.     

Genetically-designed neural networks for error reduction in an optimized biomechanical model of the human elbow joint complex

A real time dynamic biomechanical model of the human elbow joint has been used as the first step in the process of calculating time varying joint position from the electromyograms (EMGs) of eight muscles crossing the joint. Since calculation of position has a high sensitivity to errors in the model torque calculation, a genetic algorithm (GA) neural network (NN) has been developed for automatic error reduction in the dynamic model. Genetic algorithms are used to design many neural network structures during a preliminary trial effort, and then each network's performance is ranked to choose a trained network that represents the most accurate result. Experimental results from three subjects have shown model error reduction in 84.2% of the data sets from a subject on which the model had been trained, and 52.6% of the data sets from the subjects on which the model had not been trained. Furthermore, the GA networks reduced the error standard deviation across all subjects, showing that progress in error reduction was made evenly across all data sets.     

Genetically-designed Neural Networks for Error Reduction in an Optimized Biomechanical Model of the Human Elbow Joint Complex

A real time dynamic biomechanical model of the human elbow joint has been used as the first step in the process of calculating time varying joint position from the electromyograms (EMGs) of eight muscles crossing the joint. Since calculation of position has a high sensitivity to errors in the model torque calculation, a genetic algorithm (GA) neural network (NN) has been developed for automatic error reduction in the dynamic model. Genetic algorithms are used to design many neural network structures during a preliminary trial effort, and then each network's performance is ranked to choose a trained network that represents the most accurate result. Experimental results from three subjects have shown model error reduction in 84.2% of the data sets from a subject on which the model had been trained, and 52.6% of the data sets from the subjects on which the model had not been trained. Furthermore, the GA networks reduced the error standard deviation across all subjects, showing that progress in error reduction was made evenly across all data sets.     

A novel hybrid GA/RBFNN technique for protein sequences classification

A novel hybrid genetic algorithm (GA)/radial basis function neural network (RBFNN) technique, which selects features from the protein sequences and trains the RBF neural network simultaneously, is proposed in this paper. Experimental results show that the proposed hybrid GA/RBFNN system outperforms the BLAST and the HMMer.     

Hierarchical genetic algorithm for near optimal feedforward neural network design

In this paper, we propose a genetic algorithm based design procedure for a multi layer feed forward neural network. A hierarchical genetic algorithm is used to evolve both the neural networks topology and weighting parameters. Compared with traditional genetic algorithm based designs for neural networks, the hierarchical approach addresses several deficiencies, including a feasibility check highlighted in literature. A multi objective cost function is used herein to optimize the performance and topology of the evolved neural network simultaneously. In the prediction of Mackey Glass chaotic time series, the networks designed by the proposed approach prove to be competitive, or even superior, to traditional learning algorithms for the multi layer Perceptron networks and radial basis function networks. Based upon the chosen cost function, a linear weight combination decision making approach has been applied to derive an approximated Pareto optimal solution set. Therefore, designing a set of neural networks can be considered as solving a two objective optimization problem.     

人工神经网络模型在水稻群体分蘖动态模拟中外推能力的测试

研究利用人工神经网络模型 ,以水稻群体分蘖动态为例 ,采用交互验证和独立验证的方式 ,对水稻生长 BP网络模型进行了训练与模拟 ,其结果与水稻群体分蘖的积温统计模型、基本动力学模型和复合分蘖模型进行了比较。研究结果表明 ,神经网络模型具有一定的外推能力 ,但其外推能力依赖于大量的训练样本。神经网络模型具有较好的拟合能力 ,是因为有较多的模型参数 ,因此对神经网络模型的训练需要大量的参数来保证其参数不致过度吻合。具有外推能力神经网络模型的最少训练样本数应大于 6 .75倍于神经网络参数数目 ,小于 13.5倍于神经网络参数数目。因此在应用神经网络模型时 ,如果神经网络模型包括较多的输入变量时 ,可考虑采用主成分分析、对应分析等技术对输入变量进行信息综合 ,相应地减少网络模型的参数。另一方面 ,当训练样本不足时 ,最好只用神经网络模型对同一系统的情况进行模拟 ,应谨慎使用神经网络模型进行外推。神经网络模型给作物模拟研究的科学工作者提供了一个“傻瓜”式工具 ,对数学建模不熟悉的农业研究人员 ,人工神经网络可以替代数学建模进行仿真实验 ;对于精通数学建模的研究人员来说 ,它至少是一种补充和可作为比较的非线性数据处理方法     

Research on WNN Greenhouse Temperature Prediction Method Based on GA

Temperature in agricultural production has a direct impact on the growth of crops. The emergence of greenhouses has improved the impact of the original unpredictable changes in temperature, but the temperature modeling of greenhouses is still the main direction at present. Neural network modeling relies on sufficient actual data to model greenhouses, but there is a widening gap in the application of different neural networks. This paper proposes a greenhouse temperature prediction model based on wavelet neural network with genetic algorithm (GA-WNN). With the simple network structure and the nonlinear adaptability of the wavelet basis function, wavelet neural network (WNN) improved model training speed and accuracy of prediction results compared with back propagation neural networks (BPNN), which was conducive to the prediction and control of short-term greenhouse temperature fluctuations. At the same time, the genetic algorithm (GA) was introduced to globally optimize the initial weights of the original model, which improved the insensitivity of the model to the initial weights and thresholds, and improved the training speed and stability of the model. Finally, simulation results for the greenhouse showed that the model training speed, prediction results accuracy and model stability of the GA-WNN in the greenhouse were improved in comparison to results obtained by the WNN and BPNN in the greenhouse.     

Optimizationof neural network architecture using genetic programming improvesdetection and modeling of gene-gene interactions in studies of humandiseases

Background

Appropriate definitionof neural network architecture prior to data analysis is crucialfor successful data mining. This can be challenging when the underlyingmodel of the data is unknown. The goal of this study was to determinewhether optimizing neural network architecture using genetic programmingas a machine learning strategy would improve the ability of neural networksto model and detect nonlinear interactions among genes in studiesof common human diseases.

Results

Using simulateddata, we show that a genetic programming optimized neural network approachis able to model gene-gene interactions as well as a traditionalback propagation neural network. Furthermore, the genetic programmingoptimized neural network is better than the traditional back propagationneural network approach in terms of predictive ability and powerto detect gene-gene interactions when non-functional polymorphismsare present.

Conclusion

This study suggeststhat a machine learning strategy for optimizing neural network architecturemay be preferable to traditional trial-and-error approaches forthe identification and characterization of gene-gene interactionsin common, complex human diseases.

     

Predicting protein complex geometries with a neural network

A major challenge of the protein docking problem is to define scoring functions that can distinguish near‐native protein complex geometries from a large number of non‐native geometries (decoys) generated with noncomplexed protein structures (unbound docking). In this study, we have constructed a neural network that employs the information from atom‐pair distance distributions of a large number of decoys to predict protein complex geometries. We found that docking prediction can be significantly improved using two different types of polar hydrogen atoms. To train the neural network, 2000 near‐native decoys of even distance distribution were used for each of the 185 considered protein complexes. The neural network normalizes the information from different protein complexes using an additional protein complex identity input neuron for each complex. The parameters of the neural network were determined such that they mimic a scoring funnel in the neighborhood of the native complex structure. The neural network approach avoids the reference state problem, which occurs in deriving knowledge‐based energy functions for scoring. We show that a distance‐dependent atom pair potential performs much better than a simple atom‐pair contact potential. We have compared the performance of our scoring function with other empirical and knowledge‐based scoring functions such as ZDOCK 3.0, ZRANK, ITScore‐PP, EMPIRE, and RosettaDock. In spite of the simplicity of the method and its functional form, our neural network‐based scoring function achieves a reasonable performance in rigid‐body unbound docking of proteins. Proteins 2010. © 2009 Wiley‐Liss, Inc.     

An SOM-based algorithm for optimization with dynamic weight updating

The self-organizing map (SOM), as a kind of unsupervised neural network, has been used for both static data management and dynamic data analysis. To further exploit its search abilities, in this paper we propose an SOM-based algorithm (SOMS) for optimization problems involving both static and dynamic functions. Furthermore, a new SOM weight updating rule is proposed to enhance the learning efficiency; this may dynamically adjust the neighborhood function for the SOM in learning system parameters. As a demonstration, the proposed SOMS is applied to function optimization and also dynamic trajectory prediction, and its performance compared with that of the genetic algorithm (GA) due to the similar ways both methods conduct searches.     

A novel approach for solving constrained nonlinear optimization problems using neurofuzzy systems

A neural network model for solving constrained nonlinear optimization problems with bounded variables is presented in this paper. More specifically, a modified Hopfield network is developed and its internal parameters are computed using the valid-subspace technique. These parameters guarantee the convergence of the network to the equilibrium points. The network is shown to be completely stable and globally convergent to the solutions of constrained nonlinear optimization problems. A fuzzy logic controller is incorporated in the network to minimize convergence time. Simulation results are presented to validate the proposed approach.     

Nonlinear system modelling via optimal design of neural trees

This paper introduces a flexible neural tree model. The model is computed as a flexible multi-layer feed-forward neural network. A hybrid learning/evolutionary approach to automatically optimize the neural tree model is also proposed. The approach includes a modified probabilistic incremental program evolution algorithm (MPIPE) to evolve and determine a optimal structure of the neural tree and a parameter learning algorithm to optimize the free parameters embedded in the neural tree. The performance and effectiveness of the proposed method are evaluated using function approximation, time series prediction and system identification problems and compared with the related methods.     

An improved transiently chaotic neural network for the maximum independent set problem

By analyzing the dynamic behaviors of the transiently chaotic neural network and greedy heuristic for the maximum independent set (MIS) problem, we present an improved transiently chaotic neural network for the MIS problem in this paper. Extensive simulations are performed and the results show that this proposed transiently chaotic neural network can yield better solutions to p-random graphs than other existing algorithms. The efficiency of the new model is also confirmed by the results on the complement graphs of some DIMACS clique instances in the second DIMACS challenge. Moreover, the improved model uses fewer steps to converge to stable state in comparison with the original transiently chaotic neural network.     

瞳孔光反应系统的空间分布式神经网络模型

为模拟刺激光空间分布变化引起瞳孔反应的实验现象,本文建立了空间分布式神经网络瞳孔模型。它是在瞳孔双通道模型基础上,借鉴Ｃａｎｎｏｎ－Ｒｏｂｉｎｓｏｎ的Ｏｃｕｌｏｍｏｔｏｒ模型的双层网络结构和视网膜的镶嵌式特点,经空间延括而成。空间各部位信号经第一层神经元处理得到对应各部位的线性ＤＣ和非线性ＡＣ输出,在第二层神经元进行空间综合,再经第三层神经元复合去控制效应器官虹膜肌的反应。该分布式部位机制模型能解释多种瞳孔实验现象。     

A Novel Hybrid Classification Model of Genetic Algorithms,Modified k-Nearest Neighbor and Developed Backpropagation Neural Network

Among numerous artificial intelligence approaches, k-Nearest Neighbor algorithms, genetic algorithms, and artificial neural networks are considered as the most common and effective methods in classification problems in numerous studies. In the present study, the results of the implementation of a novel hybrid feature selection-classification model using the above mentioned methods are presented. The purpose is benefitting from the synergies obtained from combining these technologies for the development of classification models. Such a combination creates an opportunity to invest in the strength of each algorithm, and is an approach to make up for their deficiencies. To develop proposed model, with the aim of obtaining the best array of features, first, feature ranking techniques such as the Fisher''s discriminant ratio and class separability criteria were used to prioritize features. Second, the obtained results that included arrays of the top-ranked features were used as the initial population of a genetic algorithm to produce optimum arrays of features. Third, using a modified k-Nearest Neighbor method as well as an improved method of backpropagation neural networks, the classification process was advanced based on optimum arrays of the features selected by genetic algorithms. The performance of the proposed model was compared with thirteen well-known classification models based on seven datasets. Furthermore, the statistical analysis was performed using the Friedman test followed by post-hoc tests. The experimental findings indicated that the novel proposed hybrid model resulted in significantly better classification performance compared with all 13 classification methods. Finally, the performance results of the proposed model was benchmarked against the best ones reported as the state-of-the-art classifiers in terms of classification accuracy for the same data sets. The substantial findings of the comprehensive comparative study revealed that performance of the proposed model in terms of classification accuracy is desirable, promising, and competitive to the existing state-of-the-art classification models.