.png){kind=icon}
返回
ON TASK COMPLEXITY AND SIMPLEX CORRELATION-MATRICES
.png){kind=icon}
PRE
AI
DOI：10.1080/00049539308259123.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This article is concerned with task complexity and patterns of correlation matrices. The position advocated here is that an important initial step in the study of task complexity is the choice of an appropriate explicit model. It is argued that in general an empirical ''simplex'' correlation matrix between tasks involving different levels of complexity cannot be a safe basis for inferring an increase in task complexity. Given the multitude of factors affecting sample correlation coefficients, a model-building approach to the study of task complexity is recommended in place of preoccupation with simple comparisons of the magnitude of empirical correlations between administered tests. This structural modelling approach is applied to data from Stankov (1992). For the purposes of model testing and parameter estimation, the popular structural modelling programs LISREL and COSAN are employed.
Keyword:
STRUCTURAL EQUATION MODELS
INEQUALITY CONSTRAINTS
COVARIANCE-STRUCTURES
LATENT-VARIABLES
INTELLIGENCE
PSYCHOLOGY
FIT
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
1.6
论文数:
1.3K
被引数:
1.7K
机构
暂无机构信息
引用论文
.png){kind=icon}
查看更多内容