• DocumentCode
    2955486
  • Title

    Using Markov Models to Find Interesting Patient Pathways

  • Author

    Mcclean, Sally ; Garg, Lalit ; Meenan, Brian ; Millard, Peter

  • Author_Institution
    Univ. of Ulster, Derry
  • fYear
    2007
  • fDate
    20-22 June 2007
  • Firstpage
    713
  • Lastpage
    718
  • 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.
  • Keywords
    biology computing; medical administrative data processing; Markov models; administrative database; geriatric patients; healthcare process improvement technologies; patient pathways; Absorption; Costs; Data mining; Databases; Geriatrics; Hospitals; Manufacturing; Medical services; Pattern recognition; Six sigma;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer-Based Medical Systems, 2007. CBMS '07. Twentieth IEEE International Symposium on
  • Conference_Location
    Maribor
  • ISSN
    1063-7125
  • Print_ISBN
    0-7695-2905-4
  • Type

    conf

  • DOI
    10.1109/CBMS.2007.121
  • Filename
    4262732