2016
DOI: 10.1037/met0000090
|View full text |Cite
|
Sign up to set email alerts
|

Theory-guided exploration with structural equation model forests.

Abstract: Structural equation model (SEM) trees, a combination of SEMs and decision trees, have been proposed as a data-analytic tool for theory-guided exploration of empirical data. With respect to a hypothesized model of multivariate outcomes, such trees recursively find subgroups with similar patterns of observed data. SEM trees allow for the automatic selection of variables that predict differences across individuals in specific theoretical models, for instance, differences in latent factor profiles or developmental… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
132
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
4
3
2

Relationship

1
8

Authors

Journals

citations
Cited by 84 publications
(132 citation statements)
references
References 72 publications
0
132
0
Order By: Relevance
“…In terms of analytical frameworks, here we implement a relatively new analytical framework, called SEM-trees (Brandmaier et al, 2013) (Zadelaar et al, 2019), Gaussian process structural equation models (e.g. Silva and Gramacy, 2010), latent class and latent profile analysis (Oberski, 2016), general frameworks such as decision trees (McArdle, 2013) and model-based cluster analysis (Fraley and Raftery, 1999), as well as extensions of SEM trees such as SEM forests (Brandmaier et al, 2016). All of these techniques differ in their strengths and weaknesses, ease of implementation, degree of confirmation versus exploration and their flexibility (e.g.…”
Section: Limitations Of the Present Studymentioning
confidence: 99%
“…In terms of analytical frameworks, here we implement a relatively new analytical framework, called SEM-trees (Brandmaier et al, 2013) (Zadelaar et al, 2019), Gaussian process structural equation models (e.g. Silva and Gramacy, 2010), latent class and latent profile analysis (Oberski, 2016), general frameworks such as decision trees (McArdle, 2013) and model-based cluster analysis (Fraley and Raftery, 1999), as well as extensions of SEM trees such as SEM forests (Brandmaier et al, 2016). All of these techniques differ in their strengths and weaknesses, ease of implementation, degree of confirmation versus exploration and their flexibility (e.g.…”
Section: Limitations Of the Present Studymentioning
confidence: 99%
“…As indicated by the present simulation, this point should be more critical when the true classification structure is complex (i.e., a large number of true classes). In that respect, although the computation burden is still heavy, using SEM Forests (Brandmaier et al 2016) could be a useful alternative to address this problem, and more research is needed into the propensity for SEM Trees and SEM Forests to over-fit. From a technical aspect, additional future investigations should also include the development of more computationally efficient algorithms.…”
Section: Discussionmentioning
confidence: 99%
“…SEM Trees analyses can be performed using the R package semtree (Brandmaier et al 2013), with SEM models handled by either lavaan (Rosseel 2012) or Open M x (Boker et al 2011). In this package, we can also use a more advanced version of SEM Trees called SEM forests (Brandmaier et al 2016), which are ensembles of SEM Trees based on resamplings of the original dataset that provide increased stability of the estimation results. Currently, SEM forests can only be paired with OpenMx.…”
mentioning
confidence: 99%
“…boys and girls show differential response dynamics following divorce, Malone et al, 2004). In cases where a large number of covariates are potentially relevant but we have no strong theories to guide us, more exploratory techniques such as SEM trees (Brandmaier, von Oertzen, McArdle, & Lindenberger, 2013) and SEM forests (Brandmaier, Prindle, McArdle, & Lindenberger, 2016) allows researchers to hierarchically split empirical data into homogeneous groups sharing similar data patterns, by recursively selecting optimal predictors of these differences from a potentially large set of candidates. The resulting tree structure reflects set of subgroups with distinct model parameters, where the groups are derived in a data-driven way.…”
Section: Multigroup Latent Change Score Models: Manifest Groups Mixtmentioning
confidence: 99%