• Journal of the Korean Statistical Society
• /
• 제27권4호
• /
• pp.507-514
• /
• 1998

The minimum distance estimation based on the L$_2$ distance between a model density and a density estimator is studied from M-estimation point of view. We will show that how a model density and a density estimator are incorporated in order to create an M-estimation function. This method enables us to create an M-estimating function reflecting the natures of both an assumed model density and a given set of data. Some new types of M-estimation functions for estimating a location and scale parameters are introduced.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2001년도 ICCAS
• /
• pp.49.1-49
• /
• 2001

The skin color model is a very important concept in face detection, face recognition and face tracking. Usually, this model is obtained by estimating a probability density function of skin color distribution. In many cases, it is assumed that the underlying density function follows a Gaussian distribution. In this paper, a new method for non-parametric estimation of the probability density function, by using feed-forward neural network, is used to estimate the underlying skin color model. By using this method, the resulting skin color model is better than the Gaussian estimation and substantially approaches the real distribution. Applications to face detection and face ...

• Journal of the Korean Data and Information Science Society
• /
• 제25권3호
• /
• pp.623-632
• /
• 2014

We shall consider the estimation for the parameter and the right tail probability in a general exponential distribution. We also shall consider the estimation of the reliability P(X < Y ) and the skewness trends of the density function of the ratio X=(X+Y) for two independent general exponential variables each having different shape parameters and known scale parameter. We then shall consider the estimation of the failure rate average and the hazard function for a general exponential variable having the density function with the unknown shape and known scale parameters, and for a bivariate density induced by the general exponential density.

• Communications for Statistical Applications and Methods
• /
• 제31권3호
• /
• pp.337-347
• /
• 2024

Kernel density estimation is a prevalent technique employed for nonparametric density estimation, enabling direct estimation from the data itself. This estimation involves two crucial elements: selection of the kernel function and the determination of the appropriate bandwidth. The selection of the bandwidth plays an important role in kernel density estimation, which has been developed over the past decade. A range of methods is available for selecting the bandwidth, including the plug-in bandwidth. In this article, the proposed plug-in bandwidth is introduced, which leverages shifted Chebyshev series-based approximation to determine the optimal bandwidth. Through a simulation study, the performance of the suggested bandwidth is analyzed to reveal its favorable performance across a wide range of distributions and sample sizes compared to alternative bandwidths. The proposed bandwidth is also applied for kernel density estimation on real dataset. The outcomes obtained from the proposed bandwidth indicate a favorable selection. Hence, this article serves as motivation to explore additional plug-in bandwidths that rely on function approximations utilizing alternative series expansions.

• 정보처리학회논문지B
• /
• 제13B권1호
• /
• pp.27-34
• /
• 2006

본 연구에서는 엔트로피를 이용한 독립성분분석(ICA : Independent Component Analysis)에서 점수함수(score function)를 생성하는 알고리즘을 제안한다. 점수함수를 생성하기 위해서 원 신호(original signals)에 대한 확률밀도함수의 추정이 반드시 필요하고 밀도함수가 미분 가능해야 한다. 따라서 원 신호에 따른 적응적인 점수 함수를 유도할 수 있도록 커널 기반의 밀도추정(kernel density estimation)방법을 사용하였으며, 보다 빠른 밀도 추정 계산을 위해서 식의 형태를 컨볼루션(convolution) 변환 한 후, 컨볼루션을 빠르게 계산할 수 있는 FFT(Fast Fourier Transform) 알고리즘을 이용하였다. 제안한 점수함수 생성 방법은 원 신호에 확률밀도분포와 추정된 신호의 확률밀도 분포의 오차를 줄이는 역할을 한다 실험 결과, 암묵신호분리(blind source separation)문제에서 기존의 Extended Infomax 알고리즘과 Fixed Point ICA 보다 원 신호와 유사한 밀도함수를 추정하였고, 분리된 신호의 신호대잡음비등(SNR)에 있어서 향상된 성능을 얻을 수 있었다.

• 대한수학회논문집
• /
• 제33권4호
• /
• pp.1367-1376
• /
• 2018

In practice, the density function of a random variable X is always unknown. Even its smoothness parameter is unknown to us. In this paper, we will consider a density smoothness parameter estimation problem via wavelet theory. The smoothness parameter is defined in the sense of equivalent Besov norms. It is well-known that it is almost impossible to estimate this kind of parameter in general case. But it becomes possible when we add some conditions (to our proof, we can not remove them) to the density function. Besides, the density function contains impurities. It is covered by some additive noises, which is the key point we want to show in this paper.

• Communications for Statistical Applications and Methods
• /
• 제15권6호
• /
• pp.939-946
• /
• 2008

In this paper the support vector method is presented for the probability density function estimation when the sample observations are contaminated with random noise. The performance of the procedure is compared to kernel density estimates by the simulation study.

• Communications for Statistical Applications and Methods
• /
• 제10권2호
• /
• pp.607-617
• /
• 2003

This paper offers a practical comparison of efficiency between local likelihood approach and conventional kernel approach in density estimation. The local likelihood estimation procedure maximizes a kernel smoothed log-likelihood function with respect to a polynomial approximation of the log likelihood function. We use two types of data driven bandwidths for each method and compare the mean integrated squares for several densities. Numerical results reveal that local log-linear approach with simple plug-in bandwidth shows better performance comparing to the standard kernel approach in heavy tailed distribution. For normal mixture density cases, standard kernel estimator with the bandwidth in Sheather and Jones(1991) dominates the others in moderately large sample size.

• 대한전기학회논문지
• /
• 제45권2호
• /
• pp.325-328
• /
• 1996

In this paper, we proposed an estimation method of a posterior probability and PDF(Probability density function) using a feed forward neural network and code books of VQ(vector quantization). In this study, We estimates a posterior probability and probability density function, which compose a new parameter with well-known Mel cepstrum and verificate the performance for the five vowels taking from syllables by NN(neural network) and PNN(probabilistic neural network). In case of new parameter, showed the best result by probabilistic neural network and recognition rates are average 83.02%.

• Genomics & Informatics
• /
• 제20권2호
• /
• pp.17.1-17.11
• /
• 2022

Genetic associations have been quantified using a number of statistical measures. Entropy-based mutual information may be one of the more direct ways of estimating the association, in the sense that it does not depend on the parametrization. For this purpose, both the entropy and conditional entropy of the phenotype distribution should be obtained. Quantitative traits, however, do not usually allow an exact evaluation of entropy. The estimation of entropy needs a probability density function, which can be approximated by kernel density estimation. We have investigated the proper sequence of procedures for combining the kernel density estimation and entropy estimation with a probability density function in order to calculate mutual information. Genotypes and their interactions were constructed to set the conditions for conditional entropy. Extensive simulation data created using three types of generating functions were analyzed using two different kernels as well as two types of multifactor dimensionality reduction and another probability density approximation method called m-spacing. The statistical power in terms of correct detection rates was compared. Using kernels was found to be most useful when the trait distributions were more complex than simple normal or gamma distributions. A full-scale genomic dataset was explored to identify associations using the 2-h oral glucose tolerance test results and γ-glutamyl transpeptidase levels as phenotypes. Clearly distinguishable single-nucleotide polymorphisms (SNPs) and interacting SNP pairs associated with these phenotypes were found and listed with empirical p-values.