The Minimum Description Length (MDL) is an information-theoretic principle that can be used for model selection and other statistical inference tasks. One way to implement this principle in practice is to compute the Normalized Maximum Likelihood (NML) distribution for a given parametric model class. Unfortunately this is a computationally infeasible task for many model classes of practical importance. In this paper we present a fast algorithm for computing the NML for the Naive Bayes model class, which is frequently used in classification and clustering tasks. The algorithm is based on a relationship between powers of generating functions and discrete convolution. The resulting algorithm has the time complexity of Ο(n2), where n is the size of the data. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Mononen, T., & Myllymäki, P. (2007). Fast NML computation for naive bayes models. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4755 LNAI, pp. 151–160). Springer Verlag. https://doi.org/10.1007/978-3-540-75488-6_15
Mendeley helps you to discover research relevant for your work.