A KNOWLEDGE-BASED DSS FOR MANAGERIAL PROBLEM DIAGNOSIS

A knowledge-based system supporting managerial problem diagnosis is described. The system provides the capability to monitor values of selected variables for problem situations. When problems are located, a list of problem symptoms is delivered to a problem processor for structuring and diagnosis. Problem structuring is based on a combination of concepts from expert systems and structural modeling. User assertions about cause-effect relationships between pairs of variables are maintained in a semantic network. Problem diagnosis uses the relationships in the semantic network to construct causation trees, the branches of which represent potential explanations of the problem symptoms. Mathematical models are constructed based on causation-tree branches, and values from the data base are used to test whether the model confirms the diagnosis. If so, the source of the problem has been located and it is then up to the user to resolve the problem. If the model fails to explain the problem, the model apparently is deficient and the user may perform “what if…” type scenarios in attempts to improve the model and search for problem causes. Realistic applications in the accounting and health care areas are discussed.     

Applications and Implementation DECISION SUPPORT SYSTEMS: AN EMPIRICAL ASSESSMENT FOR DECISION MAKING

A laboratory experiment examined the effects of applying decision support system (DSS) technology to decision making in ill-structured problem environments under varying information conditions. Marketing executives participated in the experiment which investigated the effects of DSS availability, DSS training, and data availability on dependent variables that included: (1) the number of alternatives considered by a subject during decision making, (2) the period of time spent by a subject to complete the decision-making process, (3) the subject's perceived confidence in the decisions he or she had made, (4) the amount of data considered by a subject's during decision making, (5) the individual subject's decision processing, and (6) the subject's performance overall. Our results indicate that all three factors significantly affect the number of alternatives considered by subjects during the decision-making process. We therefore suggest that DSS training be coordinated with decision training in order to realize the potential of DSSs as described in the DSS literature.     

A UNIVERSITY EXAMINATION-SCHEDULING MODEL TO MINIMIZE MULTIPLE-EXAMINATION DAYS FOR STUDENTS

Scheduling university examinations is often done with the objective of spreading a student's required examinations over an examination week. That is the equivalent of the problem of minimizing the number of examinations a student must take on any one day. An approach to scheduling exams which relates the problem to the classical assignment problem is discussed. The model developed is a symmetry-constrained assignment model, and the solution method requires use of a branch-and-bound algorithm. Results from application of the algorithm to six semesters of actual data are presented.     

On the Critical Value Behaviour of Multiple Decision Procedures

In this paper we investigate the asymptotic critical value behaviour of certain multiple decision procedures as e.g. simultaneous confidence intervals and simultaneous as well as stepwise multiple test procedures. Supposing that n hypotheses or parameters of interest are under consideration we investigate the critical value behaviour when n increases. More specifically, we answer e.g. the question by which amount the lengths of confidence intervals increase when an additional parameter is added to the statistical analysis. Furthermore, critical values of different multiple decision procedures as for instance step-down and step-up procedures will be compared. Some general theoretic results are derived and applied for various distributions.     

Asymptotic Bias in Parameter Estimation of AR-Processes Using Recursive Least Squares with Exponential Forgetting

The recursive least squares technique is often extended with exponential forgetting as a tool for parameter estimation in time-varying systems. The distribution of the resulting parameter estimates is, however, unknown when the forgetting factor is less than one. In this paper an approximative expression for bias of the recursively obtained parameter estimates in a time-invariant AR( n_a ) process with arbitrary noise is given, showing that the bias is non-zero and giving bounds on the approximation errors. Simulations confirm the approximation expressions.     

On predictive distributions and Bayesian networks

In this paper we are interested in discrete prediction problems for a decision-theoretic setting, where the task is to compute the predictive distribution for a finite set of possible alternatives. This question is first addressed in a general Bayesian framework, where we consider a set of probability distributions defined by some parametric model class. Given a prior distribution on the model parameters and a set of sample data, one possible approach for determining a predictive distribution is to fix the parameters to the instantiation with the maximum a posteriori probability. A more accurate predictive distribution can be obtained by computing the evidence (marginal likelihood), i.e., the integral over all the individual parameter instantiations. As an alternative to these two approaches, we demonstrate how to use Rissanen's new definition of stochastic complexity for determining predictive distributions, and show how the evidence predictive distribution with Jeffrey's prior approaches the new stochastic complexity predictive distribution in the limit with increasing amount of sample data. To compare the alternative approaches in practice, each of the predictive distributions discussed is instantiated in the Bayesian network model family case. In particular, to determine Jeffrey's prior for this model family, we show how to compute the (expected) Fisher information matrix for a fixed but arbitrary Bayesian network structure. In the empirical part of the paper the predictive distributions are compared by using the simple tree-structured Naive Bayes model, which is used in the experiments for computational reasons. The experimentation with several public domain classification datasets suggest that the evidence approach produces the most accurate predictions in the log-score sense. The evidence-based methods are also quite robust in the sense that they predict surprisingly well even when only a small fraction of the full training set is used.