Locating and evaluating relationships among values in multiple streams of data is a difficult and important task. Consider the data flowing from monitors in an intensive care unit. Readings from various subsets of the monitors are indicative and predictive of certain aspects of the patient’s state. We present an algorithm that facilitates discovery and assessment of the strength of such predictive relationships called Multi-stream Dependency Detection (MSDD). We use heuristic search to guide our exploration of the space of potentially interesting dependencies to uncover those that are significant. We begin by reviewing the dependency detection technique described in [3], and extend it to the multiple stream case, describing in detail our heuristic search over the space of possible dependencies. Quantitative evidence for the utility of our approach is provided through a series of experiments with artificially-generated data. In addition, we present results from the application of our algorithm to two real problem domains: feature-based classification and prediction of pathologies in a simulated shipping network.
[1]
O. Mangasarian,et al.
Robust linear programming discrimination of two linearly inseparable sets
,
1992
.
[2]
Sebastian Thrun,et al.
The MONK''s Problems-A Performance Comparison of Different Learning Algorithms, CMU-CS-91-197, Sch
,
1991
.
[3]
T. Oates.
MSDD as a Tool for Classi cation
,
1994
.
[4]
Jason Catlett,et al.
Experiments on the Costs and Benefits of Windowing in ID3
,
1988,
ML.
[5]
Paul R. Cohen,et al.
Understanding Planner Behavior
,
1995,
Artif. Intell..
[6]
Adele E. Howe.
Accepting the inevitable: the role of failure recovery in the design of planners
,
1993
.
[7]
Paul R. Cohen,et al.
Toward a Plan Steering Agent: Experiments with Schedule Maintenance
,
1994,
AIPS.