Search Results (25)

Persistent forest fire refugia are areas within fire-prone landscapes that remain fire-free over long periods of time and are crucial for ecosystem resilience. Modelling to develop maps of these refugia is key to informing fire and land use management. We predict persistent forest fire refugia using variables linked to the fire triangle (aspect, slope, elevation, topographic wetness, convergence and roughness, solar irradiation, temperature, surface wind direction, and speed) in machine learning algorithms (Random Forest, XGBoost; two ensemble models) and K-Nearest Neighbour. All models were run with and without ADASYN over-sampling and grid search hyperparameterisation. Six iterations were run per algorithm to assess the impact of omitting variables. Aspect is twice as influential as any other variable across all models. Solar radiation and surface wind direction are also highlighted, although the order of importance differs between algorithms. The predominant importance of aspect relates to solar radiation received by sun-facing slopes and resultant heat and moisture balances and, in this study area, the predominant fire wind direction. Ensemble models consistently produced the most accurate results. The findings highlight the importance of topographic and microclimatic variables in persistent forest fire refugia prediction, with ensemble machine learning providing reliable forecasting frameworks. Full article

Land surface temperature (LST) is a critical variable for understanding energy exchanges and water balance at the Earth’s surface, as well as for calculating turbulent heat flux and long-wave radiation at the surface–atmosphere interface. Remote sensing techniques, particularly using satellite platforms like Landsat 8 OLI/TIRS and Sentinel-2A, have facilitated detailed LST mapping. Sentinel-2 offers high spatial and temporal resolution multispectral data, but it lacks thermal infrared bands, which Landsat 8 can provide a 30 m resolution with less frequent revisits compared to Sentinel-2. This study employs Sentinel-2 spectral indices as independent variables and Landsat 8-derived LST data as the target variable within a machine-learning framework, enabling LST prediction at a 10 m resolution. This method applies grid search-based hyperparameter-tuned machine learning algorithms—Random Forest (RF), Gradient Boosting Machine (GBM), Support Vector Machine (SVM), and k-Nearest Neighbours (kNN)—to model complex nonlinear relationships between the spectral indices (NDVI, NDWI, NDBI, and BSI) and LST. Grid search, combined with cross-validation, enhanced the model’s prediction accuracy for both pre- and post-monsoon seasons. This approach surpasses earlier methods that either employed untuned models or failed to integrate Sentinel-2 data. This study demonstrates that capturing urban thermal dynamics at fine spatial and temporal scales, combined with tuned machine learning models, can enhance the capability of urban heat island monitoring, climate adaptation planning, and sustainable environmental management models. Full article

Rapid sand filtration is a critical step in the water treatment process, as its effectiveness directly impacts the supply of safe drinking water. However, optimising filtration processes in water treatment plants (WTPs) presents a significant challenge due to the varying operational parameters and conditions. This study applies explainable machine learning to enhance insights into predicting direct filtration operations at the Ålesund WTP in Norway. Three baseline models (Multiple Linear Regression, Support Vector Regression, and K-Nearest Neighbour (KNN)) and three ensemble models (Random Forest (RF), Extra Trees (ET), and XGBoost) were optimised using the GridSearchCV algorithm and implemented on seven filter units to predict their filtered water turbidity. The results indicate that ML models can reliably predict filtered water turbidity in WTPs, with Extra Trees models achieving the highest predictive performance (R² = 0.92). ET, RF, and KNN ranked as the three top-performing models using Alternative Technique for Order of Preference by Similarity to Ideal Solution (A-TOPSIS) ranking for the suite of algorithms used. The feature importance analysis ranked the filter runtime, flow rate, and bed level. SHAP interpretation of the best model provided actionable insights, revealing how operational adjustments during the ripening stage can help mitigate filter breakthroughs. These findings offer valuable guidance for plant operators and highlight the benefits of explainable machine learning in water quality management. Full article

Background/Objectives: Cellular senescence is characterised by irreversible cell cycle arrest and the secretion of a proinflammatory phenotype. In recent years, senescent cell accumulation and senescence-associated secretory phenotype (SASP) secretion have been linked to the onset of chronic degenerative diseases associated with ageing. In this context, the senotherapeutic compounds have emerged as promising drugs that specifically eliminate senescent cells (senolytics) or diminish the damage caused by SASP (senomorphics). On the other hand, computational approaches, such as network pharmacology and machine learning, have revolutionised the identification of novel drugs. These tools enable the analysis of large volumes of compounds and the optimisation of the search for the most promising ones as potential drugs. Therefore, we employed such approaches in the present study to identify potential senotherapeutic compounds. Methods: First, we constructed drug-protein interaction networks related to cellular senescence. Then, using three machine learning models (Random Forest, Support Vector Machine, and K-Nearest Neighbours), we classified these compounds based on their therapeutic potential against senescence. Results: Our results enabled us to identify 714 compounds with potential senescent therapeutic activity, of which 270 exhibited desirable medicinal chemistry properties, and we developed an interactive web tool freely accessible to the scientific community. Conclusions: we found that flavonoids were the most abundant compound class from which 18 have never been reported as senotherapeutics. Full article

Setting parameter values is crucial for the performance of metaheuristics. Tuning the parameters of a metaheuristic is a computationally costly task. Moreover, parameter tuning is difficult considering their inherent stochasticity and problem instance dependence. In this work, we explore the application of machine learning algorithms to suggest suitable parameter values. We propose a methodology to use k-nearest neighbours and artificial neural network algorithms to predict suitable parameter values based on instance features. Here, we evaluate our proposal on the Capacitated Vehicle Routing Problem with Time Windows (CVRPTW) using its state-of-the-art algorithm, Hybrid Genetic Search (HGS). Additionally, we use the well-known tuning algorithm ParamILS to obtain suitable parameter configurations for HGS. We use a well-known instance set that considers between 200 and 1000 clients. Three sets of features based on geographical distribution, time windows, and client clustering are obtained. An in-depth exploratory analysis of the clustering features is also presented. The results are promising, demonstrating that the proposed method can successfully predict suitable parameter configurations for unseen instances and suggest configurations that perform better than baseline configurations. Furthermore, we present an explainability analysis to detect which features are more relevant for the prediction of suitable parameter values. Full article

Air writing is one of the essential fields that the world is turning to, which can benefit from the world of the metaverse, as well as the ease of communication between humans and machines. The research literature on air writing and its applications shows significant work in English and Chinese, while little research is conducted in other languages, such as Arabic. To fill this gap, we propose a hybrid model that combines feature extraction with deep learning models and then uses machine learning (ML) and optical character recognition (OCR) methods and applies grid and random search optimization algorithms to obtain the best model parameters and outcomes. Several machine learning methods (e.g., neural networks (NNs), random forest (RF), K-nearest neighbours (KNN), and support vector machine (SVM)) are applied to deep features extracted from deep convolutional neural networks (CNNs), such as VGG16, VGG19, and SqueezeNet. Our study uses the AHAWP dataset, which consists of diverse writing styles and hand sign variations, to train and evaluate the models. Prepossessing schemes are applied to improve data quality by reducing bias. Furthermore, OCR character (OCR) methods are integrated into our model to isolate individual letters from continuous air-written gestures and improve recognition results. The results of this study showed that the proposed model achieved the best accuracy of 88.8% using NN with VGG16. Full article

Hyperspectral sensors mounted on unmanned aerial vehicles (UAV) offer the prospect of high-resolution multi-temporal spectral analysis for a range of remote-sensing applications. However, although accurate onboard navigation sensors track the moment-to-moment pose of the UAV in flight, geometric distortions are introduced into the scanned data sets. Consequently, considerable time-consuming (user/manual) post-processing rectification effort is generally required to retrieve geometrically accurate mosaics of the hyperspectral data cubes. Moreover, due to the line-scan nature of many hyperspectral sensors and their intrinsic inability to exploit structure from motion (SfM), only 2D mosaics are generally created. To address this, we propose a fast, automated and computationally robust georectification and mosaicking technique that generates 3D hyperspectral point clouds. The technique first morphologically and geometrically examines (and, if possible, repairs) poorly constructed individual hyperspectral cubes before aligning these cubes into swaths. The luminance of each individual cube is estimated and normalised, prior to being integrated into a swath of images. The hyperspectral swaths are co-registered to a targeted element of a luminance-normalised orthomosaic obtained using a standard red–green–blue (RGB) camera and SfM. To avoid computationally intensive image processing operations such as 2D convolutions, key elements of the orthomosaic are identified using pixel masks, pixel index manipulation and nearest neighbour searches. Maximally stable extremal regions (MSER) and speeded-up robust feature (SURF) extraction are then combined with maximum likelihood sample consensus (MLESAC) feature matching to generate the best geometric transformation model for each swath. This geometrically transforms and merges individual pushbroom scanlines into a single spatially continuous hyperspectral mosaic; and this georectified 2D hyperspectral mosaic is then converted into a 3D hyperspectral point cloud by aligning the hyperspectral mosaic with the RGB point cloud used to create the orthomosaic obtained using SfM. A high spatial accuracy is demonstrated. Hyperspectral mosaics with a 5 cm spatial resolution were mosaicked with root mean square positional accuracies of 0.42 m. The technique was tested on five scenes comprising two types of landscape. The entire process, which is coded in MATLAB, takes around twenty minutes to process data sets covering around 30 Ha at a 5 cm resolution on a laptop with 32 GB RAM and an Intel^® Core i7-8850H CPU running at 2.60 GHz. Full article

Inertial measurement units (IMU) are widely used in sports applications to digitise human motion by measuring acceleration and rotational velocity in three-dimensional space. A common machine learning problem is the classification of human motion primitives from IMU data. In order to investigate the classification methods used in the existing literature and to analyse whether and how the time-dependent data structure is considered in the classification process of motion data analysis in sports, a scoping review was conducted. Based on a keyword search, articles from 2010 to 2021 were extracted, and 93 articles were relevant for data extraction. Over- and undersampling of data and data augmentation techniques were rarely used. The classification methods applied can be divided into three main branches: classic machine learning and deep learning models, threshold-based approaches, and dynamic time warping. The most often applied algorithms were support vector machines (SVM), followed by neural networks and k-nearest neighbours. In comparative works, when more than one classifier was applied, random forests, neural networks, boosting models and SVM were found to be the methods that achieved the highest accuracy. If the time-dependent data structure was taken into account, it was incorporated either within the models, for example, by using long-short-term memory models or within the feature calculation step by using rolling windows with an overlap, which was the most common method of considering the time dependency of the IMU data. Full article

The travelling salesman problem (TSP) is perhaps the most researched problem in the field of Computer Science and Operations. It is a known NP-hard problem and has significant practical applications in a variety of areas, such as logistics, planning, and scheduling. Route optimisation not only improves the overall profitability of a logistic centre but also reduces greenhouse gas emissions by minimising the distance travelled. In this article, we propose a simple and improved heuristic algorithm named 2-Opt++, which solves symmetric TSP problems using an enhanced 2-Opt local search technique, to generate better results. As with 2-Opt, our proposed method can also be applied to the Vehicle Routing Problem (VRP), with minor modifications. We have compared our technique with six existing algorithms, namely ruin and recreate, nearest neighbour, genetic algorithm, simulated annealing, Tabu search, and ant colony optimisation. Furthermore, to allow for the complexity of larger TSP instances, we have used a graph compression/candidate list technique that helps in reducing the computational complexity and time. The comprehensive empirical evaluation carried out for this research work shows the efficacy of the 2-Opt++ algorithm as it outperforms the other well-known algorithms in terms of the error margin, execution time, and time of convergence. Full article

k nearest neighbours (kNN) queries are fundamental in many applications, ranging from data mining, recommendation system and Internet of Things, to Industry 4.0 framework applications. In mining, specifically, it can be used for the classification of human activities, iterative closest point registration and pattern recognition and has also been helpful for intrusion detection systems and fault detection. Due to the importance of kNN queries, many algorithms have been proposed in the literature, for both static and dynamic data. In this paper, we focus on exact kNN queries and present a comprehensive survey of exact kNN queries. In particular, we study two fundamental types of exact kNN queries: the kNN Search queries and the kNN Join queries. Our survey focuses on exact approaches over high-dimensional data space, which covers 20 kNN Search methods and 9 kNN Join methods. To the best of our knowledge, this is the first work of a comprehensive survey of exact kNN queries over high-dimensional datasets. We specifically categorise the algorithms based on indexing strategies, data and space partitioning strategies, clustering techniques and the computing paradigm. We provide useful insights for the evolution of approaches based on the various categorisation factors, as well as the possibility of further expansion. Lastly, we discuss some open challenges and future research directions. Full article

The transport of information packets in complex networks is a prototype system for the study of traffic jamming, a nonlinear dynamic phenomenon that arises with increased traffic load and limited network capacity. The underlying mathematical framework helps to reveal how the macroscopic jams build-up from microscopic dynamics, depending on the posting rate, navigation rules, and network structure. We investigate the time series of traffic loads before congestion occurs on two networks with structures that support efficient transport at low traffic or higher traffic density, respectively. Each node has a fixed finite queue length and uses next-nearest-neighbour search to navigate the packets toward their destination nodes and the LIFO queueing rule. We find that when approaching the respective congestion thresholds in these networks, the traffic load fluctuations show a similar temporal pattern; it is described by dominant cyclical trends with multifractal features and the broadening of the singularity spectrum regarding small-scale fluctuations. The long-range correlations captured by the power spectra show a power-law decay with network-dependent exponents. Meanwhile, the short-range correlations dominate at the onset of congestion. These findings reveal inherent characteristics of traffic jams inferred from traffic load time series as warning signs of congestion, complementing statistical indicators such as increased travel time and prolonged queuing in different transportation networks. Full article

3D building models are widely used in many applications. The traditional image-based 3D reconstruction pipeline without using semantic information is inefficient for building reconstruction in rural areas. An oblique view selection methodology for efficient and accurate building reconstruction in rural areas is proposed in this paper. A Mask R-CNN model is trained using satellite datasets and used to detect building instances in nadir UAV images. Then, the detected building instances and UAV images are directly georeferenced. The georeferenced building instances are used to select oblique images that cover buildings by using nearest neighbours search. Finally, precise match pairs are generated from the selected oblique images and nadir images using their georeferenced principal points. The proposed methodology is tested on a dataset containing 9775 UAV images. A total of 4441 oblique images covering 99.4% of all the buildings in the survey area are automatically selected. Experimental results show that the average precision and recall of the oblique view selection are 0.90 and 0.88, respectively. The percentage of robustly matched oblique-oblique and oblique-nadir image pairs are above 94% and 84.0%, respectively. The proposed methodology is evaluated for sparse and dense reconstruction. Experimental results show that the sparse reconstruction based on the proposed methodology reduces 68.9% of the data processing time, and it is comparably accurate and complete. Experimental results also show high consistency between the dense point clouds of buildings reconstructed by the traditional pipeline and the pipeline based on the proposed methodology. Full article

We propose a method for Global Ionospheric Maps of Total Electron Content forecasting using the Nearest Neighbour method. The assumption is that in a database of global ionosphere maps spanning more than two solar cycles, one can select a set of past observations that have similar geomagnetic conditions to those of the current map. The assumption is that the current ionospheric condition can be expressed by a linear combination of conditions seen in the past. The average of these maps leads to common geomagnetic components being preserved and those not shared by several maps being reduced. The method is based on searching the historical database for the dates of the maps closest to the current map and using as a prediction the maps in the database that correspond to time shifts on the prediction horizons. In contrast to other methods of machine learning, the implementation only requires a distance computation and does not need a previous step of model training and adjustment for each prediction horizon. It also provides confidence intervals for the forecast. The method has been analyzed for two full years (2015 and 2018), for selected days of 2015 and 2018, i.e., two storm days and two non-storm days and the performance of the system has been compared with CODE (24- and 48-h forecast horizons). Full article

The current population worldwide extensively uses social media to share thoughts, societal issues, and personal concerns. Social media can be viewed as an intelligent platform that can be augmented with a capability to analyze and predict various issues such as business needs, environmental needs, election trends (polls), governmental needs, etc. This has motivated us to initiate a comprehensive search of the COVID-19 pandemic-related views and opinions amongst the population on Twitter. The basic training data have been collected from Twitter posts. On this basis, we have developed research involving ensemble deep learning techniques to reach a better prediction of the future evolutions of views in Twitter when compared to previous works that do the same. First, feature extraction is performed through an N-gram stacked autoencoder supervised learning algorithm. The extracted features are then involved in a classification and prediction involving an ensemble fusion scheme of selected machine learning techniques such as decision tree (DT), support vector machine (SVM), random forest (RF), and K-nearest neighbour (KNN). all individual results are combined/fused for a better prediction by using both mean and mode techniques. Our proposed scheme of an N-gram stacked encoder integrated in an ensemble machine learning scheme outperforms all the other existing competing techniques such unigram autoencoder, bigram autoencoder, etc. Our experimental results have been obtained from a comprehensive evaluation involving a dataset extracted from open-source data available from Twitter that were filtered by using the keywords “covid”, “covid19”, “coronavirus”, “covid-19”, “sarscov2”, and “covid_19”. Full article

Background and Objectives: Recently, many studies have focused on the early detection of Parkinson’s disease (PD). This disease belongs to a group of neurological problems that immediately affect brain cells and influence the movement, hearing, and various cognitive functions. Medical data sets are often not equally distributed in their classes and this gives a bias in the classification of patients. We performed a Hybrid feature selection framework that can deal with imbalanced datasets like PD. Use the SOMTE algorithm to deal with unbalanced datasets. Removing the contradiction from the features in the dataset and decrease the processing time by using Recursive Feature Elimination (RFE), and Principle Component Analysis (PCA). Materials and Methods: PD acoustic datasets and the characteristics of control subjects were used to construct classification models such as Bagging, K-nearest neighbour (KNN), multilayer perceptron, and the support vector machine (SVM). In the prepressing stage, the synthetic minority over-sampling technique (SMOTE) with two-feature selection RFE and PCA were used. The PD dataset comprises a large difference between the numbers of the infected and uninfected patients, which causes the classification bias problem. Therefore, SMOTE was used to resolve this problem. Results: For model evaluation, the train–test split technique was used for the experiment. All the models were Grid-search tuned, the evaluation results of the SVM model showed the highest accuracy of 98.2%, and the KNN model exhibited the highest specificity of 99%. Conclusions: the proposed method is compared with the current modern methods of detecting Parkinson’s disease and other methods for medical diseases, it was noted that our developed system could treat data bias and reach a high prediction of PD and this can be beneficial for health organizations to properly prioritize assets. Full article