Towards insightful algorithm selection for optimisation using meta-learning concepts

Proceedings of the International Joint Conference on Neural Networks

Volumn , Issue , 2008, Pages 4118-4124

  Smith Miles, Kate A ^a  

^a DEAKIN UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

LEARNING ALGORITHMS; LEARNING SYSTEMS; UNSUPERVISED LEARNING;

ALGORITHM PERFORMANCES; ALGORITHM SELECTIONS; METAHEURISTICS; OPTIMISATION; OPTIMIZATION PROBLEMS; PROBLEM INSTANCES; QUADRATIC ASSIGNMENT PROBLEMS; SEARCH SPACES; UNSUPERVISED LEARNING METHODS;

NEURAL NETWORKS;

EID: 56349134000     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IJCNN.2008.4634391     Document Type: Conference Paper

References (35)

1. Achlioptas, D., Naor, A. And Peres, Y. Rigorous Location Of Phase Transitions In Hard Optimization Problems. Nature. 435, (June 2005), 759-764.
2. Ali, S. And Smith, K. On Learning Algorithm Selection For Classification. Applied Soft Computing. 6,2 (2006), 119-138.
3. Angel, E. And Zissimopoulos, V. On The Hardness Of The Quadratic Assignment Problem With Metahcuristics. Journal Of Heuristics. 8, (2002), 399414.
4. Bachelet, V. Métaheuristiques Paralleles Hybrides: Application Au Probleme D'affectation Quadratique. Phd Dissertation, Universite Des Sciences et Technologies De Lille, France, (December 1999).
5. Borenstein, Y. And Poli, R. Kolmogorov Complexity, Optimization And Hardness. IEEE Congress On Evol. Comput., (2006), 112-119.
6. Boukeas, G., Halatsis, C., Zissimpoloulos, V. And Stamatopoulos, P. Measures Of Instrinsic Hardness For Constraint Satisfaction Problem Instances. Lecture Notes In Computer Science, 2932, (2004), 184-195.
7. Brazdil, P., Soares, C. And Costa, J. Ranking Learning Algorithms: Using Ibl And Meta-Learning On Accuracy And Time Results. Machine Learning. 50, 3 (2003), 251-277.
8. Drezner, Z. Hahn, P. And Taillard, E., "A Study Of Quadratic Assignment Problem Instances That Arc Difficult For Metaheuristic Methods", Annals Of Operations Research, 139 (2005), 65-94.
9. Eudaptics. Viscovery Somine 3.0, Available From Http://Www.Eudaptics.Com.
10. Guo, H. Algorithm Selection For Sorting And Probabilistic Inference: A Machine Learning-Based Approach. Ph.D. Dissertation, Kansas State University, Usa (2003).
11. Hill, R. R. And Reilly, C. H. The Effects Of Coefficient Correlation Structure In Two-Dimensional Knapsack Problems On Solution Procedure Performance. Management Science, 46, 2, (2000), 302-317.
12. th Conference On Uncertainty In Artificial Intelligence. (2001).
13. Jones, T. And Forrest, S. Fitness Distance Correlation As A Measure Of Problem Difficulty For Genetic Algorithms. Proceedings Of The International Conference On Genetic Algorithms (1995), 184-192.
14. Knowles, J. D. And Corne, D. W. Towards Landscape Analysis To Inform The Design Of A Hybrid Local Search For The Multiobjective Quadratic Assignment Problem. In Abraham, A., Ruiz-Del-Solar, J. And Koppen, M. (Eds.), Soft Computing Systems: Design, Management And Applications. IOS Press, (2002), 271-279, Amsterdam.
15. Kohonen, T. Self-Organisation And Associative Memory. Springer-Verlag, (1988), New York.
16. Leyton-Brown, K., Nudolman, E. And Shoham, Y. Learning The Empirical Hardness Of Optimization Problems: The Case Of Combinatorial Auctions. Lecture Notes In Comp. Sci. 2470, (2002), 556-569.
17. Merz, P. Advanced Fitness Landscape Analysis And The Performance Of Memetic Algorithms. Evol. Comput. 12, (2004), 303-325.
18. Michie, D., Spiegelhalter, D.J. And Taylor C.C. (Eds) Machine Learning, Neural And Statistical Classification. Ellis Horwood, New York. (1994).
19. Nudelman, E., Leyton-Brown, K., Hoos, H., Devkar, A. And Shoham, Y. Understanding Random Sat: Beyond The Clauscs-To-Variables Ratio. Lecture Notes In Computer Science, 3258, (2004), 438452.
20. Prudêncio, R. And Ludermir, T. Meta-Learning Approaches To Selecting Time-Series Models. Neurocomputing. 61, (2004), 121-137.
21. Rice, J. R. The Algorithm Selection Problem. Advances In Computers. 15, (1976), 65-118.
22. Smith-Miles, K. A., "Neural Networks For Prediction And Classification", In Wang, J.(Ed.), Encyclopaedia Of Data Warehousing And Mining, Information Science Publishing, 2 (2006), 865-869.
23. Smith-Miles, K. A. Cross-Disciplinary Perspectives On MetaLearning For Algorithm Selection, ACM Computing Surveys, In Press (2008).
24. Specht, D. F., Probabilistic Neural Networks. Neural Networks, 3, 1 (1990), 109-118.
25. Stützle, T. Iterated Local Search For The Quadratic Assignment Problem, European Journal Of Operational Research, 174, 3 (2006), 1519-1539.
26. Srützle, T. And Dorigo, M. Aco Algorithms For The Quadratic Assignment Problem, In D. Corne, M. Dorigo, F. Glover (Eds.), New Ideas In Optimization, (1999) Mcgraw Hill.
27. Stützle, T. And Fernandes, S. New Benchmark Instances For The QAP And The Experimental Analysis Of Algorithms. Lecture Notes In Computer Science, 3004, (2004), 199-209.
28. Taillard, E. D. Robust Taboo Search For The Quadratic Assignment Problem. Parallel Computing, 17, (1991), 443-455.
29. Taillard, E. D. Comparison Of Iterative Searches For The Quadratic Assignment Problem. Location Science, 3, 2 (1995), 87-105.
30. Van Hemert, J. I. Evolving Combinatorial Problem Instances That Are Difficult To Solve. Evolutionary Computation. 14, (2006), 433-462.
31. Vollmann, T.E. And Buffa, E.S. The Facility Layout Problem In Perspective. Management Science, 12, 10(1966), 450-468.
32. Wang, X., Smith, K. A., And Hyndman, R. Characteristic-Based Clustering For Time Series Data. Data Mining & Knowledge Discovery. 13, (2006), 335-364.
33. Watson, J.-P., Barbulescu, L., Whitley, L. D. And Howe, A. E. Contrasting Structured And Random Permutation Flow-Shop Scheduling Problems: Search-Space Topology And Algorithm Performance. Informs Journal On Computing. 14, 2 (2002), 98-123.
34. Watson, J.-P. And Howe, A. E. Focusing On The Individual: Why We Need Empirical Methods For Characterizing Problem Difficulty - Position Paper. In Working Notes Of European Conference On Artificial Intelligence, Workshop On Empirical Methods In Ai, August (2000), Berlin, Germany.
35. Wolpert, D. And Macready, W. No Free Lunch Theorems For Optimization. IEEE Transactions On Evolutionary Computation. 1, (1997), 67-82.