Optimal Nonmyopic Value of Information in Graphical Models - Efficient Algorithms and Theoretical Limits
暂无分享,去创建一个
[1] Michael L. Littman,et al. The Computational Complexity of Probabilistic Planning , 1998, J. Artif. Intell. Res..
[2] Wei Hong,et al. Model-Driven Data Acquisition in Sensor Networks , 2004, VLDB.
[3] Finn Verner Jensen,et al. Myopic Value of Information in Influence Diagrams , 1997, UAI.
[4] J. Ross Quinlan,et al. Induction of Decision Trees , 1986, Machine Learning.
[5] Uri Lerner,et al. Inference in Hybrid Networks: Theoretical Limits and Practical Algorithms , 2001, UAI.
[6] David A. Cohn,et al. Active Learning with Statistical Models , 1996, NIPS.
[7] A. Darwiche,et al. Complexity Results and Approximation Strategies for MAP Explanations , 2011, J. Artif. Intell. Res..
[8] Valentina Bayer-Zubek. Learning diagnostic policies from examples by systematic search , 2004, UAI 2004.
[9] L. van der Gaag,et al. Selective evidence gathering for diagnostic belief networks , 1993 .
[10] Eric Horvitz,et al. An approximate nonmyopic computation for value of information , 1994, UAI 1994.
[11] Peter D. Turney. Cost-Sensitive Classification: Empirical Evaluation of a Hybrid Genetic Decision Tree Induction Algorithm , 1994, J. Artif. Intell. Res..
[12] Lluís A. Belanche Muñoz,et al. Feature selection algorithms: a survey and experimental evaluation , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..
[13] Sean R. Eddy,et al. Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids , 1998 .
[14] Stefan Wrobel,et al. Active Learning of Partially Hidden Markov Models , 2001 .