• Title/Summary/Keyword: Bayesian maximum likelihood algorithm

Search Result 36, Processing Time 0.029 seconds

A Comparison of Bayesian and Maximum Likelihood Estimations in a SUR Tobit Regression Model (SUR 토빗회귀모형에서 베이지안 추정과 최대가능도 추정의 비교)

  • Lee, Seung-Chun;Choi, Byongsu
    • The Korean Journal of Applied Statistics
    • /
    • v.27 no.6
    • /
    • pp.991-1002
    • /
    • 2014
  • Both Bayesian and maximum likelihood methods are efficient for the estimation of regression coefficients of various Tobit regression models (see. e.g. Chib, 1992; Greene, 1990; Lee and Choi, 2013); however, some researchers recognized that the maximum likelihood method tends to underestimate the disturbance variance, which has implications for the estimation of marginal effects and the asymptotic standard error of estimates. The underestimation of the maximum likelihood estimate in a seemingly unrelated Tobit regression model is examined. A Bayesian method based on an objective noninformative prior is shown to provide proper estimates of the disturbance variance as well as other regression parameters

A Study on the Classification for Satellite Images using Hybrid Method (하이브리드 분류기법을 이용한 위성영상의 분류에 관한 연구)

  • Jeon, Young-Joon;Kim, Jin-Il
    • The KIPS Transactions:PartB
    • /
    • v.11B no.2
    • /
    • pp.159-168
    • /
    • 2004
  • This paper presents hybrid classification method to improve the performance of satellite images classification by combining Bayesian maximum likelihood classifier, ISODATA clustering and fuzzy C-Means algorithm. In this paper, the training data of each class were generated by separating the spectral signature using ISODATA clustering. We can classify according to pixel's membership grade followed by cluster center of fuzzy C-Means algorithm as the mean value of training data for each class. Bayesian maximum likelihood classifier is performed with prior probability by result of fuzzy C-Means classification. The results shows that proposed method could improve performance of classification method and also perform classification with no concern about spectral signature of the training data. The proposed method Is applied to a Landsat TM satellite image for the verifying test.

A Probabilistic Tracking Mechanism for Luxury Purchase Implemented by Hidden Markov Model, Bayesian Inference, Customer Satisfaction and Net Promoter Score (고객만족, NPS, Bayesian Inference 및 Hidden Markov Model로 구현하는 명품구매에 관한 확률적 추적 메카니즘)

  • Hwang, Sun Ju;Rhee, Jung Soo
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.23 no.6
    • /
    • pp.79-94
    • /
    • 2018
  • The purpose of this study is to specify a probabilistic tracking mechanism for customer luxury purchase implemented by hidden Markov model, Bayesian inference, customer satisfaction and net promoter score. In this paper, we have designed a probabilistic model based on customer's actual data containing purchase or non-purchase states by tracking the SPC chain : customer satisfaction -> customer referral -> purchase/non-purchase. By applying hidden Markov model and Viterbi algorithm to marketing theory, we have developed the statistical model related to probability theories and have found the best purchase pattern scenario from customer's purchase records.

Inverted exponentiated Weibull distribution with applications to lifetime data

  • Lee, Seunghyung;Noh, Yunhwan;Chung, Younshik
    • Communications for Statistical Applications and Methods
    • /
    • v.24 no.3
    • /
    • pp.227-240
    • /
    • 2017
  • In this paper, we introduce the inverted exponentiated Weibull (IEW) distribution which contains exponentiated inverted Weibull distribution, inverse Weibull (IW) distribution, and inverted exponentiated distribution as submodels. The proposed distribution is obtained by the inverse form of the exponentiated Weibull distribution. In particular, we explain that the proposed distribution can be interpreted by Marshall and Olkin's book (Lifetime Distributions: Structure of Non-parametric, Semiparametric, and Parametric Families, 2007, Springer) idea. We derive the cumulative distribution function and hazard function and calculate expression for its moment. The hazard function of the IEW distribution can be decreasing, increasing or bathtub-shaped. The maximum likelihood estimation (MLE) is obtained. Then we show the existence and uniqueness of MLE. We can also obtain the Bayesian estimation by using the Gibbs sampler with the Metropolis-Hastings algorithm. We also give applications with a simulated data set and two real data set to show the flexibility of the IEW distribution. Finally, conclusions are mentioned.

Online Probability Density Estimation of Nonstationary Random Signal using Dynamic Bayesian Networks

  • Cho, Hyun-Cheol;Fadali, M. Sami;Lee, Kwon-Soon
    • International Journal of Control, Automation, and Systems
    • /
    • v.6 no.1
    • /
    • pp.109-118
    • /
    • 2008
  • We present two estimators for discrete non-Gaussian and nonstationary probability density estimation based on a dynamic Bayesian network (DBN). The first estimator is for off line computation and consists of a DBN whose transition distribution is represented in terms of kernel functions. The estimator parameters are the weights and shifts of the kernel functions. The parameters are determined through a recursive learning algorithm using maximum likelihood (ML) estimation. The second estimator is a DBN whose parameters form the transition probabilities. We use an asymptotically convergent, recursive, on-line algorithm to update the parameters using observation data. The DBN calculates the state probabilities using the estimated parameters. We provide examples that demonstrate the usefulness and simplicity of the two proposed estimators.

The Exponentiated Weibull-Geometric Distribution: Properties and Estimations

  • Chung, Younshik;Kang, Yongbeen
    • Communications for Statistical Applications and Methods
    • /
    • v.21 no.2
    • /
    • pp.147-160
    • /
    • 2014
  • In this paper, we introduce the exponentiated Weibull-geometric (EWG) distribution which generalizes two-parameter exponentiated Weibull (EW) distribution introduced by Mudholkar et al. (1995). This proposed distribution is obtained by compounding the exponentiated Weibull with geometric distribution. We derive its cumulative distribution function (CDF), hazard function and the density of the order statistics and calculate expressions for its moments and the moments of the order statistics. The hazard function of the EWG distribution can be decreasing, increasing or bathtub-shaped among others. Also, we give expressions for the Renyi and Shannon entropies. The maximum likelihood estimation is obtained by using EM-algorithm (Dempster et al., 1977; McLachlan and Krishnan, 1997). We can obtain the Bayesian estimation by using Gibbs sampler with Metropolis-Hastings algorithm. Also, we give application with real data set to show the flexibility of the EWG distribution. Finally, summary and discussion are mentioned.

A Modified FCM for Nonlinear Blind Channel Equalization using RBF Networks

  • Han, Soo-Whan
    • Journal of information and communication convergence engineering
    • /
    • v.5 no.1
    • /
    • pp.35-41
    • /
    • 2007
  • In this paper, a modified Fuzzy C-Means (MFCM) algorithm is presented for nonlinear blind channel equalization. The proposed MFCM searches the optimal channel output states of a nonlinear channel, based on the Bayesian likelihood fitness function instead of a conventional Euclidean distance measure. In its searching procedure, all of the possible desired channel states are constructed with the elements of estimated channel output states. The desired state with the maximum Bayesian fitness is selected and placed at the center of a Radial Basis Function (RBF) equalizer to reconstruct transmitted symbols. In the simulations, binary signals are generated at random with Gaussian noise. The performance of the proposed method is compared with that of a hybrid genetic algorithm (GA merged with simulated annealing (SA): GASA), and the relatively high accuracy and fast searching speed are achieved.

Estimation of Non-Gaussian Probability Density by Dynamic Bayesian Networks

  • Cho, Hyun-C.;Fadali, Sami M.;Lee, Kwon-S.
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.408-413
    • /
    • 2005
  • A new methodology for discrete non-Gaussian probability density estimation is investigated in this paper based on a dynamic Bayesian network (DBN) and kernel functions. The estimator consists of a DBN in which the transition distribution is represented with kernel functions. The estimator parameters are determined through a recursive learning algorithm according to the maximum likelihood (ML) scheme. A discrete-type Poisson distribution is generated in a simulation experiment to evaluate the proposed method. In addition, an unknown probability density generated by nonlinear transformation of a Poisson random variable is simulated. Computer simulations numerically demonstrate that the method successfully estimates the unknown probability distribution function (PDF).

  • PDF

New Inference for a Multiclass Gaussian Process Classification Model using a Variational Bayesian EM Algorithm and Laplace Approximation

  • Cho, Wanhyun;Kim, Sangkyoon;Park, Soonyoung
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.4 no.4
    • /
    • pp.202-208
    • /
    • 2015
  • In this study, we propose a new inference algorithm for a multiclass Gaussian process classification model using a variational EM framework and the Laplace approximation (LA) technique. This is performed in two steps, called expectation and maximization. First, in the expectation step (E-step), using Bayes' theorem and the LA technique, we derive the approximate posterior distribution of the latent function, indicating the possibility that each observation belongs to a certain class in the Gaussian process classification model. In the maximization step, we compute the maximum likelihood estimators for hyper-parameters of a covariance matrix necessary to define the prior distribution of the latent function by using the posterior distribution derived in the E-step. These steps iteratively repeat until a convergence condition is satisfied. Moreover, we conducted the experiments by using synthetic data and Iris data in order to verify the performance of the proposed algorithm. Experimental results reveal that the proposed algorithm shows good performance on these datasets.

Image Segmentation Based on Fusion of Range and Intensity Images (거리영상과 밝기영상의 fusion을 이용한 영상분할)

  • Chang, In-Su;Park, Rae-Hong
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.35S no.9
    • /
    • pp.95-103
    • /
    • 1998
  • This paper proposes an image segmentation algorithm based on fusion of range and intensity images. Based on Bayesian theory, a priori knowledge is encoded by the Markov random field (MRF). A maximum a posteriori (MAP) estimator is constructed using the features extracted from range and intensity images. Objects are approximated by local planar surfaces in range images, and the parametric space is constructed with the surface parameters estimated pixelwise. In intensity images the ${\alpha}$-trimmed variance constructs the intensity feature. An image is segmented by optimizing the MAP estimator that is constructed using a likelihood function based on edge information. Computer simulation results shw that the proposed fusion algorithm effectively segments the images independentl of shadow, noise, and light-blurring.

  • PDF