A two-steps algorithm for min-based possibilistic causal networks

DOI10.1007/3-540-44652-4_24MaRDI QIDQ4784842zbMATH OpenFDO

Authors Nahla Ben Amor, Salem Benferhat, Khaled Mellouli

Publication date 12 December 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2143/21430266

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37)

Recommendations

• PRODUCT-BASED CAUSAL NETWORKS AND QUANTITATIVE POSSIBILISTIC BASES
• Compiling min-based possibilistic causal networks: a mutilated-based approach
• Min-based causal possibilistic networks: handling interventions and analyzing the possibilistic counterpart of Jeffrey's rule of conditioning
• A prallel algorithm for building possibilistic causal networks
• Inference using compiled product-based possibilistic networks

Cited in

(8)

• Minimal sufficient causation and directed acyclic graphs
• A prallel algorithm for building possibilistic causal networks
• Possibilistic local structure for compiling min-based networks
• Min-based causal possibilistic networks: handling interventions and analyzing the possibilistic counterpart of Jeffrey's rule of conditioning
• Compiling min-based possibilistic causal networks: a mutilated-based approach
• Binary naive possibilistic classifiers: handling uncertain inputs
• Inference in possibilistic network classifiers under uncertain observations
• Lukasiewicz-based merging possibilistic networks

This page was built for publication: A two-steps algorithm for min-based possibilistic causal networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4784842)