135 citations · 886 across the 57 of their papers we have counts for
5 papers · 1 filter
Labeled Directed Acyclic Graphs: a generalization of context-specific independence in directed graphical models
Johan Pensar, Henrik Nyman, Timo Koski +1
We introduce a novel class of labeled directed acyclic graph (LDAG) models for finite sets of discrete variables. LDAGs generalize earlier proposals for allowing local structures i…
Computing Exact Clustering Posteriors with Subset Convolution
Jukka Kohonen, Jukka Corander
An exponential-time exact algorithm is provided for the task of clustering n items of data into k clusters. Instead of seeking one partition, posterior probabilities are computed f…
Learning Chordal Markov Networks by Constraint Satisfaction
Jukka Corander, Tomi Janhunen, Jussi Rintanen +2
We investigate the problem of learning the structure of a Markov network from data. It is shown that the structure of such networks can be described in terms of constraints which e…
Addition Chains Meet Postage Stamps: Reducing the Number of Multiplications
Jukka Kohonen, Jukka Corander
We introduce stamp chains. A stamp chain is a finite integer sequence that is both an addition chain and an additive 2-basis, i.e., a solution to the postage stamp problem. We prov…
Stratified Graphical Models - Context-Specific Independence in Graphical Models
Henrik Nyman, Johan Pensar, Timo Koski +1
Theory of graphical models has matured over more than three decades to provide the backbone for several classes of models that are used in a myriad of applications such as genetic…