{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T07:49:23Z","timestamp":1760168963326,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031479939"},{"type":"electronic","value":"9783031479946"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-47994-6_27","type":"book-chapter","created":{"date-parts":[[2023,11,7]],"date-time":"2023-11-07T08:02:28Z","timestamp":1699344148000},"page":"275-290","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Explaining a\u00a0Staff Rostering Problem by\u00a0Mining Trajectory Variance Structures"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8491-7008","authenticated-orcid":false,"given":"Martin","family":"Fyvie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1738-7056","authenticated-orcid":false,"given":"John A. W.","family":"McCall","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8878-0344","authenticated-orcid":false,"given":"Lee A.","family":"Christie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1003-7504","authenticated-orcid":false,"given":"Alexandru-Ciprian","family":"Z\u0103voianu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2892-5059","authenticated-orcid":false,"given":"Alexander E. I.","family":"Brownlee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5398-1269","authenticated-orcid":false,"given":"Russell","family":"Ainslie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,11,8]]},"reference":[{"issue":"1","key":"27_CR1","doi-asserted-by":"publisher","first-page":"189","DOI":"10.3390\/su11010189","volume":"11","author":"R Abduljabbar","year":"2019","unstructured":"Abduljabbar, R., Dia, H., Liyanage, S., Bagloee, S.A.: Applications of artificial intelligence in transport: an overview. Sustainability 11(1), 189 (2019)","journal-title":"Sustainability"},{"key":"27_CR2","doi-asserted-by":"publisher","first-page":"106650","DOI":"10.1016\/j.asoc.2020.106650","volume":"96","author":"AE Brownlee","year":"2020","unstructured":"Brownlee, A.E., Wright, J.A., He, M., Lee, T., McMenemy, P.: A Novel encoding for separable large-scale multi-objective problems and its application to the optimisation of housing stock improvements. Appl. Soft Comput. 96, 106650 (2020)","journal-title":"Appl. Soft Comput."},{"key":"27_CR3","unstructured":"Hall, A., Ordish, J., Mitchell, C., Richardson (nee Murfet), H.: Black box medicine and transparency - interpretability by design framework. Technical report MSR-TR-2020-53, PHG Foundation (2020). https:\/\/www.microsoft.com\/en-us\/research\/publication\/black-box-medicine-and-transparency-interpretability-by-design-framework\/"},{"key":"27_CR4","unstructured":"European Commission: Ethics Guidelines for Trustworthy AI (2021). https:\/\/digital-strategy.ec.europa.eu\/en\/library\/ethics-guidelines-trustworthy-ai"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"Barredo Arrieta, A., et al.: Explainable artificial intelligence (XAI): concepts, taxonomies, opportunities and challenges toward responsible AI. Inf. Fusion 58, 82\u2013115 (2020). https:\/\/www.sciencedirect.com\/science\/article\/pii\/S1566253519308103","DOI":"10.1016\/j.inffus.2019.12.012"},{"key":"27_CR6","doi-asserted-by":"publisher","unstructured":"Dwivedi, R., et al.: Explainable AI (XAI): core ideas, techniques, and solutions. ACM Comput. Surv. 55(9) (2023). https:\/\/doi.org\/10.1145\/3561048","DOI":"10.1145\/3561048"},{"key":"27_CR7","unstructured":"Wright, J., Wang, M., Brownlee, A., Buswell, R.: Variable convergence in evolutionary optimization and its relationship to sensitivity analysis. In: Building Simulation and Optimization 2012, Loughborough, UK, pp. 102\u2013109 (2012). https:\/\/repository.lboro.ac.uk\/articles\/conference_contribution\/Variable_convergence_in_evolutionary_optimization_and_its_relationship_to_sensitivity_analysis\/9438080"},{"key":"27_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ins.2012.10.039","volume":"225","author":"P Cortez","year":"2013","unstructured":"Cortez, P., Embrechts, M.J.: Using sensitivity analysis and visualization techniques to open black box data mining models. Inf. Sci. 225, 1\u201317 (2013)","journal-title":"Inf. Sci."},{"issue":"2","key":"27_CR9","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.swevo.2011.05.001","volume":"1","author":"Y Jin","year":"2011","unstructured":"Jin, Y.: Surrogate-assisted evolutionary computation: recent advances and future challenges. Swarm Evol. Comput. 1(2), 61\u201370 (2011)","journal-title":"Swarm Evol. Comput."},{"key":"27_CR10","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/978-3-030-91100-3_5","volume-title":"Artificial Intelligence XXXVIII","author":"A Wallace","year":"2021","unstructured":"Wallace, A., Brownlee, A.E.I., Cairns, D.: Towards explaining metaheuristic solution quality by data mining surrogate fitness models for importance of variables. In: Bramer, M., Ellis, R. (eds.) SGAI-AI 2021. LNCS (LNAI), vol. 13101, pp. 58\u201372. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-91100-3_5"},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"Singh, M., Brownlee, A.E.I., Cairns, D.: Towards explainable metaheuristic: mining surrogate fitness models for importance of variables. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion, GECCO 2022, pp. 1785\u20131793. Association for Computing Machinery, New York (2022)","DOI":"10.1145\/3520304.3533966"},{"issue":"3","key":"27_CR12","doi-asserted-by":"publisher","first-page":"1639","DOI":"10.1016\/S0362-546X(96)00267-2","volume":"30","author":"A Duygu Arbatli","year":"1997","unstructured":"Duygu Arbatli, A., Levent Akin, H.: Rule extraction from trained neural networks using genetic algorithms. Nonlinear Anal.: Theory Methods Appl. 30(3), 1639\u20131648 (1997)","journal-title":"Nonlinear Anal.: Theory Methods Appl."},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"Sharma, S., Henderson, J., Ghosh, J.: CERTIFAI: counterfactual explanations for robustness, transparency, interpretability, and fairness of artificial intelligence models. In: Proceedings of the AAAI\/ACM Conference on AI, Ethics, and Society (2020)","DOI":"10.1145\/3375627.3375812"},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"Fyvie, M., McCall, J.A.W., Christie, L.A., Brownlee, A.E.: Explaining a staff rostering genetic algorithm using sensitivity analysis and trajectory analysis. In: Genetic and Evolutionary Computation Conference Companion (GECCO 2023 Companion), 15\u201319 July 2023, Lisbon, Portugal (2023)","DOI":"10.1145\/3583133.3596353"},{"key":"27_CR15","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-030-04191-5_25","volume-title":"Artificial Intelligence XXXV","author":"M Dimitropoulaki","year":"2018","unstructured":"Dimitropoulaki, M., Kern, M., Owusu, G., McCormick, A.: Workforce rostering via metaheuristics. In: Bramer, M., Petridis, M. (eds.) SGAI 2018. LNCS (LNAI), vol. 11311, pp. 277\u2013290. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-04191-5_25"},{"key":"27_CR16","doi-asserted-by":"crossref","unstructured":"Reid, K.N., et al.: A hybrid metaheuristic approach to a real world employee scheduling problem. In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2019, pp. 1311\u20131318. Association for Computing Machinery, New York (2019)","DOI":"10.1145\/3321707.3321769"},{"key":"27_CR17","unstructured":"Fyvie, M., McCall, J.A., Christie, L.A., Z\u0103voianu, A.C., Brownlee, A.E., Ainslie, R.: Explaining a staff rostering problem by mining trajectory variance structures definition (2023). https:\/\/github.com\/rgu-subsea\/mfyvie_sgai2023_varstruct.git"},{"key":"27_CR18","doi-asserted-by":"publisher","first-page":"89497","DOI":"10.1109\/ACCESS.2020.2990567","volume":"8","author":"J Blank","year":"2020","unstructured":"Blank, J., Deb, K.: Pymoo: multi-objective optimization in python. IEEE Access 8, 89497\u201389509 (2020)","journal-title":"IEEE Access"},{"key":"27_CR19","first-page":"1","volume":"4","author":"K Deb","year":"2014","unstructured":"Deb, K., Deb, D.: Analysing mutation schemes for real-parameter genetic algorithms. Int. J. Artif. Intell. Soft Comput. 4, 1\u201328 (2014)","journal-title":"Int. J. Artif. Intell. Soft Comput."},{"key":"27_CR20","doi-asserted-by":"crossref","unstructured":"Deb, K., Sindhya, K., Okabe, T.: Self-adaptive simulated binary crossover for real-parameter optimization. In: Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation, GECCO 2007, pp. 1187\u20131194. Association for Computing Machinery, New York (2007)","DOI":"10.1145\/1276958.1277190"},{"key":"27_CR21","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-030-91100-3_7","volume-title":"Artificial Intelligence XXXVIII","author":"M Fyvie","year":"2021","unstructured":"Fyvie, M., McCall, J.A.W., Christie, L.A.: Towards explainable metaheuristics: PCA for trajectory mining in evolutionary algorithms. In: Bramer, M., Ellis, R. (eds.) SGAI-AI 2021. LNCS (LNAI), vol. 13101, pp. 89\u2013102. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-91100-3_7"},{"key":"27_CR22","doi-asserted-by":"crossref","unstructured":"Pag\u00e9s, J.: Multiple Factor Analysis by Example Using R, 1 edn. Chapman and Hall\/CRC (2014)","DOI":"10.1201\/b17700-1"},{"key":"27_CR23","doi-asserted-by":"crossref","unstructured":"Seabold, S., Perktold, J.: Statsmodels: econometric and statistical modeling with python. In: Proceedings of the 9th Python in Science Conference 2010 (2010)","DOI":"10.25080\/Majora-92bf1922-011"},{"issue":"293","key":"27_CR24","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1080\/01621459.1961.10482090","volume":"56","author":"OJ Dunn","year":"1961","unstructured":"Dunn, O.J.: Multiple comparisons among means. J. Am. Stat. Assoc. 56(293), 52\u201364 (1961)","journal-title":"J. Am. Stat. Assoc."},{"issue":"1","key":"27_CR25","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1111\/j.2517-6161.1995.tb02031.x","volume":"57","author":"Y Benjamini","year":"1995","unstructured":"Benjamini, Y., Hochberg, Y.: Controlling the false discovery rate: a practical and powerful approach to multiple testing. J. Roy. Stat. Soc.: Ser. B (Methodol.) 57(1), 289\u2013300 (1995)","journal-title":"J. Roy. Stat. Soc.: Ser. B (Methodol.)"},{"issue":"4","key":"27_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1852102.1852106","volume":"28","author":"W Webber","year":"2010","unstructured":"Webber, W., Moffat, A., Zobel, J.: A similarity measure for indefinite rankings. ACM Trans. Inf. Syst. (TOIS) 28(4), 1\u201338 (2010)","journal-title":"ACM Trans. Inf. Syst. (TOIS)"},{"key":"27_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-031-15037-1_11","volume-title":"Brain Informatics","author":"A Sarica","year":"2022","unstructured":"Sarica, A., Quattrone, A., Quattrone, A.: Introducing the rank-biased overlap as similarity measure for feature importance in explainable machine learning: a case study on Parkinson\u2019s disease. In: Mahmud, M., He, J., Vassanelli, S., van Zundert, A., Zhong, N. (eds.) BI 2022. LNCS, vol. 13406, pp. 129\u2013139. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-15037-1_11"},{"key":"27_CR28","unstructured":"Raikar, K.: How to objectively compare two ranked lists in python (2023). https:\/\/towardsdatascience.com\/how-to-objectively-compare-two-ranked-lists-in-python-b3d74e236f6a"}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence XL"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-47994-6_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T14:28:27Z","timestamp":1730471307000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-47994-6_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031479939","9783031479946"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-47994-6_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"8 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SGAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Innovative Techniques and Applications of Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cambridge","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"43","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sgai2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/bcs-sgai.org\/ai2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"ConferenceExpert","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"67","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"27","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"20","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"40% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2 or 3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"A total of 76 reviewers plus two \u2018executive program committees\u2019 (one for each stream)","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}