Clustgrams: an extension to histogram densities based on the minimum description length principle
From MaRDI portal
Publication:692998
DOI10.2478/s13537-011-0033-xzbMath1254.62043OpenAlexW2148415743MaRDI QIDQ692998
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
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- A universal prior for integers and estimation by minimum description length
- Modeling by shortest data description
- A linear-time algorithm for computing the multinomial stochastic complexity
- Density estimation by stochastic complexity
- Fisher information and stochastic complexity
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Clustgrams: an extension to histogram densities based on the minimum description length principle