2012
DOI: 10.1037/a0027539
|View full text |Cite
|
Sign up to set email alerts
|

A comparison of methods for estimating quadratic effects in nonlinear structural equation models.

Abstract: Two Monte Carlo simulations were performed to compare methods for estimating and testing hypotheses of quadratic effects in latent variable regression models. The methods considered in the current study were (a) a 2-stage moderated regression approach using latent variable scores, (b) an unconstrained product indicator approach, (c) a latent moderated structural equation method, (d) a fully Bayesian approach, and (e) marginal maximum likelihood estimation. Of the 5 estimation methods, it was found that overall… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
52
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
7
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 52 publications
(53 citation statements)
references
References 67 publications
1
52
0
Order By: Relevance
“…Furthermore, [20] puts forth a hierarchical Bayesian nonlinear modeling approach in which unknown random parameters capture the strength and directions of causal links among variables. Several other studies adopt polynomial SEMs, which offer an immediate extension to classical linear SEMs; see e.g., [18], [21], [23], [39]. In all these contemporary approaches, it is assumed that the network connectivity structure is known a priori, and developed arXiv:1610.06551v1 [stat.AP] 20 Oct 2016 algorithms only estimate the unknown edge weights.…”
Section: Introductionmentioning
confidence: 99%
“…Furthermore, [20] puts forth a hierarchical Bayesian nonlinear modeling approach in which unknown random parameters capture the strength and directions of causal links among variables. Several other studies adopt polynomial SEMs, which offer an immediate extension to classical linear SEMs; see e.g., [18], [21], [23], [39]. In all these contemporary approaches, it is assumed that the network connectivity structure is known a priori, and developed arXiv:1610.06551v1 [stat.AP] 20 Oct 2016 algorithms only estimate the unknown edge weights.…”
Section: Introductionmentioning
confidence: 99%
“…Recognizing that summands in the regularization term of (14) can be written as (14) is a convex problem admitting a globally-optimal solution. Exploiting the structure inherent to (14), the next section develops inference algorithms for unveiling the unknown network topology.…”
Section: Kernel-based Topology Estimationmentioning
confidence: 99%
“…Since the decoupled convex cost in (14) reduces to a weighted version of the group Lasso solver, it is prudent to first define the change of variables ζ ij := K…”
Section: B Proximal Gradient Iterationsmentioning
confidence: 99%
“…We have used indicator reliability because of it has been shown to affect power to detect interaction effect in a latent variable interaction model (Harring et al, 2012). We chose the indicator reliabilities to be equal across the 12 indicator variables.…”
Section: Simulation Designmentioning
confidence: 99%