Show simple item record

Files in this item

Thumbnail

Item metadata

dc.contributor.authorDang, Nguyen
dc.contributor.authorDe Causmaecker, Patrick
dc.contributor.editorBattiti, Roberto
dc.contributor.editorBrunato, Mauro
dc.contributor.editorKotsireas, Ilias
dc.contributor.editorPardalos, Panos M.
dc.date.accessioned2019-04-23T12:30:10Z
dc.date.available2019-04-23T12:30:10Z
dc.date.issued2018
dc.identifier.citationDang , N & De Causmaecker , P 2018 , Analysis of algorithm components and parameters : some case studies . in R Battiti , M Brunato , I Kotsireas & P M Pardalos (eds) , Learning and Intelligent Optimization : 12th International Conference, LION 12, Kalamata, Greece, June 10–15, 2018, Revised Selected Papers . Lecture Notes in Computer Science (Theoretical Computer Science and General Issues) , vol. 11353 , Springer , Cham , pp. 288-303 , Learning and Intelligent Optimization Conference (LION 12) , Kalamata , Greece , 10/06/18 . https://doi.org/10.1007/978-3-030-05348-2_25en
dc.identifier.citationconferenceen
dc.identifier.isbn9783030053475
dc.identifier.isbn9783030053482
dc.identifier.issn0302-9743
dc.identifier.otherPURE: 258271693
dc.identifier.otherPURE UUID: 59b16b06-71ce-4e6a-b935-fa9975d71c9c
dc.identifier.othercrossref: 10.1007/978-3-030-05348-2_25
dc.identifier.otherScopus: 85059947815
dc.identifier.otherORCID: /0000-0002-2693-6953/work/55643847
dc.identifier.urihttp://hdl.handle.net/10023/17581
dc.description.abstractModern high-performing algorithms are usually highly parameterised, and can be configured either manually or by an automatic algorithm configurator. The algorithm performance dataset obtained after the configuration step can be used to gain insights into how different algorithm parameters influence algorithm performance. This can be done by a number of analysis methods that exploit the idea of learning prediction models from an algorithm performance dataset and then using them for the data analysis on the importance of variables. In this paper, we demonstrate the complementary usage of three methods along this line, namely forward selection, fANOVA and ablation analysis with surrogates on three case studies, each of which represents some special situations that the analyses can fall into. By these examples, we illustrate how to interpret analysis results and discuss the advantage of combining different analysis methods.
dc.language.isoeng
dc.publisherSpringer
dc.relation.ispartofLearning and Intelligent Optimizationen
dc.relation.ispartofseriesLecture Notes in Computer Science (Theoretical Computer Science and General Issues)en
dc.rights© 2019, Springer Nature Switzerland AG. This work has been made available online in accordance with the publisher's policies. This is the author created accepted version manuscript following peer review and as such may differ slightly from the final published version. The final published version of this work is available at https://doi.org/10.1007/978-3-030-05348-2_25en
dc.subjectForward selectionen
dc.subjectfANOVAen
dc.subjectAblation analysis with surrogatesen
dc.subjectParameter analysisen
dc.subjectQA75 Electronic computers. Computer scienceen
dc.subjectQA76 Computer softwareen
dc.subjectComputer Science (miscellaneous)en
dc.subjectNDASen
dc.subject.lccQA75en
dc.subject.lccQA76en
dc.titleAnalysis of algorithm components and parameters : some case studiesen
dc.typeConference itemen
dc.description.versionPostprinten
dc.contributor.institutionUniversity of St Andrews.School of Computer Scienceen
dc.identifier.doihttps://doi.org/10.1007/978-3-030-05348-2_25


This item appears in the following Collection(s)

Show simple item record