• Title/Summary/Keyword: Polynomial neural network

Search Result 174, Processing Time 0.03 seconds

The Design of Polynomial RBF Neural Network by Means of Fuzzy Inference System and Its Optimization (퍼지추론 기반 다항식 RBF 뉴럴 네트워크의 설계 및 최적화)

  • Baek, Jin-Yeol;Park, Byaung-Jun;Oh, Sung-Kwun
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.58 no.2
    • /
    • pp.399-406
    • /
    • 2009
  • In this study, Polynomial Radial Basis Function Neural Network(pRBFNN) based on Fuzzy Inference System is designed and its parameters such as learning rate, momentum coefficient, and distributed weight (width of RBF) are optimized by means of Particle Swarm Optimization. The proposed model can be expressed as three functional module that consists of condition part, conclusion part, and inference part in the viewpoint of fuzzy rule formed in 'If-then'. In the condition part of pRBFNN as a fuzzy rule, input space is partitioned by defining kernel functions (RBFs). Here, the structure of kernel functions, namely, RBF is generated from HCM clustering algorithm. We use Gaussian type and Inverse multiquadratic type as a RBF. Besides these types of RBF, Conic RBF is also proposed and used as a kernel function. Also, in order to reflect the characteristic of dataset when partitioning input space, we consider the width of RBF defined by standard deviation of dataset. In the conclusion part, the connection weights of pRBFNN are represented as a polynomial which is the extended structure of the general RBF neural network with constant as a connection weights. Finally, the output of model is decided by the fuzzy inference of the inference part of pRBFNN. In order to evaluate the proposed model, nonlinear function with 2 inputs, waster water dataset and gas furnace time series dataset are used and the results of pRBFNN are compared with some previous models. Approximation as well as generalization abilities are discussed with these results.

The FPNN Algorithm combined with fuzzy inference rules and PNN structure (퍼지추론규칙과 PNN 구조를 융합한 FPNN 알고리즘)

  • Park, Ho-Sung;Park, Byoung-Jun;Ahn, Tae-Chon;Oh, Sung-Kwun
    • Proceedings of the KIEE Conference
    • /
    • 1999.07g
    • /
    • pp.2856-2858
    • /
    • 1999
  • In this paper, the FPNN(Fuzzy Polynomial Neural Networks) algorithm with multi-layer fuzzy inference structure is proposed for the model identification of a complex nonlinear system. The FPNN structure is generated from the mutual combination of PNN (Polynomial Neural Network) structure and fuzzy inference method. The PNN extended from the GMDH(Group Method of Data Handling) uses several types of polynomials such as linear, quadratic and modifled quadratic besides the biquadratic polynomial used in the GMDH. In the fuzzy inference method, simplified and regression polynomial inference method which is based on the consequence of fuzzy rule expressed with a polynomial such as linear, quadratic and modified quadratic equation are used Each node of the FPNN is defined as a fuzzy rule and its structure is a kind of fuzzy-neural networks. Gas furnace data used to evaluate the performance of our proposed model.

  • PDF

Design of a Croos-obstacle Neural network Controller using running error calibration (주행 오차 보정을 통한 장애물 극복 신경망 제어기 설계)

  • Lim, Shin-Teak;Li, BiFu;Chong, Kil-Do
    • Proceedings of the IEEK Conference
    • /
    • 2009.05a
    • /
    • pp.372-374
    • /
    • 2009
  • In this research, an obstacle avoidance method is proposed. The common usage of a robot is indoor and the obstacles to the indoor robot is studied. The accurate detection of direction after overcoming the obstacles is necessary for performance of autonomous navigation and mission project. The sensors such as Laser, Ultrasound, PSD can be used to measure the obstacles. In this research, a PSD sensor is used to detect obstacles. It detects the height and width of obstacles located on the floor. Before measuring the obstacles, a calibration of the sensor was done and it produced a better accuracy. We have plotted an error graph using data obtained from the repeated experiments. The graph is fitted to a polynomial curve. The polynomial equation is used for the robot navigation. And in this research, a model of the error of the direction of the robot after overcoming obstacles was obtained also. The prototype of the obstacle and the error of the direction after overcoming the obstacles are modelled using a neural networks. The input of the neural network composed with the height of the obstacles, the speed of robot, the direction of wheels and the error of the direction. To implement the suggested algorithm, we set up a robot which is operated by a notebook computer. Experiment showed the suggested algorithm performed well.

  • PDF

Exploiting Neural Network for Temporal Multi-variate Air Quality and Pollutant Prediction

  • Khan, Muneeb A.;Kim, Hyun-chul;Park, Heemin
    • Journal of Korea Multimedia Society
    • /
    • v.25 no.2
    • /
    • pp.440-449
    • /
    • 2022
  • In recent years, the air pollution and Air Quality Index (AQI) has been a pivotal point for researchers due to its effect on human health. Various research has been done in predicting the AQI but most of these studies, either lack dense temporal data or cover one or two air pollutant elements. In this paper, a hybrid Convolutional Neural approach integrated with recurrent neural network architecture (CNN-LSTM), is presented to find air pollution inference using a multivariate air pollutant elements dataset. The aim of this research is to design a robust and real-time air pollutant forecasting system by exploiting a neural network. The proposed approach is implemented on a 24-month dataset from Seoul, Republic of Korea. The predicted results are cross-validated with the real dataset and compared with the state-of-the-art techniques to evaluate its robustness and performance. The proposed model outperforms SVM, SVM-Polynomial, ANN, and RF models with 60.17%, 68.99%, 14.6%, and 6.29%, respectively. The model performs SVM and SVM-Polynomial in predicting O3 by 78.04% and 83.79%, respectively. Overall performance of the model is measured in terms of Mean Absolute Error (MAE), Mean Absolute Percentage Error (MAPE) and the Root Mean Square Error (RMSE).

Polynomial Higher Order Neural Network for Shift-invariant Pattern Recognition (위치 변환 패턴 인식을 위한 다항식 고차 뉴럴네트워크)

  • Chung, Jong-Su;Hong, Sung-Chan
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.12
    • /
    • pp.3063-3068
    • /
    • 1997
  • In this paper, we have extended the generalization back-propagation algorithm to multi-layer polynomial higher order neural networks. The purpose of this paper is to describe various pattern recognition using polynomial higher-order neural network. And we have applied shift position T-C test pattern for invariant pattern recognition and measured generalization by mirror symmetry problem. simulation result shows that the ability for invariant pattern recognition increase with the proposed technique. Recognition rate of invariant T-C pattern is 90% effective and of mirror symmetry problem is 70% effective when the proposed technique is utilized. These results are much better than those by the conventional methods.

  • PDF

K-Means-Based Polynomial-Radial Basis Function Neural Network Using Space Search Algorithm: Design and Comparative Studies (공간 탐색 최적화 알고리즘을 이용한 K-Means 클러스터링 기반 다항식 방사형 기저 함수 신경회로망: 설계 및 비교 해석)

  • Kim, Wook-Dong;Oh, Sung-Kwun
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.17 no.8
    • /
    • pp.731-738
    • /
    • 2011
  • In this paper, we introduce an advanced architecture of K-Means clustering-based polynomial Radial Basis Function Neural Networks (p-RBFNNs) designed with the aid of SSOA (Space Search Optimization Algorithm) and develop a comprehensive design methodology supporting their construction. In order to design the optimized p-RBFNNs, a center value of each receptive field is determined by running the K-Means clustering algorithm and then the center value and the width of the corresponding receptive field are optimized through SSOA. The connections (weights) of the proposed p-RBFNNs are of functional character and are realized by considering three types of polynomials. In addition, a WLSE (Weighted Least Square Estimation) is used to estimate the coefficients of polynomials (serving as functional connections of the network) of each node from output node. Therefore, a local learning capability and an interpretability of the proposed model are improved. The proposed model is illustrated with the use of nonlinear function, NOx called Machine Learning dataset. A comparative analysis reveals that the proposed model exhibits higher accuracy and superb predictive capability in comparison to some previous models available in the literature.

The Recognition System of Face using Polynomial Coefficients (다항계수를 이용한 얼굴 인식 시스템)

  • 신창훈;김윤호;류광렬;이주신
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 1999.11a
    • /
    • pp.244-247
    • /
    • 1999
  • in this paper, we propose the recognition system of face using polynomial coefficients to recognize fact images using neural network. The system consists of following steps. First step, the sizes of fare images is reduced sizes of input images to 1/4 using wavelet transform. Second step, the polynomial coefficients is obtained from low frequency coefficient matrix after 3 level wavelet transform. Third step, polynomial coefficients is normalized. The of range of normalization is from -1 to 1. Last, Face images is trained and recognized using neural network with error back propagation algorithm.

  • PDF

The solution of single-variable minimization using neural network

  • Son, Jun-Hyug;Seo, Bo-Hyeok
    • Proceedings of the KIEE Conference
    • /
    • 2004.07d
    • /
    • pp.2528-2530
    • /
    • 2004
  • Neural network minimization problems are often conditioned and in this contribution way to handle this will be discussed. It is shown that a better conditioned minimization problem can be obtained if the problem is separated with respect to the linear parameters. This will increase the convergence speed of the minimization. One of the most powerful uses of neural networks is in function approximation(curve fitting)[1]. A main characteristic of this solution is that function (f) to be approximated is given not explicitly but implicitly through a set of input-output pairs, named as training set, that can be easily obtained from calibration data of the measurement system. In this context, the usage of Neural Network(NN) techniques for modeling the systems behavior can provide lower interpolation errors when compared with classical methods like polynomial interpolation. This paper solve of single-variable minimization using neural network.

  • PDF

A New Design Approach for Optimization of GA-based SOPNN (GA 기반 자기구성 다항식 뉴럴 네트워크의 최적화를 위한 새로운 설계 방법)

  • Park, Ho-Sung;Park, Byoung-Jun;Park, Keon-Jun;Oh, Sung-Kwun
    • Proceedings of the KIEE Conference
    • /
    • 2003.07d
    • /
    • pp.2627-2629
    • /
    • 2003
  • In this paper, we propose a new architecture of Genetic Algorithms(GAs)-based Self-Organizing Polynomial Neural Networks(SOPNN). The conventional SOPNN is based on the extended Group Method of Data Handling(GMDH) method and utilized the polynomial order (viz. linear, quadratic, and modified quadratic) as well as the number of node inputs fixed (selected in advance by designer) at Polynomial Neurons (or nodes) located in each layer through a growth process of the network. Moreover it does not guarantee that the SOPNN generated through learning has the optimal network architecture. But the proposed GA-based SOPNN enable the architecture to be a structurally more optimized networks, and to be much more flexible and preferable neural network than the conventional SOPNN. An aggregate performance index with a weighting factor is proposed in order to achieve a sound balance between approximation and generalization (predictive) abilities of the model. To evaluate the performance of the GA-based SOPNN, the model is experimented with using nonlinear system data.

  • PDF

Comparative Analysis of Learning Methods of Fuzzy Clustering-based Neural Network Pattern Classifier (퍼지 클러스터링기반 신경회로망 패턴 분류기의 학습 방법 비교 분석)

  • Kim, Eun-Hu;Oh, Sung-Kwun;Kim, Hyun-Ki
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.65 no.9
    • /
    • pp.1541-1550
    • /
    • 2016
  • In this paper, we introduce a novel learning methodology of fuzzy clustering-based neural network pattern classifier. Fuzzy clustering-based neural network pattern classifier depicts the patterns of given classes using fuzzy rules and categorizes the patterns on unseen data through fuzzy rules. Least squares estimator(LSE) or weighted least squares estimator(WLSE) is typically used in order to estimate the coefficients of polynomial function, but this study proposes a novel coefficient estimate method which includes advantages of the existing methods. The premise part of fuzzy rule depicts input space as "If" clause of fuzzy rule through fuzzy c-means(FCM) clustering, while the consequent part of fuzzy rule denotes output space through polynomial function such as linear, quadratic and their coefficients are estimated by the proposed local least squares estimator(LLSE)-based learning. In order to evaluate the performance of the proposed pattern classifier, the variety of machine learning data sets are exploited in experiments and through the comparative analysis of performance, it provides that the proposed LLSE-based learning method is preferable when compared with the other learning methods conventionally used in previous literature.