Linear programming for finite state multi-armed bandit problems
Mathematics of Operations Research
Optimal Sequential Exploration: A Binary Learning Model
Decision Analysis
Approximate Dynamic Programming: Solving the Curses of Dimensionality (Wiley Series in Probability and Statistics)
Optimal value of information in graphical models
Journal of Artificial Intelligence Research
Data clustering: 50 years beyond K-means
Pattern Recognition Letters
Explaining how to play real-time strategy games
Knowledge-Based Systems
A novel clustering approach: Artificial Bee Colony (ABC) algorithm
Applied Soft Computing
IEEE Transactions on Pattern Analysis and Machine Intelligence
| Hi-index | 0.00 |
The paper considers the problem of optimal sequential design for graphical models. Oil and gas exploration is the main application. Here, the outcomes at prospects or reservoir units are highly dependent on each other. The joint probability model for all node variables is considered known. As data is collected, this probability model is updated. The sequential design problem entails a dynamic selection of nodes for data collection, where the goal is to maximize utility, here defined via entropy or total expected profit. With a large number of nodes, the optimal solution to this selection problem is not tractable. An approximation based on a subdivision of the graph is considered. Within the small clusters the design problem can be solved exactly. The results on clusters are combined in a dynamic manner, to create sequential designs for the entire graph. The merging of clusters also gives upper bounds for the actual utility. Several synthetic models are studied, along with two real cases from the oil and gas industry. In these examples Bayesian networks or Markov random fields are used. The sequential model updating and data collection strategies provide useful guidelines to policy makers.