Adding value to induced decision trees for time-sensitive data

Catherine K. Murphy, Michel Benaroch

Research output: Contribution to journalArticle

5 Scopus citations

Abstract

Rule induction serves as an alternative knowledge acquisition method in the development of expert systems. This research presents ways to increase the information in induced decision trees, which convert to rules. Common rule induction methods do not organize data by time; however, time is a factor in many common induction applications, such as bankruptcy prediction and credit evaluation. Utilizing the time sequences in data can result in a more valuable decision support tool. This article extends rule induction algorithms to handle such data. It also illustrates the value of staged induction for a new real-world application: predicting hospital patients' length of stay. In the hospital application, the goal is to identify, as early as possible, patients likely to have an excessive length of stay, based on data gathered at admission and data that arrives gradually during the hospitalization period. In the context of this application, this article attempts to resolve conflicting results In the literature in two areas: 1) selecting attributes by the improvement in classification cost which they produce, and 2) stopping versus pruning in tree development. One conclusion is that selection and pruning by cost do not increase the average value of induced trees in this application.

Original languageEnglish (US)
Pages (from-to)385-396
Number of pages12
JournalINFORMS Journal on Computing
Volume9
Issue number4
DOIs
StatePublished - Jan 1 1997

Keywords

  • Induced decision trees
  • Induction

ASJC Scopus subject areas

  • Software
  • Information Systems
  • Computer Science Applications
  • Management Science and Operations Research

Fingerprint Dive into the research topics of 'Adding value to induced decision trees for time-sensitive data'. Together they form a unique fingerprint.

  • Cite this