Using graph theory to flexibly construct patient journeys in linked healthcare data

利用图论灵活构建关联医疗保健数据中的患者就诊历程

阅读:1

Abstract

INTRODUCTION: Studies of epidemiology and health system use that use linked admitted patient data benefit from understanding the patient journey, particularly when it spans multiple records within or across multiple datasets. OBJECTIVES: To develop a flexible method for grouping together administrative admitted patient records into periods of hospital care that follow patients from admission to discharge. METHODS: We describe a flexible and generalisable graph theoretic algorithm for grouping patient records into periods of hospital care. The algorithm can account for a variety of complex hospitalisation patterns involving multiple transfers and overlapping records. An R package, journeyer, that implements this algorithm, is included in the Supplementary Material. RESULTS: This algorithm was applied to the New South Wales Admitted Patient Data Collection, finding 21,405,451 periods of hospital care from 22,794,746 hospital records. The parameters and decisions required for this algorithm were assessed and found appropriate for this dataset, but we offer some advice for generalisation to other datasets. CONCLUSIONS: Our method assists in preparing data for epidemiological research in New South Wales and can be generalised to inpatient data in other jurisdictions. The method can be extended to include ambulance and emergency department data.

特别声明

1、本页面内容包含部分的内容是基于公开信息的合理引用;引用内容仅为补充信息,不代表本站立场。

2、若认为本页面引用内容涉及侵权,请及时与本站联系,我们将第一时间处理。

3、其他媒体/个人如需使用本页面原创内容,需注明“来源:[生知库]”并获得授权;使用引用内容的,需自行联系原作者获得许可。

4、投稿及合作请联系:info@biocloudy.com。