 |
 |
 |
 |
 |
 |
 |
Research
Open problems
The following pages contain open problems I am interested in. They contain a description of the problem and directions in which solutions are likely to be found. They are sorted from theoretical to the more applied.
- Bayesian or democratic voting: which one wins?
- Efficient Bayes Net Inference
- Bayes Net Structure Learning
- Webmining: Topic maps and graphical models
- XML: conversion, an auto markup and portal proposals.
Recent publications:
- R. R. Bouckaert. Low level information extraction: a Bayesian network based approach. TextML 2002. pdf
- Tomas Kocka, Remco R. Bouckaert, Milan Studeny. On characterizing Inclusion of Bayesian Networks. Uncertainty in artificial intelligence. 2001. pdf
- M. Studeny, R.R. Bouckaert, T. Kocka: Extreme supermodular set functions over five variables. Research report n. 1977, Institute of Information Theory and Automation, Prague, January 2000 (32 pages). postscript
- M. Studeny and R. R. Bouckaert: On chain graph models for description of conditional independence structures. The Annals of Statistics 26 (1998), n. 4, pp. 1434-1495. postscript
Online Material:
- Conditional Independence
- DagDig a program for experimenting with Bayesian Belief Network learning algorithms
- CSS/XML/XSL Processing
- Bayesian Belief Networks: from construction to inference (PhD-thesis).
| [About Us] | [Consulting] | [ShoXS] | [Research] | [Site index] | [Contact Us] |