Evaluating product-based possibilistic networks learning algorithms
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 970606
- PRODUCT-BASED CAUSAL NETWORKS AND QUANTITATIVE POSSIBILISTIC BASES
- Operations and evaluation measures for learning possibilistic graphical models
- Inferring interventions in product-based possibilistic causal networks
- A prallel algorithm for building possibilistic causal networks
Cites work
- A generic framework for a compilation-based inference in probabilistic and possibilistic networks
- A well-behaved algorithm for simulating dependence structures of Bayesian networks.
- Graphical Models
- scientific article; zbMATH DE number 4060768 (Why is no real title available?)
- scientific article; zbMATH DE number 48812 (Why is no real title available?)
- scientific article; zbMATH DE number 1269586 (Why is no real title available?)
- scientific article; zbMATH DE number 4121482 (Why is no real title available?)
- Hybrid possibilistic networks
- Possibilistic conditional independence: A similarity-based measure and its application to causal network learning
- Possibility theory and statistical reasoning
- SIM-PDT: A Similarity Based Possibilistic Decision Tree Approach
- Single value simulation of fuzzy variable
- The max-min hill-climbing Bayesian network structure learning algorithm
- Uncertainty and information: foundations of generalized information theory.
Cited in
(2)
This page was built for publication: Evaluating product-based possibilistic networks learning algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3451189)