A preliminary evaluation of machine learning in algorithm selection for search problems

Proceedings of the 4th Annual Symposium on Combinatorial Search, SoCS 2011

Volumn , Issue , 2011, Pages 84-91

  Kotthoff, Lars ^a   Gent, Ian P ^a   Miguel, Ian ^a  

^a UNIVERSITY OF ST ANDREWS   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM SELECTION; EXISTING SYSTEMS; MACHINE LEARNING TECHNIQUES; REAL-WORLD; SEARCH PROBLEM; STATISTICAL RELATIONAL LEARNING;

ALGORITHMS; LEARNING SYSTEMS; VIRTUAL REALITY;

PROBLEM SOLVING;

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

References (23)

1. Borrett, J. E.; Tsang, E. P. K.; and Walsh, N. R. 1996. Adaptive constraint satisfaction: The quickest first principle. In ECAI, 160-164.
2. Burke, E.; Hart, E.; Kendall, G.; Newall, J.; Ross, P.; and Schulenburg, S. 2003. Hyper heuristics: an emerging direction in modern search technology. In Handbook of Meta-Heuristics, volume 57. Kluwer.
3. Carbonell, J.; Etzioni, O.; Gil, Y.; Joseph, R.; Knoblock, C.; Minton, S.; and Veloso, M. 1991. PRODIGY: an integrated architecture for planning and learning. SIGART Bull. 2:51-55.
4. Fink, E. 1998. How to solve it automatically: Selection among Problem-Solving methods. In ICAPS, 128-136.
5. Gent, I.; Jefferson, C.; Kotthoff, L.; Miguel, I.; Moore, N.; Nightingale, P.; and Petrie, K. 2010. Learning when to use lazy learning in constraint solving. In ECAI, 873-878.
6. Getoor, L., and Taskar, B. 2007. Introduction to Statistical Relational Learning. MIT Press. Gomes, C. P., and Selman, B. 2001. Algorithm portfolios. Artif. Intell. 126(1-2):43-62.
7. Guerri, A., and Milano, M. 2004. Learning techniques for automatic algorithm portfolio selection. In ECAI, 475-479.
8. Hall, M.; Frank, E.; Holmes, G.; Pfahringer, B.; Reutemann, P.; and Witten, I. 2009. The WEKA data mining software: An update. SIGKDD Explorations 11(1).
9. Joachims, T. 2006. Training linear SVMs in linear time. In ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 217-226.
10. Kohavi, R. 1995. A study of Cross-Validation and bootstrap for accuracy estimation and model selection. In IJCAI, 1137-1143.
11. Kotthoff, L.; Miguel, I.; and Nightingale, P. 2010. Ensemble classification for constraint solver configuration. In CP, 321-329.
12. Lagoudakis, M. G., and Littman, M. L. 2000. Algorithm selection using reinforcement learning. In ICML, 511-518.
13. Leyton-Brown, K.; Nudelman, E.; Andrew, G.; McFadden, J.; and Shoham, Y. 2003. A portfolio approach to algorithm selection. In IJCAI, 1542.
14. Lobjois, L., and Lemaitre, M. 1998. Branch and bound algorithm selection by performance prediction. In AAAI, 353-358.
15. O'Mahony, E.; Hebrard, E.; Holland, A.; Nugent, C.; and O'Sullivan, B. 2008. Using case-based reasoning in an algorithm portfolio for constraint solving. In Irish Conference on Artificial Intelligence and Cognitive Science.
16. Pulina, L., and Tacchella, A. 2009. A self-adaptive multiengine solver for quantified boolean formulas. Constraints 14(1):80-116.
17. Rice, J. R. 1976. The algorithm selection problem. Advances in Computers 15:65-118.
18. Riesbeck, C. K., and Schank, R. C. 1989. Inside Case-Based Reasoning. L. Erlbaum Associates Inc.
19. Smith-Miles, K. A. 2009. Cross-disciplinary perspectives on meta-learning for algorithm selection. ACM Comput. Surv. 41:6:16:25.
20. Streeter, M. J., and Smith, S. F. 2008. New techniques for algorithm portfolio design. In UAI, 519-527.
21. Weerawarana, S.; Houstis, E. N.; Rice, J. R.; Joshi, A.; and Houstis, C. E. 1996. PYTHIA: a knowledge-based system to select scientific algorithms. ACM Trans. Math. Softw. 22(4):447-468.
22. Wolpert, D. H., and Macready,W. G. 1997. No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation 1(1):6782.
23. Xu, L.; Hutter, F.; Hoos, H. H.; and Leyton-Brown, K. 2008. SATzilla: portfolio-based algorithm selection for SAT. J. Artif. Intell. Res. (JAIR) 32:565-606.