IDEAS home Printed from https://ideas.repec.org/p/osf/socarx/f5n8k.html
   My bibliography  Save this paper

Clustering Longitudinal Life-Course Sequences using Mixtures of Exponential-Distance Models

Author

Listed:
  • Murphy, Keefe

    (University College Dublin)

  • Murphy, Brendan
  • Piccarreta, Raffaella
  • Gormley, Isobel Claire

Abstract

Sequence analysis is an increasingly popular approach for the analysis of life courses represented by an ordered collection of activities experienced by subjects over a given time period. Several criteria exist for measuring pairwise dissimilarities among sequences. Typically, dissimilarity matrices are employed as input to heuristic clustering algorithms, with the aim of identifying the most relevant patterns in the data. Here, we propose a model-based clustering approach for categorical sequence data. The technique is applied to a survey data set containing information on the career trajectories of a cohort of Northern Irish youths tracked between the ages of 16 and 22. Specifically, we develop a family of methods for clustering sequences directly, based on mixtures of exponential-distance models, which we call MEDseq. The use of the Hamming distance or weighted variants thereof as the distance metrics permits closed-form expressions for the normalising constant, thereby facilitating the development of an ECM algorithm for model fitting. Additionally, MEDseq models allow the probability of component membership to depend on fixed covariates. Sampling weights, which are often associated with life-course data arising from surveys, are also accommodated. Simultaneously including weights and covariates in the clustering process yields new insights on the Northern Irish data.

Suggested Citation

  • Murphy, Keefe & Murphy, Brendan & Piccarreta, Raffaella & Gormley, Isobel Claire, 2019. "Clustering Longitudinal Life-Course Sequences using Mixtures of Exponential-Distance Models," SocArXiv f5n8k, Center for Open Science.
    • Handle: RePEc:osf:socarx:f5n8k
    DOI: 10.31219/osf.io/f5n8k
    as

    Download full text from publisher

    File URL: https://osf.io/download/5de7c691e1e62f000a334c46/
    Download Restriction: no
    File URL: https://libkey.io/10.31219/osf.io/f5n8k?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
    ---><---

    References listed on IDEAS

    as
    1. Murphy, Thomas Brendan & Martin, Donal, 2003. "Mixtures of distance-based models for ranking data," Computational Statistics & Data Analysis, Elsevier, vol. 41(3-4), pages 645-655, January.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Mark S. Handcock & Adrian E. Raftery & Jeremy M. Tantrum, 2007. "Model‐based clustering for social networks," Journal of the Royal Statistical Society Series A, Royal Statistical Society, vol. 170(2), pages 301-354, March.
    2. Isobel Claire Gormley & Thomas Brendan Murphy, 2006. "Analysis of Irish third‐level college applications data," Journal of the Royal Statistical Society Series A, Royal Statistical Society, vol. 169(2), pages 361-379, March.
    3. Marie-Louise Lackner & Martin Lackner, 2017. "On the likelihood of single-peaked preferences," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 48(4), pages 717-745, April.
    4. Lee, Paul H. & Yu, Philip L.H., 2012. "Mixtures of weighted distance-based models for ranking data with applications in political studies," Computational Statistics & Data Analysis, Elsevier, vol. 56(8), pages 2486-2500.
    5. Pierpaolo D’Urso & Vincenzina Vitale, 2022. "A Kemeny Distance-Based Robust Fuzzy Clustering for Preference Data," Journal of Classification, Springer;The Classification Society, vol. 39(3), pages 600-647, November.
    6. D'Elia, Angela & Piccolo, Domenico, 2005. "A mixture model for preferences data analysis," Computational Statistics & Data Analysis, Elsevier, vol. 49(3), pages 917-934, June.
    7. Lee, Paul H. & Yu, Philip L.H., 2010. "Distance-based tree models for ranking data," Computational Statistics & Data Analysis, Elsevier, vol. 54(6), pages 1672-1682, June.
    8. Irurozki, Ekhine & Calvo, Borja & Lozano, Jose A., 2016. "PerMallows: An R Package for Mallows and Generalized Mallows Models," Journal of Statistical Software, Foundation for Open Access Statistics, vol. 71(i12).
    9. Antonio D’Ambrosio & Willem J. Heiser, 2016. "A Recursive Partitioning Method for the Prediction of Preference Rankings Based Upon Kemeny Distances," Psychometrika, Springer;The Psychometric Society, vol. 81(3), pages 774-794, September.
    10. Biernacki, Christophe & Jacques, Julien, 2013. "A generative model for rank data based on insertion sort algorithm," Computational Statistics & Data Analysis, Elsevier, vol. 58(C), pages 162-176.
    11. Keefe Murphy & T. Brendan Murphy & Raffaella Piccarreta & I. Claire Gormley, 2021. "Clustering longitudinal life‐course sequences using mixtures of exponential‐distance models," Journal of the Royal Statistical Society Series A, Royal Statistical Society, vol. 184(4), pages 1414-1451, October.
    12. Cascón, J.M. & González-Arteaga, T. & de Andrés Calle, R., 2022. "A new preference classification approach: The λ-dissensus cluster algorithm," Omega, Elsevier, vol. 111(C).
    13. Bohning, Dankmar & Seidel, Wilfried, 2003. "Editorial: recent developments in mixture models," Computational Statistics & Data Analysis, Elsevier, vol. 41(3-4), pages 349-357, January.
    14. Antonio D’Ambrosio & Carmela Iorio & Michele Staiano & Roberta Siciliano, 2019. "Median constrained bucket order rank aggregation," Computational Statistics, Springer, vol. 34(2), pages 787-802, June.
    15. Antoine Rolland & Jean-Baptiste Aubin & Irène Gannaz & Samuela Leoni, 2024. "Probabilistic models of profiles for voting by evaluation," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 63(2), pages 377-400, September.
    16. Amodio, S. & D’Ambrosio, A. & Siciliano, R., 2016. "Accurate algorithms for identifying the median ranking when dealing with weak and partial rankings under the Kemeny axiomatic approach," European Journal of Operational Research, Elsevier, vol. 249(2), pages 667-676.
    17. Ekhine Irurozki & Borja Calvo & Jose A. Lozano, 2018. "Sampling and Learning Mallows and Generalized Mallows Models Under the Cayley Distance," Methodology and Computing in Applied Probability, Springer, vol. 20(1), pages 1-35, March.

    More about this item

    Statistics

    Access and download statistics

    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:osf:socarx:f5n8k. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: OSF (email available below). General contact details of provider: https://arabixiv.org .

    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.