PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Clustgrams: an extension to histogram densities based on the minimum description length principle
Panu Luosto and Petri Kontkanen
Central European Journal of Computer Science Volume 1, Number 4, pp. 466-481, 2011. ISSN 1896-1533

Abstract

Density estimation is one of the most important problems in statistical inference and machine learning. A common approach to the problem is to use histograms, i.e., piecewise constant densities. Histograms are flexible and can adapt to any density given enough bins. However, due to the simplicity of histograms, a large number of parameters and a large sample size might be needed for learning an accurate density, especially in more complex problem instances. In this paper, we extend the histogram density estimation framework by introducing a model called clustgram, which uses arbitrary density functions as components of the density rather than just uniform components. The new model is based on finding a clustering of the sample points and determining the type of the density function for each cluster. We regard the problem of learning clustgrams as a model selection problem and use the theoretically appealing minimum description length principle for solving the task.

EPrint Type:Article
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Computational, Information-Theoretic Learning with Statistics
Learning/Statistics & Optimisation
Theory & Algorithms
ID Code:9164
Deposited By:Petri Myllymäki
Deposited On:21 February 2012