logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

ON TASK COMPLEXITY AND SIMPLEX CORRELATION-MATRICES

delete2007-09-27
delete4
PRE
AI
T
Tenko Raykov *
L
Lazar Stankov
DOI：10.1080/00049539308259123delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

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.
Keywords:
STRUCTURAL EQUATION MODELS
INEQUALITY CONSTRAINTS
COVARIANCE-STRUCTURES
LATENT-VARIABLES
INTELLIGENCE
PSYCHOLOGY
FIT
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Australian Journal of Psychology cover
Australian Journal of Psychology
IF:
1.6
Papers:
1.3K
Citations:
1.7K

Organization

No organization information available