ویراساینس.
سند علمی

Likelihood-Based Robust Classification with Bayesian Networks

Alessandro Antonucci, Marco E. G. V. Cattaneo, Giorgio Corani

چکیده

Bayesian networks are commonly used for classification: a structural learning algorithm determines the network graph, while standard approaches estimate the model parameters from data. Yet, with few data the corresponding assessments can be unreliable. To gain robustness in this phase, we consider a likelihood-based learning approach, which takes all the model quantifications whose likelihood exceeds a given threshold. A new classification algorithm based on this approach is presented. Notably, this is a credal classifier, i.e., more than a single class can be returned in output. This is the case when the Bayesian networks consistent with the threshold constraint assign different class labels to a test instance. This is the first classifier of this kind for general topologies. Experiments show how this approach provide the desired robustness.

اسناد مشابه

  • Constrained Maximum Likelihood Learning of Bayesian Networks for Facial Action Recognition

    سند علمی۲۰۰۸ECCVCassio Polpo de Campos, Yan Tong, Qiang Ji

    Probabilistic graphical models such as Bayesian Networks have been increasingly applied to many computer vision problems. Accuracy of inferences in such models depends on the quality of network parameters. Learning reliable parameters of Bayesian networks often requires a large a

  • Learning Maximum Likelihood Semi-Naive Bayesian Network Classifier

    سند علمی۲۰۰۲Kaizhu Huang, Irwin King

    In this paper, we propose a technique to construct a sub-optimal semi-naive Bayesian network when given a bound on the maximum number of variables that can be combined into a node. We theoretically show that our approach has a less computation cost when compared with the traditio

  • Increased robustness of Bayesian networks through probability intervals

    سند علمی۱۹۹۷Int. J. Approx. ReasoningHelmut Thöne, Ulrich Güntzer, Werner Kießling

    We present an extension of Bayesian networks to probability intervals, aiming at a more realistic and flexible modeling of applications with uncertain and imprecise knowledge. Within the logical framework of causal programs we provide a modeltheoretic foundation for a formal trea

  • Large Incomplete Sample Robustness in Bayesian Networks

    سند علمی۲۰۰۸Jim Q. Smith, Alireza Daneshkhah

    Under local DeRobertis (LDR) separation measures, the posterior distances between two densities is the same as between the prior densities. Like Kullback Leibler separation they also are additive under factorization. These two properties allow us the prove that the precise specif

  • On the robustness of Bayesian networks to learning from non-conjugate sampling

    سند علمی۲۰۱۰Int. J. Approx. ReasoningJim Q. Smith, Alireza Daneshkhah

    Under local DeRobertis separation measures, the posterior distances between two densities is the same as between the prior densities. Like Kullback Leibler separation they are also additive under factorisation. These two properties allow us to prove that the precise specification

  • Optimal Feature Selection for Decision Robustness in Bayesian Networks

    سند علمی۲۰۱۷IJCAIYooJung Choi, Adnan Darwiche, Guy Van den Broeck

    In many applications, one can define a large set of features to support the classification task at hand. At test time, however, these become prohibitively expensive to evaluate, and only a small subset of features is used, often selected for their information-theoretic value. For