Instance-based parameter tuning via search trajectory similarity clustering

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6683 LNCS, Issue , 2011, Pages 131-145

  Lindawati, ^a   Lau, Hoong Chuin ^a   Lo, David ^a  

^a SINGAPORE MANAGEMENT UNIVERSITY   (Singapore)

Author keywords

Instance clustering; Instance based automated tuning parameter; Search trajectory; Sequence alignment

Indexed keywords

AUTOMATED TUNING; GENERIC APPROACH; INSTANCE CLUSTERING; META HEURISTICS; PARAMETER-TUNING; QUADRATIC ASSIGNMENT PROBLEMS; SEQUENCE ALIGNMENT TECHNIQUES; SEQUENCE ALIGNMENTS; SIMILAR PATTERN; TRAJECTORY SIMILARITIES;

ALIGNMENT; AUTOMATION; TRAVELING SALESMAN PROBLEM;

TRAJECTORIES;

EID: 84867879187     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-25566-3_10     Document Type: Conference Paper

References (24)

1. Adenso-Diaz, B., Laguna, M.: Fine-Tuning of Algorithms Using Fractional Experimental Design and Local Search. Operations Research 54(1), 99-114 (2006)
2. Battiti, R., Brunato, M., Campigotto, P.: Learning While Optimizing an Unknown Fitness Surface. In: Maniezzo, V., Battiti, R., Watson, J.-P. (eds.) LION 2007 II. LNCS, Vol. 5313, pp. 25-40. Springer, Heidelberg (2008)
3. Birattari, M., Stuzle, T., Paquete, L., Varrentrapp, K.: A Racing Algorithm for Configuring Metaheuristics. In: Genetic and Evolutionary Computation Conference, pp. 11-18. Morgan Kaufmann, San Francisco (2002)
4. Coy, S.P., Golden, B.L., Runger, G.C., Wasil, E.A.: Using Experimental Design to Find Effective Parameter Setting for Heuristics. Journal of Heuristic 7(1), 77-97 (2001)
5. Edgar, R.C.: MUSCLE: multiple sequence alignment with high accuracy and high throughput. Nucleic Acids Research 35(5), 1792-1797 (2004)
6. Gagliolo, M., Schmidhuber, J.: Dynamic Algorithm Portfolio. In: Amato, C., Bernstein, D., Zilberstein, S. (eds.) Ninth International Symposium on Artificial Intelligence and Mathematics (2006)
7. Halim, S., Yap, R., Lau, H.C.: Viz: A Visual Analysis Suite for Explaining Local Search Behavior. In: 19th Annual ACM Symposium on User Interface Software and Technology, pp. 57-66. ACM, New York (2006)
8. Halim, S., Yap, R., Lau, H.C.: An Integrated White+Black Box Approach for Designing and Tuning Stochastic Local Search. In: Bessière, C. (ed.) CP 2007. LNCS, Vol. 4741, pp. 332-347. Springer, Heidelberg (2007)
9. Han, J., Kamber, M.: Data Mining: Concept and Techniques, 2nd edn. Morgan Kaufman, San Francisco (2006)
10. Hoos, H.H., Stutzle, T.: Stochastic Local Search: Foundation and Application, 1st edn. Morgan Kaufman, San Francisco (2004)
11. Hutter, F., Hamadi, Y.: Parameter Adjustment Based on Performance Prediction: Towards an Instance-Aware Problem Solver. Technical Report, Microsoft Research (2005)
12. Hutter, F., Hoos, H.H., Stutzle, T.: Automatic Algorithm Configuration based on Local Search. In: 22nd National Conference on Artifical Intelligence, pp. 1152-1157. AAAI Press, Menlo Park (2007)
13. Hutter, F., Hoos, H.H., Leyton-Brown, K., Stutzle, T.: ParamILS: An Automatic Algorithm Configuration Framework. Journal of Artificial Intelligence Research 36, 267-306 (2009)
14. Lau, H.C., Xiao, F.: Enhancing the Speed and Accuracy of Automated Parameter Tuning in Heuristic Design. In: 8th Metaheuristics International Conference (2009)
15. Lourenco, H.R., Martin, O.C., Stutzle, T.: Iterated Local Search. In: Glover, F., Kochenberger, G.A. (eds.) Handbook of Metaheuristics. International Series in Operations Research & Management Science, Vol. 57, pp. 320-353. Springer, Heidelberg (2003)
16. Merz, P., Freisleben, B.: Fitness Landscape Analysis and Memetic Algorithms for the Quadratic Assignment Problem. IEEE Transactions on Evolutionary Computation 4, 337-351 (2000)
17. Montgomery, D.C., Runger, G.C.: Applied Statistics and Probability for Engineers, 2nd edn. John Wiley & Son, Chichester (1999)
18. Ng, K.M., Gunawan, A., Poh, K.L.: A hybrid algorithm for the quadratic assignment problem. In: International Conf. on Scientific Computing (2008)
19. Patterson, D.J., Lautz, H.: Auto-WalkSAT: A Self-Tuning Implementation of Walk-SAT. Electronic Notes in Discrete Mathematics 9, 360-368 (2001)
20. Reeves, C.R.: Landscapes, operators and heuristic search. Annals of Operations Research 86(1), 473-490 (1999)
21. Salvador, S., Chan, P.: Determining the Number of Clusters/Segments in Hierarchical Clustering/Segmentation Algorithms. In: 16th IEEE International Conference on Tools with Artificial Intelligence, pp. 576-584 (2004)
22. Srivastava, B., Mediratta, A.: Domain-dependent parameter selection of search-based algorithms compatible with user performance criteria. In: 20th National Conference on Artificial Intelligence, pp. 1386-1391. AAAI Press, Pennsylvania (2005)
23. Taillard, E.D.: Comparison of Iterative Searches for The Quadratic Assignment Problem. Location Science 3(2), 87-105 (1995)
24. Xu, L., Hutter, F., Hoos, H.H., Leyton-Brown, K.: SATzilla: Portfolio-based Algorithm Selection for SAT. Journal of Artificial Intelligence Research 32, 565-606 (2008)