Approximation Performance of BP Neural Networks Improved by Heuristic Approach

2013 ◽  
Vol 411-414 ◽  
pp. 1952-1955 ◽  
Author(s):  
Shuo Ding ◽  
Xiao Heng Chang ◽  
Qing Hui Wu

Among all improved BP neural network algorithms, the one improved by heuristic approach is studied in this paper. Firstly, three types of improved heuristic algorithms of BP neural network are programmed in the environment of MATLAB7.0. Then network training and simulation test are conducted taking a nonlinear function as an example. The approximation performances of BP neural networks improved by different numerical optimization approaches are compared to aid the selection of proper numerical optimization approach.

2011 ◽  
Vol 243-249 ◽  
pp. 5475-5480
Author(s):  
Zhang Jun

Modals of BP neural networks with different inputs and outputs are presented for different damage detecting schemes. To identify locations of structural damages, the regular vectors of changes in modal flexibility are looked on as inputs of the networks, and the state of localized damage are as outputs. To identify extents of structural damage, parameters combined with changes in flexibility and the square changes in frequency are as inputs of the networks, and the state of damage extents are as outputs. Examples of a simply supported beam and a plate show that the BP neural network modal can detect damage of structures in quantitative terms.


2012 ◽  
Vol 627 ◽  
pp. 329-332
Author(s):  
Hui Jun Li ◽  
Xin Hou Wang

The objective of this research is to predict yarn unevenness. The model of predicting yarn unevenness is built based on BP neural network. The BP neural networks are trained with HVI test results of cotton and USTER TENSOJET 5-S400 test results of yarn. The results show prediction models based on BP neural network are very precise and efficient.


2014 ◽  
Vol 543-547 ◽  
pp. 1064-1067
Author(s):  
Jian Qun Zhang ◽  
De Jian Zhou

As a common fault of motor, the short circuit of rotor winding is important for the accurate diagnosis. In this article, the author collected every status parameter of motor by different sensors, using two BP neural networks to partly diagnose the motor and fusing the results of partly diagnosis by D-S evidence theory. The author increases the creditability of diagnosis results by practices and decreases uncertainty, showing the efficiency of this method.


2014 ◽  
Vol 510 ◽  
pp. 45-50 ◽  
Author(s):  
Lai Jiang

Although the application of the BP neural network can assist researching on catalytic agent and methods of synthesizing material, but because of slow convergence, in some cases, it can not work efficiently. The paper presents a design method for the application of GA-BP Neutral Network in optimum direction for catalytic agent and material. The simulation result shows that the application of the GA-BP neural network can improve the accuracy and versatility of the catalyst compounding.


2013 ◽  
Vol 726-731 ◽  
pp. 4303-4306 ◽  
Author(s):  
Yong Wang ◽  
Zhuang Xiong

This paper simple introduced back propagation (BP) neural networks, and constructed a dynamic predict model, based on it to predict forest disease and insect and rat pest. Then it analyzed and simulated with the BP neural network model with the data produced in the recent ten years. The result indicated that the BP neural network model is reliable for predicting the forest disease and insect and rat pest. The method provides scientific foundation for the forestry management of studied area.


2011 ◽  
Vol 331 ◽  
pp. 219-222
Author(s):  
Hui Jun Li ◽  
Xin Hou Wang

The objective of this research is to predict yarn unevenness. The model of predicting yarn unevenness is built based on improved BP neural network. The improved BP neural networks are trained with HVI test results of cotton and USTER TENSOJET 5-S400 test results of yarn. The results show prediction models based on improved BP neural network are very precise and efficient.


2014 ◽  
Vol 584-586 ◽  
pp. 2339-2342 ◽  
Author(s):  
Tian Bao Wu ◽  
Xun Liu ◽  
Tai Quan Zhou

There is a tendency that arbitrary and tendentiousness are brought by experts’ subjectivity during the bidding evaluation. A method for construction project bidding based on the BP neural network improved by LM is proposed. To overcome the disadvantage of slow convergence and being prone to converge to minimum, LM was used to be combined with the BP neural networks. It has been proved by an application an effective complement for the deficiency of BP neural network on the bidding decision of construction project. Through the application in reality, we found that the LM-BP neural network in resolving the problems during the bidding process is meaningful.


2013 ◽  
Vol 659 ◽  
pp. 113-117 ◽  
Author(s):  
Hong Yi Li ◽  
Xi Xin Wu ◽  
Tong Wang ◽  
Di Zhao

This paper focuses on the simulation and prediction problem of height of the crops, particularly the wheat, which plays a significantly important role in its yield, in different growing stages. Our model bases on the BP neural network and the ant colony algorithm. Both of these two algorithms has their own advantages and disadvantages. However, through observations, we find that their advantages and disadvantages seem to be complementary, by which we propose the combination algorithm. This combination algorithm can conquer the local optimum problem of the BP Neural Network, and could overcome the shortcomings of the weak local optimum searching capability of the ant colony algorithm. The experiments show that the our proposed algorithm can hopefully yield good simulation and prediction results of the height of wheat in different growing stages.


2013 ◽  
Vol 313-314 ◽  
pp. 1353-1356 ◽  
Author(s):  
Shuo Ding ◽  
Qing Hui Wu

BP neural networks are widely used and the algorithms are various. This paper studies the advantages and disadvantages of improved algorithms of five typical BP networks, based on artificial neural network theories. First, the learning processes of improved algorithms of the five typical BP networks are elaborated on mathematically. Then a specific network is designed on the platform of MATLAB 7.0 to conduct approximation test for a given nonlinear function. At last, a comparison is made between the training speeds and memory consumption of the five BP networks. The simulation results indicate that for small scaled and medium scaled networks, LM optimization algorithm has the best approximation ability, followed by Quasi-Newton algorithm, conjugate gradient method, resilient BP algorithm, adaptive learning rate algorithm. Keywords: BP neural network; Improved algorithm; Function approximation; MATLAB


Author(s):  
Valerii Dmitrienko ◽  
Sergey Leonov ◽  
Mykola Mezentsev

The idea of ​​Belknap's four-valued logic is that modern computers should function normally not only with the true values ​​of the input information, but also under the conditions of inconsistency and incompleteness of true failures. Belknap's logic introduces four true values: T (true - true), F (false - false), N (none - nobody, nothing, none), B (both - the two, not only the one but also the other).  For ease of work with these true values, the following designations are introduced: (1, 0, n, b). Belknap's logic can be used to obtain estimates of proximity measures for discrete objects, for which the functions Jaccard and Needhem, Russel and Rao, Sokal and Michener, Hamming, etc. are used. In this case, it becomes possible to assess the proximity, recognition and classification of objects in conditions of uncertainty when the true values ​​are taken from the set (1, 0, n, b). Based on the architecture of the Hamming neural network, neural networks have been developed that allow calculating the distances between objects described using true values ​​(1, 0, n, b). Keywords: four-valued Belknap logic, Belknap computer, proximity assessment, recognition and classification, proximity function, neural network.


Sign in / Sign up

Export Citation Format

Share Document