Masters Degrees (Computer Science)

Permanent URI for this collectionhttps://hdl.handle.net/10413/7114

Browse

Now showing 1 - 4 of 4

Application of ELECTRE algorithms in ontology selection.
(2022) Sooklall, Ameeth.; Fonou-Dombeu, Jean Vincent.
The field of artificial intelligence (AI) is expanding at a rapid pace. Ontology and the field of ontological engineering is an invaluable component of AI, as it provides AI the ability to capture and express complex knowledge and data in a form that encourages computation, inference, reasoning, and dissemination. Accordingly, the research and applications of ontology is becoming increasingly widespread in recent years. However, due to the complexity involved with ontological engineering, it is encouraged that users reuse existing ontologies as opposed to creating ontologies de novo. This in itself has a huge disadvantage as the task of selecting appropriate ontologies for reuse is complex as engineers and users may find it difficult to analyse and comprehend ontologies. It is therefore crucial that techniques and methods be developed in order to reduce the complexity of ontology selection for reuse. Essentially, ontology selection is a Multi-Criteria Decision-Making (MCDM) problem, as there are multiple ontologies to choose from whilst considering multiple criteria. However, there has been little usage of MCDM methods in solving the problem of selecting ontologies for reuse. Therefore, in order to tackle this problem, this study looks to a prominent branch of MCDM, known as the ELimination Et. Choix Traduisant la RÉalite (ELECTRE). ELECTRE is a family of decision-making algorithms that model and provide decision support for complex decisions comprising many alternatives with many characteristics or attributes. The ELECTRE algorithms are extremely powerful and they have been applied successfully in a myriad of domains, however, they have only been studied to a minimal degree with regards to ontology ranking and selection. In this study the ELECTRE algorithms were applied to aid in the selection of ontologies for reuse, particularly, three applications of ELECTRE were studied. The first application focused on ranking ontologies according to their complexity metrics. The ELECTRE I, II, III, and IV models were applied to rank a dataset of 200 ontologies from the BioPortal Repository, with 13 complexity metrics used as attributes. Secondly, the ELECTRE Tri model was applied to classify the 200 ontologies into three classes according to their complexity metrics. A preference-disaggregation approach was taken, and a genetic algorithm was designed to infer the thresholds and parameters for the ELECTRE Tri model. In the third application a novel ELECTRE model was developed, named ZPLTS-ELECTRE II, where the concept of Z-Probabilistic Linguistic Term Set (ZPLTS) was combined with the traditional ELECTRE II algorithm. The ZPLTS-ELECTRE II model enables multiple decision-makers to evaluate ontologies (group decision-making), as well as the ability to use natural language to provide their evaluations. The model was applied to rank 9 ontologies according to five complexity metrics and five qualitative usability metrics. The results of all three applications were analysed, compared, and contrasted, in order to understand the applicability and effectiveness of the ELECTRE algorithms for the task of selecting ontologies for reuse. These results constitute interesting perspectives and insights for the selection and reuse of ontologies.
Hybrid genetic optimisation for quantum feature map design.
(2024) Pellow-Jarman, Rowan Martin.; Pillay, Anban Woolaganathan.; Ilya, Sinayskiy.; Petruccione, Francesco.
Good feature maps are crucial for machine learning kernel methods for effective mapping of non-linearly separable input data into a higher dimension feature space, thus allowing the data to be linearly separable in feature space. Recent works have proposed automating the task of quantum feature map circuit design with methods such as variational ansatz parameter optimization and genetic algorithms. A problem commonly faced by genetic algorithm methods is the high cost of computing the genetic cost function. To mitigate this, this work investigates the suitability of two metrics as alternatives to test set classification accuracy. Accuracy has been applied successfully as a genetic algorithm cost function for quantum feature map design in previous work. The first metric is kernel-target alignment, which has previously been used as a training metric in quantum feature map design by variational ansatz training. Kernel-target alignment is a faster metric to evaluate than test set accuracy and does not require any data points to be reserved from the training set for its evaluation. The second metric is an estimation of kernel-target alignment which further accelerates the genetic fitness evaluation by an adjustable constant factor. The second aim of this work is to address the issue of the limited gate parameter choice available to the genetic algorithm. This is done by training the parameters of the quantum feature map circuits output in the final generation of the genetic algorithm using COBYLA to improve either kernel-target alignment or root mean squared error. This hybrid approach is intended to complement the genetic algorithm structure optimization approach by improving the feature maps without increasing their size. Eight new approaches are compared to the accuracy optimization approach across nine varied binary classification problems from the UCI machine learning repository, demonstrating that kernel-target alignment and its approximation produce feature map circuits enabling comparable accuracy to the original approach, with larger margins on training data that improve further with variational training.
Road obstacle detection Using YOLO algorithm based on attention mechanism.
(2024) Lekola , Bafokeng.; Viriri, Serestina.
Road obstacle detection is an important task in autonomous vehicles (AVs) and advanced driver assistance systems (ADAS) as they require real-time operation and high accuracy for safe operation. The mobile nature of the task means that it is carried out in a low-resourced environment where there is a need for an algorithm that achieves both high accuracy and high inference speed while meeting the requirement for lightweight. In this dissertation, an exploration of the effectiveness of the Attention-enhanced YOLO algorithm for the task of road obstacle detection is carried out. Several state-of-the-art attention modules that employ both channel and spatial attention are explored and fused with the YOLOv8 and YOLOv9 algorithms. These enhance feature maps of the network by suppressing non-distinctive features allowing the network to learn from highly distinctive features. The Attention-modified networks are trained and validated on the Kitti and BDD100k datasets which are publicly available. Comparisons are made between the models and the baseline. An improvement from the baseline is seen with the GAM attention achieving an accuracy rate of 93.3% on the Kitti dataset and 71.1% on the BDD100k dataset. The Attention modules generally achieved incremental improvements over the baseline.
Solar flare recurrence prediction & visual recognition.
(2024) Mngomezulu, Mangaliso Moses.; Gwetu, Mandlenkosi Victor.; Fonou-Dombeu, Jean Vincent.
Solar flares are intense outbursts of radiation observable in the photosphere. The radiation flux is measured in W/m2. Solar flares can kill astronauts, disrupt electrical power grids, and interrupt satellite-dependent technologies. They threaten human survival and the efficiency of technology. The reliability of solar flare prediction models is often undermined by the stochastic nature of solar flare occurrence as shown in previous studies. The Geostationary Operational Environmental Satellite (GOES) system classifies solar flares based on their radiation flux. This study investigated how Recurrent Neural Network (RNN) models compare to their ensembles when predicting flares that emit at least 10−6W/m2 of radiation flux, known as ≥C class flares. A Long-Short Term Memory (LSTM) and Simple RNN homogeneous ensemble achieved a similar performance with a tied True Skill Statistic (TSS) score of 70 ± 1.5%. Calibration curves showed that ensembles are more reliable. The balanced accuracies of the Simple RNN Ensemble and LSTM are both 85% with f1-scores of 79% and 77% respectively. Furthermore, this study proposed a framework that shows how objective function reparameterization can be used to improve binary (≥C or

Browse

Browsing Masters Degrees (Computer Science) by SDG "SDG4"