Mikko Koivisto

  1. Partial Order MCMC for Structure Discovery in Bayesian Networks.

    Authors: Mikko Koivisto, Teppo Niinimaki, Pekka Parviainen
    Subjects: Learning
    Abstract

    We present a new Markov chain Monte Carlo method for estimating posterior
    probabilities of structural features in Bayesian networks. The method draws
    samples from the posterior distribution of partial orders on the nodes; for
    each sampled partial order, the conditional probabilities of interest are
    computed exactly. We give both analytical and empirical results that suggest
    the superiority of the new method compared to previous methods, which sample
    either directed acyclic graphs or linear orders on the nodes.

  2. Narrow sieves for parameterized paths and packings.

    Authors: Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
    Subjects: Data Structures and Algorithms
    Abstract

    We present randomized algorithms for some well-studied, hard combinatorial
    problems: the k-path problem, the p-packing of q-sets problem, and the
    q-dimensional p-matching problem. Our algorithms solve these problems with high
    probability in time exponential only in the parameter (k, p, q) and using
    polynomial space; the constant bases of the exponentials are significantly
    smaller than in previous works. For example, for the k-path problem the
    improvement is from 2 to 1.66.

Syndicate content