IDEAS home Printed from https://ideas.repec.org/a/spr/stmapp/v34y2025i1d10.1007_s10260-025-00779-z.html
   My bibliography  Save this article

Addressing topic modelling via reduced latent space clustering

Author

Listed:
  • Lorenzo Schiavon

    (Ca’ Foscari University of Venice, San Giobbe)

Abstract

In the social sciences, topic modelling is gaining increased attention for its ability to automatically uncover the underlying themes within large corpora of textual data. This process typically involves two key phases: (i) identifying the words associated with language concepts, and (ii) clustering documents that share similar word distributions. In this study, motivated by the growing interest in automatic categorisation of policy documents and regulations, we leverage recent advancements in Bayesian factor models to develop a novel topic modelling approach. This enable us to represent the high-dimensional space defined by all possible observed words through a small set of latent variables, and simultaneously cluster the documents based on their distributions over these latent constructs. Here, groups and underlying constructs are interpreted as document topics and language concepts, respectively, with the number of dimensions not required in advance. Additionally, we demonstrate the effectiveness of our approach using synthetic data, providing a comparison with existing methods in the literature. The illustration of our approach on a corpus of Italian health public plans unveils intriguing patterns concerning the semantic structures used in ageing policies and document topic similarities.

Suggested Citation

  • Lorenzo Schiavon, 2025. "Addressing topic modelling via reduced latent space clustering," Statistical Methods & Applications, Springer;Società Italiana di Statistica, vol. 34(1), pages 1-20, March.
  • Handle: RePEc:spr:stmapp:v:34:y:2025:i:1:d:10.1007_s10260-025-00779-z
    DOI: 10.1007/s10260-025-00779-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10260-025-00779-z
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10260-025-00779-z?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:stmapp:v:34:y:2025:i:1:d:10.1007_s10260-025-00779-z. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.