Article contents
Discovery Algorithms for Hierarchical Relations
Published online by Cambridge University Press: 01 January 2025
Abstract
Two algorithms based on a latent class model are presented for discovering hierarchical relations that exist among a set of K dichotomous items. The two algorithms, stepwise forward selection and backward elimination, incorporate statistical criteria for selecting (or deleting) 0-1 response pattern vectors to form the subset of the total possible 2k vectors that uniquely describe the hierarchy. The performances of the algorithms are compared, using computer-constructed data, with those of three competing deterministic approaches based on ordering theory and the calculation of Phi/Phi-max coefficients. The discovery algorithms are also demonstrated on real data sets investigated in the literature.
Keywords
- Type
- Original Paper
- Information
- Copyright
- Copyright © 1980 The Psychometric Society
References
Reference Notes
References
- 8
- Cited by