A new method to evaluate the fitness of the Bayesian networks according to the observed data is provided. The main advantage of this criterion is that it is suitable for both the complete and incomplete cases while th...A new method to evaluate the fitness of the Bayesian networks according to the observed data is provided. The main advantage of this criterion is that it is suitable for both the complete and incomplete cases while the others not. Moreover it facilitates the computation greatly. In order to reduce the search space, the notation of equivalent class proposed by David Chickering is adopted. Instead of using the method directly, the novel criterion, variable ordering, and equivalent class are combined,moreover the proposed mthod avoids some problems caused by the previous one. Later, the genetic algorithm which allows global convergence, lack in the most of the methods searching for Bayesian network is applied to search for a good model in thisspace. To speed up the convergence, the genetic algorithm is combined with the greedy algorithm. Finally, the simulation shows the validity of the proposed approach.展开更多
A hybrid feature selection and classification strategy was proposed based on the simulated annealing genetic algonthrn and multiple instance learning （MIL）. The band selection method was proposed from subspace decom...A hybrid feature selection and classification strategy was proposed based on the simulated annealing genetic algonthrn and multiple instance learning （MIL）. The band selection method was proposed from subspace decomposition, which combines the simulated annealing algorithm with the genetic algorithm in choosing different cross-over and mutation probabilities, as well as mutation individuals. Then MIL was combined with image segmentation, clustering and support vector machine algorithms to classify hyperspectral image. The experimental results show that this proposed method can get high classification accuracy of 93.13% at small training samples and the weaknesses of the conventional methods are overcome.展开更多
In machine learning,randomness is a crucial factor in the success of ensemble learning,and it can be injected into tree-based ensembles by rotating the feature space.However,it is a common practice to rotate the featu...In machine learning,randomness is a crucial factor in the success of ensemble learning,and it can be injected into tree-based ensembles by rotating the feature space.However,it is a common practice to rotate the feature space randomly.Thus,a large number of trees are required to ensure the performance of the ensemble model.This random rotation method is theoretically feasible,but it requires massive computing resources,potentially restricting its applications.A multimodal genetic algorithm based rotation forest(MGARF)algorithm is proposed in this paper to solve this problem.It is a tree-based ensemble learning algorithm for classification,taking advantage of the characteristic of trees to inject randomness by feature rotation.However,this algorithm attempts to select a subset of more diverse and accurate base learners using the multimodal optimization method.The classification accuracy of the proposed MGARF algorithm was evaluated by comparing it with the original random forest and random rotation ensemble methods on 23 UCI classification datasets.Experimental results show that the MGARF method outperforms the other methods,and the number of base learners in MGARF models is much fewer.展开更多
To overcome the deficiencies of high computational complexity and low convergence speed in traditional neural networks, a novel bio-inspired machine learning algorithm named brain emotional learning （BEL） is introdu...To overcome the deficiencies of high computational complexity and low convergence speed in traditional neural networks, a novel bio-inspired machine learning algorithm named brain emotional learning （BEL） is introduced. BEL mimics the emotional learning mechanism in brain which has the superior features of fast learning and quick reacting. To further improve the performance of BEL in data analysis, genetic algorithm （GA） is adopted for optimally tuning the weights and biases of amygdala and orbitofrontal cortex in BEL neural network. The integrated algorithm named GA-BEL combines the advantages of the fast learning of BEL, and the global optimum solution of GA. GA-BEL has been tested on a real-world chaotic time series of geomagnetic activity index for prediction, eight benchmark datasets of university California at Irvine （UCI） and a functional magnetic resonance imaging （fMRI） dataset for classifications. The comparisons of experimental results have shown that the proposed GA-BEL algorithm is more accurate than the original BEL in prediction, and more effective when dealing with large-scale classification problems. Further, it outperforms most other traditional algorithms in terms of accuracy and execution speed in both prediction and classification applications.展开更多
基金This project was supported by the National Natural Science Foundation of China (70572045).
文摘A new method to evaluate the fitness of the Bayesian networks according to the observed data is provided. The main advantage of this criterion is that it is suitable for both the complete and incomplete cases while the others not. Moreover it facilitates the computation greatly. In order to reduce the search space, the notation of equivalent class proposed by David Chickering is adopted. Instead of using the method directly, the novel criterion, variable ordering, and equivalent class are combined,moreover the proposed mthod avoids some problems caused by the previous one. Later, the genetic algorithm which allows global convergence, lack in the most of the methods searching for Bayesian network is applied to search for a good model in thisspace. To speed up the convergence, the genetic algorithm is combined with the greedy algorithm. Finally, the simulation shows the validity of the proposed approach.
文摘A hybrid feature selection and classification strategy was proposed based on the simulated annealing genetic algonthrn and multiple instance learning （MIL）. The band selection method was proposed from subspace decomposition, which combines the simulated annealing algorithm with the genetic algorithm in choosing different cross-over and mutation probabilities, as well as mutation individuals. Then MIL was combined with image segmentation, clustering and support vector machine algorithms to classify hyperspectral image. The experimental results show that this proposed method can get high classification accuracy of 93.13% at small training samples and the weaknesses of the conventional methods are overcome.
基金Project(61603274)supported by the National Natural Science Foundation of ChinaProject(2017KJ249)supported by the Research Project of Tianjin Municipal Education Commission,China。
文摘In machine learning,randomness is a crucial factor in the success of ensemble learning,and it can be injected into tree-based ensembles by rotating the feature space.However,it is a common practice to rotate the feature space randomly.Thus,a large number of trees are required to ensure the performance of the ensemble model.This random rotation method is theoretically feasible,but it requires massive computing resources,potentially restricting its applications.A multimodal genetic algorithm based rotation forest(MGARF)algorithm is proposed in this paper to solve this problem.It is a tree-based ensemble learning algorithm for classification,taking advantage of the characteristic of trees to inject randomness by feature rotation.However,this algorithm attempts to select a subset of more diverse and accurate base learners using the multimodal optimization method.The classification accuracy of the proposed MGARF algorithm was evaluated by comparing it with the original random forest and random rotation ensemble methods on 23 UCI classification datasets.Experimental results show that the MGARF method outperforms the other methods,and the number of base learners in MGARF models is much fewer.
基金Project(61403422)supported by the National Natural Science Foundation of ChinaProject(17C1084)supported by Hunan Education Department Science Foundation of ChinaProject(17ZD02)supported by Hunan University of Arts and Science,China
文摘To overcome the deficiencies of high computational complexity and low convergence speed in traditional neural networks, a novel bio-inspired machine learning algorithm named brain emotional learning （BEL） is introduced. BEL mimics the emotional learning mechanism in brain which has the superior features of fast learning and quick reacting. To further improve the performance of BEL in data analysis, genetic algorithm （GA） is adopted for optimally tuning the weights and biases of amygdala and orbitofrontal cortex in BEL neural network. The integrated algorithm named GA-BEL combines the advantages of the fast learning of BEL, and the global optimum solution of GA. GA-BEL has been tested on a real-world chaotic time series of geomagnetic activity index for prediction, eight benchmark datasets of university California at Irvine （UCI） and a functional magnetic resonance imaging （fMRI） dataset for classifications. The comparisons of experimental results have shown that the proposed GA-BEL algorithm is more accurate than the original BEL in prediction, and more effective when dealing with large-scale classification problems. Further, it outperforms most other traditional algorithms in terms of accuracy and execution speed in both prediction and classification applications.
