Efficient heuristic hypothesis ranking

Journal of Artificial Intelligence Research

Volumn 10, Issue , 1999, Pages 375-397

  Chien, Steve ^a   Stechert, Andre ^a   Mutz, Darren ^a  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA STRUCTURES; DECISION THEORY; HEURISTIC METHODS; ITERATIVE METHODS; OPTIMIZATION; PROBABILITY; RANDOM PROCESSES;

EXPECTED LOSS LEARNING CRITERIA; HYPOTHESIS RANKING; PROBABLY APPROXIMATELY CORRECT;

LEARNING SYSTEMS;

EID: 0033342012     PISSN: 10769757     EISSN: None     Source Type: Journal    
DOI: 10.1613/jair.615     Document Type: Article

References (20)

1. Balacuit., C. P. (1997). Deep Space 2 - Mars Microprobe Home Page (mission objectives statement). Tech. rep. http://nmp.jpl.nasa.gov/ds2, NASA/JPL.
2. Chien, S. A., Gratch, J. M., & Burl, M. C. (1995). On the Efficient Allocation of Resources for Hypothesis Evaluation: A Statistical Approach. IEEE Trans. Pattern Analysis and Machine Intelligence, 17(7), 652-665.
3. Chien, S. A., Stechert, A. D., & Mutz, D. H. (1998). Efficient Heuristic Ranking of Hypotheses. In Advances in Neural Information Processing Systems 10 (Jordan, Kearns, and Solla eds.), pp. 444-450 Denver, Colorado. NIPS.
4. Ginsberg, M., & Harvey, W. (1992). Iterative Broadening. Artificial Intelligence Journal, 55, 367-383.
5. Goldberg, D. (1989). Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley.
6. Gratch, J. (1992). COMPOSER: A Probabilistic Solution to the Utility Problem in Speed-up Learning. In Proceedings of the Tenth National Conference on Artificial Intelligence, pp. 235-240 San Jose, CA. AAAI.
7. Gratch, J. (1993). COMPOSER: A Decision-theoretic Approach to Adaptive Problem Solving. Tech. rep. UIUCDCS-R-93-1806, Department of Computer Science, University of Illinois.
8. Gratch, J., Chien, S., & DeJong, G. (1994). Improving Learning Performance Through Rational Resource Allocation. In Proceedings of the Twelfth National Conference on Artificial Intelligence, pp. 576-582 Seattle, WA. AAAI.
9. Greiner, R., & Jurisica, I. (1992). A Statistical Approach to Solving the EBL Utility Problem. In Proceedings of the Tenth National Conference on Artificial Intelligence, pp. 241-248 San Jose, CA. AAAI.
10. Haseeb, R. M. (1985). Modern Statistical Selection. American Sciences Press, Columbus, OH.
11. Howard, R. A. (1970). Decision Analysis: Perspectives on Inference, Decision, and Experimentation. Proceedings of the IEEE, 58(5), 823-834.
12. Kaelbling, L. P. (1993). Learning in Embedded Systems. MIT Press, Cambridge, MA.
13. Minton, S. (1988). Learning Search Control Knowledge: An Explanation-Based Approach. Kluwer Academic Publishers, Norwell, MA.
14. Moore, A. W., & Lee, M. S. (1994). Efficient Algorithms for Minimizing Cross-Validation Error. In Proceedings of the International Conference on Machine Learning New Brunswick, MA.
15. Musick, R., Catlett, J., & Russell, S. (1993). Decision Theoretic Subsampling for Induction on Large Databases. In Proceedings of the International Conference on Machine Learning, pp. 212-219 Amherst, MA.
16. Rivest, R. L., & Sloan, R. (1988). A New Model for Inductive Inference. In Proceedings of the Second Conference on Theoretical Aspects of Reasoning about Knowledge.
17. Russell, S., & Wefald, E. (1992). Do the Right Thing: Studies in Limited Rationality. MIT Press, Cambridge, MA.
18. Tadepalli, P. (1992). A theory of unsupervised speedup learning. In Proc. of the Tenth National Conference on Artificial Intelligence, pp. 229-234 San Jose, CA. AAAI.
19. Turnbull, B. W., & Weiss, L. I. (1984). A Class of Sequential Procedures for k-sample Problems Concerning Normal Means with Unknown Equal Variances. In Santner, T. J., & Tamhane, A. C. (Eds.), Design of Experiments: Ranking and Selection, pp. 225-240. Marcel Dekker.
20. Valiant, L. G. (1984). A Theory of the Learnable. Communications of the ACM, 27, 1134-1142.