Soft Sensor Modeling Based on Radial Basis Function Neural Network and Fuzzy C-Means

2011 ◽  
Vol 219-220 ◽  
pp. 1263-1266
Author(s):  
Xi Huai Wang ◽  
Jian Mei Xiao

A neural network soft sensor based on fuzzy clustering is presented. The training data set is separated into several clusters with different centers, the number of fuzzy cluster is decided automatically, and the clustering centers are modified using an adaptive fuzzy clustering algorithm in the online stage. The proposed approach has been applied to the slab temperature estimation in a practical walking beam reheating furnace. Simulation results show that the approach is effective.

2017 ◽  
Vol 2 (5) ◽  
Author(s):  
Ali M. Al-Salihi ◽  
Zahraa A. AL-Ramahy

Soil temperature is an important meteorological variable which plays a significant role in hydrological cycle. In present study, artificial intelligence technique employed for estimating for 3 daysa head soil temperature estimation at 10 and 20 cm depth. Soil temperature daily data for the period 1 January 2012 to 31 December 2013 measured in three stations namely (Mosul, Baghdad and Muthanna) in Iraq. The training data set includes 616 days and the testing data includes 109 days. The Levenberg-Marquardt, Scaled Conjugate Gradient and Bayesian regularization algorithms. To evaluate the ANN models, Root mean square error (RMSE), Mean absolute error (MAE), Mean absolute percentage error (MAPE) and Correlation Coefficient (r) were determined. According to the four statistical indices were calculated of the optimum ANN model, it was ANN model (3) in Muthanaa station for the depth 10 cm and ANN model (3) in Baghdad station for the depth 20 were (RMSE=0.959oC, MAE=0.725, MAPE=4.293, R=0.988) and (RMSE=0.887OC, MAE=0.704, MAPE=4.239, R=0.993) respectively, theses statistical criteria shown the efficiency of artificial neural network for soil temperature estimation.


2014 ◽  
Vol 2014 ◽  
pp. 1-14 ◽  
Author(s):  
Yu Zhou ◽  
Lian Tian ◽  
Linfei Liu

Extension neural network (ENN) is a new neural network that is a combination of extension theory and artificial neural network (ANN). The learning algorithm of ENN is based on supervised learning algorithm. One of important issues in the field of classification and recognition of ENN is how to achieve the best possible classifier with a small number of labeled training data. Training data selection is an effective approach to solve this issue. In this work, in order to improve the supervised learning performance and expand the engineering application range of ENN, we use a novel data selection method based on shadowed sets to refine the training data set of ENN. Firstly, we use clustering algorithm to label the data and induce shadowed sets. Then, in the framework of shadowed sets, the samples located around each cluster centers (core data) and the borders between clusters (boundary data) are selected as training data. Lastly, we use selected data to train ENN. Compared with traditional ENN, the proposed improved ENN (IENN) has a better performance. Moreover, IENN is independent of the supervised learning algorithms and initial labeled data. Experimental results verify the effectiveness and applicability of our proposed work.


Author(s):  
M. Takadoya ◽  
M. Notake ◽  
M. Kitahara ◽  
J. D. Achenbach ◽  
Q. C. Guo ◽  
...  

2019 ◽  
Vol 2 (1) ◽  
Author(s):  
Jeffrey Micher

We present a method for building a morphological generator from the output of an existing analyzer for Inuktitut, in the absence of a two-way finite state transducer which would normally provide this functionality. We make use of a sequence to sequence neural network which “translates” underlying Inuktitut morpheme sequences into surface character sequences. The neural network uses only the previous and the following morphemes as context. We report a morpheme accuracy of approximately 86%. We are able to increase this accuracy slightly by passing deep morphemes directly to output for unknown morphemes. We do not see significant improvement when increasing training data set size, and postulate possible causes for this.


2013 ◽  
Vol 760-762 ◽  
pp. 2220-2223
Author(s):  
Lang Guo

In view of the defects of K-means algorithm in intrusion detection: the need of preassign cluster number and sensitive initial center and easy to fall into local optimum, this paper puts forward a fuzzy clustering algorithm. The fuzzy rules are utilized to express the invasion features, and standardized matrix is adopted to further process so as to reflect the approximation degree or correlation degree between the invasion indicator data and establish a similarity matrix. The simulation results of KDD CUP1999 data set show that the algorithm has better intrusion detection effect and can effectively detect the network intrusion data.


2014 ◽  
Vol 17 (1) ◽  
pp. 56-74 ◽  
Author(s):  
Gurjeet Singh ◽  
Rabindra K. Panda ◽  
Marc Lamers

The reported study was undertaken in a small agricultural watershed, namely, Kapgari in Eastern India having a drainage area of 973 ha. The watershed was subdivided into three sub-watersheds on the basis of drainage network and land topography. An attempt was made to relate the continuously monitored runoff data from the sub-watersheds and the whole-watershed with the rainfall and temperature data using the artificial neural network (ANN) technique. The reported study also evaluated the bias in the prediction of daily runoff with shorter length of training data set using different resampling techniques with the ANN modeling. A 10-fold cross-validation (CV) technique was used to find the optimum number of hidden neurons in the hidden layer and to avoid neural network over-fitting during the training process for shorter length of data. The results illustrated that the ANN models developed with shorter length of training data set avoid neural network over-fitting during the training process, using a 10-fold CV method. Moreover, the biasness was investigated using the bootstrap resampling technique based ANN (BANN) for short length of training data set. In comparison with the 10-fold CV technique, the BANN is more efficient in solving the problems of the over-fitting and under-fitting during training of models for shorter length of data set.


2013 ◽  
Vol 830 ◽  
pp. 341-344
Author(s):  
Jun Jun Du ◽  
Sheng Ping Jin ◽  
Qiong Li ◽  
She Sheng Zhang

Consider heavy metal pollution of topsoil in the city of world today is a hot science research project. A fuzzy clustering algorithm l is constructed ed by analyzing the propagation characteristics of heavy metal pollutants. Considering topography, areas, factories, roads, , irredentist, etc. we calculate a evaluation on comprehensive pollution, and the degree of heavy metals pollution, by using fuzzy clustering and fuzzy AHP. The results show that the index of the comprehensive pollution of heavy metals on the region, and the weight of pollution of each category.


2012 ◽  
Vol 263-266 ◽  
pp. 2173-2178
Author(s):  
Xin Guang Li ◽  
Min Feng Yao ◽  
Li Rui Jian ◽  
Zhen Jiang Li

A probabilistic neural network (PNN) speech recognition model based on the partition clustering algorithm is proposed in this paper. The most important advantage of PNN is that training is easy and instantaneous. Therefore, PNN is capable of dealing with real time speech recognition. Besides, in order to increase the performance of PNN, the selection of data set is one of the most important issues. In this paper, using the partition clustering algorithm to select data is proposed. The proposed model is tested on two data sets from the field of spoken Arabic numbers, with promising results. The performance of the proposed model is compared to single back propagation neural network and integrated back propagation neural network. The final comparison result shows that the proposed model performs better than the other two neural networks, and has an accuracy rate of 92.41%.


Author(s):  
T. G.B. Amaral ◽  
M. M. Crisostomo ◽  
V. Fernao Pires

This chapter describes the application of a general regression neural network (GRNN) to control the flight of a helicopter. This GRNN is an adaptive network that provides estimates of continuous variables and is a one-pass learning algorithm with a highly parallel structure. Even with sparse data in a multidimensional measurement space, the algorithm provides smooth transitions from one observed value to another. An important reason for using the GRNN as a controller is the fast learning capability and its non-iterative process. The disadvantage of this neural network is the amount of computation required to produce an estimate, which can become large if many training instances are gathered. To overcome this problem, it is described as a clustering algorithm to produce representative exemplars from a group of training instances that are close to one another reducing the computation amount to obtain an estimate. The reduction of training data used by the GRNN can make it possible to separate the obtained representative exemplars, for example, in two data sets for the coarse and fine control. Experiments are performed to determine the degradation of the performance of the clustering algorithm with less training data. In the control flight system, data training is also reduced to obtain faster controllers, maintaining the desired performance.


2013 ◽  
Vol 2013 ◽  
pp. 1-9 ◽  
Author(s):  
R. Manjula Devi ◽  
S. Kuppuswami ◽  
R. C. Suganthe

Artificial neural network has been extensively consumed training model for solving pattern recognition tasks. However, training a very huge training data set using complex neural network necessitates excessively high training time. In this correspondence, a new fast Linear Adaptive Skipping Training (LAST) algorithm for training artificial neural network (ANN) is instituted. The core essence of this paper is to ameliorate the training speed of ANN by exhibiting only the input samples that do not categorize perfectly in the previous epoch which dynamically reducing the number of input samples exhibited to the network at every single epoch without affecting the network’s accuracy. Thus decreasing the size of the training set can reduce the training time, thereby ameliorating the training speed. This LAST algorithm also determines how many epochs the particular input sample has to skip depending upon the successful classification of that input sample. This LAST algorithm can be incorporated into any supervised training algorithms. Experimental result shows that the training speed attained by LAST algorithm is preferably higher than that of other conventional training algorithms.


Sign in / Sign up

Export Citation Format

Share Document