PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

EPrints submitted by Tommi Mononen

Click here to see user's record.

Number of EPrints submitted by this user: 6

Fast NML Computation for Naive Bayes Models
Tommi Mononen and Petri Myllymäki
In: 10th International Conference on Discovery Science (DS-2007), 1-4 Oct 2007, Sendai, Japan.

Computing the Multinomial Stochastic Complexity in Sub-Linear Time
Tommi Mononen and Petri Myllymäki
In: The Fourth European Workshop on Probabilistic Graphical Models, 17-19 Sep 2008, Hirtshals, Denmark.

Computing the NML for Bayesian Forests via Matrices and Generating Polynomials
Tommi Mononen and Petri Myllymäki
In: 2008 IEEE Information Theory Workshop, 5-9 May 2008, Porto, Portugal.

On the Multinomial Stochastic Complexity and its Connection to the Birthday Problem
Tommi Mononen and Petri Myllymäki
In: 2008 International Conference on Information Theory and Statistical Learning, 14-17 Jul 2008, Las Vegas, Nevada, USA.

On Recurrence Formulas for Computing the Stochastic Complexity
Tommi Mononen and Petri Myllymäki
In: 2008 International Symposium on Information Theory and its Applications, 7-10 Dec 2008, Auckland, New Zealand.

Computing the stochastic complexity of simple probabilistic graphical models
Tommi Mononen
(2009) PhD thesis, University of Helsinki.