Latent class analysis by regularized spectral clustering

Abstract:The latent class model is a highly effective tool in the analysis of categorical data from social, psychological, and behavioral sciences, where populations often share hidden common characteristics. In this article, we introduce two new algorithms for estimating the parameters of a latent class model for ordered categorical data with polytomous responses. These algorithms are based on a newly defined regularized Laplacian matrix derived from the response matrix. We provide theoretical convergence rates for our algorithms by considering a sparsity parameter and demonstrate that under a mild condition on data's sparsity, our algorithms yield consistent latent class analysis. Furthermore, we introduce a metric to assess the strength of latent class analysis and develop procedures based on this metric to determine the optimal number of latent classes for real-world ordered categorical data. Extensive simulation experiments demonstrate the efficiency and accuracy of our algorithms, and we demonstrate their practical application to real-world ordered categorical data with promising results.

Machine Learning (cs.LG); Machine Learning (stat.ML)

arXiv:2310.18727 [cs.LG]

(or arXiv:2310.18727v2 [cs.LG] for this version)

https://doi.org/10.48550/arXiv.2310.18727 Focus to learn more arXiv-issued DOI via DataCite

https://doi.org/10.1007/s00180-026-01772-0 Focus to learn more DOI(s) linking to related resources

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.