
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Steve Chien, Jonathan Gratch, Michael Burl, "On the Efficient Allocation of Resources for Hypothesis Evaluation: A Statistical Approach," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 17, no. 7, pp. 652665, July, 1995.  
BibTex  x  
@article{ 10.1109/34.391408, author = {Steve Chien and Jonathan Gratch and Michael Burl}, title = {On the Efficient Allocation of Resources for Hypothesis Evaluation: A Statistical Approach}, journal ={IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {17}, number = {7}, issn = {01628828}, year = {1995}, pages = {652665}, doi = {http://doi.ieeecomputersociety.org/10.1109/34.391408}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Pattern Analysis and Machine Intelligence TI  On the Efficient Allocation of Resources for Hypothesis Evaluation: A Statistical Approach IS  7 SN  01628828 SP652 EP665 EPD  652665 A1  Steve Chien, A1  Jonathan Gratch, A1  Michael Burl, PY  1995 KW  Machine learning KW  the utility problem KW  planning and scheduling KW  parameter estimation KW  adaptive problemsolving. VL  17 JA  IEEE Transactions on Pattern Analysis and Machine Intelligence ER   
[1] J. Gratch and G. DeJong,“COMPOSER: A probabilistic solution to the utility problem in speedup learning,” Proc. Nat’l Conf. Artificial Intelligence, pp. 235240, 1992.
[2] R. Greiner and I. Jurisca,“A statistical approach to solving the EBL utility problem,” Proc. Nat’l Conf. Artificial Intelligence, pp. 241248, 1992.
[3] U. Fayyad and K. Irani,“The attribute selection problem in decision tree generation,” Proc. 10th Nat’l Conf. Artificial Intelligence, pp. 104110, 1990.
[4] R. Musick,J. Catlett, , and S. Russell,“Decision theoretic subsampling for induction on large databases,” Proc. 10th Int’l Conf. Machine Learning, pp. 212219, 1993.
[5] A. Moore and M. Lee,“Efficient algorithms for minimizing cross validation error,” Proc. 11th Int’l Conf. Machine Learning, pp. 190198, 1994.
[6] L.G. Valiant, “A Theory of the Learnable,” Comm. ACM, vol. 27, no. 11, pp. 11341142, Nov. 1984.
[7] S. Russell and E. Wefald,“On optimal game tree search using rational metareasoning,” Proc. 11th Int’l Joint Conf. Artificial Intelligence, pp. 334340, 1989.
[8] S. Russell and E. Wefald,Do the Right Thing: Studies in Limited Rationality.Cambridge, Mass.: MIT Press, 1991.
[9] M. Iwamoto,“A planner with quality goal and its speedup learning for optimization problem,” Proc. Second Int’l Conf. AI Planning Systems, pp. 281286, 1994.
[10] S. Chien and J. Gratch,“Producing satisfying solutions to scheduling problems: An iterative constraint relaxation approach,” Proc. Second Int’l Conf. AI Planning Systems, pp. 213218, 1994.
[11] M.A. Perez and J. Carbonell,“Control knowledge to improve plan quality,” Proc. Second Int’l Conf. AI Planning Systems, pp. 323328, 1994.
[12] T.J. Santner and A.C. Tamhane,“Designing experiments for selecting a normal population with a large mean and a small variance,” Design of Experiments: Ranking and Selection, T.J. Santner and A.C. Tamhane, eds., Marcel Dekker, 1984.
[13] R.V. Hogg and A.T. Craig,Introduction to Mathematical Statistics. New York: Macmillan Publishing, 1978
[14] E. Kreysig,Introductory Mathematical Statistics: Principles and Methods. New York,: John Wiley and Sons, 1970.
[15] H. Buringer,H. Martin, , and K. Schriever,Nonparametric Sequential Selection Procedures.Boston, Mass. : Birkhauser, 1980.
[16] W. Yang and B. Nelson,“Using common random numbers and control variates in multiplecomparison procedures,” Operations Research, vol. 39, no. 4, pp. 583591, 1991.
[17] O. Maron and A. Moore,“Hoeffding races: Accelerating model selection search for classification and function approximation,” Advances in Neural Information Processing Systems 6.San Francisco: Morgan Kaufmann, 1994.
[18] R.E. Bechhofer,“A singlesample multiple decision procedure for ranking means of normal populations with known variances,” Annals of Mathematical Statistics, vol. 25, no. 1, pp. 1639, 1954.
[19] E. Paulson,“A sequential procedure for selecting the population with the largest mean from k normal populations,” Annals of Mathematical Statistics, vol. 35, pp. 174180, 1964.
[20] J. Gratch,“COMPOSER: A decisiontheoretic approach to adaptive problemsolving,” Technical Report UIUCDCSR931806, Dept. of Computer Science, Univ. of Illi nois, Urbana, Ill., May 1993.
[21] Turnbull and Weiss,“A class of sequential procedures for ksample problems concerning normal means with unknown unequal variances,” Design of Experiments: Ranking and Selection, T.J. Santner and A.C. Tamhane, ed., Marcel Dekker, 1984.
[22] R.M. Haseeb,Modern Statistical Selection.Columbus, Ohio: American Sciences Press, 1985.
[23] J. Gratch,S. Chien, , and G. DeJong,“Learning search control knowledge for deep space network scheduling,” Proc. 10th Int’l Conf. Machine Learning, pp. 135142, 1993.
[24] J. Gratch,S. Chien, , and G. DeJong,“Improving learning performance through rational resource allocation,” Proc. 12th Nat’l Conf. Artificial Intelligence, pp. 576581, 1994.