Search

We show an alternative way of representing a Bayesian belief network by sensitivities and probability distributions. This representation is equivalent to the traditional representation by conditional probabilities, but makes dependencies between nodes apparent and intuitively easy to understand. We also propose a QR matrix representation for the sensitivities and/or conditional probabilities which is more efficient, in both memory requirements and computational speed, than the traditional representation for computer-based implementations of probabilistic inference. We use sensitivities to show that for a certain class of binary networks, the computation time for approximate probabilistic inference with any positive upper bound on the error of the result is independent of the size of the network. Finally, as an alternative to traditional algorithms that use conditional probabilities, we describe an exact algorithm for probabilistic inference that uses the QR-representation for sensitivities and updates probability distributions of nodes in a network according to messages from the neighbors., Comment: Appears in Proceedings of the Eleventh Conference on Uncertainty in Artificial Intelligence (UAI1995)

Although probabilistic inference in a general Bayesian belief network is an NP-hard problem, computation time for inference can be reduced in most practical cases by exploiting domain knowledge and by making approximations in the knowledge representation. In this paper we introduce the property of similarity of states and a new method for approximate knowledge representation and inference which is based on this property. We define two or more states of a node to be similar when the ratio of their probabilities, the likelihood ratio, does not depend on the instantiations of the other nodes in the network. We show that the similarity of states exposes redundancies in the joint probability distribution which can be exploited to reduce the computation time of probabilistic inference in networks with multiple similar states, and that the computational complexity in the networks with exponentially many similar states might be polynomial. We demonstrate our ideas on the example of a BN2O network -- a two layer network often used in diagnostic problems -- by reducing it to a very close network with multiple similar states. We show that the answers to practical queries converge very fast to the answers obtained with the original network. The maximum error is as low as 5% for models that require only 10% of the computation time needed by the original BN2O model., Comment: Appears in Proceedings of the Twelfth Conference on Uncertainty in Artificial Intelligence (UAI1996)

We consider probabilistic inference in general hybrid networks, which include continuous and discrete variables in an arbitrary topology. We reexamine the question of variable discretization in a hybrid network aiming at minimizing the information loss induced by the discretization. We show that a nonuniform partition across all variables as opposed to uniform partition of each variable separately reduces the size of the data structures needed to represent a continuous function. We also provide a simple but efficient procedure for nonuniform partition. To represent a nonuniform discretization in the computer memory, we introduce a new data structure, which we call a Binary Split Partition (BSP) tree. We show that BSP trees can be an exponential factor smaller than the data structures in the standard uniform discretization in multiple dimensions and show how the BSP trees can be used in the standard join tree algorithm. We show that the accuracy of the inference process can be significantly improved by adjusting discretization with evidence. We construct an iterative anytime algorithm that gradually improves the quality of the discretization and the accuracy of the answer on a query. We provide empirical evidence that the algorithm converges., Comment: Appears in Proceedings of the Thirteenth Conference on Uncertainty in Artificial Intelligence (UAI1997)

The production of the low-mass dielectrons is considered to be a powerful tool to study the properties of the hot and dense matter created in the ultra-relativistic heavy-ion collisions. We present the preliminary results on the first measurements of the low-mass dielectron continuum in Au+Au collisions and the phi meson production measured in Au+Au and d+Au collisions at sqrt{s_NN} = 200 GeV performed by the PHENIX experiment., Comment: 6 pages, 12 figures, conference proceedings for QNP06 (5-10 June, 2006, Madrid)

The properties of the phi-meson have been measured via its e+e- and K+K- decay channels in Au+Au collisions at sqrt{s_NN} = 200 GeV by the PHENIX experiment. The preliminary yields and temperatures derived for the minimum bias and several centrality bins in both decay channels are presented., Comment: 4 pages, 4 figures, "Quark Matter 2005" conference proceedings

First data on coherent threshold \pi^0 electroproduction from the deuteron taken by the A1 Collaboration at the Mainz Microtron MAMI are presented. At a four-momentum transfer of q^2=-0.1 GeV^2/c^2 the full solid angle was covered up to a center-of-mass energy of 4 MeV above threshold. By means of a Rosenbluth separation the longitudinal threshold s wave multipole and an upper limit for the transverse threshold s wave multipole could be extracted and compared to predictions of Heavy Baryon Chiral Perturbation Theory., Comment: 7 pages, 7 figures, latex2e