An evaluation of machine learning in algorithm selection for search problems

AI Communications

Volumn 25, Issue 3, 2012, Pages 257-270

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

^a UNIVERSITY OF ST ANDREWS   (United Kingdom)

Author keywords

Algorithm selection; combinatorial search; machine learning

Indexed keywords

ALGORITHM SELECTION; ALTERNATING DECISION TREES; COMBINATORIAL SEARCH; DATA SETS; EXISTING SYSTEMS; HIGH PROBABILITY; MACHINE LEARNING TECHNIQUES; SEARCH PROBLEM; STATISTICAL RELATIONAL LEARNING;

DECISION TREES; LEARNING ALGORITHMS; LEARNING SYSTEMS;

PROBLEM SOLVING;

EID: 84865481979     PISSN: 09217126     EISSN: None     Source Type: Journal    
DOI: 10.3233/AIC-2012-0533     Document Type: Article

References (40)

1. S. Bhowmick, V. Eijkhout, Y. Freund, E. Fuentes and D. Keyes, Application of machine learning in selecting sparse linear solvers, Technical report, Columbia University, 2006.
2. J.E. Borrett, E.P.K. Tsang and N.R. Walsh, Adaptive constraint satisfaction: The quickest first principle, in: ECAI, 1996, pp. 160-164.
3. J. Carbonell, O. Etzioni, Y. Gil, R. Joseph, C. Knoblock, S. Minton and M. Veloso, PRODIGY: an integrated architecture for planning and learning, SIGART Bull. 2 (1991), 51-55.
4. D.J. Cook and R.C. Varnell, Maximizing the benefits of parallel search using machine learning, in: Proceedings of the 14th National Conference on Artificial Intelligence AAAI-97, AAAI Press, 1997, pp. 559-564.
5. E. Fink, How to solve it automatically: Selection among problem-solving methods, in: Proceedings of the Fourth International Conference on Artificial Intelligence Planning Systems, AAAI Press, 1998, pp. 128-136.
6. C. Gebruers, B. Hnich, D. Bridge and E. Freuder, Using CBR to select solution strategies in constraint programming, in: Proceedings of the ICCBR-05, 2005, pp. 222-236.
7. I.P. Gent, C.A. Jefferson, L. Kotthoff, I. Miguel, N.C.A. Moore, P. Nightingale and K. Petrie, Learning when to use lazy learning in constraint solving, in: ECAI, 2010, pp. 873-878.
8. I.P. Gent, L. Kotthoff, I. Miguel and P. Nightingale, Machine learning for constraint solver design-a case study for the alldifferent constraint, in: 3rd Workshop on Techniques for Implementing Constraint Programming Systems (TRICS), 2010, pp. 13-25.
9. A.E. Gerevini, A. Saetti and M. Vallati, An automatically configurable portfolio-based planner with macro-actions: PbP, in: Proceedings of the 19th International Conference on Automated Planning and Scheduling (ICAPS-09), 2009, pp. 350-353.
10. L. Getoor and B. Taskar, Introduction to Statistical Relational Learning, The MIT Press, Cambridge, MA, 2007.
11. C.P. Gomes and B. Selman, Algorithm portfolios, Artificial Intelligence 126(1,2) (2001), 43-62.
12. A. Guerri and M. Milano, Learning techniques for automatic algorithm portfolio selection, in: ECAI, 2004, pp. 475-479.
13. H. Guo and W.H. Hsu, A learning-based algorithm selection meta-reasoner for the real-time MPE problem, in: Australian Conference on Artificial Intelligence, 2004, pp. 307-318.
14. M. Hall, E. Frank, G. Holmes, B. Pfahringer, P. Reutemann and I.H.Witten, TheWEKA data mining software: An update, SIGKDD Explor. Newsl. 11(1) (2009), 10-18.
15. R.C. Holte, Very simple classification rules perform well on most commonly used datasets, Mach. Learn. 11 (1993), 63-90.
16. P.D. Hough and P.J. Williams, Modern machine learning for automatic optimization algorithm selection, in: Proceedings of the INFORMS Artificial Intelligence and Data Mining Workshop, November 2006.
17. T. Joachims, Training linear SVMs in linear time, in: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'06), ACM, New York, NY, USA, 2006, pp. 217-226.
18. S. Kadioglu, Y. Malitsky, M. Sellmann and K. Tierney, ISAC-Instance-specific algorithm configuration, in: ECAI 2010: 19th European Conference on Artificial Intelligence, IOS Press, Amsterdam, 2010, pp. 751-756.
19. R. Kohavi, A study of cross-validation and bootstrap for accuracy estimation and model selection, in: IJCAI, Morgan Kaufmann, 1995, pp. 1137-1143.
20. L. Kotthoff, I. Miguel and P. Nightingale, Ensemble classification for constraint solver configuration, in: CP, September 2010, pp. 321-329.
21. M.G. Lagoudakis and M.L. Littman, Algorithm selection using reinforcement learning, in: ICML'00: Proceedings of the Seventeenth International Conference on Machine Learning, Morgan Kaufmann, San Francisco, CA, USA, 2000, pp. 511-518.
22. K. Leyton-Brown, E. Nudelman, G. Andrew, J. Mcfadden and Y. Shoham, A portfolio approach to algorithm selection, in: IJCAI, 2003, pp. 1542-1543.
23. K. Leyton-Brown, E. Nudelman and Y. Shoham, Learning the empirical hardness of optimization problems: The case of combinatorial auctions, in: CP'02: Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming, London, UK, Springer-Verlag, 2002, pp. 556-572.
24. L. Lobjois and M. Lemaître, Branch and bound algorithm selection by performance prediction, in: AAAI'98/IAAI'98: Proceedings of the Fifteenth National/Tenth Conference on Artificial Intelligence/Innovative Applications of Artificial Intelligence, American Association for Artificial Intelligence, Menlo Park, CA, USA, 1998, pp. 353-358.
25. S. Minton, Automatically configuring constraint satisfaction programs: A case study, Constraints 1 (1996), 7-43.
26. E. O'Mahony, E. Hebrard, A. Holland, C. Nugent and B. O'Sullivan, Using case-based reasoning in an algorithm portfolio for constraint solving, in: Proceedings of the 19th Irish Conference on Artificial Intelligence and Cognitive Science, 2008.
27. L. Pulina and A. Tacchella, A multi-engine solver for quantified Boolean formulas, in: Proceedings of the 13th International Conference on Principles and Practice of Constraint Programming (CP'07), Springer-Verlag, Berlin, Heidelberg, 2007, pp. 574-589.
28. L. Pulina and A. Tacchella, A self-adaptive multi-engine solver for quantified Boolean formulas, Constraints 14(1) (2009), 80-116.
29. R.B. Rao, D. Gordon and W. Spears, For every generalization action, is there really an equal and opposite reaction? Analysis of the conservation law for generalization performance, in: Proceedings of the Twelfth International Conference on Machine Learning, Morgan Kaufmann, 1995, pp. 471-479.
30. J.R. Rice, The algorithm selection problem, Advances in Computers 15 (1976), 65-118.
31. C.K. Riesbeck and R.C. Schank, Inside Case-Based Reasoning, Erlbaum Associates, Hillsdale, NJ, USA, 1989.
32. M. Roberts and A.E. Howe, Learned models of performance for many planners, in: ICAPS 2007 Workshop AI Planning and Learning, 2007.
33. B. Silverthorn and R. Miikkulainen, Latent class models for algorithm portfolio methods, in: Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010.
34. K.A. Smith-Miles, Cross-disciplinary perspectives on metalearning for algorithm selection, ACM Comput. Surv. 41 (2009), 1-25.
35. D.H. Stern, H. Samulowitz, R. Herbrich, T. Graepel, L. Pulina and A. Tacchella, Collaborative expert portfolio management, in: AAAI, 2010, pp. 179-184.
36. M.J. Streeter and S.F. Smith, New techniques for algorithm portfolio design, in: UAI, 2008, pp. 519-527.
37. S. Weerawarana, E.N. Houstis, J.R. Rice, A. Joshi and C.E. Houstis, PYTHIA: A knowledge-based system to select scientific algorithms, ACM Trans. Math. Softw. 22(4) (1996), 447-468.
38. D.H. Wolpert, The supervised learning No-Free-Lunch theorems, in: Proc. 6th Online World Conference on Soft Computing in Industrial Applications, 2001, pp. 25-42.
39. L. Xu, H.H. Hoos and K. Leyton-Brown, Hydra: Automatically configuring algorithms for portfolio-based selection, in: Twenty-Fourth Conference of the Association for the Advancement of Artificial Intelligence (AAAI-10), 2010, pp. 210-216.
40. L. Xu, F. Hutter, H.H. Hoos and K. Leyton-Brown, SATzilla: Portfolio-based algorithm selection for SAT, J. Artif. Intell. Res. (JAIR) 32 (2008), 565-606.