• Title/Summary/Keyword: Gaussian-polynomial approximation

Search Result 8, Processing Time 0.02 seconds

Numerical Comparisons for the Null Distribution of the Bagai Statistic

  • Ha, Hyung-Tae
    • Communications for Statistical Applications and Methods
    • /
    • v.19 no.2
    • /
    • pp.267-276
    • /
    • 2012
  • Bagai et al. (1989) proposed a distribution-free test for stochastic ordering in the competing risk model, and recently Murakami (2009) utilized a standard saddlepoint approximation to provide tail probabilities for the Bagai statistic under finite sample sizes. In the present paper, we consider the Gaussian-polynomial approximation proposed in Ha and Provost (2007) and compare it to the saddlepoint approximation in terms of approximating the percentiles of the Bagai statistic. We make numerical comparisons of these approximations for moderate sample sizes as was done in Murakami (2009). From the numerical results, it was observed that the Gaussianpolynomial approximation provides comparable or greater accuracy in the tail probabilities than the saddlepoint approximation. Unlike saddlepoint approximation, the Gaussian-polynomial approximation provides a simple explicit representation of the approximated density function. We also discuss the details of computations.

Krawtchouk Polynomial Approximation for Binomial Convolutions

  • Ha, Hyung-Tae
    • Kyungpook Mathematical Journal
    • /
    • v.57 no.3
    • /
    • pp.493-502
    • /
    • 2017
  • We propose an accurate approximation method via discrete Krawtchouk orthogonal polynomials to the distribution of a sum of independent but non-identically distributed binomial random variables. This approximation is a weighted binomial distribution with no need for continuity correction unlike commonly used density approximation methods such as saddlepoint, Gram-Charlier A type(GC), and Gaussian approximation methods. The accuracy obtained from the proposed approximation is compared with saddlepoint approximations applied by Eisinga et al. [4], which are the most accurate method among higher order asymptotic approximation methods. The numerical results show that the proposed approximation in general provide more accurate estimates over the entire range for the target probability mass function including the right-tail probabilities. In addition, the method is mathematically tractable and computationally easy to program.

Fuzzy Polynomial Neural Networks based on GMDH algorithm and Polynomial Fuzzy Inference (GMDH 알고리즘과 다항식 퍼지추론에 기초한 퍼지 다항식 뉴럴 네트워크)

  • 박호성;윤기찬;오성권
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2000.05a
    • /
    • pp.130-133
    • /
    • 2000
  • In this paper, a new design methodology named FNNN(Fuzzy Polynomial Neural Network) algorithm is proposed to identify the structure and parameters of fuzzy model using PNN(Polynomial Neural Network) structure and a fuzzy inference method. The PNN is the extended structure of the GMDH(Group Method of Data Handling), and uses several types of polynomials such as linear, quadratic and modified quadratic besides the biquadratic polynomial used in the GMDH. The premise of fuzzy inference rules defines by triangular and gaussian type membership function. The fuzzy inference method uses 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 fuzzy rules and its structure is a kind of neuro-fuzzy architecture Several numerical example are used to evaluate the performance of out proposed model. Also we used the training data and testing data set to obtain a balance between the approximation and generalization of proposed model.

  • PDF

Modal Parameter Estimations of Wind-Excited Structures based on a Rational Polynomial Approximation Method (유리분수함수 근사법에 기반한 풍하중을 받는 구조물의 동특성 추정)

  • Kim, Sang-Bum;Lee, Wan-Soo;Yun, Chung-Bang
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2005.11a
    • /
    • pp.287-292
    • /
    • 2005
  • This paper presents a rational polynomial approximation method to estimate modal parameters of wind excited structures using incomplete noisy measurements of structural responses and partial measurements of wind velocities only. A stochastic model of the excitation wind force acting on the structure is estimated from partial measurements of wind velocities. Then the transfer functions of the structure are approximated as rational polynomial functions. From the poles and zeros of the estimated rational polynomial functions, the modal parameters, such as natural frequencies, damping ratios, and mode shapes are extracted. Since the frequency characteristics of wind forces acting on structures can be assumed as a smooth Gaussian process especially around the natural frequencies of the structures according to the central limit theorem (Brillinger, 1969; Yaglom, 1987), the estimated modal parameters are robust and reliable with respect to the assumed stochastic input models. To verify the proposed method, the modal parameters of a TV transmission tower excited by gust wind are estimated. Comparison study with the results of other researchers shows the efficacy of the suggested method.

  • PDF

A new high-order response surface method for structural reliability analysis

  • Li, Hong-Shuang;Lu, Zhen-Zhou;Qiao, Hong-Wei
    • Structural Engineering and Mechanics
    • /
    • v.34 no.6
    • /
    • pp.779-799
    • /
    • 2010
  • In order to consider high-order effects on the actual limit state function, a new response surface method is proposed for structural reliability analysis by the use of high-order approximation concept in this study. Hermite polynomials are used to determine the highest orders of input random variables, and the sampling points for the determination of highest orders are located on Gaussian points of Gauss-Hermite integration. The cross terms between two random variables, only in case that their corresponding percent contributions to the total variation of limit state function are significant, will be added to the response surface function to improve the approximation accuracy. As a result, significant reduction in computational cost is achieved with this strategy. Due to the addition of cross terms, the additional sampling points, laid on two-dimensional Gaussian points off axis on the plane of two significant variables, are required to determine the coefficients of the approximated limit state function. All available sampling points are employed to construct the final response surface function. Then, Monte Carlo Simulation is carried out on the final approximation response surface function to estimate the failure probability. Due to the use of high order polynomial, the proposed method is more accurate than the traditional second-order or linear response surface method. It also provides much more efficient solutions than the available high-order response surface method with less loss in accuracy. The efficiency and the accuracy of the proposed method compared with those of various response surface methods available are illustrated by five numerical examples.

Minimum Message Length and Classical Methods for Model Selection in Univariate Polynomial Regression

  • Viswanathan, Murlikrishna;Yang, Young-Kyu;WhangBo, Taeg-Keun
    • ETRI Journal
    • /
    • v.27 no.6
    • /
    • pp.747-758
    • /
    • 2005
  • The problem of selection among competing models has been a fundamental issue in statistical data analysis. Good fits to data can be misleading since they can result from properties of the model that have nothing to do with it being a close approximation to the source distribution of interest (for example, overfitting). In this study we focus on the preference among models from a family of polynomial regressors. Three decades of research has spawned a number of plausible techniques for the selection of models, namely, Akaike's Finite Prediction Error (FPE) and Information Criterion (AIC), Schwartz's criterion (SCH), Generalized Cross Validation (GCV), Wallace's Minimum Message Length (MML), Minimum Description Length (MDL), and Vapnik's Structural Risk Minimization (SRM). The fundamental similarity between all these principles is their attempt to define an appropriate balance between the complexity of models and their ability to explain the data. This paper presents an empirical study of the above principles in the context of model selection, where the models under consideration are univariate polynomials. The paper includes a detailed empirical evaluation of the model selection methods on six target functions, with varying sample sizes and added Gaussian noise. The results from the study appear to provide strong evidence in support of the MML- and SRM- based methods over the other standard approaches (FPE, AIC, SCH and GCV).

  • PDF

A Study on Modeling of Search Space with GA Sampling

  • Banno, Yoshifumi;Ohsaki, Miho;Yoshikawa, Tomohiro;Shinogi, Tsuyoshi;Tsuruoka, Shinji
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2003.09a
    • /
    • pp.86-89
    • /
    • 2003
  • To model a numerical problem space under the limitation of available data, we need to extract sparse but key points from the space and to efficiently approximate the space with them. This study proposes a sampling method based on the search process of genetic algorithm and a space modeling method based on least-squares approximation using the summation of Gaussian functions. We conducted simulations to evaluate them for several kinds of problem spaces: DeJong's, Schaffer's, and our original one. We then compared the performance between our sampling method and sampling at regular intervals and that between our modeling method and modeling using a polynomial. The results showed that the error between a problem space and its model was the smallest for the combination of our sampling and modeling methods for many problem spaces when the number of samples was considerably small.

  • PDF

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.