2021
DOI: 10.1016/j.eswa.2021.115035
|View full text |Cite
|
Sign up to set email alerts
|

Multi-level interpretable logic tree analysis: A data-driven approach for hierarchical causality analysis

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
11
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
3
3
2

Relationship

0
8

Authors

Journals

citations
Cited by 16 publications
(11 citation statements)
references
References 33 publications
0
11
0
Order By: Relevance
“…This concept consists of helping the optimization process by injecting additional knowledge. One way to address this is by searching out for patterns (e.g., Waghen & Ouali [20]) in the failure data set that enables identifying parts of the FT and then assemble them.…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…This concept consists of helping the optimization process by injecting additional knowledge. One way to address this is by searching out for patterns (e.g., Waghen & Ouali [20]) in the failure data set that enables identifying parts of the FT and then assemble them.…”
Section: Discussionmentioning
confidence: 99%
“…This algorithm also manages to infer FT models with VoT gates. In Waghen & Ouali [20] the authors further extended their work to the Multi-level Interpretable Logic Tree Analysis (MILTA), which tackles the problem of multiple cause-and-effect sequences (the latter a limitation of their previous version, the ILTA algorithm) by incorporating Bayesian probability rules.…”
mentioning
confidence: 99%
“…(1) Establishing a Fault Tree Model Deductive analysis is used to create a fault tree. The top event is selected and the cause of the issue is then classified into intermediate events [4] . The basic events that do not require decomposition are then regarded as the base event.…”
Section: Fault Tree Analysismentioning
confidence: 99%
“…While most data-driven approaches only require information about basic events, LIFT also needs information about failures of intermediate events. Both the ILTA [27] and MILTA [28] algorithms make use of Knowledge Discovery in Data sets, Interpretable Logic Tree Analysis, and Bayesian probability rules. The method in [15] first learns a Bayesian Network and then translates it into an FT model, using blacklists and whitelists to define missing or present arcs.…”
Section: Relatedmentioning
confidence: 99%