• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.54 no.4
• /
• pp.251-258
• /
• 2005

Automatic document classification may differ significantly according to the characteristics of documents that are subject to classification, as well as classifier's performance. This research identifies e-mail document's characteristics to apply a three-step preprocessing algorithm that can minimize e-mail document's atypical characteristics. In the first 5go, uncertain based sampling algorithm that used Mean Absolute Deviation(MAD), is used to address the question of selection learning document for the rule generation at the time of classification. In the subsequent stage, Weighted vlaue assigning method by attribute is applied to increase the discriminating capability of the terms that appear on the title on the e-mail document characteristic level. in the third and last stage, accuracy level during classification by each category is increased by using Naive Bayesian Presumptive Algorithm's Dynamic Threshold. And, we implemented an E-Mail Recommendtion System using a three-step preprocessing algorithm the enable users for direct and optimal classification with the recommendation of the applicable category when a mail arrives.

• The Korean Journal of Applied Statistics
• /
• v.14 no.2
• /
• pp.379-391
• /
• 2001

본 연구에서는 관심거리가 되고 있는 마코프인쇄 몬테칼로(Markov Chain Monte Carlo, MCMC)방법에 근거한 공간 확률난수 (spatial random variate)생성법과 깁스표본추출법(Gibbs sampling)에 의한 베이지안 분석 방법에 대한 기술적 사항들에 관하여 검토하였다. 먼저 기본적인 확률난수 생성법과 관련된 사항을 살펴보고, 다음으로 조건부명시법(conditional specification)을 이용한 공간 확률난수 생성법을 예를 들어 살펴보기로한다. 다음으로는 이렇게 생성된 공간자료를 분석하기 위하여 깁스표본추출법을 이용한 베이지안 사후분포를 구하는 방법을 살펴보았다.

• Communications for Statistical Applications and Methods
• /
• v.13 no.3
• /
• pp.491-501
• /
• 2006

We consider a multiple change point model with autoregressive conditional heteroscedasticity (ARCH). The model assumes that all or the part of the parameters in the ARCH equation change over time. The occurrence of the change points is modelled as the discrete time Markov process with unknown transition probabilities. The model is estimated by Markov chain Monte Carlo methods based on the approach of Chib (1998). Simulation is performed using a variant of perfect sampling algorithm to achieve the accuracy and efficiency. We apply the proposed model to the simulated data for verifying the usefulness of the model.

• The Korean Journal of Applied Statistics
• /
• v.9 no.1
• /
• pp.153-164
• /
• 1996

We discussed estimation of parameters using Gibbs sampler under order restriction on the parameters. Two well-knwon probability models, ordered exponential family and binomial distribution, are considered. We derived full conditional distributions(FCD) and also used one-for-one sampling algorithm to sample from the FCD's under order restrictions. Finally through two real data sets we compared three kinds of estimators; isotonic regression estimator, isotonic Bayesian estimator and the estimator using Gibbs sampler.

• Proceedings of the Korean Society for Quality Management Conference
• /
• 2006.04a
• /
• pp.319-324
• /
• 2006

In this paper, we propose Bayesian procedure for the multiple change points analysis in a sequence of fractions nonconforming. We first compute the Bayes factor for detecting the existence of no change, a single change or multiple changes. The Gibbs sampler with the Metropolis-Hastings subchain is run to estimate parameters of the change point model, once the number of change points is identified. Finally, we apply the results developed in this paper to both a real and simulated data.

• The Korean Journal of Applied Statistics
• /
• v.15 no.1
• /
• pp.73-84
• /
• 2002

Linear regression models with inequality constraints on the coefficients are frequently used in economic models due to sign or order constraints on the coefficients. In this paper, we propose a Bayesian approach to selecting significant explanatory variables in linear regression models with inequality constraints on the coefficients. Bayesian variable selection requires computation of posterior probability of each candidate model. We propose a method which computes all the necessary posterior model probabilities simultaneously. In specific, we obtain posterior samples form the most general model via Gibbs sampling algorithm (Gelfand and Smith, 1990) and compute the posterior probabilities by using the samples. A real example is given to illustrate the method.

• Journal of the Korean Mathematical Society
• /
• v.61 no.5
• /
• pp.875-898
• /
• 2024

This study estimates the true price of an asset and finds the optimal bid/ask prices for market makers. We provide a novel state-space model based on the exponential Ornstein-Uhlenbeck volatility and the Heston models with Gaussian noise, where the traded price and volume are available, but the true price is not observable. An objective of this study is to use Bayesian filtering to estimate the posterior distribution of the true price, given the traded price and volume. Because the posterior density is intractable, we employ the guided particle filtering algorithm, with which adaptive rejection metropolis sampling is used to generate samples from the density function of an unknown distribution. Given a simulated sample path, the posterior expectation of the true price outperforms the traded price in estimating the true price in terms of both the mean absolute error and root-mean-square error metrics. Another objective is to determine the optimal bid/ask prices for a market maker. The profit-and-loss of the market maker is the difference between the true price and its bid/ask prices multiplied by the traded volume or bid/ask size of the market maker. The market maker maximizes the expected utility of the PnL under the posterior distribution. We numerically calculate the optimal bid/ask prices using the Monte Carlo method, finding that its spread widens as the market maker becomes more risk-averse, and the bid/ask size and the level of uncertainty increase.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.14 no.3
• /
• pp.517-523
• /
• 2011

The estimation filter in radar systems must track targets' position within low tracking error. In the Multi-Function Radar(MFR), ${\alpha}-{\beta}$ filter and Kalman filter are widely used to track single or multiple targets. However, due to target maneuvering, these filters may not reduce tracking error, therefore, may lost target tracks. In this paper, a target tracking filter based on particle filtering algorithm is proposed for the MFR. The advantage of this method is that it can track targets within low tracking error while targets maneuver and reduce impoverishment of particles by the proposed resampling method. From the simulation results, the improved tracking performance is obtained by the proposed filtering algorithm.

• Communications for Statistical Applications and Methods
• /
• v.24 no.5
• /
• pp.457-480
• /
• 2017

We develop a random partition procedure based on a Dirichlet process prior with Laplace distribution. Gibbs sampling of a Laplace mixture of linear mixed regressions with a Dirichlet process is implemented as a random partition model when the number of clusters is unknown. Our approach provides simultaneous partitioning and parameter estimation with the computation of classification probabilities, unlike its counterparts. A full Gibbs-sampling algorithm is developed for an efficient Markov chain Monte Carlo posterior computation. The proposed method is illustrated with simulated data and one real data of the energy efficiency of Tsanas and Xifara (Energy and Buildings, 49, 560-567, 2012).

• KIISE Transactions on Computing Practices
• /
• v.21 no.1
• /
• pp.94-99
• /
• 2015

With the recent machine learning paradigm of using nonparametric Bayesian statistics and statistical inference based on random sampling, the Dirichlet distribution finds many uses in a variety of graphical models. It is a multivariate generalization of the gamma distribution and is defined on a continuous (K-1)-simplex. This paper presents a sampling method for a Dirichlet distribution for the problem of dividing an integer X into a sequence of K integers which sum to X. The target samples in our problem are all positive integer vectors when multiplied by a given X. They must be sampled from the correspondingly gridded simplex. In this paper we develop a Markov Chain Monte Carlo (MCMC) proposal distribution for the neighborhood grid points on the simplex and then present the complete algorithm based on the Metropolis-Hastings algorithm. The proposed algorithm can be used for the Markov model, HMM, and Semi-Markov model for accurate state-duration modeling. It can also be used for the Gamma-Dirichlet HMM to model q the global-local duration distributions.