English
Related papers

Related papers: A non-parametric k-nearest neighbour entropy estim…

200 papers

Estimators of information theoretic measures such as entropy and mutual information are a basic workhorse for many downstream applications in modern data science. State of the art approaches have been either geometric (nearest neighbor (NN)…

Information Theory · Computer Science 2016-09-09 Weihao Gao , Sewoong Oh , Pramod Viswanath

The k-Nearest Neighbor (kNN) classification approach is conceptually simple - yet widely applied since it often performs well in practical applications. However, using a global constant k does not always provide an optimal solution, e.g.,…

Computer Vision and Pattern Recognition · Computer Science 2018-01-08 Mark Kibanov , Martin Becker , Juergen Mueller , Martin Atzmueller , Andreas Hotho , Gerd Stumme

We consider density estimators based on the nearest neighbors method applied to discrete point distibutions in spaces of arbitrary dimensionality. If the density is constant, the volume of a hypersphere centered at a random location is…

Instrumentation and Methods for Astrophysics · Physics 2013-01-24 Przemek Wozniak , Andrzej Kruszewski

The empirical distribution function assigns mass $1/n$ to each of the $n$ observations in a sample. As these are highly variable, estimation error may be reduced by replacing them with estimated observations that are asymptotically less…

Methodology · Statistics 2026-05-26 Tommaso Lando , Lorenzo Tedesco

We first investigate on the asymptotics of the Kolmogorov metric entropy and nonlinear n-widths of approximation spaces on some function classes on manifolds and quasi-metric measure spaces. Secondly, we develop constructive algorithms to…

Numerical Analysis · Mathematics 2018-05-17 Martin Ehler , Frank Filbir

This paper proposes a new probabilistic classification algorithm using a Markov random field approach. The joint distribution of class labels is explicitly modelled using the distances between feature vectors. Intuitively, a class label…

Computation · Statistics 2010-06-02 Nial Friel , Anthony N. Pettitt

When the competing classes in a classification problem are not of comparable size, many popular classifiers exhibit a bias towards larger classes, and the nearest neighbor classifier is no exception. To take care of this problem, we develop…

Methodology · Statistics 2023-11-02 Anvit Garg , Anil K. Ghosh , Soham Sarkar

In this paper, we propose a novel and efficient parameter estimator based on $k$-Nearest Neighbor ($k$NN) and data generation method for the Lognormal-Rician turbulence channel. The Kolmogorov-Smirnov (KS) goodness-of-fit statistical tools…

Signal Processing · Electrical Eng. & Systems 2025-02-14 Maoke Miao , Xinyu Zhang , Bo Liu , Rui Yin , Jiantao Yuan , Feng Gao , Xiao-Yu Chen

In this paper we study nonparametric estimators of copulas and copula densities. We first focus our study on a density copula estimator based on a polynomial orthogonal projection of the joint density. A new copula estimator is then…

Statistics Theory · Mathematics 2021-12-21 Yves Ismaël Ngounou Bakam , Denys Pommeret

The aim of this paper is to present a new estimation procedure that can be applied in many statistical frameworks including density and regression and which leads to both robust and optimal (or nearly optimal) estimators. In density…

Statistics Theory · Mathematics 2017-01-23 Yannick Baraud , Lucien Birgé , Mathieu Sart

It is often of interest to assess whether a function-valued statistical parameter, such as a density function or a mean regression function, is equal to any function in a class of candidate null parameters. This can be framed as a…

Methodology · Statistics 2023-06-14 Aaron Hudson

We present two new estimators for estimating the entropy of absolutely continuous random variables. Some properties of them are considered, specifically consistency of the first is proved. The introduced estimators are compared with the…

Statistics Theory · Mathematics 2014-05-05 A. Kohansal , S. Rezakhah

Nearest-neighbor search dominates the asymptotic complexity of sampling-based motion planning algorithms and is often addressed with k-d tree data structures. While it is generally believed that the expected complexity of nearest-neighbor…

Computational Geometry · Computer Science 2017-09-25 Valerio Varricchio , Brian Paden , Dmitry Yershov , Emilio Frazzoli

This paper develops a nonparametric density estimator with parametric overtones. Suppose $f(x,\theta)$ is some family of densities, indexed by a vector of parameters $\theta$. We define a local kernel smoothed likelihood function which for…

Methodology · Statistics 2026-04-22 Nils Lid Hjort , M. C. Jones

We give a general unified method that can be used for $L_1$ {\em closeness testing} of a wide range of univariate structured distribution families. More specifically, we design a sample optimal and computationally efficient algorithm for…

Data Structures and Algorithms · Computer Science 2015-08-25 Ilias Diakonikolas , Daniel M. Kane , Vladimir Nikishkin

Nonparametric density estimators are studied for $d$-dimensional, strongly spatial mixing data which is defined on a general $N$-dimensional lattice structure. We consider linear and nonlinear hard thresholded wavelet estimators which are…

Statistics Theory · Mathematics 2017-12-27 Johannes T. N. Krebs

In the paper, we introduce the maximum entropy estimator based on 2-dimensional empirical distribution of the observation sequence of hidden Markov model , when the sample size is big: in that case computing the maximum likelihood estimator…

Statistics Theory · Mathematics 2023-03-16 Shulan Hu , Xinyu Wang , Liming Wu

New local linear estimators are proposed for a wide class of nonparametric regression models. The estimators are uniformly consistent regardless of satisfying traditional conditions of depen\-dence of design elements. The estimators are the…

Statistics Theory · Mathematics 2022-07-05 Yuliana Linke , Igor Borisov , Pavel Ruzankin , Vladimir Kutsenko , Elena Yarovaya , Svetlana Shalnova

This paper studies a stylized, yet natural, learning-to-rank problem and points out the critical incorrectness of a widely used nearest neighbor algorithm. We consider a model with $n$ agents (users) $\{x_i\}_{i \in [n]}$ and $m$…

Machine Learning · Computer Science 2018-07-11 Ao Liu , Qiong Wu , Zhenming Liu , Lirong Xia

We describe a method to computationally estimate the probability density function of a univariate random variable by applying the maximum entropy principle with some local conditions given by Gaussian functions. The estimation errors and…

Statistics Theory · Mathematics 2012-06-21 Mihail-Ioan Pop
‹ Prev 1 4 5 6 7 8 10 Next ›