Some Necessary Conditions for Common-Factor Analysis  

Oleh:

Guttman, Louis

Jenis: Article from Journal - e-Journal
Dalam koleksi: Psychometrika: A Journal of Quantitative Psychology vol. 19 no. 2 (Jun. 1954), page 149-161.
Topik: Unknown Communalities and Uniquenesses; Null Hypotheses; Non-negative Index of a Real Symmetric Matrix; Three Lower Bounds; Frequency Distribution of the Latent Roots of R; Infinite Universe of Variable
Fulltext: Vol 19 No 2 June 1954 p.149-161.pdf (568.53KB)

Isi artikel

LetR be any correlation matrix of ordern, with unity as each main diagonal element. Common-factor analysis, in the Spearman-Thurstone sense, seeks a diagonal matrixU 2 such thatG = R - U 2 is Gramian and of minimum rankr. Lets 1 be the number of latent roots ofR which are greater than or equal to unity. Then it is proved here thatr ?s 1. Two further lower bounds tor are also established that are better thans 1. Simple computing procedures are shown for all three lower bounds that avoid any calculations of latent roots. It is proved further that there are many cases where the rank of all diagonal-free submatrices inR is small, but the minimum rankr for a GramianG is nevertheless very large compared withn. Heuristic criteria are given for testing the hypothesis that a finiter exists for the infinite universe of content from which the sample ofn observed variables is selected; in many cases, the Spearman-Thurstone type of multiple common-factor structure cannot hold.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali