.png){kind=icon}
.png){kind=icon}
Return
Fast Multidimensional Entropy Estimation by k-d Partitioning
.png){kind=icon}
OA
AI
DOI：10.1109/LSP.2009.2017346.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We describe a nonparametric estimator for the differential entropy of a multidimensional distribution, given a limited set of data points, by a recursive rectilinear partitioning. The estimator uses an adaptive partitioning method and runs in Theta(N log N) time, with low memory requirements. In experiments using known distributions, the estimator is several orders of magnitude faster than other estimators, with only modest increase in bias and variance.
Keywords:
Entropy
estimation
multidimensional signal processing
multidimensional systems
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
9.6
Papers:
1.1W
Citations:
1.7W