Hostname: page-component-6bf8c574d5-n2sc8 Total loading time: 0 Render date: 2025-03-07T02:52:06.493Z Has data issue: false hasContentIssue false
  • English
  • Français

A Method for Clustering Eigenvalues

Published online by Cambridge University Press:  01 January 2025

Larry Irwin
Larry Irwin*
Affiliation:
Systems Research Laboratories
Get access Rights & Permissions [Opens in a new window]

Abstract

A method of computing communalities is presented which attempts to cluster eigenvalues about zero. Results are exhibited which show reduction of rank using computed communalities.

Type
Original Paper
Information
Psychometrika , Volume 31 , Issue 1 , March 1966 , pp. 11 - 16
Copyright
Copyright © 1966 Psychometric Society

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Footnotes

*

This paper is based on work performed under Contract AF 30(602)-3300 monitored for the U. S. Air Force by Mr. Rocco Iuorno, Rome Air Development Center. The use, under the above contract, of the IBM 7094 computer located at Aeronautical Systems Division, Wright-Patterson Air Force Base, is gratefully acknowledged. Permission is granted for reproduction, translation, publication, use, and disposal in whole and in part by or for the United States Government.

References

Guttman, L. “Best possible” systematic estimates of communalities. Psychometrika, 1956, 21, 273–286.CrossRefGoogle Scholar
Guttman, L. Simple proofs of relations between the communality problem and multiple correlation. Psychometrika, 1957, 22, 147–157.CrossRefGoogle Scholar
Harman, H. H. Modern factor analysis, Chicago: Univ. Chicago Press, 1960.Google Scholar
Wilf, H. S. Mathematics for the physical sciences, New York: Wiley, 1962.Google Scholar