Please use this identifier to cite or link to this item:
https://www.um.edu.mt/library/oar/handle/123456789/24960
Title: | Using Markov models to find interesting patient pathways |
Authors: | McClean, Sally Garg, Lalit Meenan, Brian Millard, Peter |
Keywords: | Markov processes Cerebrovascular disease -- Patients Hospital utilization -- Length of stay |
Issue Date: | 2007 |
Publisher: | Institute of Electrical and Electronics Engineers Inc. |
Citation: | McClean, S., Garg, L., Meenan, B., & Millard, P. (2007). Using Markov models to find interesting patient pathways. Twentieth IEEE International Symposium on Computer-Based Medical Systems, Maribor. 1-6. |
Abstract: | Over recent years the concept of Interestingness has come to underpin Data Mining, leading to the discovery of much new knowledge. In particular recognition of interesting patient pathways can lead to the discovery of important rules and patterns such as high probability pathways, groups of patients who incur exceptional high costs or pathways that are very long lasting. In the current paper we show how Markov models can be used to identify such patient pathways. Using Markov modelling we show how patient pathways may be extracted and describe an algorithm based on branch and bound that we have developed to efficiently extract a number of interesting pathways, subject to the number of pathways required, or some other criterion being specified. The approach is illustrated using data on geriatric patients from an administrative database of a London hospital, and we identify interesting pathways for geriatric patients. Such an approach might be used in association with healthcare process improvement technologies, such as Lean Thinking or Six Sigma. |
URI: | https://www.um.edu.mt/library/oar//handle/123456789/24960 |
Appears in Collections: | Scholarly Works - FacICTCIS |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
04262732.pdf Restricted Access | 255.25 kB | Adobe PDF | View/Open Request a copy |
Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.