• Journal for History of Mathematics
• /
• v.17 no.2
• /
• pp.15-20
• /
• 2004

We investigate the unbiasedness and consistency as the statistical properties of density estimators. We show histogram, kernel density estimation, and local adaptive smoothing as density smoothing in this paper. Also, the early and recent research on nonparametric density estimation is described and discussed.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11b
• /
• pp.796-798
• /
• 2005

본 연구에서는 엔트로피 이론을 사용하여 ICA(Independent Component Analysis) 점수함수를 생성하는 새로운 밀도추정자(Density Estimator)를 제안한다. 원 신호에 대한 밀도함수의 추정은 적당한 점수함수를 생성하기 위해 필요하고, 미분 가능한 밀도함수인 커널을 이용한 밀도추정법(Kernel Density Estimation)을 이용하여 점수함수를 생성하였다. 보다 빠른 점수함수의 생성을 위해서 식의 형태를 convolution 형태로 표현하였으며, ICA 학습을 위해서 결합엔트로피를 최대화(Joint Entropy Maximization)하는 방향으로 커널의 폭을 학습하였다. 이를 위해서 기울기 강하법(Gradient descent method)를 사용하였으며, 이러한 제약 사항은 새로운 밀도 추정자를 설계하기 위한 기본적인 개념을 나타낸다. 실험결과, 커널의 폭을 담당하는 smoothing parameters들이 일정한 값으로 학습함을 알 수 있었다.

• Journal of the Korean Data and Information Science Society
• /
• v.7 no.2
• /
• pp.211-217
• /
• 1996

본 논문은 확률밀도함수의 l 번째 도함수의 커널추정법에 관하여 다루고 있다. 확률밀도함수 도함수의 커널추정에 사용될 수 있는 두가지 평활량의 선택법, 교차타당성방법과 삽입방법에 의한 평활량의 점근분포를 규명하고 이들의 상대적 수렴속도를 각각 밝히고 삽입방법의 우수성을 소표본 모의실험을 통하여 확인하였다.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.19 no.3
• /
• pp.127-143
• /
• 2016

This study explored the variability in the accuracy of dasymetric population estimation with different grid cell sizes. Dasymetric population maps for Fulton County, Georgia in the US were generated from 30m to 420m at intervals of 30m using an automated intelligent dasymetric mapping technique, population data, and original and simulated land use and cover data. The accuracies of dasymetric population maps were evaluated using RMSE and adjusted RMSE statistics. Lumped fractal dimension values were calculated for the dasymetric population maps generated from resolutions of 30m to 420m using the triangular prism surface area (TPSA) method. The results show that a grid cell size of 210m or smaller is required to estimate population more accurately in terms of thematic accuracy, but a grid cell size of 30m is required to meet an acceptable spatial accuracy of dasymetric population estimation in the study area. The fractal analysis also indicates that a grid cell size of 120m is the optimal resolution for dasymetric population estimation in the study area.

• Journal of the Korean Data and Information Science Society
• /
• v.8 no.1
• /
• pp.9-20
• /
• 1997

Several methods are proposed for optimizing Fourier series estimators with respect to Mean Integrated Square Error metrics. Traditionally, such method have followed. one of two basic strategies; A stopping rules or the rules of determine multipliers. A central hypothesis of this study is that better estimates can be obtained by combining the two strategies. A new multiplier sequence is proposed, which used in conjunction with any of the stopping rules, is shown to improve the performance of estimator which relies solely on a stopping rule.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2011.01a
• /
• pp.85-88
• /
• 2011

Fuzzy C-Means (FCM) 알고리듬은 가장 널리 사용되는 군집화 알고리듬 중 하나로 다양한 응용 분야에서 사용되고 있다. 하지만 FCM은 여러 가지 문제점을 가지고 있으며 초기 원형 설정이 그 중 하나이다. FCM은 국부 최적해에 수렴하므로 초기 원형 설정에 따라 클러스터링 결과가 달라진다. 이 논문에서는 이러한 FCM의 초기 원형 설정 문제를 개선하기 위하여 커널밀도 추정 (kernel density estimation) 기법을 활용하는 방법을 제안한다. 제안한 방법에서는 먼저 커널 밀도 추정을 수행한 후 밀도가 높은 지역에 클러스터의 초기 원형을 설정하고 원형이 설정된 영역의 밀도를 감소시키는 과정을 반복함으로써 효율적으로 초기 원형을 설정할 수 있다. 제안된 방법이 일반적으로 사용되는 무작위 초기화 방법에 비해 효율적이라는 사실은 실험결과를 통해 확인할 수 있다.

• The KIPS Transactions:PartB
• /
• v.13B no.1 s.104
• /
• pp.27-34
• /
• 2006

In this study, we propose this new algorithm that generates score function in ICA(Independent Component Analysis) using entropy theory. To generate score function, estimation of probability density function about original signals are certainly necessary and density function should be differentiated. Therefore, we used kernel density estimation method in order to derive differential equation of score function by original signal. After changing formula to convolution form to increase speed of density estimation, we used FFT algorithm that can calculate convolution faster. Proposed score function generation method reduces the errors, it is density difference of recovered signals and originals signals. In the result of computer simulation, we estimate density function more similar to original signals compared with Extended Infomax and Fixed Point ICA in blind source separation problem and get improved performance at the SNR(Signal to Noise Ratio) between recovered signals and original signal.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.8
• /
• pp.1659-1664
• /
• 2011

Fuzzy C-Means (FCM) is one of the most widely used clustering algorithms and has been used in many applications successfully. However, FCM has some shortcomings and initial prototype selection is one of them. As FCM is only guaranteed to converge on a local optimum, different initial prototype results in different clustering. Therefore, much care should be given to the selection of initial prototype. In this paper, a new initialization method for FCM using kernel density estimation (KDE) is proposed to resolve the initialization problem. KDE can be used to estimate non-parametric data distribution and is useful in estimating local density. After KDE, in the proposed method, one initial point is placed at the most dense region and the density of that region is reduced. By iterating the process, initial prototype can be obtained. The initial prototype such obtained showed better result than the randomly selected one commonly used in FCM, which was demonstrated by experimental results.

• Journal of the Korean Data and Information Science Society
• /
• v.23 no.1
• /
• pp.79-87
• /
• 2012

In the case that the probability density function has a discontinuity point, Huh (2002) estimated the location and jump size of the discontinuity point based on the difference between the right and left kernel density estimators using the one-sided kernel function. In this paper, we consider the cross-validation, made by the right and left maximum likelihood cross-validations, for the bandwidth selection in order to estimate the location and jump size of the discontinuity point. This method is motivated by the one-sided cross-validation of Hart and Yi (1998). The finite sample performance is illustrated by simulated example.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.2
• /
• pp.196-201
• /
• 2007

The Fuzzy E-means (FCM) algorithm is a widely used clustering method that incorporates probabilitic memberships. Due to these memberships, it can be sensitive to noise data. In this paper, we propose a new fuzzy C-means clustering algorithm by incorporating the Parzen Window method to include density information of the data. Several experimental results show that our proposed density-based FCM algorithm outperforms conventional FCM especially for data with noise and it is not sensitive to initial cluster centers.