TY - JOUR
T1 - Non-homogeneous Markov models for sequential pattern mining of healthcare data
AU - Garg, L.
AU - McClean, SI
AU - Meenan, BJ
AU - Millard, P.
PY - 2009
Y1 - 2009
N2 - Sequential pattern mining has been a popular data mining technique for extracting useful information from large databases and has successfully been used for numerous industrial and commercial problems. This paper presents a new mathematical modelling application to healthcare, providing important information to health service managers and policy makers to help them identify sequential patterns which require attention for efficiently managing scarce healthcare resources and developing effective healthcare management policies. In healthcare, these sequential patterns are analogous to the patient pathways. We present a non-homogeneous Markov model for identifying not only patient pathways which have high probability but also for identifying pathways which incur high cost or time. In order to have a more realistic model, we also consider time-dependent covariates and their impact on the pathways. An algorithm based on branch and bound global optimization is presented which can efficiently extract a required number of such patient pathways of interest. The approach is illustrated using historical data on geriatric patients from an administrative database of a London hospital.
AB - Sequential pattern mining has been a popular data mining technique for extracting useful information from large databases and has successfully been used for numerous industrial and commercial problems. This paper presents a new mathematical modelling application to healthcare, providing important information to health service managers and policy makers to help them identify sequential patterns which require attention for efficiently managing scarce healthcare resources and developing effective healthcare management policies. In healthcare, these sequential patterns are analogous to the patient pathways. We present a non-homogeneous Markov model for identifying not only patient pathways which have high probability but also for identifying pathways which incur high cost or time. In order to have a more realistic model, we also consider time-dependent covariates and their impact on the pathways. An algorithm based on branch and bound global optimization is presented which can efficiently extract a required number of such patient pathways of interest. The approach is illustrated using historical data on geriatric patients from an administrative database of a London hospital.
UR - https://www.scopus.com/pages/publications/72249102675
U2 - 10.1093/imaman/dpn030
DO - 10.1093/imaman/dpn030
M3 - Article
SN - 1471-6798
VL - 20
SP - 327
EP - 344
JO - IMA Journal of Management Mathematics
JF - IMA Journal of Management Mathematics
IS - 4
ER -