Clustgrams: an extension to histogram densities based on the minimum description length principle
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.
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
Clustgrams: an extension to histogram densities based on the minimum description length principle ; volume:1 ; number:4 ; year:2011 ; pages:466-481 ; extent:16
Open computer science ; 1, Heft 4 (2011), 466-481 (gesamt 16)
- Creator
-
Luosto, Panu
Kontkanen, Petri
- DOI
-
10.2478/s13537-011-0033-x
- URN
-
urn:nbn:de:101:1-2410301509217.201833191753
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:30 AM CEST
Data provider
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Luosto, Panu
- Kontkanen, Petri
Other Objects (12)
3. First Extension principle.
The broad histogram method : an extension to continuous systems
Microdata adjustment by the minimum information loss principle
Microdata adjustment by the minimum information loss principle
Neutrino mixing and masses from a minimum principle
Typoskript "On an extension of the maximum likelihood principle"
Generalized minimum 0-extension problem and discrete convexity
Location histogram privacy by Sensitive Location Hiding and Target Histogram Avoidance/Resemblance
Densities, spectral densities and modality
Densities, Spectral Densities and Modality
10. Second Extension principle; the divergence theorem for regular regions.
Minority Costume Image Retrieval by Fusion of Color Histogram and Edge Orientation Histogram
3. First Extension principle.
The broad histogram method : an extension to continuous systems
Microdata adjustment by the minimum information loss principle
Microdata adjustment by the minimum information loss principle
Neutrino mixing and masses from a minimum principle
Typoskript "On an extension of the maximum likelihood principle"
Generalized minimum 0-extension problem and discrete convexity
Location histogram privacy by Sensitive Location Hiding and Target Histogram Avoidance/Resemblance
Densities, spectral densities and modality
Densities, Spectral Densities and Modality
10. Second Extension principle; the divergence theorem for regular regions.
Minority Costume Image Retrieval by Fusion of Color Histogram and Edge Orientation Histogram
3. First Extension principle.
The broad histogram method : an extension to continuous systems
Microdata adjustment by the minimum information loss principle
Microdata adjustment by the minimum information loss principle
Neutrino mixing and masses from a minimum principle
Typoskript "On an extension of the maximum likelihood principle"
Generalized minimum 0-extension problem and discrete convexity
Location histogram privacy by Sensitive Location Hiding and Target Histogram Avoidance/Resemblance
Densities, spectral densities and modality
Densities, Spectral Densities and Modality
10. Second Extension principle; the divergence theorem for regular regions.