Performing simulations with a realistic biophysical auditory nerve fiber model can be very time-consuming, due to the complex nature of the calculations involved. Here, a surrogate (approximate)... Show morePerforming simulations with a realistic biophysical auditory nerve fiber model can be very time-consuming, due to the complex nature of the calculations involved. Here, a surrogate (approximate) model of such an auditory nerve fiber model was developed using machine learning methods, to perform simulations more efficiently. Several machine learning models were compared, of which a Convolutional Neural Network showed the best performance. In fact, the Convolutional Neural Network was able to emulate the behavior of the auditory nerve fiber model with extremely high similarity ( R 2 > 0 . 99 ), tested under a wide range of experimental conditions, whilst reducing the simulation time by five orders of magnitude. In addition, a method for randomly generating charge-balanced waveforms using hyperplane projection is introduced. In the second part of this paper, the Convolutional Neural Network surrogate model was used by an Evolutionary Algorithm to optimize the shape of the stimulus waveform in terms of energy efficiency. The resulting waveforms resemble a positive Gaussian-like peak, preceded by an elongated negative phase. When comparing the energy of the waveforms generated by the Evolutionary Algorithm with the commonly used square wave, energy decreases of 8%-45% were observed for differ-ent pulse durations. These results were validated with the original auditory nerve fiber model, which demonstrates that the proposed surrogate model can be used as its accurate and efficient replacement.(c) 2023 The Authors. Published by Elsevier B.V. This is an open access article under the CC BY license ( http://creativecommons.org/licenses/by/4.0/ ) Show less
Despite the large overall beneficial effects of endovascular treatment in patients with acute ischemic stroke, severe disability or death still occurs in almost one-third of patients. These... Show moreDespite the large overall beneficial effects of endovascular treatment in patients with acute ischemic stroke, severe disability or death still occurs in almost one-third of patients. These patients, who might not benefit from treatment, have been previously identified with traditional logistic regression models, which may oversimplify relations between characteristics and outcome, or machine learning techniques, which may be difficult to interpret. We developed and evaluated a novel evolutionary algorithm for fuzzy decision trees to accurately identify patients with poor outcome after endovascular treatment, which was defined as having a modified Rankin Scale score (mRS) higher or equal to 5. The created decision trees have the benefit of being comprehensible, easily interpretable models, making its predictions easy to explain to patients and practitioners. Insights in the reason for the predicted outcome can encourage acceptance and adaptation in practice and help manage expectations after treatment. We compared our proposed method to CART, the benchmark decision tree algorithm, on classification accuracy and interpretability. The fuzzy decision tree significantly outperformed CART: using 5-fold cross-validation with on average 1090 patients in the training set and 273 patients in the test set, the fuzzy decision tree misclassified on average 77 (standard deviation of 7) patients compared to 83 (+/- 7) using CART. The mean number of nodes (decision and leaf nodes) in the fuzzy decision tree was 11 (+/- 2) compared to 26 (+/- 1) for CART decision trees. With an average accuracy of 72% and much fewer nodes than CART, the developed evolutionary algorithm for fuzzy decision trees might be used to gain insights into the predictive value of patient characteristics and can contribute to the development of more accurate medical outcome prediction methods with improved clarity for practitioners and patients. Show less
Multi-objective evolutionary computation aims to find high quality (Pareto optimal) solutions that represent the trade-off between multiple objectives. Within this field there are a number of key... Show moreMulti-objective evolutionary computation aims to find high quality (Pareto optimal) solutions that represent the trade-off between multiple objectives. Within this field there are a number of key challenges. Among others, this includes constraint handling and the exploration of mixed-integer search spaces. This thesis investigates how these challenges can be handled at the same time, and in particular how they can be applied in the multi-objective optimisation algorithms. These algorithms are developed in the context of the optimisation of building spatial designs, which describe the exterior shape of a building, and the internal division into different spaces. Spatial designs are developed early in the design process, and thus have a large impact on the final building design, and in turn also on the quality of the building. Here the structural and thermal performance of a building are optimised to reduce resource consumption. The main contributions of this thesis are as follows. Firstly, a representation for building spatial designs in is introduced. Secondly, specialised search operators are designed to ensure only feasible solutions will be explored. Thirdly, data about the discovered solutions is analysed to explain the results to domain experts. Finally, a general purpose multi-objective mixed-integer evolutionary algorithm is developed. Show less
The main goal of this work is to develop a method that, operating on top of an Evolutionary Algorithm, increases its likeliness of finding innovative solutions. This likeliness is laid out to be... Show moreThe main goal of this work is to develop a method that, operating on top of an Evolutionary Algorithm, increases its likeliness of finding innovative solutions. This likeliness is laid out to be increased with the diversity of the solutions found, provided that they are of sufficient quality. The developed method needs to be applicable in a scenario in which the search is required to be started from a single, fixed solution. Therefore, a scheme is envisioned in which the search is performed in a sequential fashion, zooming in on a locally-optimal solution, and then exploring for a new potentially high-quality region based on a memory of solutions encountered earlier in the search. Two exploration criteria, one using an archive of earlier solutions as memory and the other deriving from a surrogate model trained on earlier solutions, were established to be worthwhile for integration into quality-based search. The resulting schemes were applied to a real-world airfoil optimization task, showing both to perform better than the baseline method of multiple standard optimization runs. The model-based approach delivers the best results, in the sense that it finds more solutions, more diverse solutions, and better-quality solutions than the baseline method. Show less
