Arrow Research search

Author name cluster

John S. Breese

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

13 papers
2 author rows

Possible papers

13

UAI Conference 1998 Conference Paper

Empirical Analysis of Predictive Algorithms for Collaborative Filtering

  • John S. Breese
  • David Heckerman
  • Carl Myers Kadie

Collaborative filtering or recommender systems use a database about user preferences to predict additional topics or products a new user might like. In this paper we describe several algorithms designed for this task, including techniques based on correlation coefficients, vector-based similarity calculations, and statistical Bayesian methods. We compare the predictive accuracy of the various methods in a set of representative problem domains. We use two basic classes of evaluation metrics. The first characterizes accuracy over a set of individual predictions in terms of average absolute deviation. The second estimates the utility of a ranked list of suggested items. This metric uses an estimate of the probability that a user will see a recommendation in an ordered list. Experiments were run for datasets associated with 3 application areas, 4 experimental protocols, and the 2 evaluation metrics for the various algorithms. Results indicate that for a wide range of conditions, Bayesian networks with decision trees at each node and correlation methods outperform Bayesian-clustering and vector-similarity methods. Between correlation and Bayesian networks, the preferred method depends on the nature of the dataset, nature of the application (ranked versus one-by-one presentation), and the availability of votes with which to make predictions. Other considerations include the size of database, speed of predictions, and learning time.

UAI Conference 1998 Conference Paper

The Lumière Project: Bayesian User Modeling for Inferring the Goals and Needs of Software Users

  • Eric Horvitz
  • John S. Breese
  • David Heckerman
  • David Hovel
  • Koos Rommelse

The Lumiere Project centers on harnessing probability and utility to provide assistance to computer software users. We review work on Bayesian user models that can be employed to infer a users needs by considering a user's background, actions, and queries. Several problems were tackled in Lumiere research, including (1) the construction of Bayesian models for reasoning about the time-varying goals of computer users from their observed actions and queries, (2) gaining access to a stream of events from software applications, (3) developing a language for transforming system events into observational variables represented in Bayesian user models, (4) developing persistent profiles to capture changes in a user expertise, and (5) the development of an overall architecture for an intelligent user interface. Lumiere prototypes served as the basis for the Office Assistant in the Microsoft Office '97 suite of productivity applications.

UAI Conference 1996 Conference Paper

Decision-Theoretic Troubleshooting: A Framework for Repair and Experiment

  • John S. Breese
  • David Heckerman

We develop and extend existing decision-theoretic methods for troubleshooting a nonfunctioning device. Traditionally, diagnosis with Bayesian networks has focused on belief updating---determining the probabilities of various faults given current observations. In this paper, we extend this paradigm to include taking actions. In particular, we consider three classes of actions: (1) we can make observations regarding the behavior of a device and infer likely faults as in traditional diagnosis, (2) we can repair a component and then observe the behavior of the device to infer likely faults, and (3) we can change the configuration of the device, observe its new behavior, and infer the likelihood of faults. Analysis of latter two classes of troubleshooting actions requires incorporating notions of persistence into the belief-network formalism used for probabilistic inference.

UAI Conference 1995 Conference Paper

Automating Computer Bottleneck Detection with Belief Nets

  • John S. Breese
  • Russ Blake

We describe an application of belief networks to the diagnosis of bottlenecks in computer systems. The technique relies on a high-level functional model of the interaction between application workloads, the Windows NT operating system, and system hardware. Given a workload description, the model predicts the values of observable system counters available from the Windows NT performance monitoring tool. Uncertainty in workloads, predictions, and counter values are characterized with Gaussian distributions. During diagnostic inference, we use observed performance monitor values to find the most probable assignment to the workload parameters. In this paper we provide some background on automated bottleneck detection, describe the structure of the system model, and discuss empirical procedures for model calibration and verification. Part of the calibration process includes generating a dataset to estimate a multivariate Gaussian error model. Initial results in diagnosing bottlenecks are presented.

UAI Conference 1994 Conference Paper

A New Look at Causal Independence

  • David Heckerman
  • John S. Breese

Heckerman (1993) defined causal independence in terms of a set of temporal conditional independence statements. These statements formalized certain types of causal interaction where (1) the effect is independent of the order that causes are introduced and (2) the impact of a single cause on the effect does not depend on what other causes have previously been applied. In this paper, we introduce an equivalent a temporal characterization of causal independence based on a functional representation of the relationship between causes and the effect. In this representation, the interaction between causes and effect can be written as a nested decomposition of functions. Causal independence can be exploited by representing this decomposition in the belief network, resulting in representations that are more efficient for inference than general causal models. We present empirical results showing the benefits of a causal-independence representation for belief-network inference.

KER Journal 1992 Journal Article

From knowledge bases to decision models

  • Michael P. Wellman
  • John S. Breese
  • Robert P. Goldman

Abstract In recent years there has been a growing interest among AI researchers in probabilistic and decision modelling, spurred by significant advances in representation and computation with network modelling formalisms. In applying these techniques to decision support tasks, fixed network models have proven to be inadequately expressive when a broad range of situations must be handled. Hence many researchers have sought to combine the strengths of flexible knowledge representation languages with the normative status and well-understood computational properties of decision-modelling formalisms and algorithms. One approach is to encode general knowledge in an expressive language, then dynamically construct a decision model for each particular situation or problem instance. We have developed several systems adopting this approach, which illustrate a variety of interesting techniques and design issues.

UAI Conference 1990 Conference Paper

Ideal reformulation of belief networks

  • John S. Breese
  • Eric Horvitz

The intelligent reformulation or restructuring of a belief network can greatly increase the efficiency of inference. However, time expended for reformulation is not available for performing inference. Thus, under time pressure, there is a tradeoff between the time dedicated to reformulating the network and the time applied to the implementation of a solution. We investigate this partition of resources into time applied to reformulation and time used for inference. We shall describe first general principles for computing the ideal partition of resources under uncertainty. These principles have applicability to a wide variety of problems that can be divided into interdependent phases of problem solving. After, we shall present results of our empirical study of the problem of determining the ideal amount of time to devote to searching for clusters in belief networks. In this work, we acquired and made use of probability distributions that characterize (1) the performance of alternative heuristic search methods for reformulating a network instance into a set of cliques, and (2) the time for executing inference procedures on various belief networks. Given a preference model describing the value of a solution as a function of the delay required for its computation, the system selects an ideal time to devote to reformulation.

UAI Conference 1989 Conference Paper

Interval Influence Diagrams

  • Kenneth W. Fertig
  • John S. Breese

We describe a mechanism for performing probabilistic reasoning in influence diagrams using interval rather than point valued probabilities. We derive the procedures for node removal (corresponding to conditional expectation) and arc reversal (corresponding to Bayesian conditioning) in influence diagrams where lower bounds on probabilities are stored at each node. The resulting bounds for the transformed diagram are shown to be optimal within the class of constraints on probability distributions that can be expressed exclusively as lower bounds on the component probabilities of the diagram. Sequences of these operations can be performed to answer probabilistic queries with indeterminacies in the input and for performing sensitivity analysis on an influence diagram. The storage requirements and computational complexity of this approach are comparable to those for point-valued probabilistic inference mechanisms, making the approach attractive for performing sensitivity analysis and where probability information is not available. Limited empirical data on an implementation of the methodology are provided.

UAI Conference 1989 Conference Paper

Software Tools for Uncertain Reasoning: An Introduction

  • John S. Breese

The three papers in this section address a common thread: the development of operable software systems which do reasoning under uncertainty. It is clear that such systems will necessarily be embedded within a larger mosaic of system design issues than are typically addressed in research forums on uncertainty in artificial intelligence. Each paper in this section provides its own perspective on issues of development, delivery, and integration. The paper by Bonissone discusses the Dynamic Classification Problem and in rapid fire addresses a host of issues associated with developing and deploying an uncertain reasoning system. The paper by Booker et. al. also examines development of a classification problem solver (BaRT) from a Bayesian perspective. Like Bonissone, the BaRT team recognizes the need for integrating multiple representations in the reasoner. The final paper in this section by Bradshaw et. a/. addresses integration of a knowledge acquisition tool into a decision analysis environment. This paper also begins to address the issue of model-building in uncertain reasoning system based on the preferences, information, and alternatives of a specific user and problem instance. This section highlights system design issues which encompass an uncertainty management method. Topics in knowledge acquisition, representation, integration, compilation, presentation, and user interface have at least as much effect on the overall usefulness of a reasoning system as the formal characteristics of the underlying uncertainty mechanism. As research in uncertainty in artificial intelligence achieves some clarity on the characteristics of available alternative uncertainty formalisms, it is hoped that these papers will initiate a trend in research on implementation and delivery of uncertain reasoners in complex environments.

v2026.09.13