New techniques for repertory grid analysis

Ole Johnny Liseth; James C. Bezdek; Kenneth M. Ford; Jack R. Adams-Webber

doi:10.1117/12.45455

1 March 1991 New techniques for repertory grid analysis

Ole Johnny Liseth, James C. Bezdek, Kenneth M. Ford, Jack R. Adams-Webber

Proceedings Volume 1468, Applications of Artificial Intelligence IX; (1991) https://doi.org/10.1117/12.45455
Event: Orlando '91, 1991, Orlando, FL, United States

Abstract

In this paper, two new methods of analyzing repertory grids are explored. The property of transitivity is used to help unravel latent relationships within a grid. Relationships are exposed with the help of transitive closures and principal component analysis. One method produces 'sensitivity maps' by superimposing principal component scatterplots of transitive closures of the (transformed) element (or construct) grid computed with six T-norms onto the principal component display of the original. The other method uses the well known (alpha) cut method to decompose each transitive closure into a partition tree of clusters of elements (or constructs). Both method are illustrated with a small numerical example.

Citation Download Citation

Ole Johnny Liseth, James C. Bezdek, Kenneth M. Ford, and Jack R. Adams-Webber "New techniques for repertory grid analysis", Proc. SPIE 1468, Applications of Artificial Intelligence IX, (1 March 1991); https://doi.org/10.1117/12.45455

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available