Clustering of timed sequences -- Application to the analysis of care pathways

Thomas Guyet, Pierre Pinson, Enoal Gesny
4/23/2024
cs.LGcs.AI

No confident code implementation found for this paper.

Abstract

Improving the future of healthcare starts by better understanding the current actual practices in hospital settings. This motivates the objective of discovering typical care pathways from patient data. Revealing typical care pathways can be achieved through clustering. The difficulty in clustering care pathways, represented by sequences of timestamped events, lies in defining a semantically appropriate metric and clustering algorithms. In this article, we adapt two methods developed for time series to the clustering of timed sequences: the drop-DTW metric and the DBA approach for the construction of averaged time sequences. These methods are then applied in clustering algorithms to propose original and sound clustering algorithms for timed sequences. This approach is experimented with and evaluated on synthetic and real-world data.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{guyet2024clustering,
  title  = {Clustering of timed sequences -- Application to the analysis of care pathways},
  author = {Thomas Guyet and Pierre Pinson and Enoal Gesny},
  year   = {2024},
  eprint = {2404.15379},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2404.15379v3}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2404.15379.svg)](https://codeofpaper.com/paper/2404.15379)

Discussion