Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
Introduction to Bayesian Networks
Introduction to Bayesian Networks
Probabilistic Networks and Expert Systems
Probabilistic Networks and Expert Systems
Graphical Models: Methods for Data Analysis and Mining
Graphical Models: Methods for Data Analysis and Mining
Getting into information retrieval
Lectures on information retrieval
Constructing attack scenarios through correlation of intrusion alerts
Proceedings of the 9th ACM conference on Computer and communications security
Independence and Possibilistic Conditioning
Annals of Mathematics and Artificial Intelligence
Learning from imprecise data: possibilistic graphical models
Computational Statistics & Data Analysis - Nonlinear methods and data mining
Possibilistic Induction in Decision-Tree Learning
ECML '02 Proceedings of the 13th European Conference on Machine Learning
Obtaining calibrated probability estimates from decision trees and naive Bayesian classifiers
ICML '01 Proceedings of the Eighteenth International Conference on Machine Learning
Aggregation and Correlation of Intrusion-Detection Alerts
RAID '00 Proceedings of the 4th International Symposium on Recent Advances in Intrusion Detection
A Two-Steps Algorithm for Min-Based Possibilistic Causal Networks
ECSQARU '01 Proceedings of the 6th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Alert Correlation in a Cooperative Intrusion Detection Framework
SP '02 Proceedings of the 2002 IEEE Symposium on Security and Privacy
Database aggregation of imprecise and uncertain evidence
Information Sciences—Informatics and Computer Science: An International Journal - special issue: Knowledge discovery from distributed information sources
Combining Pattern Classifiers: Methods and Algorithms
Combining Pattern Classifiers: Methods and Algorithms
Learning Bayesian Networks
Decision making under uncertainty using imprecise probabilities
International Journal of Approximate Reasoning
Web spam detection via commercial intent analysis
AIRWeb '07 Proceedings of the 3rd international workshop on Adversarial information retrieval on the web
An overview of anomaly detection techniques: Existing solutions and latest technological trends
Computer Networks: The International Journal of Computer and Telecommunications Networking
A definition of subjective possibility
International Journal of Approximate Reasoning
An Efficient Algorithm for Naive Possibilistic Classifiers with Uncertain Inputs
SUM '08 Proceedings of the 2nd international conference on Scalable Uncertainty Management
Managing and Mining Uncertain Data
Managing and Mining Uncertain Data
A Survey of Uncertain Data Algorithms and Applications
IEEE Transactions on Knowledge and Data Engineering
Bayesian Network Technologies: Applications and Graphical Models
Bayesian Network Technologies: Applications and Graphical Models
Fuzzy information retrieval model revisited
Fuzzy Sets and Systems
Exploiting contexts to deal with uncertainty in classification
Proceedings of the 1st ACM SIGKDD Workshop on Knowledge Discovery from Uncertain Data
Proceedings of the 1st ACM SIGKDD Workshop on Knowledge Discovery from Uncertain Data
On the revision of probabilistic beliefs using uncertain evidence
Artificial Intelligence
Possibility theory and statistical reasoning
Computational Statistics & Data Analysis
Inferring a possibility distribution from empirical data
Fuzzy Sets and Systems
On optimum recognition error and reject tradeoff
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
Possibilistic networks, which are compact representations of possibility distributions, are powerful tools for representing and reasoning with uncertain and incomplete information in the framework of possibility theory. They are like Bayesian networks but lie on possibility theory to deal with uncertainty, imprecision and incompleteness. While classification is a very useful task in many real world applications, possibilistic network-based classification issues are not well investigated in general and possibilistic-based classification inference with uncertain observations in particular. In this paper, we address on one hand the theoretical foundations of inference in possibilistic classifiers under uncertain inputs and propose on the other hand a novel efficient algorithm for the inference in possibilistic network-based classification under uncertain observations. We start by studying and analyzing the counterpart of Jeffrey's rule in the framework of possibility theory. After that, we address the validity of Markov-blanket criterion in the context of possibilistic networks used for classification with uncertain inputs purposes. Finally, we propose a novel algorithm suitable for possibilistic classifiers with uncertain observations without assuming any independence relations between observations. This algorithm guarantees the same results as if classification were performed using the possibilistic counterpart of Jeffrey's rule. Classification is achieved in polynomial time if the target variable is binary. The basic idea of our algorithm is to only search for totally plausible class instances through a series of equivalent and polynomial transformations applied on the possibilistic classifier taking into account the uncertain observations.