Near-optimal nonmyopic value of information in graphical models

Proceedings of the 21st Conference on Uncertainty in Artificial Intelligence, UAI 2005

Volumn , Issue , 2005, Pages 324-331

  Krause, Andreas ^a   Guestrin, Carlos ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPLEX NETWORKS; GRAPHIC METHODS; SENSOR NETWORKS;

CONSTANT FACTOR APPROXIMATION; POLYNOMIAL BOUNDS; POLYNOMIAL-TIME ALGORITHMS; RANDOMIZED ALGORITHMS; REAL-WORLD DATASETS; REAL-WORLD SYSTEM; SUBMODULAR FUNCTIONS; VALUE OF INFORMATION;

POLYNOMIAL APPROXIMATION;

EID: 67650691734     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. V. Bayer-Zubek. Learning diagnostic policies from examples by systematic search. In UAI, 2004.
2. T. M. Cover and J. A. Thomas. Elements of Information Theory. Wiley Interscience, 1991.
3. A. Deshpande, C. Guestrin, S. Madden, J. Hellerstein, and W. Hong. Model-driven data acquisition in sensor networks. In VLDB, 2004.
4. S. Dittmer and F. Jensen. Myopic value of information in influence diagrams. In UAI, pages 142-149, 1997.
5. U. Feige. A threshold of ln n for approximating set cover. Journal of the ACM, 45(4):634-652, July 1998. (Pubitemid 128488790)
6. S. Fujishige. Polymatroidal dependence structure of a set of random variables. Inform. Contr., 39:55-72, 1978. (Pubitemid 9408951)
7. B. Goldengorin, G. Tijssen, and M. Tso. The maximization of submodular functions. Technical report, University of Groningen, Research Institute SOM, 1999.
8. C. Guestrin, A. Krause, and A. Singh. Near-optimal sensor placements in gaussian processes. In CMU-CALD-05-102, submitted to ICML 2005, 2005.
9. D. Heckerman, E. Horvitz, and B. Middleton. An approximate nonmyopic computation for value of information. IEEE TPAMI, 15:292-298, 1993.
10. W. Hoeffding. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58(301):13-30, 1963.
11. S. Khuller, A. Moss, and J. Naor. The budgeted maximum coverage problem. Inf Proc Let, 70(1):39-45, 1999.
12. S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi. Optimization by simulated annealing. Science, 220:671-680, 1983.
13. C. Ko, J. Lee, and M. Queyranne. An exact algorithm for maximum entropy sampling. OR, 43(4):684-691, 1995.
14. A. Krause and C. Guestrin. A note on the budgeted maximization of submodular functions. Technical report, CMUCALD-05-103, 2005.
15. A. Krause and C. Guestrin. Optimal nonmyopic value of information in graphical models -efficient algorithms and theoretical limits. In Proc. of IJCAI, 2005.
16. G. Nemhauser, L. Wolsey, and M. Fisher. An analysis of the approximations for maximizing submodular set functions. Mathematical Programming, 14:265-294, 1978.
17. N. Ramakrishnan, C. Bailey-Kellogg, S. Tadepalli, and V. Pandey. Gaussian processes for active data mining of spatial aggregates. In SIAM Data Mining, 2005.
18. M. Sviridenko. A note on maximizing a submodular set function subject to knapsack constraint. Operations Research Letters, 32:41-43, 2004.
19. UC Berkeley, PATH and Caltrans. Freeway performance measurement system. http://pems.eecs.berkeley.edu/.
20. L. van der Gaag and M.Wessels. Selective evidence gathering for diagnostic belief networks. AISB Q, 86:23-34, 1993.