Please use this identifier to cite or link to this item: http://hdl.handle.net/1893/33535
Appears in Collections:Computing Science and Mathematics Conference Papers and Proceedings
Author(s): Wallace, Aidan
Brownlee, Alexander E I
Cairns, David
Contact Email: alexander.brownlee@stir.ac.uk
Title: Towards explaining metaheuristic solution quality by data mining surrogate fitness models for importance of variables
Editor(s): Bramer, Max
Ellis, Richard
Citation: Wallace A, Brownlee AEI & Cairns D (2021) Towards explaining metaheuristic solution quality by data mining surrogate fitness models for importance of variables. In: Bramer M & Ellis R (eds.) Artificial Intelligence XXXVIII. Lecture Notes in Computer Science, 13101. 41st SGAI International Conference on Artificial Intelligence, AI 2021, Cambridge, 14.12.2021-16.12.2021. Cham, Switzerland: Springer, pp. 58-72. https://doi.org/10.1007/978-3-030-91100-3_5
Issue Date: 2021
Date Deposited: 29-Oct-2021
Series/Report no.: Lecture Notes in Computer Science, 13101
Conference Name: 41st SGAI International Conference on Artificial Intelligence, AI 2021
Conference Dates: 2021-12-14 - 2021-12-16
Conference Location: Cambridge
Abstract: Metaheuristics are randomised search algorithms that are effective at finding "good enough" solutions to optimisation problems. However, they present no justification for generated solutions and these solutions are non-trivial to analyse in most cases. We propose that identifying the combinations of variables that strongly influence solution quality, and the nature of this relationship, represents a step towards explaining the choices made by a metaheuristic. Using three benchmark problems, we present an approach to mining this information by using a "surrogate fitness function" within a metaheuristic. For each problem, rankings of the importance of each variable with respect to fitness are determined through sampling of the surrogate model. We show that two of the three surrogate models tested were able to generate variable rank-ings that agree with our understanding of variable importance rankings within the three common binary benchmark problems trialled.
Status: AM - Accepted Manuscript
Rights: This item has been embargoed for a period. During the embargo please use the Request a Copy feature at the foot of the Repository record to request a copy directly from the author. You can only request a copy if you wish to use this work for your own research or private study. This is a post-peer-review, pre-copyedit version of an article published in Bramer M & Ellis R (eds.) Artificial Intelligence XXXVIII. Lecture Notes in Computer Science, 13101. 41st SGAI International Conference on Artificial Intelligence, AI 2021, Cambridge, 14.12.2021-16.12.2021. Cham, Switzerland: Springer. . The final authenticated version is available online at: http://www.springer.com/gp/book/9783030910990
Licence URL(s): https://storre.stir.ac.uk/STORREEndUserLicence.pdf

Files in This Item:
File Description SizeFormat 
SGAI_2021_Paper_cameraready.pdfFulltext - Accepted Version329.96 kBAdobe PDFView/Open



This item is protected by original copyright



Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.

The metadata of the records in the Repository are available under the CC0 public domain dedication: No Rights Reserved https://creativecommons.org/publicdomain/zero/1.0/

If you believe that any material held in STORRE infringes copyright, please contact library@stir.ac.uk providing details and we will remove the Work from public display in STORRE and investigate your claim.