Adaptive Decision Support Systems via Problem Processor Learning

  • W. Holsapple C
  • Jacob V
  • Pakath R
  • et al.
N/ACitations
Citations of this article
13Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this chapter, we describe the potential advantages of developing adaptive decision support systems (adaptive DSSs) for the efficient and/or effective solution of problems in complex domains. The problem processing components of DSSs that subscribe to existing DSS paradigms typically utilize supervised learning strategies to acquire problem processing knowledge (PPK). On the other hand, the problem processor of an adaptive DSS utilizes unsupervised inductive learning, perhaps in addition to other forms of learning, to acquire some of the necessary PPK. Thus, adaptive DSSs are, to some extent, self-teaching systems with less reliance on external agents for PPK acquisition. To illustrate these notions, we examine an application in the domain concerned with the scheduling of jobs in flexible manufacturing systems (FMSs). We provide an architectural description for an adaptive DSS for supporting static scheduling decisions in FMSs and illustrate key problem processing features of the system using an example.

Cite

CITATION STYLE

APA

W. Holsapple, C., Jacob, V. S., Pakath, R., & Zaveri, J. S. (2008). Adaptive Decision Support Systems via Problem Processor Learning. In Handbook on Decision Support Systems 1 (pp. 659–696). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-48713-5_30

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free