Correction to 'Minimum Complexity Density Estimation'
نویسندگان
چکیده
Manuscript submitted July 1991. A. R. Barron is with the Department of Statistics and the Department of Electrical and Computer Engineering, University of Illinois, 101 Illini Hall, 725 S. Wright Street, Champaign, IL. 91820. T. M. Cover is with the Departments of Electrical Engineering and Statistics, Durand, Room 121, Stanford University, Stanford, CA 94305. IEEE Log Number 9103053. ‘A. R. Barron and T. M. Cover, “Minimum complexity density estimation,” IEEE Trans. Inform. Theory, vol. 37, no. 4, pp. 1034-1054, July 1991.
منابع مشابه
Development a New Technique Based on Least Square Method to Synthesize the Pattern of Equally Space Linear Arrays
Using the sampled data of a desired pattern is a common technique in pattern synthesizing of array factor (AF) of antenna arrays. Based on the obtained data matrix, Least Square Method (LSM) is used to calculate the exciting coefficient of array elements. The most important parameter, which involves the accuracy and complexity of calculation, is the sampling rate of the desired pattern. Classic...
متن کاملRobust noise estimation using minimum correction with harmonicity control
In this paper a new noise spectrum estimation algorithm is described for single-channel acoustic noise suppression systems. To achieve fast convergence during abrupt change of noise floor, the proposed algorithm uses a minimum correction module to adjust an adaptive noise estimator. The minimum search duration is controlled by a harmonicity module for improved noise tracking under continuous vo...
متن کاملMinimum complexity density estimation
The minimum complexity or minimum description-length criterion developed by Kolmogorov, Rissanen, Wallace, So&in, and others leads to consistent probability density estimators. These density estimators are defined to achieve the best compromise between likelihood and simplicity. A related issue is the compromise between accuracy of approximations and complexity relative to the sample size. An i...
متن کاملRobust Estimation in Linear Regression Model: the Density Power Divergence Approach
The minimum density power divergence method provides a robust estimate in the face of a situation where the dataset includes a number of outlier data. In this study, we introduce and use a robust minimum density power divergence estimator to estimate the parameters of the linear regression model and then with some numerical examples of linear regression model, we show the robustness of this est...
متن کاملFrom -entropy to KL-entropy: Analysis of Minimum Information Complexity Density Estimation
We consider an extension of -entropy to a KL-divergence based complexity measure for randomized density estimation methods. Based on this extension, we develop a general information theoretical inequality that measures the statistical complexity of some deterministic and randomized density estimators. Consequences of the new inequality will be presented. In particular, we show that this techniq...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Information Theory
دوره 37 شماره
صفحات -
تاریخ انتشار 1991