Binary naive possibilistic classifiers: handling uncertain inputs
From MaRDI portal
Recommendations
Cites work
- A comparative study of possibilistic conditional independence and lack of interaction
- A synthetic view of belief revision with uncertain inputs in the framework of possibility theory
- Conditional possibilities independence and noninteraction
- Fuzzy sets as a basis for a theory of possibility
- Graphical models. Methods for data analysis and mining
- scientific article; zbMATH DE number 1665314 (Why is no real title available?)
- scientific article; zbMATH DE number 48812 (Why is no real title available?)
- scientific article; zbMATH DE number 193123 (Why is no real title available?)
- scientific article; zbMATH DE number 1568688 (Why is no real title available?)
- scientific article; zbMATH DE number 1844476 (Why is no real title available?)
- Hybrid possibilistic networks
- Independence and possibilistic conditioning
- Modeling and Reasoning with Bayesian Networks
- Naïve possibilistic network classifiers
- Updating beliefs with incomplete observations
Cited in
(5)- Naïve possibilistic network classifiers
- Naive possibilistic classifiers for imprecise or uncertain numerical data
- Classification based on possibilistic likelihood
- Inference in possibilistic network classifiers under uncertain observations
- Reasoning and learning in the setting of possibility theory -- overview and perspectives
This page was built for publication: Binary naive possibilistic classifiers: handling uncertain inputs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3650905)