A PARALLEL ALGORITHM FOR BUILDING POSSIBILISTIC CAUSAL NETWORKS

Citation
R. Sanguesa et al., A PARALLEL ALGORITHM FOR BUILDING POSSIBILISTIC CAUSAL NETWORKS, International journal of approximate reasoning, 18(3-4), 1998, pp. 251-270
Citations number
31
Categorie Soggetti
Computer Science Artificial Intelligence","Engineering, Eletrical & Electronic","Computer Science Artificial Intelligence
ISSN journal
0888613X
Volume
18
Issue
3-4
Year of publication
1998
Pages
251 - 270
Database
ISI
SICI code
0888-613X(1998)18:3-4<251:APAFBP>2.0.ZU;2-Z
Abstract
Among the several representations of uncertainty, possibility theory a llows also for the management of imprecision coming from data. Domain models with inherent uncertainty and imprecision can be represented by means of possibilistic causal networks that, the possibilistic counte rpart of Bayesian belief networks. Only recently the definition of pos sibilistic network has been clearly stated and the corresponding infer ence algorithms developed. However, and in contrast to the correspondi ng developments in Bayesian networks, learning methods for possibilist ic networks are still few. We present here a new approach that hybridi zes two of the most used approaches in uncertain network learning: tho se methods based on conditional dependency information and those based on information quality measures. The resulting algorithm, POSSCAUSE, admits easily a parallel formulation. In the present paper POSSCAUSE i s presented and its main features discussed together with the underlyi ng new concepts used. (C) 1998 Elsevier Science Inc, All rights reserv ed.