Skip to main content

Research Repository

Advanced Search

Outputs (94)

Two-layer ensemble of deep learning models for medical image segmentation. [Article] (2024)
Journal Article
DANG, T., NGUYEN, T.T., MCCALL, J., ELYAN, E. and MORENO-GARCÍA, C.F. 2024. Two-layer ensemble of deep learning models for medical image segmentation. Cognitive computation [online], In Press. Available from: https://doi.org/10.1007/s12559-024-10257-5

One of the most important areas in medical image analysis is segmentation, in which raw image data is partitioned into structured and meaningful regions to gain further insights. By using Deep Neural Networks (DNN), AI-based automated segmentation al... Read More about Two-layer ensemble of deep learning models for medical image segmentation. [Article].

A weighted ensemble of regression methods for gross error identification problem. (2023)
Conference Proceeding
DOBOS, D., DANG, T., NGUYEN, T.T., MCCALL, J., WILSON, A., CORBETT, H. and STOCKTON, P. 2023. A weighted ensemble of regression methods for gross error identification problem. In Proceedings of the 2023 IEEE (Institute of Electrical and Electronics Engineers) Symposium series on computational intelligence (SSCI 2023), 5-8 December 2023, Mexico City, Mexico. Piscataway: IEEE [online], pages 413-420. Available from: https://doi.org/10.1109/SSCI52147.2023.10371882

In this study, we proposed a new ensemble method to predict the magnitude of gross errors (GEs) on measurement data obtained from the hydrocarbon and stream processing industries. Our proposed model consists of an ensemble of regressors (EoR) obtaine... Read More about A weighted ensemble of regression methods for gross error identification problem..

Explaining a staff rostering problem by mining trajectory variance structures. (2023)
Conference Proceeding
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..

Comparison of simulated annealing and evolution strategies for optimising cyclical rosters with uneven demand and flexible trainee placement. (2023)
Conference Proceeding
COLLINS, J., ZĂVOIANU, A.-C. and MCCALL, J.A.W. 2023. Comparison of simulated annealing and evolution strategies for optimising cyclical rosters with uneven demand and flexible trainee placement. In Bramer, M. and Stahl, F. (eds.) Artificial intelligence XL: proceedings of the 43rd SGAI (Specialist Group on Artificial Intelligence) Artificial intelligence international conference 2023 (AI-2023), 12-14 December 2023, Cambridge, UK. Lecture notes in computer science, 14381. Cham: Springer [online], pages 451-464. Available from: https://doi.org/10.1007/978-3-031-47994-6_39

Rosters are often used for real-world staff scheduling requirements. Multiple design factors such as demand variability, shift type placement, annual leave requirements, staff well-being and the placement of trainees need to be considered when constr... Read More about Comparison of simulated annealing and evolution strategies for optimising cyclical rosters with uneven demand and flexible trainee placement..

Explaining a staff rostering genetic algorithm using sensitivity analysis and trajectory analysis. (2023)
Conference Proceeding
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..

DEFEG: deep ensemble with weighted feature generation. (2023)
Journal Article
LUONG, A.V., NGUYEN, T.T., HAN, K., VU, T.H., MCCALL, J. and LIEW, A.W.-C. 2023. DEFEG: deep ensemble with weighted feature generation. Knowledge-based systems [online], 275, article 110691. Available from: https://doi.org/10.1016/j.knosys.2023.110691

With the significant breakthrough of Deep Neural Networks in recent years, multi-layer architecture has influenced other sub-fields of machine learning including ensemble learning. In 2017, Zhou and Feng introduced a deep random forest called gcFores... Read More about DEFEG: deep ensemble with weighted feature generation..

On the elusivity of dynamic optimisation problems. (2023)
Journal Article
ALZA, J., BARTLETT, M., CEBERIO, J. and MCCALL, J. 2023. On the elusivity of dynamic optimisation problems. Swarm and evolutionary computation [online], 78, article 101289. Available from: https://doi.org/10.1016/j.swevo.2023.101289

The field of dynamic optimisation continuously designs and compares algorithms with adaptation abilities that deal with changing problems during their search process. However, restarting the search algorithm after a detected change is sometimes a bet... Read More about On the elusivity of dynamic optimisation problems..

On discovering optimal trade-offs when introducing new routes in existing multi-modal public transport systems. (2022)
Conference Proceeding
HAN, K., CHRISTIE, L.A., ZAVOIANU, A.-C. and MCCALL, J. 2022. On discovering optimal trade-offs when introducing new routes in existing multi-modal public transport systems. In Moreno-Díaz, R., Pichler, F. and Quesada-Arencibia, A. (eds.) Computer aided systems theory: Eurocast 2022; revised selected papers from the 18th International conference on computer aided systems theory (Eurocast 2022), 20-25 February 2022, Las Palmas, Spain. Lecture notes in computer science, 13789. Cham: Springer [online], pages 104-111. Available from: https://doi.org/10.1007/978-3-031-25312-6_12

While self-driving technology is still being perfected, public transport authorities are increasingly interested in the ability to model and optimise the benefits of adding connected and autonomous vehicles (CAVs) to existing multi-modal transport sy... Read More about On discovering optimal trade-offs when introducing new routes in existing multi-modal public transport systems..

Lightweight interpolation-based surrogate modelling for multi-objective continuous optimisation. (2022)
Conference Proceeding
ZAVOIANU, A.-C., LACROIX, B. and MCCALL, J. 2022. Lightweight Interpolation-based surrogate modelling for multiobjective continuous optimisation. In Moreno-Díaz, R., Pichler, F. and Quesada-Arencibia, A. (eds.) Computer aided systems theory: Eurocast 2022; revised selected papers from the 18th International conference on computer aided systems theory (Eurocast 2022), 20-25 February 2022, Las Palmas, Spain. Lecture notes in computer science, 13789. Cham: Springer [online], pages 53-60. Available from: https://doi.org/10.1007/978-3-031-25312-6_6

We propose two surrogate-based strategies for increasing the convergence speed of multi-objective evolutionary algorithms (MOEAs) by stimulating the creation of high-quality individuals early in the run. Both offspring generation strategies are desig... Read More about Lightweight interpolation-based surrogate modelling for multi-objective continuous optimisation..

Ensemble learning based on classifier prediction confidence and comprehensive learning particle swarm optimisation for medical image segmentation. (2022)
Conference Proceeding
DANG, T., NGUYEN, T.T., MCCALL, J. and LIEW, A.W.-C. 2022. Ensemble learning based on classifier prediction confidence and comprehensive learning particle swarm optimisation for medical image segmentation. In Ishibuchi, H., Kwoh, C.-K., Tan, A.-H., Srinivasan, D., Miao, C., Trivedi, A. and Crockett, K. (eds.) Proceedings of the 2022 IEEE Symposium series on computational intelligence (SSCI 2022), 4-7 December 2022, Singapore. Piscataway: IEEE [online], pages 269-276. Available from: https://doi.org/10.1109/SSCI51031.2022.10022114

Segmentation, a process of partitioning an image into multiple segments to locate objects and boundaries, is considered one of the most essential medical imaging process. In recent years, Deep Neural Networks (DNN) have achieved many notable successe... Read More about Ensemble learning based on classifier prediction confidence and comprehensive learning particle swarm optimisation for medical image segmentation..

Job assignment problem and traveling salesman problem: a linked optimisation problem. (2022)
Conference Proceeding
OGUNSEMI, A., MCCALL, J., KERN, M., LACROIX, B., CORSAR, D. and OWUSU, G. 2022. Job assignment problem and traveling salesman problem: a linked optimisation problem. In Bramer, M. and Stahl, F (eds.) Artificial intelligence XXXIX: proceedings of the 42nd SGAI (Specialist Group on Artificial Intelligence) Artificial intelligence international conference 2022 (AI 2022), 13-15 December 2022, Cambridge, UK. Lecture notes in computer science (LNCS), 13652. Cham: Springer [online], pages 19-33. Available from: https://doi.org/10.1007/978-3-031-21441-7_2

Linked decision-making in service management systems has attracted strong adoption of optimisation algorithms. However, most of these algorithms do not incorporate the complexity associated with interacting decision-making systems. This paper, theref... Read More about Job assignment problem and traveling salesman problem: a linked optimisation problem..

Bi-level optimisation and machine learning in the management of large service-oriented field workforces. (2022)
Thesis
AINSLIE, R.T. 2022. Bi-level optimisation and machine learning in the management of large service-oriented field workforces. Robert Gordon University, PhD thesis. Hosted on OpenAIR [online]. Available from: https://doi.org/10.48526/rgu-wt-1880200

The tactical planning problem for members of the service industry with large multi-skilled workforces is an important process that is often underlooked. It sits between the operational plan - which involves the actual allocation of members of the wor... Read More about Bi-level optimisation and machine learning in the management of large service-oriented field workforces..

Analysing the fitness landscape rotation for combinatorial optimisation. (2022)
Conference Proceeding
ALZA, J., BARTLETT, M., CEBERIO, J. and MCCALL, J. 2022. Analysing the fitness landscape rotation for combinatorial optimisation. In Rudolph, G., Kononova, A.V., Aguirre, H., Kerschke, P., Ochoa, G. and Tušar, T. (eds.) Parallel problem solving from nature (PPSN XVII): proceedings of 17th Parallel problem solving from nature international conference 2022 (PPSN 2022), 10-14 September 2022, Dortmund, Germany. Lecture notes in computer science, 13398. Cham: Springer [online], pages 533-547. Available from: https://doi.org/10.1007/978-3-031-14714-2_37

Fitness landscape rotation has been widely used in the field of dynamic combinatorial optimisation to generate test problems with academic purposes. This method changes the mapping between solutions and objective values, but preserves the structure o... Read More about Analysing the fitness landscape rotation for combinatorial optimisation..

Holistic, data-driven, service and supply chain optimisation: linked optimisation. (2022)
Thesis
OGUNSEMI, A. 2022. Holistic, data-driven, service and supply chain optimisation: linked optimisation. Robert Gordon University, PhD thesis. Hosted on OpenAIR [online]. Available from: https://doi.org/10.48526/rgu-wt-1987884

The intensity of competition and technological advancements in the business environment has made companies collaborate and cooperate together as a means of survival. This creates a chain of companies and business components with unified business obje... Read More about Holistic, data-driven, service and supply chain optimisation: linked optimisation..

Ensemble of deep learning models with surrogate-based optimization for medical image segmentation. (2022)
Conference Proceeding
DANG, T., LUONG, A.V., LIEW, A.W.C., MCCALL, J. and NGUYEN, T.T. 2022. Ensemble of deep learning models with surrogate-based optimization for medical image segmentation. In 2022 IEEE (Institute of Electrical and Electronics Engineers) Congress on evolutionary computation (CEC 2022), co-located with 2022 IEEE International joint conferences on neural networks (IJCNN 2022), 2022 IEEE International conference on fuzzy systems (FUZZ-IEEE 2022), 18-23 July 2022, Padua, Italy. Piscataway: IEEE (online), article #1030. Available from: https://doi.org/10.1109/CEC55065.2022.9870389

Deep Neural Networks (DNNs) have created a breakthrough in medical image analysis in recent years. Because clinical applications of automated medical analysis are required to be reliable, robust and accurate, it is necessary to devise effective DNNs... Read More about Ensemble of deep learning models with surrogate-based optimization for medical image segmentation..

Facility location problem and permutation flow shop scheduling problem: a linked optimisation problem. (2022)
Conference Proceeding
OGUNSEMI, A., MCCALL, J., KERN, M., LACROIX, B., CORSAR, D. and OWUSU, G. 2022. Facility location problem and permutation flow shop scheduling problem: a linked optimisation problem. In Fieldsend, J. (ed.) GECCO'22 companion: proceedings of 2022 Genetic and evolutionary computation conference companion, 9-13 July 2022, Boston, USA, [virtual event]. New York: ACM [online], pages 735-738. Available from: https://doi.org/10.1145/3520304.3529033

There is a growing literature spanning several research communities that studies multiple optimisation problems whose solutions interact, thereby leading researchers to consider suitable approaches to joint solution. Real-world problems, like supply... Read More about Facility location problem and permutation flow shop scheduling problem: a linked optimisation problem..

The intersection of evolutionary computation and explainable AI. (2022)
Conference Proceeding
BACARDIT, J., BROWNLEE, A.E.I., CAGNONI, S., IACCA, G., MCCALL, J. and WALKER, D. 2022. The intersection of evolutionary computation and explainable AI. In Fieldsend, J. (ed.) GECCO'22 companion: proceedings of 2022 Genetic and evolutionary computation conference companion, 9-13 July 2022, Boston, USA, [virtual event]. New York: ACM [online], pages 1757-1762. Available from: https://doi.org/10.1145/3520304.3533974

In the past decade, Explainable Artificial Intelligence (XAI) has attracted a great interest in the research community, motivated by the need for explanations in critical AI applications. Some recent advances in XAI are based on Evolutionary Computat... Read More about The intersection of evolutionary computation and explainable AI..

Towards explainable metaheuristics: PCA for trajectory mining in evolutionary algorithms. (2021)
Conference Proceeding
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..

Optimising the introduction of connected and autonomous vehicles in a public transport system using macro-level mobility simulations and evolutionary algorithms. (2021)
Presentation / Conference
HAN, K., CHRISTIE, L.A., ZAVOIANU, A.-C. and MCCALL, J. 2021. Optimising the introduction of connected and autonomous vehicles in a public transport system using macro-level mobility simulations and evolutionary algorithms. Presented at 2021 Genetic and evolutionary computation conference (GECCO 2021), 10-14 July 2021, [virtual conference].

The past five years have seen a rapid development of plans and test pilots aimed at introducing connected and autonomous vehicles (CAVs) in public transport systems around the world. Using a real-world scenario from the Leeds Metropolitan Area as a c... Read More about Optimising the introduction of connected and autonomous vehicles in a public transport system using macro-level mobility simulations and evolutionary algorithms..

Towards the landscape rotation as a perturbation strategy on the quadratic assignment problem. (2021)
Conference Proceeding
ALZA, J., BARTLETT, M., CEBERIO, J. and MCCALL, J. 2021. Towards the landscape rotation as a perturbation strategy on the quadratic assignment problem. In Chicano, F. (ed.) GECCO '21: proceedings of 2021 Genetic and evolutionary computation conference companion, 10-14 July 2021, [virtual conference]. New York: ACM [online], pages 1405-1413. Available from: https://doi.org/10.1145/3449726.3463139

Recent work in combinatorial optimisation have demonstrated that neighbouring solutions of a local optima may belong to more favourable attraction basins. In this sense, the perturbation strategy plays a critical role on local search based algorithms... Read More about Towards the landscape rotation as a perturbation strategy on the quadratic assignment problem..

Weighted ensemble of deep learning models based on comprehensive learning particle swarm optimization for medical image segmentation. (2021)
Conference Proceeding
DANG, T., NGUYEN, T.T., MORENO-GARCIA, C.F., ELYAN, E. and MCCALL, J. 2021. Weighted ensemble of deep learning models based on comprehensive learning particle swarm optimization for medical image segmentation. In Proceeding of 2021 IEEE (Institute of electrical and electronics engineers) Congress on evolutionary computation (CEC 2021), 28 June - 1 July 2021, Kraków, Poland : [virtual conference]. Piscataway: IEEE [online], pages 744-751. Available from: https://doi.org/10.1109/CEC45853.2021.9504929

In recent years, deep learning has rapidly become a method of choice for segmentation of medical images. Deep neural architectures such as UNet and FPN have achieved high performances on many medical datasets. However, medical image analysis algorith... Read More about Weighted ensemble of deep learning models based on comprehensive learning particle swarm optimization for medical image segmentation..

Weighted ensemble of gross error detection methods based on particle swarm optimization. (2021)
Conference Proceeding
DOBOS, D., NGUYEN, T.T., MCCALL, J., WILSON, A., STOCKTON, P. and CORBETT, H. 2021. Weighted ensemble of gross error detection methods based on particle swarm optimization. In Chicano, F. (ed) Proceedings of the 2021 Genetic and evolutionary computation conference (GECCO 2021), 10-14 July 2021, [virtual conference]. New York: ACM [online], pages 307-308. Available from: https://doi.org/10.1145/3449726.3459415

Gross errors, a kind of non-random error caused by process disturbances or leaks, can make reconciled estimates can be very inaccurate and even infeasible. Detecting gross errors thus prevents financial loss from incorrectly accounting and also ident... Read More about Weighted ensemble of gross error detection methods based on particle swarm optimization..

Landscape features and automated algorithm selection for multi-objective interpolated continuous optimisation problems. (2021)
Conference Proceeding
LIEFOOGHE, A., VEREL, S., LACROIX, B., ZĂVOIANU, A.-C. and MCCALL, J. 2021. Landscape features and automated algorithm selection for multi-objective interpolated continuous optimisation problems. In Chicano, F. (ed) Proceedings of 2021 Genetic and evolutionary computation conference (GECCO 2021), 10-14 July 2021, [virtual conference]. New York: ACM [online], pages 421-429. Available from: https://doi.org/10.1145/3449639.3459353

In this paper, we demonstrate the application of features from landscape analysis, initially proposed for multi-objective combinatorial optimisation, to a benchmark set of 1 200 randomly-generated multiobjective interpolated continuous optimisation p... Read More about Landscape features and automated algorithm selection for multi-objective interpolated continuous optimisation problems..

Non-deterministic solvers and explainable AI through trajectory mining. (2021)
Conference Proceeding
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..

Two layer ensemble of deep learning models for medical image segmentation. [Preprint] (2021)
Working Paper
DANG, T., NGUYEN, T.T., MCCALL, J., ELYAN, E. and MORENO-GARCÍA, C.F. 2021. Two layer ensemble of deep learning models for medical image segmentation. arXiv [online]. Available from: https://doi.org/10.48550/arXiv.2104.04809

In recent years, deep learning has rapidly become a method of choice for the segmentation of medical images. Deep Neural Network (DNN) architectures such as UNet have achieved state-of-the-art results on many medical datasets. To further improve the... Read More about Two layer ensemble of deep learning models for medical image segmentation. [Preprint].

VEGAS: a variable length-based genetic algorithm for ensemble selection in deep ensemble learning. (2021)
Conference Proceeding
HAN, K., PHAM, T., VU, T.H., DANG, T., MCCALL, J. and NGUYEN, T.T. 2021. VEGAS: a variable length-based genetic algorithm for ensemble selection in deep ensemble learning. In Nguyen, N.T., Chittayasothorn, S., Niyato, D. and Trawiński, B. (eds.) Intelligent information and database systems: proceedings of the 13th Asian conference on intelligent information and database systems 2021 (ACCIIDS 2021), 7-10 April 2021, [virtual conference]. Lecture Notes in Computer Science, 12672. Cham: Springer [online], pages 168–180. Available from: https://doi.org/10.1007/978-3-030-73280-6_14

In this study, we introduce an ensemble selection method for deep ensemble systems called VEGAS. The deep ensemble models include multiple layers of the ensemble of classifiers (EoC). At each layer, we train the EoC and generates training data for th... Read More about VEGAS: a variable length-based genetic algorithm for ensemble selection in deep ensemble learning..

Ensemble-based relationship discovery in relational databases. (2020)
Conference Proceeding
OGUNSEMI, A., MCCALL, J., KERN, M., LACROIX, B., CORSAR, D. and OWUSU, G. 2020. Ensemble-based relationship discovery in relational databases. In Bramer, M. and Ellis, R. (eds.) Artificial intelligence XXXVII: proceedings of 40th British Computer Society's Specialist Group on Artificial Intelligence (SGAI) Artificial intelligence international conference 2020 (AI-2020), 15-17 December 2020, [virtual conference]. Lecture notes in artificial intelligence, 12498. Cham: Springer [online], pages 286-300. Available from: https://doi.org/10.1007/978-3-030-63799-6_22

We performed an investigation of how several data relationship discovery algorithms can be combined to improve performance. We investigated eight relationship discovery algorithms like Cosine similarity, Soundex similarity, Name similarity, Value ran... Read More about Ensemble-based relationship discovery in relational databases..

Toward an ensemble of object detectors. (2020)
Conference Proceeding
DANG, T., NGUYEN, T.T. and MCCALL, J. 2020. Toward an ensemble of object detectors. In Yang, H., Pasupa, K., Leung, A.C.-S., Kwok, J.T., Chan, J.H. and King, I. (eds.) Neural information processing: proceedings of 27th International conference on neural information processing 2020 (ICONIP 2020), part 5. Communications in computer and information science, 1333. Cham: Springer [online], pages, 458-467. Available from: https://doi.org/10.1007/978-3-030-63823-8_53

The field of object detection has witnessed great strides in recent years. With the wave of deep neural networks (DNN), many breakthroughs have achieved for the problems of object detection which previously were thought to be difficult. However, ther... Read More about Toward an ensemble of object detectors..

A homogeneous-heterogeneous ensemble of classifiers. (2020)
Conference Proceeding
LUONG, A.V., VU, T.H., NGUYEN, P.M., VAN PHAM, N., MCCALL, J., LIEW, A.W.-C. and NGUYEN, T.T. 2020. A homogeneous-heterogeneous ensemble of classifiers. In Yang, H., Pasupa, K., Leung, A.C.-S., Kwok, J.T., Chan, J.H. and King, I. (eds.) Neural information processing: proceedings of 27th International conference on neural information processing 2020 (ICONIP 2020), part 5. Communications in computer and information science, 1333. Cham: Springer [online], pages, 251-259. Available from: https://doi.org/10.1007/978-3-030-63823-8_30

In this study, we introduce an ensemble system by combining homogeneous ensemble and heterogeneous ensemble into a single framework. Based on the observation that the projected data is significantly different from the original data as well as each ot... Read More about A homogeneous-heterogeneous ensemble of classifiers..

Comparative run-time performance of evolutionary algorithms on multi-objective interpolated continuous optimisation problems. (2020)
Conference Proceeding
ZAVOIANU, A.-C., LACROIX, B. and MCCALL, J. 2020. Comparative run-time performance of evolutionary algorithms on multi-objective interpolated continuous optimisation problems. In Bäck, T., Preuss, M., Deutz, A., Wang, H., Doerr, C., Emmerich, M. and Trautmann, H. (eds.) Parallel problem solving from nature: PPSN XVI: proceedings of the 16th Parallel problem solving from nature international conference (PPSN 2020), 5-9 September 2020, Leiden, The Netherlands. Lecture notes in computer science, 12269. Cham; Springer, part 1, pages 287-300. Available from: https://doi.org/10.1007/978-3-030-58112-1_20

We propose a new class of multi-objective benchmark problems on which we analyse the performance of four well established multi-objective evolutionary algorithms (MOEAs) – each implementing a different search paradigm – by comparing run-time converge... Read More about Comparative run-time performance of evolutionary algorithms on multi-objective interpolated continuous optimisation problems..

Racing strategy for the dynamic-customer location-allocation problem. (2020)
Conference Proceeding
ANKRAH, R., LACROIX, B., MCCALL, J., HARDWICK, A., CONWAY, A. and OWUSU, G. 2020. Racing strategy for the dynamic-customer location-allocation problem. In Proceedings of 2020 Institute of Electrical and Electronics Engineers (IEEE) congress on evolutionary computation (IEEE CEC 2020), part of the 2020 (IEEE) World congress on computational intelligence (IEEE WCCI 2020) and co-located with the 2020 International joint conference on neural networks (IJCNN 2020) and the 2020 IEEE International fuzzy systems conference (FUZZ-IEEE 2020), 19-24 July 2020, Glasgow, UK [virtual conference]. Piscataway: IEEE [online], article 9185918. Available from: https://doi.org/10.1109/CEC48606.2020.9185918

In previous work, we proposed and studied a new dynamic formulation of the Location-allocation (LA) problem called the Dynamic-Customer Location-allocation (DC-LA) prob­lem. DC-LA is based on the idea of changes in customer distribution over a define... Read More about Racing strategy for the dynamic-customer location-allocation problem..

WEC: weighted ensemble of text classifiers. (2020)
Conference Proceeding
UPADHYAY, A., NGUYEN, T.T., MASSIE, S. and MCCALL, J. 2020. WEC: weighted ensemble of text classifiers. In Proceedings of 2020 Institute of Electrical and Electronics Engineers (IEEE) congress on evolutionary computation (IEEE CEC 2020), part of the 2020 (IEEE) World congress on computational intelligence (IEEE WCCI 2020) and co-located with the 2020 International joint conference on neural networks (IJCNN 2020) and the 2020 IEEE International fuzzy systems conference (FUZZ-IEEE 2020), 19-24 July 2020, Glasgow, UK [virtual conference]. Piscataway: IEEE [online], article ID 9185641. Available from: https://doi.org/10.1109/CEC48606.2020.9185641

Text classification is one of the most important tasks in the field of Natural Language Processing. There are many approaches that focus on two main aspects: generating an effective representation; and selecting and refining algorithms to build the c... Read More about WEC: weighted ensemble of text classifiers..

Evolved ensemble of detectors for gross error detection. (2020)
Conference Proceeding
NGUYEN, T.T., MCCALL, J., WILSON, A., OCHEI, L., CORBETT, H. and STOCKTON, P. 2020. Evolved ensemble of detectors for gross error detection. In GECCO '20: proceedings of the Genetic and evolutionary computation conference companion (GECCO 2020), 8-12 July 2020, Cancún, Mexico. New York: ACM [online], pages 281-282. Available from: https://doi.org/10.1145/3377929.3389906

In this study, we evolve an ensemble of detectors to check the presence of gross systematic errors on measurement data. We use the Fisher method to combine the output of different detectors and then test the hypothesis about the presence of gross err... Read More about Evolved ensemble of detectors for gross error detection..

Multi-layer heterogeneous ensemble with classifier and feature selection. (2020)
Conference Proceeding
NGUYEN, T.T., VAN PHAM, N., DANG, M.T., LUONG, A.V., MCCALL, J. and LIEW, A.W.C. 2020. Multi-layer heterogeneous ensemble with classifier and feature selection. In GECCO '20: proceedings of the Genetic and evolutionary computation conference (GECCO 2020), 8-12 July 2020, Cancun, Mexico. New York: ACM [online], pages 725-733. Available from: https://doi.org/10.1145/3377930.3389832

Deep Neural Networks have achieved many successes when applying to visual, text, and speech information in various domains. The crucial reasons behind these successes are the multi-layer architecture and the in-model feature transformation of deep le... Read More about Multi-layer heterogeneous ensemble with classifier and feature selection..

Programming heterogeneous parallel machines using refactoring and Monte–Carlo tree search. (2020)
Journal Article
BROWN, C. JANJIC, V., GOLI, M. and MCCALL, J. 2020. Programming heterogeneous parallel machines using refactoring and Monte–Carlo tree search. International journal of parallel programming [online], 48(4): high level parallel programming, pages 583-602. Available from: https://doi.org/10.1007/s10766-020-00665-z

This paper presents a new technique for introducing and tuning parallelism for heterogeneous shared-memory systems (comprising a mixture of CPUs and GPUs), using a combination of algorithmic skeletons (such as farms and pipelines), Monte–Carlo tree s... Read More about Programming heterogeneous parallel machines using refactoring and Monte–Carlo tree search..

Evolving interval-based representation for multiple classifier fusion. (2020)
Journal Article
NGUYEN, T.T., DANG,M.T., BAGHEL, V.A., LUONG, A.V., MCCALL, J. and LIEW, A.W.-C. 2020 Evolving interval-based representation for multiple classifier fusion. Knowledge-based systems [online], 201-202, article ID 106034. Available from: https://doi.org/10.1016/j.knosys.2020.106034

Designing an ensemble of classifiers is one of the popular research topics in machine learning since it can give better results than using each constituent member. Furthermore, the performance of ensemble can be improved using selection or adaptation... Read More about Evolving interval-based representation for multiple classifier fusion..

Confidence in prediction: an approach for dynamic weighted ensemble. (2020)
Conference Proceeding
DO D.T., NGUYEN T.T., NGUYEN T.T., LUONG A.V., LIEW A.W.-C. and MCCALL J. 2020. Confidence in prediction: an approach for dynamic weighted ensemble. In Nguyen N., Jearanaitanakij K., Selamat A., Trawiński B. and Chittayasothorn S. (eds.) Intelligent information and database systems: proceedings of the 12th Asian intelligent information and database systems conference (ACIIDS 2020), 23-26 March 2020, Phuket, Thailand. Lecture Notes in Computer Science, 12033. Cham: Springer [online], part 1, pages 358-370. Available from: https://doi.org/10.1007/978-3-030-41964-6_31

Combining classifiers in an ensemble is beneficial in achieving better prediction than using a single classifier. Furthermore, each classifier can be associated with a weight in the aggregation to boost the performance of the ensemble system. In this... Read More about Confidence in prediction: an approach for dynamic weighted ensemble..

Generation and optimisation of real-world static and dynamic location-allocation problems with application to the telecommunications industry. (2019)
Thesis
ANKRAH, R.B. 2019. Generation and optimisation of real-world static and dynamic location-allocation problems with application to the telecommunications industry. Robert Gordon University [online], PhD thesis. Available from: https://openair.rgu.ac.uk

The location-allocation (LA) problem concerns the location of facilities and the allocation of demand, to minimise or maximise a particular function such as cost, profit or a measure of distance. Many formulations of LA problems have been presented i... Read More about Generation and optimisation of real-world static and dynamic location-allocation problems with application to the telecommunications industry..

Deep heterogeneous ensemble. (2019)
Journal Article
NGUYEN, T.T., DANG, M.T., PHAM, T.D., DAO, L.P., LUONG, A.V., MCCALL, J. and LIEW, A.W.C. 2019. Deep heterogeneous ensemble. Australian journal of intelligent information processing systems [online], 16(1): special issue on neural information processing: proceedings of the 26th International conference on neural information processing (ICONIP 2019), 12-15 December 2019, Sydney, Australia, pages 1-9. Available from: http://ajiips.com.au/papers/V16.1/v16n1_5-13.pdf

In recent years, deep neural networks (DNNs) have emerged as a powerful technique in many areas of machine learning. Although DNNs have achieved great breakthrough in processing images, video, audio and text, it also has some limitations... Read More about Deep heterogeneous ensemble..

Evolving an optimal decision template for combining classifiers. (2019)
Conference Proceeding
NGUYEN, T.T., LUONG, A.V., DANG, M.T., DAO, L.P., NGUYEN, T.T.T., LIEW, A.W.-C. and MCCALL, J. 2019. Evolving an optimal decision template for combining classifiers. In Gedeon, T., Wong, K.W. and Lee, M. (eds.) Neural information processing: proceedings of the 26th International conference on neural information processing (ICONIP 2019), 12-15 December 2019, Sydney, Australia. Part I. Lecture notes in computer science, 11953. Cham: Springer [online], pages 608-620. Available from: https://doi.org/10.1007/978-3-030-36708-4_50

In this paper, we aim to develop an effective combining algorithm for ensemble learning systems. The Decision Template method, one of the most popular combining algorithms for ensemble systems, does not perform well when working on certain datasets l... Read More about Evolving an optimal decision template for combining classifiers..

Ensemble selection based on classifier prediction confidence. (2019)
Journal Article
NGUYEN, T.T., LUONG, A.V., DANG, M.T., LIEW, A.W.-C. and MCCALL, J. 2020. Ensemble selection based on classifier prediction confidence. Pattern recognition [online], 100, article ID 107104. Available from: https://doi.org/10.1016/j.patcog.2019.107104

Ensemble selection is one of the most studied topics in ensemble learning because a selected subset of base classifiers may perform better than the whole ensemble system. In recent years, a great many ensemble selection methods have been introduced.... Read More about Ensemble selection based on classifier prediction confidence..

Introducing the dynamic customer location-allocation problem. (2019)
Conference Proceeding
ANKRAH, R., LACROIX, B., MCCALL, J., HARDWICK, A. and CONWAY, A. 2019. Introducing the dynamic customer location-allocation problem. In Proceedings of the 2019 Institute of Electrical and Electronics Engineers (IEEE) Congress on evolutionary computation (IEEE CEC 2019), 10-13 June 2019, Wellington, NZ. Piscataway: IEEE [online], pages 3157-3164. Available from: https://doi.org/10.1109/CEC.2019.8790150

In this paper, we introduce a new stochastic Location-Allocation Problem which assumes the movement of customers over time. We call this new problem Dynamic Customer Location-Allocation Problem (DC-LAP). The problem is based on the idea that customer... Read More about Introducing the dynamic customer location-allocation problem..

On the definition of dynamic permutation problems under landscape rotation. (2019)
Conference Proceeding
ALZA, J., BARTLETT, M., CEBERIO, J. and MCCALL, J. 2019. On the definition of dynamic permutation problems under landscape rotation. In López-Ibáñez, M. (ed.) Proceedings of the 2019 Genetic and evolutionary computation conference companion (GECCO 2019), 13-17 July 2019, Prague, Czech Republic. New York: ACM [online], pages 1518-1526. Available from: https://doi.org/10.1145/3319619.3326840

Dynamic optimisation problems (DOPs) are optimisation problems that change over time. Typically, DOPs have been defined as a sequence of static problems, and the dynamism has been inserted into existing static problems using different techniques. In... Read More about On the definition of dynamic permutation problems under landscape rotation..

Simultaneous meta-data and meta-classifier selection in multiple classifier system. (2019)
Conference Proceeding
NGUYEN, T.T., LUONG, A.V., NGUYEN, T.M.V., HA, T.S., LIEW, A.W.-C. and MCCALL, J. 2019. Simultaneous meta-data and meta-classifier selection in multiple classifier system. In López-Ibáñez, M. (ed.) Proceedings of the 2019 Genetic and evolutionary computation conference (GECCO ’19), 13-17 July 2019, Prague, Czech Republic. New York: ACM [online], pages 39-46. Available from: https://doi.org/10.1145/3321707.3321770

In ensemble systems, the predictions of base classifiers are aggregated by a combining algorithm (meta-classifier) to achieve better classification accuracy than using a single classifier. Experiments show that the performance of ensembles significan... Read More about Simultaneous meta-data and meta-classifier selection in multiple classifier system..

Limitations of benchmark sets and landscape features for algorithm selection and performance prediction. (2019)
Conference Proceeding
LACROIX, B. and MCCALL, J. 2019. Limitations of benchmark sets and landscape features for algorithm selection and performance prediction. In López-Ibáñe, M. (ed.) Proceedings of the 2019 Genetic and evolutionary computation conference (GECCO 2019) companion, 13-17 July 2019, Prague, Czech Republic. New York: Association for Computing Machinery [online], pages 261-262. Available from: https://doi.org/10.1145/3319619.3322051

Benchmark sets and landscape features are used to test algorithms and to train models to perform algorithm selection or configuration. These approaches are based on the assumption that algorithms have similar performances on problems with similar fea... Read More about Limitations of benchmark sets and landscape features for algorithm selection and performance prediction..

Multi-label classification via incremental clustering on an evolving data stream. (2019)
Journal Article
NGUYEN, T.T., DANG, M.T., LUONG, A.V., LIEW, A. W.-C., LIANG, T. and MCCALL, J. 2019. Multi-label classification via incremental clustering on an evolving data stream. Pattern recognition [online], 95, pages 96-113. Available from: https://doi.org/10.1016/j.patcog.2019.06.001

With the advancement of storage and processing technology, an enormous amount of data is collected on a daily basis in many applications. Nowadays, advanced data analytics have been used to mine the collected data for useful information and make pred... Read More about Multi-label classification via incremental clustering on an evolving data stream..

A holistic metric approach to solving the dynamic location-allocation problem. (2018)
Conference Proceeding
ANKRAH, R., LACROIX, B., MCCALL, J., HARDWICK, A. and CONWAY, A. 2018. A holistic metric approach to solving the dynamic location-allocation problem. In Bramer, M. and Petridis, M. (eds.) Artificial intelligence xxxv: proceedings of the 38th British Computer Society's Specialist Group on Artificial Intelligence (SGAI) International conference on innovative techniques and applications of artificial intelligence (AI-2018), 11-13 December 2018, Cambridge, UK. Lecture notes in artificial intelligence, 11311. Cham: Springer [online], pages 433-439. Available from: https://doi.org/10.1007/978-3-030-04191-5_35

In this paper, we introduce a dynamic variant of the Location-Allocation problem: Dynamic Location-Allocation Problem (DULAP). DULAP involves the location of facilities to service a set of customer demands over a defined horizon. To evaluate a soluti... Read More about A holistic metric approach to solving the dynamic location-allocation problem..

Tactical plan optimisation for large multi-skilled workforces using a bi-level model. (2018)
Conference Proceeding
AINSLIE, R., MCCALL, J., SHAKYA, S. and OWUSU, G. 2018. Tactical plan optimisation for large multi-skilled workforces using a bi-level model. In Proceedings of Institute of Electrical and Electronics Engineers (IEEE) congress on evolutionary computation (IEEE CEC 2018), 8-13 July 2018, Rio de Janeiro, Brazil. Piscataway, NJ: IEEE [online], article ID 8477701. Available from: https://doi.org/10.1109/CEC.2018.8477701

The service chain planning process is a critical component in the operations of companies in the service industry, such as logistics, telecoms or utilities. This process involves looking ahead over various timescales to ensure that available capacity... Read More about Tactical plan optimisation for large multi-skilled workforces using a bi-level model..

An analysis of indirect optimisation strategies for scheduling. (2018)
Conference Proceeding
NEAU, C., REGNIER-COUDERT, O. and MCCALL, J. 2018. An analysis of indirect optimisation strategies for scheduling. In Proceedings of Institute of Electrical and Electronics Engineers (IEEE) congress on evolutionary computation (IEEE CEC 2018), 8-13 July 2018, Rio de Janeiro, Brazil. Piscataway, NJ: IEEE [online], article ID 8477967. Available from: https://doi.org/10.1109/CEC.2018.8477967

By incorporating domain knowledge, simple greedy procedures can be defined to generate reasonably good solutions to many optimisation problems. However, such solutions are unlikely to be optimal and their quality often depends on the way the decision... Read More about An analysis of indirect optimisation strategies for scheduling..

Iterated racing algorithm for simulation-optimisation of maintenance planning. (2018)
Conference Proceeding
LACROIX, B., MCCALL, J. and LONCHAMPT, J. 2018. Iterated racing algorithm for simulation-optimisation of maintenance planning. In Proceedings of the 2018 IEEE congress on evolutionary computation (CEC 2018), 8-13 July 2018, Rio de Janeiro, Brazil. Piscataway, NJ: IEEE [online], article number 8477843. Available from: https://doi.org/10.1109/CEC.2018.8477843

The purpose of this paper is two fold. First, we present a set of benchmark problems for maintenance optimisation called VMELight. This model allows the user to define the number of components in the system to maintain and a number of customisable pa... Read More about Iterated racing algorithm for simulation-optimisation of maintenance planning..

Performance analysis of GA and PBIL variants for real-world location-allocation problems. (2018)
Conference Proceeding
ANKRAH, R., REGNIER-COUDERT, O., MCCALL, J., CONWAY, A. and HARDWICK, A. 2018. Performance analysis of GA and PBIL variants for real-world location-allocation problems. In Proceedings of the 2018 IEEE congress on evolutionary computation (CEC 2018), 8-13 July 2018, Rio de Janeiro, Brazil. Piscataway, NJ: IEEE [online], article number 8477727. Available from: https://doi.org/10.1109/CEC.2018.8477727

The Uncapacitated Location-Allocation problem (ULAP) is a major optimisation problem concerning the determination of the optimal location of facilities and the allocation of demand to them. In this paper, we present two novel problem variants of Non-... Read More about Performance analysis of GA and PBIL variants for real-world location-allocation problems..

Effective and efficient estimation of distribution algorithms for permutation and scheduling problems. (2018)
Thesis
AYODELE, M. 2018. Effective and efficient estimation of distribution algorithms for permutation and scheduling problems. Robert Gordon University, PhD thesis.

Estimation of Distribution Algorithm (EDA) is a branch of evolutionary computation that learn a probabilistic model of good solutions. Probabilistic models are used to represent relationships between solution variables which may give useful, human-un... Read More about Effective and efficient estimation of distribution algorithms for permutation and scheduling problems..

Predicting service levels using neural networks. (2017)
Conference Proceeding
AINSLIE, R., MCCALL, J., SHAKYA, S. and OWUSU, G. 2017. Predicting service levels using neural networks. In Bramer, M. and Petridis, M. (eds.) Artificial intelliegence XXXIV: proceedings of the 37th SGAI International innovative techniques and applications of artifical intelligence conference 2017 (AI 2017), 12-14 December 2017, Cambridge, UK. Lecture notes in computer science, 10630. Cham: Springer [online], pages 411-416. Available from: https://doi.org/10.1007/978-3-319-71078-5_35

In this paper we present a method to predict service levels in utility companies, giving them advanced visibility of expected service outcomes and helping them to ensure adherence to service level agreements made to their clients. Service level adher... Read More about Predicting service levels using neural networks..

Simulation and optimisation of the separation process in offshore oil and gas platforms. (2017)
Thesis
VELESHKI, S. 2017. Simulation and optimisation of the separation process in offshore oil and gas platforms. Robert Gordon University, MRes thesis.

Hydrocarbon separation in offshore oil and gas platforms is the process that transforms extracted crude oil into transportable oil and gas. Temperatures and pressures of the separation system can be adjusted to modify the separation of the hydrocarbo... Read More about Simulation and optimisation of the separation process in offshore oil and gas platforms..

A random key based estimation of distribution algorithm for the permutation flowshop scheduling problem. (2017)
Conference Proceeding
AYODELE, M., MCCALL, J., REGNIER-COUDERT, O. and BOWIE, L. 2017. A random key based estimation of distribution algorithm for the permutation flowshop scheduling problem. In Proceedings of the 2017 IEEE congress on evolutionary computation (CEC 2017), 5-8 June 2017, San Sebastian, Spain. New York: IEEE [online], article number 7969591, pages 2364-2371. Available from: https://doi.org/10.1109/CEC.2017.7969591

Random Key (RK) is an alternative representation for permutation problems that enables application of techniques generally used for continuous optimisation. Although the benefit of RKs to permutation optimisation has been shown, its use within Estima... Read More about A random key based estimation of distribution algorithm for the permutation flowshop scheduling problem..

Estimation of distribution algorithms for the multi-mode resource constrained project scheduling problem. (2017)
Conference Proceeding
AYODELE, M., MCCALL, J. and REGNIER-COUDERT, O. 2017. Estimation of distribution algorithms for the multi-mode resource constrained project scheduling problem. In Proceedings of the 2017 IEEE congress on evolutionary computation (CEC 2017), 5-8 June 2017, San Sebastian, Spain. New York: IEEE [online], article number 7969491, pages 1579-1586. Available from: https://doi.org/10.1109/CEC.2017.7969491

Multi-Mode Resource Constrained Project Problem (MRCPSP) is a multi-component problem which combines two interacting sub-problems; activity scheduling and mode assignment. Multi-component problems have been of research interest to the evolutionary co... Read More about Estimation of distribution algorithms for the multi-mode resource constrained project scheduling problem..

RK-EDA: a novel random key based estimation of distribution algorithm. (2016)
Conference Proceeding
AYODELE, M., MCCALL, J. and REGNIER-COUDERT, O. 2016. RK-EDA: a novel random key based estimation of distribution algorithm. In Handl, J., Hart, E., Lewis, P.R., López-Ibáñez, M., Ochoa, G. and Paechter, B. (eds.) Parallel problem solving from natuture: proceedings of the 14th International parallel problem solving from nature conference (PPSN XIV), 17-21 September 2016, Edinburgh, UK. Lecture notes in computer science, 9921. Cham: Springer [online], pages 849-858. Available from: https://doi.org/10.1007/978-3-319-45823-6_79

The challenges of solving problems naturally represented as permutations by Estimation of Distribution Algorithms (EDAs) have been a recent focus of interest in the evolutionary computation community. One of the most common alternative representation... Read More about RK-EDA: a novel random key based estimation of distribution algorithm..

Predictive planning with neural networks. (2016)
Conference Proceeding
AINSLIE, R., MCCALL, J., SHAKYA, S. and OWUSU, G. 2016. Predictive planning with neural networks. In Proceedings of the International joint conference on neural networks (IJCNN), 24-29 July 2016, Vancouver, Canada. Piscataway: IEEE [online], pages 2110-2117. Available from: https://doi.org/10.1109/IJCNN.2016.7727460

Critical for successful operations of service industries, such as telecoms, utility companies and logistic companies, is the service chain planning process. This involves optimizing resources against expected demand to maximize the utilization and mi... Read More about Predictive planning with neural networks..

BPGA-EDA for the multi-mode resource constrained project scheduling problem. (2016)
Conference Proceeding
AYODELE, M., MCCALL, J. and REGNIER-COUDERT, O. 2016. BPGA-EDA for the multi-mode resource constrained project scheduling problem. In Proceedings of the 2016 IEEE congress on evolutionary computation (CEC 2016), 24-29 July 2016, Vancouver, Canada. Piscataway, NJ: IEEE [online], article number 7744222, pages 3417-3424. Available from: https://doi.org/10.1109/CEC.2016.7744222

The Multi-mode Resource Constrained Project Scheduling Problem (MRCPSP) has been of research interest for over two decades. The problem is composed of two interacting sub problems: mode assignment and activity scheduling. These problems cannot be sol... Read More about BPGA-EDA for the multi-mode resource constrained project scheduling problem..

Truck and trailer scheduling in a real world, dynamic and heterogeneous context. (2016)
Journal Article
REGNIER-COUDERT, O., MCCALL, J., AYODELE, M. and ANDERSON, S. 2016. Truck and trailer scheduling in a real world, dynamic and heterogeneous context. Transportation research, part E: logistics and transportation review [online], 93, pages 389-408. Available from: https://doi.org/10.1016/j.tre.2016.06.010

We present a new variant of the Vehicle Routing Problem based on a real industrial scenario. This VRP is dynamic and heavily constrained and uses time-windows, a heterogeneous vehicle fleet and multiple types of job. A constructive solver is develope... Read More about Truck and trailer scheduling in a real world, dynamic and heterogeneous context..

The role of Walsh structure and ordinal linkage in the optimisation of pseudo-Boolean functions under monotonicity invariance. (2016)
Thesis
CHRISTIE, L.A. 2016. The role of Walsh structure and ordinal linkage in the optimisation of pseudo-Boolean functions under monotonicity invariance. Robert Gordon University, PhD thesis.

Optimisation heuristics rely on implicit or explicit assumptions about the structure of the black-box fitness function they optimise. A review of the literature shows that understanding of structure and linkage is helpful to the design and analysis o... Read More about The role of Walsh structure and ordinal linkage in the optimisation of pseudo-Boolean functions under monotonicity invariance..

Generating easy and hard problems using the proximate optimality principle. [Dataset] (2015)
Dataset
MCCALL, J.A.W., CHRISTIE, L.A. and BROWNLEE, A.E.I. 2015. Generating easy and hard problems using the proximate optimality principle. [Dataset]

These data were gathered to investigate the hypothesis that coherent functions will be easy and anti-coherent functions will be hard for a hillclimber. We generated 10 coherent functions for each length on bit-strings of length 6-100 and the same num... Read More about Generating easy and hard problems using the proximate optimality principle. [Dataset].

Generating easy and hard problems using the proximate optimality principle. (2015)
Conference Proceeding
MCCALL, J.A.W., CHRISTIE, L.A. and BROWNLEE, A.E.I. 2015. Generating easy and hard problems using the proximate optimality principle. In Silva, S. (ed.) Proceedings of the companion publication of the 2015 annual conference on genetic and evolutionary computation (GECCO Companion '15), 11-15 July 2015, Madrid, Spain. New York: ACM [online], pages 767-768. Available from: https://doi.org/10.1145/2739482.2764890

We present an approach to generating problems of variable difficulty based on the well-known Proximate Optimality Principle (POP), often paraphrased as similar solutions have similar fitness. We explore definitions of this concept in terms of metrics... Read More about Generating easy and hard problems using the proximate optimality principle..

Autonomic behavioural framework for structural parallelism over heterogeneous multi-core systems. (2015)
Thesis
GOLI, M. 2015. Autonomic behavioural framework for structural parallelism over heterogeneous multi-core systems. Robert Gordon University, PhD thesis.

With the continuous advancement in hardware technologies, significant research has been devoted to design and develop high-level parallel programming models that allow programmers to exploit the latest developments in heterogeneous multi-core/many-co... Read More about Autonomic behavioural framework for structural parallelism over heterogeneous multi-core systems..

Adaptive heterogeneous parallelism for semi-empirical lattice dynamics in computational materials science. (2015)
Thesis
GARBA, M. 2015. Adaptive heterogeneous parallelism for semi-empirical lattice dynamics in computational materials science. Robert Gordon University, PhD thesis.

With the variability in performance of the multitude of parallel environments available today, the conceptual overhead created by the need to anticipate runtime information to make design-time decisions has become overwhelming. Performance-critical a... Read More about Adaptive heterogeneous parallelism for semi-empirical lattice dynamics in computational materials science..

Structural coherence of problem and algorithm: an analysis for EDAs on all 2-bit and 3-bit problems. (2015)
Conference Proceeding
BROWNLEE, A.E.I., MCCALL, J.A.W. and CHRISTIE, L.A. 2015. Structural coherence of problem and algorithm: an analysis for EDAs on all 2-bit and 3-bit problems. In Proceedings of the 2015 IEEE congress on evolutionary computation (CEC 2015), 25-28 May 2015, Sendai, Japan. Piscataway, NJ: IEEE [online], pages 2066-2073. Available from: https://doi.org/10.1109/CEC.2015.7257139

Metaheuristics assume some kind of coherence between decision and objective spaces. Estimation of Distribution algorithms approach this by constructing an explicit probabilistic model of high fitness solutions, the structure of which is intended to r... Read More about Structural coherence of problem and algorithm: an analysis for EDAs on all 2-bit and 3-bit problems..

Computational aspects of cellular intelligence and their role in artificial intelligence. (2014)
Thesis
GERRARD, C.E. 2014. Computational aspects of cellular intelligence and their role in artificial intelligence. Robert Gordon University, PhD thesis.

The work presented in this thesis is concerned with an exploration of the computational aspects of the primitive intelligence associated with single-celled organisms. The main aim is to explore this Cellular Intelligence and its role within Artificia... Read More about Computational aspects of cellular intelligence and their role in artificial intelligence..

Minimal walsh structure and ordinal linkage of monotonicity-invariant function classes on bit strings. (2014)
Conference Proceeding
CHRISTIE, L.A., MCCALL, J.A.W. and LONIE, D.P. 2014. Minimal walsh structure and ordinal linkage of monotonicity-invariant function classes on bit strings. In Igel, C. (ed.) Proceedings of the 2014 Genetic and evolutionary computation conference (GECCO 2014): a recombination of the 23rd International conference on genetic algorithms (ICGA-2014), and the 19th Annual genetic programming conference (GP-2014), 12-16 July 2014, Vancouver, Canada. New York: ACM [online], pages 333-340. Available from: https://doi.org/10.1145/2576768.2598240

Problem structure, or linkage, refers to the interaction between variables in a black-box fitness function. Discovering structure is a feature of a range of algorithms, including estimation of distribution algorithms (EDAs) and perturbation methods (... Read More about Minimal walsh structure and ordinal linkage of monotonicity-invariant function classes on bit strings..

Applications and design of cooperative multi-agent ARN-based systems. (2014)
Journal Article
GERRARD, C.E., MCCALL, J., MACLEOD, C. and COGHILL, G.M. 2015. Applications and design of cooperative multi-agent ARN-based systems. Soft computing [online], 19(6), pages 1581-1594. Available from: https://doi.org/10.1007/s00500-014-1330-9

The Artificial Reaction Network (ARN) is an Artificial Chemistry inspired by Cell Signalling Networks (CSNs). Its purpose is to represent chemical circuitry and to explore the computational properties responsible for generating emergent high-level be... Read More about Applications and design of cooperative multi-agent ARN-based systems..

Multi-objective particle swarm optimisation: methods and applications. (2014)
Thesis
AL MOUBAYED, N. 2014. Multi-objective particle swarm optimisation: methods and applications. Robert Gordon University, PhD thesis.

Solving real life optimisation problems is a challenging engineering venture. Since the early days of research on optimisation it was realised that many problems do not simply have one optimisation objective. This led to the development of multi-obje... Read More about Multi-objective particle swarm optimisation: methods and applications..

The asset replacement problem state of the art. (2013)
Book Chapter
ANSARIPOOR, A.H., OLIVEIRA, F.S. and LIRET, A. 2013. The asset replacement problem state of the art. In Owusu, G., O'Brien, P., McCall, J. and Doherty, N.F. (eds.) Transforming field and service operations: methodologies for successful technology-driven business transformation. Berlin: Springer [online], chapter 14, pages 213-233. Available from: https://doi.org/10.1007/978-3-642-44970-3_14

This book chapter outlines the different modelling approaches for realising sustainable operations of asset replacement and studying the impact of the economic life, the repair-cost limit and comprehensive cost minimisation models. In particular it a... Read More about The asset replacement problem state of the art..

Exploring aspects of cell intelligence with artificial reaction networks. (2013)
Journal Article
GERRARD, C. E., MCCALL, J., COGHILL, G. M. and MACLEOD, C. 2014. Exploring aspects of cell intelligence with artificial reaction networks. Soft computing [online], 18(10), pages 1899-1912. Available from: https://doi.org/10.1007/s00500-013-1174-8

The Artificial Reaction Network (ARN) is a Cell Signalling Network inspired connectionist representation belonging to the branch of A-Life known as Artificial Chemistry. Its purpose is to represent chemical circuitry and to explore computational prop... Read More about Exploring aspects of cell intelligence with artificial reaction networks..

Combining biochemical network motifs within an ARN-agent control system. (2013)
Conference Proceeding
GERRARD, C.E., MCCALL, J., MACLEOD, C. and COGHILL, G.M. 2013. Combining biochemical network motifs within an ARN-agent control system. In Jin, Y. and Thomas, S.A. (eds.) Proceedings of the 13th UK workshop on computational intelligence (UKCI 2013), 9-11 September 2013, Guildford, UK. New York: IEEE [online], article number 6651281, pages 8-15. Available from: https://doi.org/10.1109/UKCI.2013.6651281

The Artificial Reaction Network (ARN) is an Artificial Chemistry representation inspired by cell signaling networks. The ARN has previously been applied to the simulation of the chemotaxis pathway of Escherichia coli and to the control of limbed robo... Read More about Combining biochemical network motifs within an ARN-agent control system..

Partial structure learning by subset Walsh transform. (2013)
Conference Proceeding
CHRISTIE, L.A., LONIE, D.P. and MCCALL, J.A.W. 2013. Partial structure learning by subset Walsh transform. In Jin, Y. and Thomas, S.A. (eds.) Proceedings of the 13th UK workshop on computational intelligence (UKCI 2013), 9-11 September 2013, Guildford, UK. New York: IEEE [online], article number 6651297, pages 128-135. Available from: https://doi.org/10.1109/UKCI.2013.6651297

Estimation of distribution algorithms (EDAs) use structure learning to build a statistical model of good solutions discovered so far, in an effort to discover better solutions. The non-zero coefficients of the Walsh transform produce a hypergraph rep... Read More about Partial structure learning by subset Walsh transform..

Artificial chemistry approach to exploring search spaces using artificial reaction network agents. (2013)
Conference Proceeding
GERRARD, C.E., MCCALL, J., MACLEOD, C. and COGHILL, G.M. 2013. Artificial chemistry approach to exploring search spaces using artificial reaction network agents. In Proceedings of the 2013 IEEE congress on evolutionary computation (CEC 2013), 20-23 June 2013, Cancun, Mexico. New York: IEEE [online], article number 6557702, pages 1201-1208. Available from: https://doi.org/10.1109/CEC.2013.6557702

The Artificial Reaction Network (ARN) is a cell signaling network inspired representation belonging to the branch of A-Life known as Artificial Chemistry. It has properties in common with both AI and Systems Biology techniques including Artificial Ne... Read More about Artificial chemistry approach to exploring search spaces using artificial reaction network agents..

Bayesian network structure learning using characteristic properties of permutation representations with applications to prostate cancer treatment. (2013)
Thesis
REGNIER-COUDERT, O. 2013. Bayesian network structure learning using characteristic properties of permutation representations with applications to prostate cancer treatment. Robert Gordon University, PhD thesis.

Over the last decades, Bayesian Networks (BNs) have become an increasingly popular technique to model data under presence of uncertainty. BNs are probabilistic models that represent relationships between variables by means of a node structure and a s... Read More about Bayesian network structure learning using characteristic properties of permutation representations with applications to prostate cancer treatment..

Experimental user interface design toolkit for interaction research (IDTR). (2013)
Thesis
GOLOVINE, J.C.R.R. 2013. Experimental user interface design toolkit for interaction research (IDTR). Robert Gordon University, PhD thesis.

The research reported and discussed in this thesis represents a novel approach to User Interface evaluation and optimisation through cognitive modelling. This is achieved through the development and testing of a toolkit or platform titled Toolkit for... Read More about Experimental user interface design toolkit for interaction research (IDTR)..

Probabilistic modelling of oil rig drilling operations for business decision support: a real world application of Bayesian networks and computational intelligence. (2013)
Thesis
FOURNIER, F.A. 2013. Probabilistic modelling of oil rig drilling operations for business decision support: a real world application of Bayesian networks and computational intelligence. Robert Gordon University [online], PhD thesis. Available from: https://openair.rgu.ac.uk

This work investigates the use of evolved Bayesian networks learning algorithms based on computational intelligence meta-heuristic algorithms. These algorithms are applied to a new domain provided by the exclusive data, available to this project from... Read More about Probabilistic modelling of oil rig drilling operations for business decision support: a real world application of Bayesian networks and computational intelligence..

Approximating true relevance model in relevance feedback. (2013)
Thesis
ZHANG, P. 2013. Approximating true relevance model in relevance feedback. Robert Gordon University, PhD thesis.

Relevance is an essential concept in information retrieval (IR) and relevance estimation is a fundamental IR task. It involves not only document relevance estimation, but also estimation of user's information need. Relevance-based language model aims... Read More about Approximating true relevance model in relevance feedback..

Adaptive dynamic control of quadrupedal robotic gaits with artificial reaction networks. (2012)
Conference Proceeding
GERRARD, C.E., MCCALL, J., COGHILL, G.M. and MACLEOD, C. 2012. Adaptive dynamic control of quadrupedal robotic gaits with artificial reaction networks. In Huang, T., Zeng, Z., Li, C. and Leung, C.S. (eds.) Proceedings of the 19th International conference on neural information processing (ICONIP 2012), 12-15 November 2012, Doha, Qatar. Lecture notes in computer science, 7663. Berlin: Springer [online], part I, pages 280-287. Available from: https://doi.org/10.1007/978-3-642-34475-6_34

The Artificial Reaction Network (ARN) is a bio-inspired connectionist paradigm based on the emerging field of Cellular Intelligence. It has properties in common with both AI and Systems Biology techniques including Artificial Neural Networks, Petri N... Read More about Adaptive dynamic control of quadrupedal robotic gaits with artificial reaction networks..

Temporal patterns in artificial reaction networks. (2012)
Conference Proceeding
GERRARD, C., MCCALL, J., COGHILL, G.M. and MACLEOD, C. 2012. Temporal patterns in artificial reaction networks. In Villa, A.E.P., Duch, W., Érdi, P., Masulli, F. and Palm, G. (eds.) Artificial neural networks and machine learning: proceedings of the 22nd International conference on artificial neural networks (ICANN 2012), 11-14 September 2012, Lausanne, Switzerland. Lecture notes in computer science, 7552. Berlin: Springer [online], part I, pages 1-8. Available from: https://doi.org/10.1007/978-3-642-33269-2_1

The Artificial Reaction Network (ARN) is a bio-inspired connectionist paradigm based on the emerging field of Cellular Intelligence. It has properties in common with both AI and Systems Biology techniques including Artificial Neural Networks, Petri N... Read More about Temporal patterns in artificial reaction networks..

Problem dependent metaheuristic performance in Bayesian network structure learning. (2012)
Thesis
WU, Y. 2012. Problem dependent metaheuristic performance in Bayesian network structure learning. Robert Gordon University, PhD thesis.

Bayesian network (BN) structure learning from data has been an active research area in the machine learning field in recent decades. Much of the research has considered BN structure learning as an optimization problem. However, the finding of optimal... Read More about Problem dependent metaheuristic performance in Bayesian network structure learning..

Machine learning for improved pathological staging of prostate cancer: a performance comparison on a range of classifiers. (2011)
Journal Article
REGNIER-COUDERT, O., MCCALL, J., LOTHIAN, R., LAM, T., MCCLINTON, S. and N'DOW, J. 2012. Machine learning for improved pathological staging of prostate cancer: a performance comparison on a range of classifiers. Artificial intelligence in medicine [online], 55(1), pages 25-35. Available from: https://doi.org/10.1016/j.artmed.2011.11.003

Objectives: Prediction of prostate cancer pathological stage is an essential step in a patient's pathway. It determines the treatment that will be applied further. In current practice, urologists use the pathological stage predictions provided in Par... Read More about Machine learning for improved pathological staging of prostate cancer: a performance comparison on a range of classifiers..

Artificial reaction networks. (2011)
Presentation / Conference
GERRARD, C.E., MCCALL, J., COGHILL, G.M. and MACLEOD, C. 2011. Artificial reaction networks. Presented at the 11th UK workshop on computational intelligence (UKCI 2011), 7-9 September 2011, Manchester, UK.

In this paper we present a novel method of simulating cellular intelligence, the Artificial Reaction Network (ARN). The ARN can be described as a modular S-System, with some properties in common with other Systems Biology and AI techniques, including... Read More about Artificial reaction networks..

A sequence-length sensitive approach to learning biological grammars using inductive logic programming. (2011)
Thesis
MAMER, T. 2011. A sequence-length sensitive approach to learning biological grammars using inductive logic programming. Robert Gordon University, PhD thesis.

This thesis aims to investigate if the ideas behind compression principles, such as the Minimum Description Length, can help us to improve the process of learning biological grammars from protein sequences using Inductive Logic Programming (ILP). Con... Read More about A sequence-length sensitive approach to learning biological grammars using inductive logic programming..

Multivariate Markov networks for fitness modelling in an estimation of distribution algorithm. (2009)
Thesis
BROWNLEE, A.E.I. 2009. Multivariate Markov networks for fitness modelling in an estimation of distribution algorithm. Robert Gordon University, PhD thesis.

A well-known paradigm for optimisation is the evolutionary algorithm (EA). An EA maintains a population of possible solutions to a problem which converges on a global optimum using biologically-inspired selection and reproduction operators. These alg... Read More about Multivariate Markov networks for fitness modelling in an estimation of distribution algorithm..

An inductive logic programming approach to learning which uORFs regulate gene expression. (2008)
Thesis
SELPI 2008. An inductive logic programming approach to learning which uORFs regulate gene expression. Robert Gordon University, PhD thesis.

Some upstream open reading frames (uORFs) regulate gene expression (i.e. they are functional) and can play key roles in keeping organisms healthy. However, how uORFs are involved in gene regulation is not het fully understood. In order to get a compl... Read More about An inductive logic programming approach to learning which uORFs regulate gene expression..

Solving the Ising spin glass problem using a bivariate EDA based on Markov random fields. (2006)
Conference Proceeding
SHAKYA, S.K., MCCALL, J.A.W. and BROWN, D.F. 2006. Solving the Ising spin glass problem using a bivariate EDA based on Markov random fields. In Proceedings of the 2006 IEEE congress on evolutionary computation (CEC 2006), 16-21 July 2006, Vancouver, Canada. New York: IEEE [online], article number 1688408, pages 908-915. Available from: https://doi.org/10.1109/CEC.2006.1688408

Markov Random Field (MRF) modelling techniques have been recently proposed as a novel approach to probabilistic modelling for Estimation of Distribution Algorithms (EDAs). An EDA using this technique was called Distribution Estimation using Markov Ra... Read More about Solving the Ising spin glass problem using a bivariate EDA based on Markov random fields..

DEUM: a framework for an estimation of distribution algorithm based on Markov random fields. (2006)
Thesis
SHAKYA, S.K. 2006. DEUM: a framework for an estimation of distribution algorithm based on Markov random fields. Robert Gordon University, PhD thesis.

Estimation of Distribution Algorithms (EDAs) belong to the class of population based optimisation algorithms. They are motivated by the idea of discovering and exploiting the interaction between variables in the solution. They estimate a probability... Read More about DEUM: a framework for an estimation of distribution algorithm based on Markov random fields..

Incorporating a metropolis method in a distribution estimation using Markov random field algorithm. (2005)
Conference Proceeding
SHAKYA, S.K., MCCALL, J.A.W. and BROWN, D.F. 2005. Incorporating a metropolis method in a distribution estimation using Markov random field algorithm. In Proceedings of the 2005 IEEE congress on evolutionary computation (CEC 2005), 2-5 September 2005, Edinburgh, UK. New York: IEEE [online], volume 3, article number 1555017, pages 2576-2583. Available from: https://doi.org/10.1109/CEC.2005.1555017

Markov Random Field (MRF) modelling techniques have been recently proposed as a novel approach to probabilistic modelling for Estimation of Distribution Algorithms (EDAs)[34, 4]. An EDA using this technique, presented in [34], was called Distribution... Read More about Incorporating a metropolis method in a distribution estimation using Markov random field algorithm..

Statistical optimisation and tuning of GA factors. (2005)
Conference Proceeding
PETROVSKI, A., BROWNLEE, A. and MCCALL, J. 2005. Statistical optimisation and tuning of GA factors. In Proceedings of the 2005 IEEE congress on evolutionary computation (CEC 2005), 2-5 September 2005, Edinburgh, UK. New York: IEEE [online], volume 1, article number 1554759, pages 758-764. Available from: https://doi.org/10.1109/CEC.2005.1554759

This paper presents a practical methodology of improving the efficiency of Genetic Algorithms through tuning the factors significantly affecting GA performance. This methodology is based on the methods of statistical inference and has been successful... Read More about Statistical optimisation and tuning of GA factors..

A lightweight, graph-theoretic model of class-based similarity to support object-oriented code reuse. (2003)
Thesis
MACLEAN, A. 2003. A lightweight, graph-theoretic model of class-based similarity to support object-oriented code reuse. Robert Gordon University, PhD thesis. Hosted on OpenAIR [online]. Available from: https://doi.org/10.48526/rgu-wt-1871759

The work presented in this thesis is principally concerned with the development of a method and set of tools designed to support the identification of class-based similarity in collections of object-oriented code. Attention is focused on enhancing th... Read More about A lightweight, graph-theoretic model of class-based similarity to support object-oriented code reuse..

Multi-objective optimisation of cancer chemotherapy using evolutionary algorithms. (2001)
Conference Proceeding
PETROVSKI, A. and MCCALL, J. 2001. Multi-objective optimisation of cancer chemotherapy using evolutionary algorithms. In Zitzler, E., Thiele, L., Deb, K., Coello Coello, C.A. and Corne, D. (eds.) Proceedings of the 1st International conference on evolutionary multi-criterion optimization (EMO 2001), 7-9 March 2001, Zurich, Switzerland. Lecture notes in computer science, 1993. Berlin: Springer [online], pages 531-545. Available from: https://doi.org/10.1007/3-540-44719-9_37

The main objectives of cancer treatment in general, and of cancer chemotherapy in particular, are to eradicate the tumour and to prolong the patient survival time. Traditionally, treatments are optimised with only one objective in mind. As a result o... Read More about Multi-objective optimisation of cancer chemotherapy using evolutionary algorithms..

An application of genetic algorithms to chemotherapy treatment. (1998)
Thesis
PETROVSKI, A. 1998. An application of genetic algorithms to chemotherapy treatment. Robert Gordon University, PhD thesis.

The present work investigates methods for optimising cancer chemotherapy within the bounds of clinical acceptability and making this optimisation easily accessible to oncologists. Clinical oncologists wish to be able to improve existing treatment reg... Read More about An application of genetic algorithms to chemotherapy treatment..