Dimitris Margaritis, Sebastian Thrun
November 21, 1998
Probabilistic or Bayesian Networks (BNs)--see Figure 1--are compact and semantically clean representations of probabilistic independencies and possible dependencies among sets of variables. As such they may provide with insights as to the application domain as well as be used to characterize future data. The basic technique for constructing Bayesian Nets is for an expert to provide causal relations among variables, which is then converted to a network structure under certain assumptions. However, these representations can be inaccurate and impossible to manually specify for large domains. Automatic structure inference is necessary in such cases. The research I am proposing relates to producing efficient algorithms for BN structure inference from data by exploiting probabilistic relations that may exist among sets of variables.
There is a large number of prediction/classification tasks that benefit from accurate modelling of the probabilistic relationships in the underlying representation of a problem. A practical solution to the abovementioned problem will enable systems with a large number of variables such as image retrieval or text categorization to recover complex interdependencies of the domain variables and improve their classification accuracy. As an example, the proliferation of web search engines for multimedia information should benefit from such a scientific advancement.
There are two approaches to recovery of structure in the case where all variables are observable. The first, more popular one involves a local, gradient ascent type search in the space of structures, with each step being an arc addition, removal or reversal . Conditional probability tables accompanying the structure are computed from data. This process is guaranteed to reach a local maximum of the score function, but not necessarily a global one. The second approach  involves exploiting statistical independence among sets of variables upon conditioning on another set, and is the one most related to the current research.
In the case of existence of hidden variables, recovery of structure is more difficult, especially since usually the exact number of hidden variables is unknown. Computation of the score is also more difficult because of the unobserved values for the hidden nodes. Conditioning on variables for local structure recovery may no longer be possible. Algorithms such as gradient ascent  and EM  are the ones mainly used in this case.
At present I am interested in structure discovery in the case where all variables are observed. I propose an algorithm that discovers the local structure in the case where the actual net is a polytree. The structure around each node is revealed after examination of how the neighborhood sets (maximal sets of nodes that are all probabilistically dependent to each other) of that node changes by conditioning on that particular node. A graph-theoretic connectedness reconstruction discovers sets of ancestor and descendant nodes grouped by the link they are connected to the node in question. The algorithm is polynomial in time in the number of nodes.
I am interested in extending the domain of applicability of the algorithm to general Bayesian Nets that may involve (undirected) cycles. The general problem is NP-complete  so it would be interesting to see how well structure discovery can be done in practice. I am also interested in structure discovery in the case of hidden variables, since that will have a much higher applicability to domains such as vision and image retrieval, as well as a plethora of other application areas.