𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Networks of probabilistic events in discrete time

✍ Scribed by Severino F. Galán; Francisco J. Dı́ez


Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
229 KB
Volume
30
Category
Article
ISSN
0888-613X

No coin nor oath required. For personal study only.

✦ Synopsis


The usual methods of applying Bayesian networks to the modeling of temporal processes, such as Dean and Kanazawa's dynamic Bayesian networks (DBNs), consist in discretizing time and creating an instance of each random variable for each point in time. We present a new approach called network of probabilistic events in discrete time (NPEDT), for temporal reasoning with uncertainty in domains involving probabilistic events. Under this approach, time is discretized and each value of a variable represents the instant at which a certain event may occur. This is the main difference with respect to DBNs, in which the value of a variable V i represents the state of a real-world property at time t i . Therefore, our method is more appropriate for temporal fault diagnosis, because only one variable is necessary for representing the occurrence of a fault and, as a consequence, the networks involved are much simpler than those obtained by using DBNs. In contrast, DBNs are more appropriate for monitoring tasks, since they explicitly represent the state of the system at each moment. We also introduce in this paper several types of temporal noisy gates, which facilitate the acquisition and representation of uncertain temporal knowledge. They constitute a generalization of traditional canonical models of multicausal interactions, such as the noisy OR-gate, which have been usually applied to static domains. We illustrate the approach with the example domain of modeling the evolution of traffic jams produced on the outskirts of a city, after the occurrence of an event that obliges traffic to stop indefinitely.


📜 SIMILAR VOLUMES


Modeling Probabilistic Networks of Discr
✍ Enrique Castillo; José Manuel Gutiérrez; Ali S. Hadi 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 378 KB

In this paper we show how discrete and continuous variables can be combined using parametric conditional families of distributions and how the likelihood weighting method can be used for propagating uncertainty through the network in an efficient manner. To illustrate the method we use, as an exampl

Robust state estimation for discrete-tim
✍ Zidong Wang; Yurong Liu; Xiaohui Liu; Yong Shi 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 298 KB

In this paper, the robust H 1 state estimation problem is investigated for a general class of uncertain discrete-time stochastic neural networks with probabilistic measurement delays. The measurement delays of the neural networks are described by a binary switching sequence satisfying a conditional

Saturation at high gain in discrete time
✍ Morris W. Hirsch 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 451 KB

We develop analogs of the saturation theorems of Grossberg and Hopfield for networks operating in discrete time with continuous activation dynamics. At certain units, called output nodes, the transfer functions gj are like sums of classical sigmoids with gain parameter ~. There is no restriction on

Discrete-time neural network output feed
✍ J. Vance; S. Jagannathan 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 212 KB

An adaptive neural network (NN)-based output feedback controller is proposed to deliver a desired tracking performance for a class of discrete-time nonlinear systems, which are represented in non-strict feedback form. The NN backstepping approach is utilized to design the adaptive output feedback co