Clustgrams: an extension to histogram densities based on the minimum description length principle

DOI10.2478/S13537-011-0033-XMaRDI QIDQ692998zbMATH OpenOpenAlexFDO

Authors Panu Luosto, Petri Kontkanen

Publication date 6 December 2012

Published in Central European Journal of Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.2478/s13537-011-0033-x

zbMATH Keywords

clusteringdensity estimationhistogramsMDL principle

Mathematics Subject Classification ID

Density estimation (62G07) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

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

Cites work

• scientific article; zbMATH DE number 2188025 (Why is no real title available?)
• A linear-time algorithm for computing the multinomial stochastic complexity
• A universal prior for integers and estimation by minimum description length
• Average case analysis of algorithms on sequences. With a foreword by Philippe Flajolet
• Density estimation by stochastic complexity
• Fisher information and stochastic complexity
• Information and complexity in statistical modeling.
• Modeling by shortest data description

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)