Descriptor
| Algorithms | 3 |
| Feedback | 1 |
| Markov Processes | 1 |
| Matrices | 1 |
| Maximum Likelihood Statistics | 1 |
| Path Analysis | 1 |
Source
| Structural Equation Modeling | 3 |
Publication Type
| Journal Articles | 3 |
| Reports - Descriptive | 3 |
Education Level
Audience
Location
Laws, Policies, & Programs
Assessments and Surveys
What Works Clearinghouse Rating
Peer reviewedBoker, Steven M.; McArdle, J. J.; Neale, Michael – Structural Equation Modeling, 2002
Presents an algorithm for the production of a graphical diagram from a matrix formula in such a way that its components are logically and hierarchically arranged. The algorithm, which relies on the matrix equations of J. McArdle and R. McDonald (1984), calculates the individual path components of expected covariance between variables and…
Descriptors: Algorithms, Feedback, Matrices
Peer reviewedEnders, Craig K. – Structural Equation Modeling, 2001
Provides a comprehensive, nontechnical overview of the three maximum likelihood algorithms available for use with missing data and discusses multiple imputation, frequently used in conjunction with the EM algorithm. (SLD)
Descriptors: Algorithms, Maximum Likelihood Statistics
Peer reviewedShipley, Bill – Structural Equation Modeling, 2002
Describes a method for choosing rejection probabilities for the tests of independence that are used in constraint-based algorithms of exploratory path analysis. The method consists of generating a Markov or semi-Markov model from the equivalence class represented by a partial ancestral graph and then testing the d-separation implications. (SLD)
Descriptors: Algorithms, Markov Processes, Path Analysis
