A Modified Method of Latent Class Analysis for File Organization in Information Retrieval

Authors:
William K. Winters
Affiliations:
Computer Science Center, University of Missouri at Rolla, Missouri
Venue:
Journal of the ACM (JACM)
Year:
1965

Citing 5
Cited 0

The algebraic eigenvalue problem

The algebraic eigenvalue problem
The Jacobi Method for Real Symmetric Matrices

Journal of the ACM (JACM)
Automatic Indexing: An Experimental Inquiry

Journal of the ACM (JACM)
Information Retrieval Based upon Latent Class Analysis

Journal of the ACM (JACM)
Automatic Document Classification

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

The latent class structure is modified by requiring the number of latent classes to be equal to the number of keywords. This modification changes the latent structure to one that consists of matrices that are both symmetric and positive definite, therefore making a “computer solution” both possible and practical. The modified latent structure is derived, the numerical analysis considerations for a computer solution are presented, and an example illustrates the use of the latent class structure in both file organization and retrieval.