• Communications for Statistical Applications and Methods
• /
• v.14 no.3
• /
• pp.583-592
• /
• 2007

Given the moments of a symmetric random variable, its density and distribution functions can be accurately approximated by making use of the algorithm proposed in this paper. This algorithm is specially designed for approximating symmetric distributions and comprises of four phases. This approach is essentially based on the transformation of variable technique and moment-based density approximants expressed in terms of the product of an appropriate initial approximant and a polynomial adjustment. Probabilistic quantities such as percentage points and percentiles can also be accurately determined from approximation of the corresponding distribution functions. This algorithm is not only conceptually simple but also easy to implement. As illustrated by the first two numerical examples, the density functions so obtained are in good agreement with the exact values. Moreover, the proposed approximation algorithm can provide the more accurate quantities than direct approximation as shown in the last example.

• Communications for Statistical Applications and Methods
• /
• v.17 no.3
• /
• pp.451-457
• /
• 2010

This paper considers the problem of nonparametric deconvolution density estimation when sample observa-tions are contaminated by double exponentially distributed errors. Three different deconvolution density estima-tors are introduced: a weighted kernel density estimator, a kernel density estimator based on the support vector regression method in a RKHS, and a classical kernel density estimator. The performance of these deconvolution density estimators is compared by means of a simulation study.

• ETRI Journal
• /
• v.35 no.5
• /
• pp.900-910
• /
• 2013

Small-screen mobile terminals have difficulty accessing existing Web resources designed for large-screen devices. This paper presents an adaptive transformation method based on webpage semantic features to solve this problem. According to the text density and link density features of the webpages, the webpages are divided into two types: index and content. Our method uses an index-based webpage transformation algorithm and a content-based webpage transformation algorithm. Experiment results demonstrate that our adaptive transformation method is not dependent on specific software and webpage templates, and it is capable of enhancing Web content adaptation on small-screen terminals.

• Journal of Korea Multimedia Society
• /
• v.6 no.3
• /
• pp.375-383
• /
• 2003

Clustering in spatial mining is to group similar objects based on their distance, connectivity or their relative density in space. In the real world. there exist many physical objects such as rivers, lakes and highways, and their presence may affect the result of clustering. In this paper, we define distance to handle obstacles, and using that we propose the density based clustering algorithm called DBSCAN-O to handle obstacles. We show that DBSCAN-O produce different clustering results from previous density based clustering algorithm DBSCAN by our experiment result.

• IEIE Transactions on Smart Processing and Computing
• /
• v.6 no.3
• /
• pp.183-192
• /
• 2017

k-nearest neighbor (K-NN) is a well-known classification algorithm, being feature space-based on nearest-neighbor training examples in machine learning. However, K-NN, as we know, is a lazy learning method. Therefore, if a K-NN-based system very much depends on a huge amount of history data to achieve an accurate prediction result for a particular task, it gradually faces a processing-time performance-degradation problem. We have noticed that many researchers usually contemplate only classification accuracy. But estimation speed also plays an essential role in real-time prediction systems. To compensate for this weakness, this paper proposes correlation coefficient-based clustering (CCC) aimed at upgrading the performance of K-NN by leveraging processing-time speed and plurality rule-based density (PRD) to improve estimation accuracy. For experiments, we used real datasets (on breast cancer, breast tissue, heart, and the iris) from the University of California, Irvine (UCI) machine learning repository. Moreover, real traffic data collected from Ojana Junction, Route 58, Okinawa, Japan, was also utilized to lay bare the efficiency of this method. By using these datasets, we proved better processing-time performance with the new approach by comparing it with classical K-NN. Besides, via experiments on real-world datasets, we compared the prediction accuracy of our approach with density peaks clustering based on K-NN and principal component analysis (DPC-KNN-PCA).

• Applied Microscopy
• /
• v.44 no.2
• /
• pp.74-78
• /
• 2014

Dislocation density and distribution in epitaxial GaAs layer on Si are evaluated quantitatively and effectively using image processing of transmission electron microscopy image. In order to evaluate dislocation density and distribution, three methods are introduced based on line-intercept, line-length measurement and our coding with line-scanning method. Our coding method based on line-scanning is used to detect the dislocations line-by-line effectively by sweeping a thin line with the width of one pixel. The proposed method has advances in the evaluation of dislocation density and distribution. Dislocations can be detected automatically and continuously by a sweeping line in the code. Variation of dislocation density in epitaxial GaAs films can be precisely analyzed along the growth direction on the film.

• Korean Management Science Review
• /
• v.32 no.3
• /
• pp.29-36
• /
• 2015

In this research, we analyze the sensitivity of the network density to the estimates for the Bass model parameters with both theoretical model and a simulation. Bass model describes the process that the non-adopters in the market potential adopt a new product or an innovation by the innovation effect and imitation effect. The imitation effect shows the word of mouth effect from the previous adopters to non-adopters. But it does not divide the underlying network structure from the strength of the influence over the network. With a network based Bass model, we found that the estimate for the imitation coefficient is highly sensitive to the network density and it is decreasing while the network density is decreasing. This finding implies that the interpersonal influence can be under-looked when the network density is low. It also implies that both of the network density and the interpersonal influence are important to facilitate the diffusion of an innovation.

• Communications for Statistical Applications and Methods
• /
• v.31 no.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.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.36 no.4
• /
• pp.391-395
• /
• 2012

We present a continuous cell separator that achieves density-dependent and size-independent cell separation based on the net force of gravity and buoyancy forces on the cells in dissimilar density fluids. Previous cell separators are, based on the size or dielectrophoretic property of the cells and, are suitable for size-dependent and density-independent cell separation. However, these properties can make it difficult to collect the same types of cells with the same density but with size variations. The present separator, however, is capable of collecting the same types of cells based on the cell density in the fluid. Regardless of cell size, the proposed chip isolates low density cells, (white blood cells, or WBCs) at the upper outlet while obtaining high-density cells (red blood cells, or RBCs) from the lower outlet based on density. Efficiency levels for separation of WBCs and RBCs were $90.9{\pm}9.1%$ and $86.4{\pm}1.99%$, respectively. The present separator therefore has the potential for use in the pretreatment of whole blood.

• Communications for Statistical Applications and Methods
• /
• v.9 no.1
• /
• pp.241-248
• /
• 2002

The problem of wavelet density estimation based on Shannon's wavelets is studied when the sample observations are contaminated with random noise. In this paper we will discuss the asymptotic normality for deconvolving wavelet density estimator of the unknown density f(x) when courier transform of random noise has polynomial descent.