MDL histogram density estimation

Journal of Machine Learning Research

Volumn 2, Issue , 2007, Pages 219-226

  Kontkanen, Petri ^a   Myllymäki, Petri ^a  

^a UNIVERSITY OF HELSINKI   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

CUT POINT; DATA CLUSTERING; DENSITY ESTIMATION; DYNAMIC PROGRAMMING ALGORITHM; HISTOGRAM DENSITY; MINIMUM DESCRIPTION LENGTH PRINCIPLE; MODEL SELECTION; MODEL SELECTION CRITERIA; MODEL SELECTION PROBLEM; NORMALIZED MAXIMUM LIKELIHOOD; OPTIMALITY; POLYNOMIAL-TIME; SIMULATION TESTS;

ARTIFICIAL INTELLIGENCE; CLUSTERING ALGORITHMS; GRAPHIC METHODS; INFORMATION THEORY; OPTIMIZATION; POLYNOMIAL APPROXIMATION;

STATISTICAL METHODS;

EID: 84862290989     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (16)

1. Balasubramanian, V. (2006). MDL, Bayesian inference, and the geometry of the space of probability distributions. In P. Grünwald, I. Myung, & M. Pitt (Eds.), Advances in minimum description length: Theory and applications (pp. 81-98). The MIT Press.
2. Birge, L., & Rozenholc, Y. (2002, April). How many bins should be put in a regular histogram. (Prepublication no 721, Laboratoire de Probabilites et Modeles Aleatoires, CNRS-UMR 7599, Universite Paris VI & VII)
3. Grünwald, P. (2006). Minimum description length tutorial. In P. Grünwald, I. Myung, & M. Pitt (Eds.), Advances in minimum description length: Theory and applications (pp. 23-79). The MIT Press.
4. Hall, P., & Hannan, E. (1988). On stochastic complexity and nonparametric density estimation. Biometrika, 75 (4), 705-714.
5. Kanazawa, Y. (1993). Hellinger distance and Akaike's information criterion for the histogram. Statist. Probab. Letters(17), 293-298.
6. Kontkanen, P., & Myllymäki, P. (2005). Analyzing the stochastic complexity via tree polynomials (Tech. Rep. No. 2005-4). Helsinki Institute for Information Technology (HIIT).
7. Kontkanen, P., Myllymäki, P., Buntine, W., Rissanen, J., & Tirri, H. (2006). An MDL framework for data clustering. In P. Grünwald, I. Myung, & M. Pitt (Eds.), Advances in minimum description length: Theory and applications. The MIT Press.
8. Rissanen, J. (1978). Modeling by shortest data description. Automatica, 14, 445-471.
9. Rissanen, J. (1987). Stochastic complexity. Journal of the Royal Statistical Society, 49 (3), 223-239 and 252-265.
10. Rissanen, J. (1996). Fisher information and stochastic complexity. IEEE Transactions on Information Theory, 42 (1), 40-47.
11. Rissanen, J. (2001). Strong optimality of the normalized ML models as universal codes and information in data. IEEE Transactions on Information Theory, 47 (5), 1712-1717.
12. Rissanen, J. (2005, August). Lectures on statistical modeling theory. (Available online at www.mdlresearch.org)
13. Rissanen, J., Speed, T., & Yu, B. (1992). Density estimation by stochastic complexity. IEEE Transactions on Information Theory, 38 (2), 315-323.
14. Roos, T., Myllymäki, P., & Tirri, H. (2005). On the behavior of MDL denoising. In R. G. Cowell & Z. Ghahramani (Eds.), Proceedings of the 10th international workshop on artificial intelligence and statistics (aistats) (pp. 309-316). Barbados: Society for Artificial Intelligence and Statistics.
15. Shtarkov, Y. M. (1987). Universal sequential coding of single messages. Problems of Information Transmission, 23, 3-17.
16. Yu, B., & Speed, T. (1992). Data compression and histograms. Probab. Theory Relat. Fields, 92, 195-229.