Abstract
Machine learning is an established method of selecting algorithms to solve hard search problems. Despite this, to date no systematic comparison and evaluation of the different techniques has been performed and the performance of existing systems has not been critically compared to other approaches. We compare machine learning techniques for algorithm selection on real-world data sets of hard search problems. In addition to well-established approaches, for the first time we also apply statistical relational learning to this problem. We demonstrate that most machine learning techniques and existing systems perform less well than one might expect. To guide practitioners, we close by giving clear recommendations as to which machine learning techniques are likely to perform well based on our experiments.
Original language | English |
---|---|
Title of host publication | Proceedings of the 4th Annual Symposium on Combinatorial Search (SoCS 2011) |
Place of Publication | Palo Alto, CA |
Publisher | Association for the Advancement of Artificial Intelligence |
Pages | 84-91 |
Number of pages | 8 |
ISBN (Print) | 9781577355373 |
DOIs | |
Publication status | Published - 15 Jul 2011 |
Event | 4th International Symposium on Combinatorial Search, SoCS 2011 - Barcelona, Spain Duration: 15 Jul 2011 → 16 Jul 2011 |
Conference
Conference | 4th International Symposium on Combinatorial Search, SoCS 2011 |
---|---|
Country/Territory | Spain |
City | Barcelona |
Period | 15/07/11 → 16/07/11 |
Keywords
- Combinatorial problem
- Search problem
- Machine learning