Decision-theoretic optimal sampling in Hidden Markov Random fields

Frontiers in Artificial Intelligence and Applications

Volumn 215, Issue , 2010, Pages 687-692

  Peyrard, N ^a   Sabbadin, R ^a   Farrokh Niaz, U ^b  

^a CEMAGREF   (France)

^b UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; BUDGET CONTROL; IMAGE SEGMENTATION; PROBABILITY DISTRIBUTIONS;

DECISION-THEORETIC; FIELD II; HIDDEN MARKOV RANDOM FIELDS; MOST PROBABLE EXPLANATION; OPTIMAL SAMPLING; PROBABILISTIC KNOWLEDGE; PROBABILISTIC MODELS; REASONING PROBLEMS; SOLUTION ALGORITHMS; STRUCTURED PROBLEMS;

MARKOV PROCESSES;

EID: 77956026309     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: 10.3233/978-1-60750-606-5-687     Document Type: Conference Paper

References (20)

1. T. Asano, K. Hori, T. Ono, and T. Hirata, 'A theoretical framework of hybrid approaches to MAX SAT', in Proc. 8th Annual Int. Symposium on Algorithms and Computation, LNCS 1350, pp. 153-162. Springer Verlag, (1997).
2. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti- Spaccamela, and M. Protasi, Complexity and Approximation: Combinatorial optimization problems and their approximability properties, Springer-Verlag, 1999.
3. J. Baxter and P. L. Bartlett, 'Reinforcement learning in POMDP's via direct gradient ascent', in Proc. 17th International Conf. on Machine Learning, pp. 41-48. Morgan Kaufmann, (2000).
4. J. Besag, 'On the statistical analysis of dirty pictures', Journal of the Royal Statistical Society B, 48(3), 259-302, (1986).
5. A. R. Cassandra, L. P. Kaelbling, and M. L. Littman, 'Acting optimally in partially observable stochastic domains', in Proc. 11th Nat. Conf. on Artificial Intelligence (AAAI'94), pp. 1023-1028. AAAI Press, (1994).
6. T. M. Cover and J. A. Thomas, Elements of Information Theory, Wiley Interscience, 1991.
7. U. Feige and M. X. Goemans, 'Approximating the value of two prover proof systems, with application to MAX 2-SAT and MAX DICUT', in Proc. 3rd Israel Symposium on Theory of Computing and Systems, ed., IEEE Computer Society, pp. 182-189, (1995).
8. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, San Francisco, 1979.
9. S. Geman and D. Geman, 'Stochastic relaxation, Gibbs distribution, and the Bayesian restoration of images', IEEE Transactions on Pattern Analysis and Machine Intelligence, 6, 721-741, (1984).
10. J. Hastad, 'Some optimal inapproximability results', in Proc. of the 29th annual ACM Symposium on Theory Of Computing (STOC'97), pp. 1- 10, New-York, NY, (1997).
11. R. A. Howard, 'Information value theory', IEEE Transactions on Systems Science and Cybernetics, SSC-2(1), 22-26, (1966).
12. D. Koller and N. Friedman, Probabilistic Graphical Models - Principles and techniques, The MIT Press, Cambridge, MA, 2009.
13. A. Krause and C. Guestrin, 'Optimal value of information in gaphical models', Journal of Artificial Intelligence Research, 35, 557-591, (2009).
14. S. Z. Li, Markov random field modeling in computer vision, Springer, 1995.
15. M. Munie and Y. Shoham, 'Optimal testing of structured knowledge', in Proc. of 23rd AAAI Conference, (2008).
16. G. Nemhauser, L. Wosley, and M. Fisher, 'An analysis of the approximations for maximising submodular set functions', Mathematical Programming, 14, 265-294, (1978).
17. J. D. Park and A. Darwiche, 'Complexity results and approximation strategies for MAP explanations', JAIR, 21, 101-133, (2004).
18. Y. Radovilsky, G. Shattah, and S. Shimony, 'Efficient deterministic approximation algorithm for nonmyopic value of information in graphical models', in SMC conference, Taipei, Taiwan, (2006).
19. Y. Radovilsky and S. Shimony, 'Observation subset selection as local compilation of performance profiles', in Proc. of the 24th Annual Conf. on Uncertainty in Artificial Intelligence (UAI-08), pp. 460-467, Corvallis, Oregon, (2008). AUAI Press.
20. J. S. Yedidia, W. T. Freeman, and Y. Weiss, 'Constructing free-energy approximations and generalized belief propagation algorithms', IEEE transactions on information theory, 51(7), 2282-2312, (2005).