An Approximate Nonmyopic Computation for Value of Information
IEEE Transactions on Pattern Analysis and Machine Intelligence
Machine Learning
Inference in Hybrid Networks: Theoretical Limits and Practical Algorithms
UAI '01 Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence
Feature Selection Algorithms: A Survey and Experimental Evaluation
ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
Learning diagnostic policies from examples by systematic search
UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
Model-driven data acquisition in sensor networks
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Complexity results and approximation strategies for MAP explanations
Journal of Artificial Intelligence Research
Active learning with statistical models
Journal of Artificial Intelligence Research
The computational complexity of probabilistic planning
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
Myopic value of information in influence diagrams
UAI'97 Proceedings of the Thirteenth conference on Uncertainty in artificial intelligence
Intelligent light control using sensor networks
Proceedings of the 3rd international conference on Embedded networked sensor systems
Effective label acquisition for collective classification
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Finding Minimum Data Requirements Using Pseudo-independence
WI-IAT '08 Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 02
Near-optimal observation selection using submodular functions
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Optimal testing of structured knowledge
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
Reflect and correct: A misclassification prediction approach to active inference
ACM Transactions on Knowledge Discovery from Data (TKDD)
Optimal value of information in graphical models
Journal of Artificial Intelligence Research
Online distributed sensor selection
Proceedings of the 9th ACM/IEEE International Conference on Information Processing in Sensor Networks
Efficient sensor selection for active information fusion
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics - Special issue on game theory
Paradoxes in Learning and the Marginal Value of Information
Decision Analysis
Sensitivity analysis and explanations for robust query evaluation in probabilistic databases
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Observer effect from stateful resources in agent sensing
Autonomous Agents and Multi-Agent Systems
Efficiently gathering information in costly domains
Decision Support Systems
| Hi-index | 0.00 |
Many real-world decision making tasks require us to choose among several expensive observations. In a sensor network, for example, it is important to select the subset of sensors that is expected to provide the strongest reduction in uncertainty. It has been general practice to use heuristic-guided procedures for selecting observations. In this paper, we present the first efficient optimal algorithms for selecting observations for a class of graphical models containing Hidden Markov Models (HMMs). We provide results for both selecting the optimal subset of observations, and for obtaining an optimal conditional observation plan. For both problems, we present algorithms for the filtering case, where only observations made in the past are taken into account, and the smoothing case, where all observations are utilized. Furthermore we prove a surprising result: In most graphical models tasks, if one designs an efficient algorithm for chain graphs, such as HMMs, this procedure can be generalized to polytrees. We prove that the value of information problem is NPPP-hard even for discrete polytrees. It also follows from our results that even computing conditional entropies, which are widely used to measure value of information, is a #P-complete problem on polytrees. Finally, we demonstrate the effectiveness of our approach on several real-world datasets.