Anna Louise D. Latour
Stochastic Constraint Propagation for Mining Probabilistic Networks
A number of data mining problems on probabilistic networks can be modelled as Stochastic Constraint Optimisation and Satisfaction Problems (SCPs), i.e., problems that involve objectives or constraints with a stochastic component.
We present a new Constraint Programming approach to solving SCPs on monotonic distributions. Here, we exploit the structure of the Ordered Binary Decision Diagram in which these problems can be encoded, as well as the property of monotonicity.
Anna Louise is a PhD student at Leiden University and a visiting researcher at Université catholique de Louvain, under the supervision of dr. Siegfried Nijssen, prof. dr. Joost Kok and prof. dr. Holger Hoos. Her research focuses on the intersection of Constraint Programming and Probabilistic Logic Programming.