The DOI matches its Crossref record; 37 of the 37 references it cites were found in a registry or an index.
Divergence Estimation for Multidimensional Densities Via $k$-Nearest-Neighbor Distances
Abstract
A new universal estimator of divergence is presented for multidimensional continuous densities based on$k$-nearest-neighbor ($k$-NN) distances. Assuming independent and identically distributed (i.i.d.) samples, the new estimator is proved to be asymptotically unbiased and mean-square consistent. In experiments with high-dimensional data, the$k$-NN approach generally exhibits faster convergence than previous algorithms. It is also shown that the speed of convergence of the$k$-NN method can be further improved by an adaptive choice of$k$.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
An introduction to probability theory and its applications
(1958) · Journal of the Franklin Institute · doi:10.1016/0016-0032(58)90688-4 · Cited by 29,269
On Information and Sufficiency
Kullback, S., & Leibler, R. A. (1951) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729694 · Cited by 20,193
Nearest neighbor pattern classification
Cover, T., & Hart, P. (1967) · IEEE Transactions on Information Theory · doi:10.1109/tit.1967.1053964 · Cited by 16,936
Density Estimation for Statistics and Data Analysis
Silverman, B. W. (2018) · Routledge eBooks · doi:10.1201/9781315140919 · Cited by 15,796
Multidimensional binary search trees used for associative searching
Bentley, J. L. (1975) · Communications of the ACM · doi:10.1145/361002.361007 · Cited by 7,520
Density Estimation for Statistics and Data Analysis
Dehnad, K. (1987) · Technometrics · doi:10.1080/00401706.1987.10488295 · Cited by 5,302
Kraskov, A., Stögbauer, H., & Grassberger, P. (2004) · Physical Review E · doi:10.1103/physreve.69.066138 · Cited by 3,512
A Probabilistic Theory of Pattern Recognition
Devroye, L., Györfi, L., & Lugosi, G. (1996) · Stochastic Modelling and Applied Probability · doi:10.1007/978-1-4612-0711-5 · Cited by 3,274
Discriminatory Analysis. Nonparametric Discrimination: Consistency Properties
Fix, E., & Hodges, J. L. (1989) · International Statistical Review / Revue Internationale de Statistique · doi:10.2307/1403797 · Cited by 2,516
Discriminatory analysis: Nonparametric discrimination: Consistency properties: (471672008-001)
Fix, E., & Hodges, J. L. (1951) · PsycEXTRA Dataset · doi:10.1037/e471672008-001 · Cited by 1,696
An Introduction to Probability Theory and its Applications
Chambers, D. S. (1970) · Journal of Quality Technology · doi:10.1080/00224065.1970.11980411 · Cited by 916
The mutual information: detecting and evaluating dependencies between variables
Steuer, R., Kurths, J., Daub, C. O., Weise, J., & Selbig, J. (2002) · Bioinformatics · doi:10.1093/bioinformatics/18.suppl_2.s231 · Cited by 815
A Nonparametric Estimate of a Multivariate Density Function
Loftsgaarden, D. O., & Quesenberry, C. P. (1965) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177700079 · Cited by 781
A Branch and Bound Algorithm for Computing k-Nearest Neighbors
Fukunaga, K., & Narendra, P. M. (1975) · IEEE Transactions on Computers · doi:10.1109/t-c.1975.224297 · Cited by 736
What Is the Nearest Neighbor in High Dimensional Spaces
Hinneburg, A., Aggarwal, C. C., & Keim, D. A. (2000) · KOPS (University of Konstanz) · Cited by 505
A Course in Density Estimation.
Jones, M. C., & Devroye, L. (1988) · Journal of the Royal Statistical Society. Series A (Statistics in Society) · doi:10.2307/2982771 · Cited by 503
A divisive information theoretic feature clustering algorithm for text classification
Dhillon, I. S., Mallela, S., & Kumar, R. (2003) · doi:10.5555/944919.944973 · Cited by 500
Goldberger, Gordon, & Greenspan (2003) · Proceedings Ninth IEEE International Conference on Computer Vision · doi:10.1109/iccv.2003.1238387 · Cited by 409
中澤, 真. (1997) · Medical Entomology and Zoology · Cited by 354
Channel Identification: Secret Sharing Using Reciprocity in Ultrawideband Channels
Wilson, R., Tse, D., & Scholtz, R. A. (2007) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2007.902666 · Cited by 332
On the Strong Universal Consistency of Nearest Neighbor Regression Function Estimates
Devroye, L., Gyorfi, L., Krzyzak, A., & Lugosi, G. (1994) · The Annals of Statistics · doi:10.1214/aos/1176325633 · Cited by 304
Binless strategies for estimation of information from neural data
Victor, J. D. (2002) · Physical Review E · doi:10.1103/physreve.66.051903 · Cited by 238
An Information-Theoretic Approach to Detecting Changes in Multi-Dimensional Data Streams
Dasu, T., Krishnan, S. M., Venkatasubramanian, S., & Yi, K. (2006) · Cited by 235
Extracting Secrecy from Jointly Gaussian Random Variables
Ye, C., Reznik, A., & Shah, Y. (2006) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2006.262101 · Cited by 193
Liu, C., & Shum, H.-Y. (2003) · 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings. · doi:10.1109/cvpr.2003.1211407 · Cited by 180
Divergence Estimation of Continuous Distributions Based on Data-Dependent Partitions
Wang, Q., Kulkarni, S. R., & Verdu, S. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.853314 · Cited by 180
Self-citationGoria, M. N., Leonenko, N. N., Mergel, V. V., & Novi Inverardi, P. L. (2005) · Journal of Nonparametric Statistics · doi:10.1080/104852504200026815 · Cited by 176
Bunke, O. (1969) · Biometrische Zeitschrift · doi:10.1002/bimj.19690110615 · Cited by 163
The Strong Uniform Consistency of Nearest Neighbor Density Estimates
Devroye, L., & Wagner, T. J. (1977) · The Annals of Statistics · doi:10.1214/aos/1176343851 · Cited by 145
Information-Theoretic Analysis of Neural Coding
Johnson, D. H., Gruner, C. M., Baggerly, K., & Seshagiri, C. V. (2001) · Journal of Computational Neuroscience · doi:10.1023/a:1008968010214 · Cited by 120
A Nearest-Neighbor Approach to Estimating Divergence between Continuous Random Vectors
Wang, Q., Kulkarni, S. R., & Verdú, S. (2006) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2006.261842 · Cited by 88
Self-citationTexture Similarity Measure Using Kullback-Leibler Divergence between Gamma Distributions
Mathiassen, J. R., Skavhaug, A., & Bø, K. (2002) · Lecture notes in computer science · doi:10.1007/3-540-47977-5_9 · Cited by 79
Gene Mapping and Marker Clustering Using Shannon's Mutual Information
Dawy, Z., Goebel, B., Hagenauer, J., Andréoli, C., Meitinger, T., & Mueller, J. C. (2006) · IEEE Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2006.9 · Cited by 56
Root-N consistent estimators of entropy for densities with unbounded support
Tsybakov, A. B., & van der Meulen, E. C. (2002) · IEEE-IMS Workshop on Information Theory and Statistics · doi:10.1109/wits.1994.513907 · Cited by 47
An information theoretic approach to the functional classification of neuronsPreprint
Schneidman, E., Bialek, W., & Berry, M. J. (2002) · arXiv (Cornell University) · doi:10.48550/arxiv.physics/0212114 · Cited by 21
Sarkis, M., Goebel, B., Dawy, Z., Hagenauer, J., Hanus, P., & Mueller, J. C. (2007) · IEEE Signal Processing Magazine · doi:10.1109/msp.2007.273061 · Cited by 11
Universal estimation of information measures
Verdú, S. (2005) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw.2005.1531895 · Cited by 7
Cited by
Machine Learning Methods for Attack Detection in the Smart Grid
Ozay, M., Esnaola, I., Yarman Vural, F. T., Kulkarni, S. R., & Poor, H. V. (2016) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2015.2404803 · Cited by 641
Self-citationYe, H., Liang, L., Li, G. Y., & Juang, B.-H. (2020) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2020.2970707 · Cited by 413
Measuring integrated information: comparison of candidate measures in theory and simulation
Mediano, P., Seth, A., & Barrett, A. (2018) · Entropy · doi:10.3390/e21010017 · Cited by 145
Metadata
- Authors
- Wang, Q., Kulkarni, S. R., & Verdu, S.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2009-05
- Volume
- 55
- Issue
- 5
- Pages
- 2392-2405
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2150879893
- Cited by
- 342
- References
- 37
- FWCI
- 11.21
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.