Skip to main content

Research Repository

Advanced Search

All Outputs (4)

Explaining a staff rostering problem by mining trajectory variance structures. (2023)
Presentation / Conference Contribution
FYVIE, M., MCCALL, J.A.W., CHRISTIE, L.A., ZĂVOIANU, A.-C., BROWNLEE, A.E.I. and AINSLIE, R. 2023. Explaining a staff rostering problem by mining trajectory variance structures. In Bramer, M. and Stahl, F. (eds.) Artificial intelligence XL: proceedings of the 43rd SGAI international conference on artificial intelligence (AI-2023), 12-14 December 2023, Cambridge, UK. Lecture notes in computer science, 14381. Cham: Springer [online], pages 275-290. Available from: https://doi.org/10.1007/978-3-031-47994-6_27

The use of Artificial Intelligence-driven solutions in domains involving end-user interaction and cooperation has been continually growing. This has also lead to an increasing need to communicate crucial information to end-users about algorithm behav... Read More about Explaining a staff rostering problem by mining trajectory variance structures..

Explaining a staff rostering genetic algorithm using sensitivity analysis and trajectory analysis. (2023)
Presentation / Conference Contribution
FYVIE, M., MCCALL, J.A.W., CHRISTIE, L.A. and BROWNLEE, A.E.I. 2023. Explaining a staff rostering genetic algorithm using sensitivity analysis and trajectory analysis. In GECCO’23 companion: proceedings of the 2023 Genetic and evolutionary computation conference companion, 15-19 July 2023, Lisbon, Portugal. New York: ACM [online], pages 1648-1656. Available from: https://doi.org/10.1145/3583133.3596353

In the field of Explainable AI, population-based search metaheuristics are of growing interest as they become more widely used in critical applications. The ability to relate key information regarding algorithm behaviour and drivers of solution quali... Read More about Explaining a staff rostering genetic algorithm using sensitivity analysis and trajectory analysis..

Towards explainable metaheuristics: PCA for trajectory mining in evolutionary algorithms. (2021)
Presentation / Conference Contribution
FYVIE, M., MCCALL, J.A.W. and CHRISTIE, L.A. 2021. Towards explainable metaheuristics: PCA for trajectory mining in evolutionary algorithms. In Bramer, M. and Ellis, R (eds.) Artificial intelligence XXXVIII: proceedings of 41st British Computer Society's Specialist Group on Artificial Intelligence (SGAI) Artificial intelligence international conference 2021 (AI-2021) (SGAI-AI 2021), 14-16 December 2021, [virtual conference]. Lecture notes in computer science, 13101. Cham: Springer [online], pages 89-102. Available from: https://doi.org/10.1007/978-3-030-91100-3_7

The generation of explanations regarding decisions made by population-based meta-heuristics is often a difficult task due to the nature of the mechanisms employed by these approaches. With the increase in use of these methods for optimisation in indu... Read More about Towards explainable metaheuristics: PCA for trajectory mining in evolutionary algorithms..

Non-deterministic solvers and explainable AI through trajectory mining. (2021)
Presentation / Conference Contribution
FYVIE, M., MCCALL, J.A.W. and CHRISTIE, L.A. 2021. Non-deterministic solvers and explainable AI through trajectory mining. In Martin, K., Wiratunga, N. and Wijekoon, A. (eds.) SICSA XAI workshop 2021: proceedings of 2021 SICSA (Scottish Informatics and Computer Science Alliance) eXplainable artificial intelligence workshop (SICSA XAI 2021), 1st June 2021, [virtual conference]. CEUR workshop proceedings, 2894. Aachen: CEUR-WS [online], session 4, pages 75-78. Available from: http://ceur-ws.org/Vol-2894/poster2.pdf

Traditional methods of creating explanations from complex systems involving the use of AI have resulted in a wide variety of tools available to users to generate explanations regarding algorithm and network designs. This however has traditionally bee... Read More about Non-deterministic solvers and explainable AI through trajectory mining..