Next Article in Journal
Structural Patterns in Complex Systems Using Multidendrograms
Next Article in Special Issue
The Kalman Filter Revisited Using Maximum Relative Entropy
Previous Article in Journal
Core-Based Dynamic Community Detection in Mobile Social Networks
Previous Article in Special Issue
Objective Bayesianism and the Maximum Entropy Principle
Open AccessArticle

Consistency and Generalization Bounds for Maximum Entropy Density Estimation

1
Kno.e.sis Center, Department of Computer Science and Engineering, Wright State University, Dayton, OH 45435, USA
2
Department of Computing Science, University of Alberta, Edmonton, Alberta T6G 2E8, Canada
3
Visa Inc., San Francisco, CA 94128, USA
*
Author to whom correspondence should be addressed.
Entropy 2013, 15(12), 5439-5463; https://doi.org/10.3390/e15125439
Received: 9 July 2013 / Revised: 13 November 2013 / Accepted: 3 December 2013 / Published: 9 December 2013
(This article belongs to the Special Issue Maximum Entropy and Bayes Theorem)
We investigate the statistical properties of maximum entropy density estimation, both for the complete data case and the incomplete data case. We show that under certain assumptions, the generalization error can be bounded in terms of the complexity of the underlying feature functions. This allows us to establish the universal consistency of maximum entropy density estimation. View Full-Text
Keywords: maximum entropy principle; density estimation; generalization bound; consistency maximum entropy principle; density estimation; generalization bound; consistency
Show Figures

Figure 1

MDPI and ACS Style

Wang, S.; Greiner, R.; Wang, S. Consistency and Generalization Bounds for Maximum Entropy Density Estimation. Entropy 2013, 15, 5439-5463.

Show more citation formats Show less citations formats

Article Access Map by Country/Region

1
Only visits after 24 November 2015 are recorded.
Search more from Scilit
 
Search
Back to TopTop