THE FC1 RULE OF IDENTIFICATION FOR CONFIRMATORY FACTOR-ANALYSIS - A GENERAL SUFFICIENT CONDITION
THE FC1 RULE OF IDENTIFICATION FOR CONFIRMATORY FACTOR-ANALYSIS - A GENERAL SUFFICIENT CONDITION
复制标题
DOI：
10.1177/0049124193021004001
复制
发表时间：
1993-05-01
影响因子：
6.3
通讯作者：
DAVIS, WR
中科院分区：
文献类型：
--
作者：
DAVIS, WR
建立一个验证性分析（CFA）模型的识别仍然是结构方程建模中最困难的任务之一。用代数方法证明这种模型的识别既容易出错又耗时。不幸的是，很少有通用的识别规则存在CFA模型，它们仅限于简单的模型，不允许相关的错误。本文提出了一个新的，高度普遍的，充分条件的识别CFA模型的因素复杂性为1。该规则不限制潜变量的数量或指标变量的数量，并允许极其复杂的错误结构。该测试的简易性和通用性通过识别一些实质性和hypothetical模型来证明。
Establishing the identification of a confirmatory for analysis (CFA) model continues to be one of the most difficult tasks in structural equation modeling. Proving the identification of such models algebraically is both error prone and time consuming. Unfortunately, very few general rules of identification exist for CFA models and they are limited to simple models that do not allow for correlated errors. This article presents a new, highly general, sufficient condition of identification for CFA models with a factor complexity of one. This rule places no limits on the number of latent variables or number of indicator variables and allows for extremely complex error structures The ease and generality of this test is demonstrated by identifying a number of substantive and hyothetical models.