Effective Data Density Estimation in Ring-Based P2P Networks

Author(s):  
Minqi Zhou ◽  
Heng Tao Shen ◽  
Xiaofang Zhou ◽  
Weining Qian ◽  
Aoying Zhou
2009 ◽  
Vol 26 (2-3) ◽  
pp. 261-289 ◽  
Author(s):  
Minqi Zhou ◽  
Weining Qian ◽  
Xueqing Gong ◽  
Aoying Zhou

2018 ◽  
Vol 12 (6) ◽  
pp. 1220-1240
Author(s):  
Minqi Zhou ◽  
Rong Zhang ◽  
Weining Qian ◽  
Aoying Zhou

Author(s):  
Zhenyu Jiang ◽  
Nengxiang Ling ◽  
Zudi Lu ◽  
Dag Tj⊘stheim ◽  
Qiang Zhang

2021 ◽  
Vol 8 (4) ◽  
pp. 309-332
Author(s):  
Efosa Michael Ogbeide ◽  
Joseph Erunmwosa Osemwenkhae

Density estimation is an important aspect of statistics. Statistical inference often requires the knowledge of observed data density. A common method of density estimation is the kernel density estimation (KDE). It is a nonparametric estimation approach which requires a kernel function and a window size (smoothing parameter H). It aids density estimation and pattern recognition. So, this work focuses on the use of a modified intersection of confidence intervals (MICIH) approach in estimating density. The Nigerian crime rate data reported to the Police as reported by the National Bureau of Statistics was used to demonstrate this new approach. This approach in the multivariate kernel density estimation is based on the data. The main way to improve density estimation is to obtain a reduced mean squared error (MSE), the errors for this approach was evaluated. Some improvements were seen. The aim is to achieve adaptive kernel density estimation. This was achieved under a sufficiently smoothing technique. This adaptive approach was based on the bandwidths selection. The quality of the estimates obtained of the MICIH approach when applied, showed some improvements over the existing methods. The MICIH approach has reduced mean squared error and relative faster rate of convergence compared to some other approaches. The approach of MICIH has reduced points of discontinuities in the graphical densities the datasets. This will help to correct points of discontinuities and display adaptive density. Keywords: approach, bandwidth, estimate, error, kernel density


1998 ◽  
Vol 10 (8) ◽  
pp. 2115-2135 ◽  
Author(s):  
Akio Utsugi

In the statistical approach for self-organizing maps (SOMs), learning is regarded as an estimation algorithm for a gaussian mixture model with a gaussian smoothing prior on the centroid parameters. The values of the hyperparameters and the topological structure are selected on the basis of a statistical principle. However, since the component selection probabilities are fixed to a common value, the centroids concentrate on areas with high data density. This deforms a coordinate system on an extracted manifold and makes smoothness evaluation for the manifold inaccurate. In this article, we study an extended SOM model whose component selection probabilities are variable. To stabilize the estimation, a smoothing prior on the component selection probabilities is introduced. An estimation algorithm for the parameters and the hyperparameters based on empirical Bayesian inference is obtained. The performance of density estimation by the new model and the SOM model is compared via simulation experiments.


Sign in / Sign up

Export Citation Format

Share Document