Clustgrams: an extension to histogram densities based on the minimum description length principle
DOI10.2478/S13537-011-0033-XzbMATH Open1254.62043OpenAlexW2148415743MaRDI QIDQ692998FDOQ692998
Authors: Panu Luosto, Petri Kontkanen 
Publication date: 6 December 2012
Published in: Central European Journal of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2478/s13537-011-0033-x
Recommendations
- Cluster analysis of multivariate random observations based on a histogram estimate of the density of a probability distribution
- On clustering histograms with \(k\)-means by using mixed \(\alpha\)-divergences
- A hierarchical modeling approach for clustering probability density functions
- An automatic clustering algorithm for probability density functions
Density estimation (62G07) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)
Cites Work
- A universal prior for integers and estimation by minimum description length
- Information and complexity in statistical modeling.
- Modeling by shortest data description
- Title not available (Why is that?)
- Density estimation by stochastic complexity
- Fisher information and stochastic complexity
- Average case analysis of algorithms on sequences. With a foreword by Philippe Flajolet
- A linear-time algorithm for computing the multinomial stochastic complexity
This page was built for publication: Clustgrams: an extension to histogram densities based on the minimum description length principle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q692998)
