Hostname: page-component-74656f9884-rdgjk Total loading time: 0 Render date: 2026-11-09T11:16:29.196Z Has data issue: false hasContentIssue false

Discovery Algorithms for Hierarchical Relations

Published online by Cambridge University Press:  01 January 2025

Lewis C. Price*
Affiliation:
Macro Systems, Inc.
C. Mitchell Dayton
Affiliation:
University of Maryland
George B. Macready
Affiliation:
University of Maryland
*
Requests for reprints should be sent to Lewis C. Price, Macro Systems, Inc., 8630 Fenton Street, Suite 300, Silver Spring, Maryland 20910.

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.

Information

Type
Original Paper
Copyright
Copyright © 1980 The 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.)

Article purchase

Temporarily unavailable