2009
DOI: 10.1016/j.csda.2008.11.003
|View full text |Cite
|
Sign up to set email alerts
|

Supervised classification using probabilistic decision graphs

Abstract: A new model for supervised classification based on probabilistic decision graphs is introduced. A probabilistic decision graph (PDG) is a graphical model that efficiently captures certain context specific independencies that are not easily represented by other graphical models traditionally used for classification, such as the Naïve Bayes (NB) or Classification Trees (CT). This means that the PDG model can capture some distributions using fewer parameters than classical models. Two approaches for constructing … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
6
0

Year Published

2009
2009
2020
2020

Publication Types

Select...
5
2

Relationship

1
6

Authors

Journals

citations
Cited by 15 publications
(6 citation statements)
references
References 16 publications
0
6
0
Order By: Relevance
“…Assume we want to compile the CG-PDG described there, in order to incorporate evidence (W 2 = 0). The restriction of the model to (W 2 = 0) results in the following changes: f ν 5 (1) = f ν 6 (1) = f ν 7 (1) = 0, and the compilation of the restricted models requires the updating of the following parameters: μ ν 8 = 5.5, s 2 ν 8 = 1.46, μ ν 9 = 8.5 and s 2 ν 9 = 1.9924.…”
Section: Examplementioning
confidence: 99%
See 1 more Smart Citation
“…Assume we want to compile the CG-PDG described there, in order to incorporate evidence (W 2 = 0). The restriction of the model to (W 2 = 0) results in the following changes: f ν 5 (1) = f ν 6 (1) = f ν 7 (1) = 0, and the compilation of the restricted models requires the updating of the following parameters: μ ν 8 = 5.5, s 2 ν 8 = 1.46, μ ν 9 = 8.5 and s 2 ν 9 = 1.9924.…”
Section: Examplementioning
confidence: 99%
“…The PDG model has also been successfully applied to supervised classification problems [5] and unsupervised clustering [6].…”
Section: Introductionmentioning
confidence: 99%
“…Dynamic programming is often adopted to help reduce the time complexity of the algorithm (Cicalese et al 2011). In supervised classification training, for instance, decision graphs have been found to significantly enhance the efficiency of classification models constructed for wireless network planning (Nielsen et al 2009). In clinical and epidemiological analysis, tree diagrams have also been used to formulate classification rules that help clinical practitioners to distinguish between clusters of signs and symptoms and quickly reach a diagnosis (Marshall 2001).…”
Section: Tree Diagrammentioning
confidence: 99%
“…Thus many techniques can be used in the binary classification but methods with high performance are highly required to minimize risks where diagnosis mistakes can cost the life of the patients. In this context, Bayesian networks have emerged as a practical classification technology with successful applications in many fields and provides some advantages such as the ability to combine expert opinion and experimental data (NIELSEN et al, 2009;HECKERMAN et al, 1995).…”
Section: Introductionmentioning
confidence: 99%