2017
DOI: 10.1017/s0033291716003287
|View full text |Cite
|
Sign up to set email alerts
|

Co-morbid obsessive–compulsive disorder and depression: a Bayesian network approach

Abstract: Bayesian analysis can expand the repertoire of network analytic approaches to psychopathology. We discuss clinical implications and limitations of our findings.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

6
164
1
5

Year Published

2017
2017
2024
2024

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 188 publications
(183 citation statements)
references
References 43 publications
6
164
1
5
Order By: Relevance
“…However, replicability of specific edges was notably worse in the split-half pairs, with a median of a quarter to over a third of the edges failing to replicate. This finding is in contrast to McNally et al’s (2017) suggestion that this method “depicts only those edges nearly certain to be genuine” (p. 1207) and highlights the sensitivity of DAGs to small differences in the relationships among symptoms in the network. Overall, the lack of stability and generalizability in the DAGs is to be expected once we understand the assumptions, discussed below, that underlie the estimation and interpretability of the models.…”
Section: Discussioncontrasting
confidence: 93%
See 1 more Smart Citation
“…However, replicability of specific edges was notably worse in the split-half pairs, with a median of a quarter to over a third of the edges failing to replicate. This finding is in contrast to McNally et al’s (2017) suggestion that this method “depicts only those edges nearly certain to be genuine” (p. 1207) and highlights the sensitivity of DAGs to small differences in the relationships among symptoms in the network. Overall, the lack of stability and generalizability in the DAGs is to be expected once we understand the assumptions, discussed below, that underlie the estimation and interpretability of the models.…”
Section: Discussioncontrasting
confidence: 93%
“…DAGs were computed based on Bayesian network analyses (i.e., the hill-climbing algorithm from the R package bnlearn ; Scutari, 2010), as described in McNally, Mair, Mungo, and Riemann (2017). The hill-climbing algorithm adds, removes, and reverses edges until a target Bayesian Information Criterion score is reached.…”
Section: Methodsmentioning
confidence: 99%
“…Finally, studying comorbid depression and obsessive-compulsive disorder (OCD), McNally et al [74] found that both clusters of symptoms were connected through “sadness,” but sleep and appetite symptoms were not connected to either depression or OCD. These types of results illustrate that not all symptoms play the same role when developing comorbid disorders.…”
Section: Resultsmentioning
confidence: 99%
“…To ensure the stability of the DAG, we bootstrapped 10,000 samples, computing a network for each sample (McNally et al, 2017). We then averaged them to obtain the final, resultant network.…”
Section: Methodsmentioning
confidence: 99%
“…First, we computed an undirected, regularized partial correlation graph – the most popular method for modelling psychopathology (Epskamp & Fried, 2016). Next, we used Bayesian methods to compute a directed, acyclic graph – a relatively new approach to modelling psychopathology (McNally, Mair, Mugno, & Riemann, 2017). Both approaches test for links between symptoms after adjusting for the influence of other symptoms, but their strengths and weaknesses are mirror images of one another.…”
mentioning
confidence: 99%