Finding mixed memberships in categorical data

• Published in: arXiv.org
• Main Author: Qing, Huan
• Format: Paper Journal Article
• Language: English
• Published: Ithaca Cornell University Library, arXiv.org 05.06.2024
• Subjects: Algorithms; Computer Science - Social and Information Networks; Data analysis; Memberships; Singular value decomposition
• ISSN: 2331-8422
• DOI: 10.48550/arxiv.2312.01565

Latent class analysis, a fundamental problem in categorical data analysis, often encounters overlapping latent classes that introduce further challenges. This paper presents a solution to this problem by focusing on finding latent mixed memberships of subjects in categorical data with polytomous responses. We employ the Grade of Membership (GoM) model, which assigns each subject a membership score in each latent class. To address this, we propose two efficient spectral algorithms for estimating these mixed memberships and other GoM parameters. Our algorithms are based on the singular value decomposition of a regularized Laplacian matrix. We establish their convergence rates under a mild condition on data sparsity. Additionally, we introduce a metric to evaluate the quality of estimated mixed memberships for real-world categorical data and determine the optimal number of latent classes based on this metric. Finally, we demonstrate the practicality of our methods through experiments on both computer-generated and real-world categorical datasets.