• 제목/요약/키워드: polynomial order

검색결과 876건 처리시간 0.027초

다항식 뉴럴네트워크 구조의 최적 설계에 관한 연구 (A Study on the Optimal Design of Polynomial Neural Networks Structure)

  • 오성권;김동원;박병준
    • 대한전기학회논문지:시스템및제어부문D
    • /
    • 제49권3호
    • /
    • pp.145-156
    • /
    • 2000
  • In this paper, we propose a new methodology which includes the optimal design procedure of Polynomial Neural Networks(PNN) structure for model identification of complex and nonlinear system. The proposed PNN algorithm is based on GMDA(Group Method of Data handling) method and its structure is similar to Neural Networks. But the structure of PNN is not fixed like in conventional Neural Networks and can be generated. The each node of PNN structure uses several types of high-order polynomial such as linear, quadratic and cubic, and is connected as various kinds of multi-variable inputs. In other words, the PNN uses high-order polynomial as extended type besides quadratic polynomial used in GMDH, and the number of input of its node in each layer depends on that of variables used in the polynomial. The design procedure to obtain an optimal model structure utilizing PNN algorithm is shown in each stage. The study is illustrated with the aid of pH neutralization process data besides representative time series data for gas furnace process used widely for performance comparison, and shows that the proposed PNN algorithm can produce the model with higher accuracy than previous other works. And performance index related to approximation and prediction capabilities of model is evaluated and also discussed.

  • PDF

산업용 백금저항온도계를 위한 향상된 내삽식 (Improved Interpolating Equation for Industrial Platinum Resistance Thermometer)

  • 양인석;김용규;감기술;이영희
    • 센서학회지
    • /
    • 제21권2호
    • /
    • pp.109-113
    • /
    • 2012
  • We propose an improved interpolating equation to express temperature-resistance characteristics for modern industrial platinum resistance thermometers (PRTs). Callendar-van Dusen equation which has been widely used for platinum resistance thermometer fails to fully describe temperature characteristics of high quality PRTs and leaves systematic residual when the calibration point include temperatures above $300^{\circ}C$. Expanding Callendar-van Dusen to higher-order polynomial drastically improves the uncertainty of the fitting even with reduced degrees of freedom of the fitting. We found that in the fourth-order polynomial fitting, the third-order and fourth-order coefficients have a strong correlation. Using the correlation, we suggest an improved interpolating equation in the form of fourth-order polynomial, but with three fitting parameters. Applying this interpolating equation reduced the uncertainty of the fitting to 32 % of that resulted from the traditional Callendar-van Dusen. This improvement was better than that from a simple third-order polynomial despite that the degrees of the freedom of the fitting was the same.

On Fitting Polynomial Measurement Error Models with Vector Predictor -When Interactions Exist among Predictors-

  • Myung-Sang Moon
    • Communications for Statistical Applications and Methods
    • /
    • 제2권1호
    • /
    • pp.1-12
    • /
    • 1995
  • An estimator of coefficients of polynomial measurement error model with vector predictor and first-order interaction terms is derived using Hermite polynomial. Asymptotic normality of estimator is provided and some simulation study is performed to compare the small sample properties of derived estimator with those of OLS estimator.

  • PDF

전대수 다항식형 확률강우강도식의 최적차수 결정 및 회귀계수에 대한 유의성 검정 (Determination of optimal order for the full-logged I-D-F polynomial equation and significance test of regression coefficients)

  • 박진희;이재준
    • 한국수자원학회논문집
    • /
    • 제55권10호
    • /
    • pp.775-784
    • /
    • 2022
  • 본 연구에서는 임의지속기간의 확률강우량 산정을 위해 실무에서 주로 사용되고 있는 전대수 다항식형 확률강우강도식의 최적차수 결정을 위하여 경상북도 내 9개 지점을 대상으로 확률강우량을 산정하고 전대수 다항식형 강우강도식의 회귀계수를 추정하였다. 추정된 지점별 다항식을 대상으로 단계선택법을 이용하여 각 지점별 다항식의 최적변수를 선정하고 선정된 변수들의 통계적 유의성을 검토하기 위하여 분산분석을 통한 유의성 검정을 실시하였으며, 이들 결과를 이용하여 각 지점별 통계적으로 적절하게 산정된 강우강도식을 제시하였다. 경북 9개 지점의 전대수 다항식형 강우강도식의 변수선정 결과는 6개 지점에서 1~3차식이 최적식으로 나타났고 1개 지점이 불완전 3차식이 최적식으로 나타났다. 그 중 1차는 Sherman 식, 2차는 General 식의 형태와 유사하므로 독립변수의 수를 증가시켜 적합도를 높이고 사용 편의를 위해 통일된 형태의 강우강도식으로 제시한다면 전대수 다항식형 강우강도식은 3차 회귀식까지만 고려하여도 통계학적으로 문제가 없는 것으로 판단된다.

비선형 공정을 위한 최적 다항식 뉴럴네트워크에 관한 연구 (A Study on Optimal Polynomial Neural Network for Nonlinear Process)

  • 김완수;오성권;김현기
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2005년도 학술대회 논문집 정보 및 제어부문
    • /
    • pp.149-151
    • /
    • 2005
  • In this paper, we propose the Optimal Polynomial Neural Networks(PNN) for nonlinear process. The PNN is based on Group Method of Data Handling(GMDH) method and its structure is similar to feedforward Neural Networks. But the structure of PNN is not fixed like in conventional Neural Networks and can be generated. The each node of PNN structure uses several types of high-order polynomial such as linear, quadratic and modified quadratic, and is connected as various kinds of multi-variable inputs. The conventional PNN depends on experience of a designer that select No. of input variable, input variable and polynomial type. Therefore it is very difficult a organizing of optimized network. The proposed algorithm identified and selected No. of input variable, input variable and polynomial type by using Genetic Algorithms(GAs). In the sequel the proposed model shows not only superior results to the existing models, but also pliability in organizing of optimal network. Medical Imaging System(MIS) data is simulated in order to confirm the efficiency and feasibility of the proposed approach in this paper.

  • PDF

APPROXIMATION ORDER TO A FUNCTION IN $C^1$[0, 1] AND ITS DERIVATIVE BY A FEEDFOWARD NEURAL NETWORK

  • Hahm, Nahm-Woo;Hong, Bum-Il
    • Journal of applied mathematics & informatics
    • /
    • 제27권1_2호
    • /
    • pp.139-147
    • /
    • 2009
  • We study the neural network approximation to a function in $C^1$[0, 1] and its derivative. In [3], we used even trigonometric polynomials in order to get an approximation order to a function in $L_p$ space. In this paper, we show the simultaneous approximation order to a function in $C^1$[0, 1] using a Bernstein polynomial and a feedforward neural network. Our proofs are constructive.

  • PDF

경쟁적 퍼지다항식 뉴런에 기초한 고급 자기구성 뉴럴네트워크 (Advanced Self-Organizing Neural Networks Based on Competitive Fuzzy Polynomial Neurons)

  • 박호성;박건준;이동윤;오성권
    • 대한전기학회논문지:시스템및제어부문D
    • /
    • 제53권3호
    • /
    • pp.135-144
    • /
    • 2004
  • In this paper, we propose competitive fuzzy polynomial neurons-based advanced Self-Organizing Neural Networks(SONN) architecture for optimal model identification and discuss a comprehensive design methodology supporting its development. The proposed SONN dwells on the ideas of fuzzy rule-based computing and neural networks. And it consists of layers with activation nodes based on fuzzy inference rules and regression polynomial. Each activation node is presented as Fuzzy Polynomial Neuron(FPN) which includes either the simplified or regression polynomial fuzzy inference rules. As the form of the conclusion part of the rules, especially the regression polynomial uses several types of high-order polynomials such as linear, quadratic, and modified quadratic. As the premise part of the rules, both triangular and Gaussian-like membership (unction are studied and the number of the premise input variables used in the rules depends on that of the inputs of its node in each layer. We introduce two kinds of SONN architectures, that is, the basic and modified one with both the generic and the advanced type. Here the basic and modified architecture depend on the number of input variables and the order of polynomial in each layer. The number of the layers and the nodes in each layer of the SONN are not predetermined, unlike in the case of the popular multi-layer perceptron structure, but these are generated in a dynamic way. The superiority and effectiveness of the Proposed SONN architecture is demonstrated through two representative numerical examples.

Prediction of Future Milk Yield with Random Regression Model Using Test-day Records in Holstein Cows

  • Park, Byoungho;Lee, Deukhwan
    • Asian-Australasian Journal of Animal Sciences
    • /
    • 제19권7호
    • /
    • pp.915-921
    • /
    • 2006
  • Various random regression models with different order of Legendre polynomials for permanent environmental and genetic effects were constructed to predict future milk yield of Holstein cows in Korea. A total of 257,908 test-day (TD) milk yield records from a total of 28,135 cows belonging to 1,090 herds were considered for estimating (co)variance of the random covariate coefficients using an expectation-maximization REML algorithm in an animal mixed model. The variances did not change much between the models, having different order of Legendre polynomial, but a decreasing trend was observed with increase in the order of Legendre polynomial in the model. The R-squared value of the model increased and the residual variance reduced with the increase in order of Legendre polynomial in the model. Therefore, a model with $5^{th}$ order of Legendre polynomial was considered for predicting future milk yield. For predicting the future milk yield of cows, 132,771 TD records from 28,135 cows were randomly selected from the above data by way of preceding partial TD record, and then future milk yields were estimated using incomplete records from each cow randomly retained. Results suggested that we could predict the next four months milk yield with an error deviation of 4 kg. The correlation of more than 70% between predicted and observed values was estimated for the next four months milk yield. Even using only 3 TD records of some cows, the average milk yield of Korean Holstein cows would be predicted with high accuracy if compared with observed milk yield. Persistency of each cow was estimated which might be useful for selecting the cows with higher persistency. The results of the present study suggested the use of a $5^{th}$ order Legendre polynomial to predict the future milk yield of each cow.

QUATNARY APPROXIMATING 4-POINT SUBDIVISION SCHEME

  • Ko, Kwan-Pyo
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • 제13권4호
    • /
    • pp.307-314
    • /
    • 2009
  • In this work, we introduce a new quatnary approximating subdivision scheme for curve and deal with its analysis (convergence and regularity) using Laurent polynomials method. We also discuss various properties, such as approximation order and support of basic limit function.

  • PDF

Minimum Mean Squared Error Invariant Designs for Polynomial Approximation

  • Joong-Yang Park
    • Communications for Statistical Applications and Methods
    • /
    • 제2권2호
    • /
    • pp.376-386
    • /
    • 1995
  • Designs for polynomial approximation to the unknown response function are considered. Optimality criteria are monotone functions of the mean squared error matrix of the least squares estimator. They correspond to the classical A-, D-, G- and Q-optimalities. Optimal first order designs are chosen from the invariant designs and then compared with optimal second order designs.

  • PDF