2013
DOI: 10.1016/j.ijar.2013.03.009
|View full text |Cite
|
Sign up to set email alerts
|

An interactive approach for Bayesian network learning using domain/expert knowledge

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
30
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 46 publications
(30 citation statements)
references
References 20 publications
0
30
0
Order By: Relevance
“…Meganck et al (2006) compare different utility functions for single-vertex interventions, but do not address algorithmic questions of efficiently calculating optima of the utility functions. In the Bayesian setting, Tong and Koller (2001) and Masegosa and Moral (2013) uses entropy-based utility functions. While the approach of Tong and Koller (2001) only interacts with the system under investigation, the approach of Masegosa and Moral (2013) use (error-free) expert knowledge.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Meganck et al (2006) compare different utility functions for single-vertex interventions, but do not address algorithmic questions of efficiently calculating optima of the utility functions. In the Bayesian setting, Tong and Koller (2001) and Masegosa and Moral (2013) uses entropy-based utility functions. While the approach of Tong and Koller (2001) only interacts with the system under investigation, the approach of Masegosa and Moral (2013) use (error-free) expert knowledge.…”
Section: Introductionmentioning
confidence: 99%
“…In the Bayesian setting, Tong and Koller (2001) and Masegosa and Moral (2013) uses entropy-based utility functions. While the approach of Tong and Koller (2001) only interacts with the system under investigation, the approach of Masegosa and Moral (2013) use (error-free) expert knowledge.…”
Section: Introductionmentioning
confidence: 99%
“…The qualitative part (i.e., the structure of the Bayesian network) consists of a directed acyclic graph (DAG) where the nodes correspond to the variables in the domain problem and the edges between two variables correspond to direct probabilistic dependencies. On the other hand, the quantitative part consists of the specification of the conditional probability distributions that are stored in the nodes of the network [28]. DAG describes the relationship between attributes and consists of nodes and arcs, where each arc describes a probabilistic dependence.…”
Section: B Bayesian Networkmentioning
confidence: 99%
“…Cano et al [8] and Flores et al [35] proposed an interactive BN structure learning approach that iteratively queries the domain expert about the reliability of learnt edges. This interactive paradigm can be easily applied to help elicit edges' monotonic influences from experts and suggests that the theoretical method presented in this paper can be applied in practice (we do not use the interactive paradigm here because in our experiments we assume that any edges with monotonic influences are known and we simulate errors made by experts).…”
Section: Related Workmentioning
confidence: 99%