2021
DOI: 10.1002/sim.8925
|View full text |Cite
|
Sign up to set email alerts
|

Corrected score methods for estimating Bayesian networks with error‐prone nodes

Abstract: Motivated by inferring cellular signaling networks using noisy flow cytometry data, we develop procedures to draw inference for Bayesian networks based on error‐prone data. Two methods for inferring causal relationships between nodes in a network are proposed based on penalized estimation methods that account for measurement error and encourage sparsity. We discuss consistency of the proposed network estimators and develop an approach for selecting the tuning parameter in the penalized estimation methods. Empi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
2

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 69 publications
0
2
0
Order By: Relevance
“…In Step 1, we apply the frequentist node‐wise parent selection method proposed in our earlier work 17 to estimate a coefficients matrix that satisfies the acyclic constraint while encouraging sparsity. We then mismatch data with (estimated) graph structures when estimating causal effects again in Step 2 to obtain trueboldB^false(1false)false(trueG^2false)$$ {\hat{\mathbf{B}}}^{(1)}\left({\hat{G}}_2\right) $$ and trueboldB^false(2false)false(trueG^1false)$$ {\hat{\mathbf{B}}}^{(2)}\left({\hat{G}}_1\right) $$, which can (and usually do) differ from the coefficients matrix estimates in Step 1, that is, trueboldB^false(1false)false(trueG^1false)$$ {\hat{\mathbf{B}}}^{(1)}\left({\hat{G}}_1\right) $$ and trueboldB^false(2false)false(trueG^2false)$$ {\hat{\mathbf{B}}}^{(2)}\left({\hat{G}}_2\right) $$.…”
Section: Two New Scores For Differential Analysismentioning
confidence: 99%
See 1 more Smart Citation
“…In Step 1, we apply the frequentist node‐wise parent selection method proposed in our earlier work 17 to estimate a coefficients matrix that satisfies the acyclic constraint while encouraging sparsity. We then mismatch data with (estimated) graph structures when estimating causal effects again in Step 2 to obtain trueboldB^false(1false)false(trueG^2false)$$ {\hat{\mathbf{B}}}^{(1)}\left({\hat{G}}_2\right) $$ and trueboldB^false(2false)false(trueG^1false)$$ {\hat{\mathbf{B}}}^{(2)}\left({\hat{G}}_1\right) $$, which can (and usually do) differ from the coefficients matrix estimates in Step 1, that is, trueboldB^false(1false)false(trueG^1false)$$ {\hat{\mathbf{B}}}^{(1)}\left({\hat{G}}_1\right) $$ and trueboldB^false(2false)false(trueG^2false)$$ {\hat{\mathbf{B}}}^{(2)}\left({\hat{G}}_2\right) $$.…”
Section: Two New Scores For Differential Analysismentioning
confidence: 99%
“…Step 1, we apply the frequentist node-wise parent selection method proposed in our earlier work 17 to estimate a coefficients matrix that satisfies the acyclic constraint while encouraging sparsity. We then mismatch data with (estimated) graph structures when estimating causal effects again in Step…”
Section: The Prediction Invariance Scorementioning
confidence: 99%