• 한국데이터정보과학회:학술대회논문집
• /
• 한국데이터정보과학회 2004년도 추계학술대회
• /
• pp.77-86
• /
• 2004

Clustering is the process of grouping the data into clusters so that objects within a cluster have high similarity in comparison to one another. In this paper we used k-means clustering of several clustering techniques. The k-means Clustering is classified as a partitional clustering method. We analyze 2002 Gyeongnam social indicator survey data using k-means clustering techniques for environmental information. We can use these outputs given by k-means clustering for environmental preservation and environmental improvement.

• Journal of the Korean Data and Information Science Society
• /
• 제15권4호
• /
• pp.731-741
• /
• 2004

This paper is planned to use multi-proportions randomized response model for sensitive information on internet survey. This is an indirect response technique as a way of obtaining much more precise information. In this system we consider that respondents are generally reluctant to answer in a survey to get sensitive information targeting employees, customers, etc.

• Journal of the Korean Data and Information Science Society
• /
• 제24권6호
• /
• pp.1543-1550
• /
• 2013

In this paper, we study Bayesian estimation for the finite population proportion in binary data under selection bias. We use a Bayesian nonignorable selection model to accommodate the selection mechanism. We compare four possible estimators of the finite population proportions based on data analysis as well as Monte Carlo simulation. It turns out that nonignorable selection model might be useful for weekly biased samples.

• Journal of applied mathematics & informatics
• /
• 제29권1_2호
• /
• pp.23-37
• /
• 2011

In this paper, we use a modified Tikhonov regularization method to solve the Fredholm integral equation of the first kind. Under the assumption that measured data are contaminated with deterministic errors, we give two error estimates. The convergence rates can be obtained under the suitable choices of regularization parameters and the number of measured points. Some numerical experiments show that the proposed method is effective and stable.

• 한국경영과학회지
• /
• 제19권1호
• /
• pp.201-206
• /
• 1994

The linear search problem is concerned with finding a hiden target on the real line R. The position of the target governed by some probability distribution. It is desired to find the target in the least expected search time. This problem has been formulated as an optimization problem by a number of authors without making use of Markov Decision Process (MDP) theory. It is the aim of the paper to give a (MDP) formulation to the search problem which we feel is both natural and easy to follow.

• Communications for Statistical Applications and Methods
• /
• 제8권1호
• /
• pp.257-269
• /
• 2001

The simulation is used to estimate an overflow probability in a stable parallel network with coupled inputs. Since the general simulation needs extremely many trials to obtain such a small probability, the fast simulation is proposed to reduce trials instead. By using the Cramer’s theorem, we first obtain an optimally changed measure under which the variance of the estimator is minimized. Then, we use it to derive an importance sampling estimator of the overflow probability which enables us to perform the fast simulation.

• Communications for Statistical Applications and Methods
• /
• 제7권1호
• /
• pp.233-244
• /
• 2000

Confidence intervals for survival function give useful information about the lifetime distribution. In this paper we develop Edgeworkth expansions as approximation to the true and bootstrap distributions of normalized nonparametric maximum likelihood estimator of survival function in the Koziol-Green model and then use these results to show that the bootstrap approximations have second order accuracy.

• 품질경영학회지
• /
• 제17권1호
• /
• pp.60-68
• /
• 1989

In this paper we study some procedures selecting all populations close to a control based on sample medians for several double exponential populations. The cases of known and unknown control are considered. Tables needed to use the proposed rules are provided and an illustrative example is also included.

• Journal of the Korean Statistical Society
• /
• 제36권4호
• /
• pp.471-477
• /
• 2007

In this paper, we provide a new proof to correct the asymptotic normality for the estimate $\hat{C}_{pmk}\;of\;C_{pmk}$, which is one of the well-known definitions of the process capability index. Also we comment briefly on the correction of the limiting distribution for $\hat{C}_{pmk}$ and on the use of re-sampling methods for the inference of $C_{pmk}$. Finally we discuss the concept of asymptotic unbiasedness.

• Communications for Statistical Applications and Methods
• /
• 제20권6호
• /
• pp.467-474
• /
• 2013

It is common to measure multiple coverage metrics during software testing. Software reliability growth models and coverage growth functions have been applied to each coverage metric to evaluate software reliability; however, analysis results for the individual coverage metrics may conflict with each other. This paper proposes the virtual coverage metric of a normalized first principal component in order to avoid conflicting cases. The use of the virtual coverage metric causes a negligible loss of information.