Binary Datasets Research Articles

Integration of Light Curve Brightness Information and Layered Discriminative Constrained Energy Minimization for Automatic Binary Asteroid Detection

Binary asteroid exploration is an important research focus in the areas of deep space exploration and space informatics because of its unique scientific value in analyzing the structure and gravitational dynamic properties of asteroids, as well as the origin and evolution of celestial bodies in the solar system. Remote photometric observations can reveal the key characteristics of binary asteroids that differ from other kinds of asteroids, especially unary asteroids, and provide an efficient and convenient way to discover binary asteroids. However, the automatic binary asteroid detection problem by advanced machine learning methodology remains unresolved when handing complex asteroid photometric data. For this problem, this article proposes to simulate unary and binary asteroid systems using cellinoid and oblate sphere shape models and generate the corresponding light curve brightness information with different asteroid physical parameters. Then, a benchmark unary and binary asteroid light curve dataset is constructed. Afterward, a layered discriminative constrained energy minimization (LDCEM) method is developed to train a binary asteroid detector in a layered learning manner by enlarging the response differences between the light curve data of unary and binary asteroids such that the two common kinds of asteroids can be well distinguished. The experimental results on the simulated asteroid light curve data, as well as the real observed asteroid light curve data, show that the proposed LDCEM method can yield promising binary asteroid detection performance in comparison with some representative detection methods.

Meta-Heuristic Optimization Algorithm-Based Hierarchical Intrusion Detection System

Numerous network cyberattacks have been launched due to inherent weaknesses. Network intrusion detection is a crucial foundation of the cybersecurity field. Intrusion detection systems (IDSs) are a type of machine learning (ML) software proposed for making decisions without explicit programming and with little human intervention. Although ML-based IDS advancements have surpassed earlier methods, they still struggle to identify attack types with high detection rates (DR) and low false alarm rates (FAR). This paper proposes a meta-heuristic optimization algorithm-based hierarchical IDS to identify several types of attack and to secure the computing environment. The proposed approach comprises three stages: The first stage includes data preprocessing, feature selection, and the splitting of the dataset into multiple binary balanced datasets. In the second stage, two novel meta-heuristic optimization algorithms are introduced to optimize the hyperparameters of the extreme learning machine during the construction of multiple binary models to detect different attack types. These are combined in the last stage using an aggregated anomaly detection engine in a hierarchical structure on account of the model’s accuracy. We propose a software machine learning IDS that enables multi-class classification. It achieved scores of 98.93, 99.63, 99.19, 99.78, and 0.01, with 0.51 for average accuracy, DR, and FAR in the UNSW-NB15 and CICIDS2017 datasets, respectively.

Compressing BERT for Binary Text Classification via Adaptive Truncation before Fine-Tuning

Large-scale pre-trained language models such as BERT have brought much better performance to text classification. However, their large sizes can lead to sometimes prohibitively slow fine-tuning and inference. To alleviate this, various compression methods have been proposed; however, most of these methods solely consider reducing inference time, often ignoring significant increases in training time, and thus are even more resource consuming. In this article, we focus on lottery ticket extraction for the BERT architecture. Inspired by observations that representations at lower layers are often more useful for text classification, we propose that we can identify the winning ticket of BERT for binary text classification through adaptive truncation, i.e., a process that drops the top-k layers of the pre-trained model based on simple, fast computations. In this way, the cost for compressing and fine-tuning, as well as inference, can be vastly reduced. We present experiments on eight mainstream binary text classification datasets covering different input styles (i.e., single-text and text-pair), as well as different typical tasks (e.g., sentiment analysis, acceptability judgement, textual entailment, semantic similarity analysis and natural language inference). Compared with some strong baselines, our method saved 78.1% time and 31.7% memory on average, and up to 86.7 and 48% in extreme cases, respectively. We also saw good performance, often outperforming the original language model.

Comparison of Convolutional Neural Network for Classifying Lung Diseases from Chest CT Images

This paper proposes a convolutional neural network for diagnosing various lung illnesses from chest CT images based on a customized Medical Image Analysis and Detection network (MIDNet18). With simplified model building, minimal complexity, easy technique, and high-performance accuracy, the MIDNet-18 CNN architecture classifies binary and multiclass medical images. Fourteen convolutional layers, 7 pooling layers, 4 dense layers, and 1 classification layer comprise the MIDNet-18 architecture. The medical image classification process involves training, validating, and testing the MIDNet-18 model. In the Lung CT image binary class dataset, 2214 images as training set, 1800 images as validation set, and 831 as test set are considered for classifying COVID images and normal lung images. In the multiclass dataset, 6720 images as training sets belonging to 3 classes, 3360 images as validation sets and 601 images as test sets are considered for classifying COVID, cancer images and normal images. Independent sample size calculated for binary classification is 26 samples for each group. Similarly, 10 sample sizes are calculated for multiclass dataset classification keeping GPower at 80%. To validate the performance of the MIDNet18 CNN architecture, the medical images of two different datasets are compared with existing models like LeNet-5, VGG-16, VGG-19, ResNet-50. In multiclass classification, the MIDNet-18 architecture gives better training accuracy and test accuracy, while the LeNet5 model obtained 92.6% and 95.9%, respectively. Similarly, VGG-16 is 89.3% and 77.2% respectively; VGG-19 is 85.8% and 85.4%, respectively; ResNet50 is 90.6% and 99%, respectively. For binary classification, the MIDNet18 architecture gives better training accuracy and test accuracy, while the LeNet-5 model has obtained 52.3% and 54.3%, respectively. Similarly, VGG 16 is 50.5% and 45.6%, respectively; VGG-19 is 50.6% and 45.6%, respectively; ResNet-50 is 96.1% and 98.4%, respectively. The classified images are further predicted using detectron-2 model and the results identify abnormalities (cancer, COVID-19) with 99% accuracy. The MIDNET18 is significantly more accurate than LeNet5, VGG19, VGG16 algorithms and is marginally better than the RESNET50 algorithm for the given lung binary dataset (Bonferroni — one-way Anova and pairwise comparison of MIDNET, LeNet5, VGG19, VGG16, and RESNET 50 ([Formula: see text])). The proposed MIDNet18 model is significantly more accurate than LeNet5, VGG19, VGG16, ResNet50 algorithms in classifying the diseases for the given multiclass lung dataset (Bonferroni — one-way Anova and pairwise comparison of MIDNET18, LeNet5, VGG19, VGG16, ResNet50 ([Formula: see text])).

A Neural Network Approach to Predict Gibbs Free Energy of Ternary Solid Solutions

We present a data-centric deep learning (DL) approach using neural networks (NNs) to predict the thermodynamics of ternary solid solutions. We explore how NNs can be trained with a dataset of Gibbs free energies computed from a CALPHAD database to predict ternary systems as a function of composition and temperature. We have chosen the energetics of the FCC solid solution phase in 226 binaries consisting of 23 elements at 11 different temperatures to demonstrate the feasibility. The number of binary data points included in the present study is 102,000. We select six ternaries to augment the binary dataset to investigate their influence on the NN prediction accuracy. We examine the sensitivity of data sampling on the prediction accuracy of NNs over selected ternary systems. It is anticipated that the current DL workflow can be further elevated by integrating advanced descriptors beyond the elemental composition and more curated training datasets to improve prediction accuracy and applicability.

Unsupervised Change Detection in Multitemporal VHR Images Based on Deep Kernel PCA Convolutional Mapping Network.

With the development of Earth observation technology, a very-high-resolution (VHR) image has become an important data source of change detection (CD). These days, deep learning (DL) methods have achieved conspicuous performance in the CD of VHR images. Nonetheless, most of the existing CD models based on DL require annotated training samples. In this article, a novel unsupervised model, called kernel principal component analysis (KPCA) convolution, is proposed for extracting representative features from multitemporal VHR images. Based on the KPCA convolution, an unsupervised deep siamese KPCA convolutional mapping network (KPCA-MNet) is designed for binary and multiclass CD. In the KPCA-MNet, the high-level spatial-spectral feature maps are extracted by a deep siamese network consisting of weight-shared KPCA convolutional layers. Then, the change information in the feature difference map is mapped into a 2-D polar domain. Finally, the CD results are generated by threshold segmentation and clustering algorithms. All procedures of KPCA-MNet do not require labeled data. The theoretical analysis and experimental results in two binary CD datasets and one multiclass CD datasets demonstrate the validity, robustness, and potential of the proposed method.

TextConvoNet: a convolutional neural network based architecture for text classification.

This paper presents, TextConvoNet, a novel Convolutional Neural Network (CNN) based architecture for binary and multi-class text classification problems. Most of the existing CNN-based models use one-dimensional convolving filters, where each filter specializes in extracting n-grams features of a particular input word embeddings (Sentence Matrix). These features can be termed as intra-sentence n-gram features. To the best of our knowledge, all the existing CNN models for text classification are based on the aforementioned concept. The presented TextConvoNet not only extracts the intra-sentence n-gram features but also captures the inter-sentence n-gram features in input text data. It uses an alternative approach for input matrix representation and applies a two-dimensional multi-scale convolutional operation on the input. We perform an experimental study on five binary and multi-class classification datasets and evaluate the performance of the TextConvoNet for text classification. The results are evaluated using eight performance measures, accuracy, precision, recall, f1-score, specificity, gmean1, gmean2, and Mathews correlation coefficient (MCC). Furthermore, we extensively compared presented TextConvoNet with machine learning, deep learning, and attention-based models. The experimental results evidenced that the presented TextConvoNet outperformed and yielded better performance than the other used models for text classification purposes.

Stacking ensemble-based HIDS framework for detecting anomalous system processes in Windows based operating systems using multiple word embedding

Globally, more than 80% of end-user devices run on Microsoft’s Windows-based operating systems. Therefore, majority of the cyber-attack payloads are crafted explicitly for exploiting various vulnerabilities that exist across different software modules of Windows-based operating systems. To address this security issue, a stacking ensemble-based HIDS framework for detecting anomalous system processes is proposed in this paper. The proposed HIDS framework analyzes the process files comprising sequence of dll instruction calls made by various application and system processes to the Windows operating system’s kernel for detecting anomalous processes. The framework initially transforms the system process files comprising sequence of dll invocations into their corresponding n-gram feature vectors. It then uses two different state-of-the-art word embedding techniques namely, Word2Vec and GloVe to learn the contextual inter-dependencies between n-gram terms of the feature vectors, and generate fixed length word embedding vectors for each n-gram terms. These learned numeric word embedding vectors along with the n-gram feature vectors corresponding to the system process files are then provided as input to train an ensemble-based classifier model comprising LSTM, Bi-LSTM, GRU and Bi-GRU based base-level classifiers, and a fully connected neural network based meta-level classifier for classification of system process files as either normal or anomalous. The proposed HIDS framework is capable of detecting wide range of Windows-based attacks with high accuracy and precision. Experimental results show that the proposed HIDS framework achieves high accuracy and precision of 91.00% and 93.30%, respectively on the benchmark binary class Australian Defense Force Academy Windows Dataset (ADFA-WD) dataset. It also achieves an accuracy and precision of 68.70% and 67.80%, respectively on the multi-class ADFA-WD dataset, which are significantly higher than other similar HIDS frameworks proposed in the literature.

Cyberbullying Identification System Based Deep Learning Algorithms

Cyberbullying is characterized by deliberate and sustained peer aggression, as well as a power differential between the victim and the perpetrators or abusers. Cyberbullying can have a variety of consequences for victims, including mental health problems, poor academic performance, a tendency to drop out of work, and even suicidal thoughts. The main objective of this study was to develop a cyberbullying detection system (CDS) to uncover hateful and abusive behaviour on social media platforms. Two experiments were carried out to train and test the proposed system with binary and multiclass cyberbullying classification datasets. Hybrid deep learning architecture consisting of convolutional neural networks integrated with bidirectional long short-term memory networks (CNN-BiLSTM) and single BiLSTM models were compared in terms of their ability to classify social media posts into several bullying types related to gender, religion, ethnicity, age, aggression, and non-cyberbullying. Both classifiers showed promising performance in the binary classification dataset (aggressive or non-aggressive bullying), with a detection accuracy of 94%. For the multiclass dataset, BiLSTM outperformed the combined CNN-BiLSTM classifier, achieving an accuracy of 99%. A comparison of our method to the existing method on the multiclass classification dataset revealed that our method performed better in detecting online bullying.

The problem with dichotomizing quality improvement measures

The Anesthesia Quality Institute (AQI) promotes improvements in clinical care outcomes by managing data entered in the National Anesthesia Clinical Outcomes Registry (NACOR). Each case included in NACOR is classified as “performance met” or “performance not met” and expressed as a percentage for a length of time. The clarity associated with this binary classification is associated with limitations on data analysis and presentations that may not be optimal guides to evaluate the quality of care. High compliance benchmarks present another obstacle for evaluating quality. Traditional approaches for interpreting statistical process control (SPC) charts depend on data points above and below a center line, which may not provide adequate characterizations of a QI process with a low failure rate, or few possible data points below the center line. This article demonstrates the limitations associated with the use of binary datasets to evaluate the quality of care at an individual organization with QI measures, describes a method for characterizing binary data with continuous variables and presents a solution to analyze rare QI events using g charts.

Dandelion segmentation with background transfer learning and RGB-attention module

Automatic weed control using weeding robots has arisen as a promising alternative for reducing the amount of herbicide applied in the agriculture and landscaping industry. Dandelion detection is a challenging task for weeding robots. To obtain accurate dandelion segmentation results, a multi-category segmentation dataset is converted into a binary segmentation dataset to learn the difference between background and foreground, which is referred to as background transfer learning. This method can help us use different datasets to overcome the problem of dandelion segmentation in a complex background environment. In addition, the color space information of the dandelion images with concentrated colors is aggregated in convolutional networks. Inspired by the attention mechanism in the neural network, we design a color-attention module to learn the weight of each color space. In this way, the color information is used to segment the dandelion. By combining background transfer learning and color-attention module methods, the dandelion segmentation method can effectively segment the dandelion with a satisfactory accuracy rate. The results of ablation experiments show that for the input images of different colors, the method proposed in this paper can learn different attention information. The proposed method can be used in agricultural and landscape industry weeding.

SplitAVG: A Heterogeneity-Aware Federated Deep Learning Method for Medical Imaging.

Federated learning is an emerging research paradigm for enabling collaboratively training deep learning models without sharing patient data. However, the data from different institutions are usually heterogeneous across institutions, which may reduce the performance of models trained using federated learning. In this study, we propose a novel heterogeneity-aware federated learning method, SplitAVG, to overcome the performance drops from data heterogeneity in federated learning. Unlike previous federated methods that require complex heuristic training or hyper parameter tuning, our SplitAVG leverages the simple network split and feature map concatenation strategies to encourage the federated model training an unbiased estimator of the target data distribution. We compare SplitAVG with seven state-of-the-art federated learning methods, using centrally hosted training data as the baseline on a suite of both synthetic and real-world federated datasets. We find that the performance of models trained using all the comparison federated learning methods degraded significantly with the increasing degrees of data heterogeneity. In contrast, SplitAVG method achieves comparable results to the baseline method under all heterogeneous settings, that it achieves 96.2% of the accuracy and 110.4% of the mean absolute error obtained by the baseline in a diabetic retinopathy binary classification dataset and a bone age prediction dataset, respectively, on highly heterogeneous data partitions. We conclude that SplitAVG method can effectively overcome the performance drops from variability in data distributions across institutions. Experimental results also show that SplitAVG can be adapted to different base convolutional neural networks (CNNs) and generalized to various types of medical imaging tasks. The code is publicly available at https://github.com/zm17943/SplitAVG.

Contour Resampling-Based Garlic Clove Bud Orientation Recognition for High-Speed Precision Seeding

Achieving fast and accurate recognition of garlic clove bud orientation is necessary for high-speed garlic seed righting operation and precision sowing. However, disturbances from actual field sowing conditions, such as garlic skin, vibration, and rapid movement of garlic seeds, can affect the accuracy of recognition. Meanwhile, garlic precision planters need to realize a recognition algorithm with low-delay calculation under the condition of limited computing power, which is a challenge for embedded computing platforms. Existing solutions suffer from low recognition rate and high algorithm complexity. Therefore, a high-speed method for recognizing garlic clove bud direction based on deep learning is proposed, which uses an auxiliary device to obtain the garlic clove contours as the basis for bud orientation classification. First, hybrid garlic breeds with the largest variation in shape were selected randomly and used as research materials, and a binary image dataset of garlic seed contours was created through image sampling and various data enhancement methods to ensure the generalization of the model that had been trained on the data. Second, three lightweight deep-learning classifiers, transfer learning based on MobileNetV3, a naive convolutional neural network model, and a contour resampling-based fully connected network, were utilized to realize accurate and high-speed orientation recognition of garlic clove buds. Third, after the optimization of the model’s structure and hyper-parameters, recognition models suitable for different levels of embedded hardware performance were trained and tested on the low-cost embedded platform. The experimental results showed that the MobileNetV3 model based on transfer learning, the naive convolutional neural network model, and the fully connected model achieved accuracy of 98.71, 98.21, and 98.16%, respectively. The recognition speed of the three including auxiliary programs was 19.35, 97.39, and 151.40 FPS, respectively. Theoretically, the processing speed of 151 seeds per second achieves a 1.3 hm2/h planting speed with single-row operation, which outperforms state-of-the-art methods in garlic-clove-bud-orientation recognition and could meet the needs of high-speed precise seeding.

An Ensemble and Iterative Recovery Strategy Based kGNN Method to Edit Data with Label Noise

Learning label noise is gaining increasing attention from a variety of disciplines, particularly in supervised machine learning for classification tasks. The k nearest neighbors (kNN) classifier is often used as a natural way to edit the training sets due to its sensitivity to label noise. However, the kNN-based editor may remove too many instances if not designed to take care of the label noise. In addition, the one-sided nearest neighbor (NN) rule is unconvincing, as it just considers the nearest neighbors from the perspective of the query sample. In this paper, we propose an ensemble and iterative recovery strategy-based kGNN method (EIRS-kGNN) to edit data with label noise. EIRS-kGNN first uses the general nearest neighbors (GNN) to expand the one-sided NN rule to a binary-sided NN rule, taking the neighborhood of the queried samples into account. Then, it ensembles the prediction results of a finite set of ks in the kGNN to prudently judge the noise levels for each sample. Finally, two loops, i.e., the inner loop and the outer loop, are leveraged to iteratively detect label noise. A frequency indicator is derived from the iterative processes to guide the mixture approaches, including relabeling and removing, to deal with the detected label noise. The goal of EIRS-kGNN is to recover the distribution of the data set as if it were not corrupted. Experimental results on both synthetic data sets and UCI benchmarks, including binary data sets and multi-class data sets, demonstrate the effectiveness of the proposed EIRS-kGNN method.

Foraging with MUSHROOMS: A Mixed-integer Linear Programming Scheduler for Multimessenger Target of Opportunity Searches with the Zwicky Transient Facility

Electromagnetic follow-up of gravitational-wave detections is very resource intensive, taking up hours of limited observation time on dozens of telescopes. Creating more efficient schedules for follow-up will lead to a commensurate increase in counterpart location efficiency without using more telescope time. Widely used in operations research and telescope scheduling, mixed-integer linear programming is a strong candidate to produce these higher-efficiency schedules, as it can make use of powerful commercial solvers that find globally optimal solutions to provided problems. We detail a new target-of-opportunity scheduling algorithm designed with Zwicky Transient Facility in mind that uses mixed-integer linear programming. We compare its performance to gwemopt, the tuned heuristic scheduler used by the Zwicky Transient Facility and other facilities during the third LIGO–Virgo gravitational-wave observing run. This new algorithm uses variable-length observing blocks to enforce cadence requirements and to ensure field observability, along with having a secondary optimization step to minimize slew time. We show that by employing a hybrid method utilizing both this scheduler and gwemopt, the previous scheduler used, in concert, we can achieve an average improvement in detection efficiency of 3%–11% over gwemopt alone for a simulated binary neutron star merger data set consistent with LIGO–Virgo’s third observing run, highlighting the potential of mixed-integer target of opportunity schedulers for future multimessenger follow-up surveys.

Exploring clusters of rare events using unsupervised random forests

Given highly imbalanced data, most learning algorithms face the challenge of accurately predicting rare events, while such cases are the ones that carry importance and useful knowledge. In a binary class label dataset, the rare events are the ones in the minority class. This study used a stroke dataset with a binary class label and the class imbalance ratio was 54:1. In addition to that, the dataset contained missing values and mixed data types. To identify the intrinsic structures in the minority class (the stroke group), Random Forest Clustering was used to produce the proximity matrix and fed to Partition around Medoid (PAM) clustering method to identify the optimal number of clusters. The proximity plot seems to show there could be cluster tendency as Hopkins’s statistics test value was H = 0.8735 and k=2 was identified to be the optimal number of clusters. Based on the internal cluster validation, however, the silhouette coefficient width was small (0.1), indicating that many of the data objects were within the other boundary of the other class. We have suggested a further investigation plan in this paper for the next action.

A curated binary pattern multitarget dataset of focused ATP-binding cassette transporter inhibitors

Multitarget datasets that correlate bioactivity landscapes of small-molecules toward different related or unrelated pharmacological targets are crucial for novel drug design and discovery. ATP-binding cassette (ABC) transporters are critical membrane-bound transport proteins that impact drug and metabolite distribution in human disease as well as disease diagnosis and therapy. Molecular-structural patterns are of the highest importance for the drug discovery process as demonstrated by the novel drug discovery tool ‘computer-aided pattern analysis’ (‘C@PA’). Here, we report a multitarget dataset of 1,167 ABC transporter inhibitors analyzed for 604 molecular substructures in a statistical binary pattern distribution scheme. This binary pattern multitarget dataset (ABC_BPMDS) can be utilized for various areas. These areas include the intended design of (i) polypharmacological agents, (ii) highly potent and selective ABC transporter-targeting agents, but also (iii) agents that avoid clearance by the focused ABC transporters [e.g., at the blood-brain barrier (BBB)]. The information provided will not only facilitate novel drug prediction and discovery of ABC transporter-targeting agents, but also drug design in general in terms of pharmacokinetics and pharmacodynamics.

A Framework to Classify Clinical Data Using a Genetic Algorithm and Artificial Flora-Optimized Neural Network

A new classification framework for a Clinical Decision Support System, utilizing a Genetic algorithm and an Artificial Flora Optimized Neural Network is presented in this paper. GAFON is an artificial neural network whose topology is optimized with Genetic Algorithm and the learnable parameters are optimized with Artificial Flora Optimization algorithm. Drop out technique is used in the topology optimization phase and weight regularization is used in the parameter optimization phase. The proposed method minimizes the co-adaptation problem, reduces over-fitting of training data and improves the generalization of a feed forward neural network. The classification framework developed has been tested for classifying both multi class and binary class clinical datasets. The proposed method attained accuracy values of 86.82% for Hepatitis C Virus (HCV) for Egyptian patients, 84.91% for Vertebral Column 95.65% for Statlog Heart Disease (SHD), SHD and 93.79% for Early Stage Diabetes Risk Prediction (ESDRP), all datasets obtained from UCI repository

Purification of methyl isobutyl ketone via dividing wall column with an internal boiling point of a heterogeneous azeotrope

Methyl isobutyl ketone (MIBK) is an important chemical product used in many fields and is mostly made by the acetone one-step method. It is difficult to extract high-purity MIBK from the reactants where complex azeotropes form, thus leading to traditional MIBK separation process at high energy cost and investments. In this study, a new separation process based on dividing wall column, HA-DWC-U, was developed considering the heterogeneous azeotrope with an internal boiling point. First, thermodynamic research was performed to assure the accuracy of the physical properties. The NRTL and UNIQUAC models were compared, of which some model parameters were regressed from experimental data, and two binary parameter data sets were set for the VLE and LLE calculations. Then, steady-state simulation and optimization of the traditional process and HA-DWC-U were performed, in which continuous variables were optimized in the inner loop using the sequential quadratic programing (SQP) method, while discrete variables were optimized in the outer loop using sensitivity analysis method. Remarkable, the results show that HA-DWC-U has obvious advantages over the traditional separation process, including 18.47% savings in total utility cost and 17.86% savings in total annual cost.

Groundwater Flow Rate Prediction From Geo‐Electrical Features Using Support Vector Machines

AbstractUnsuccessful drillings are issues in groundwater exploration using electrical resistivity profiling (ERP) and vertical electrical sounding (VES). Many geophysical companies spend a lot of money without obtaining the flow rate (FR) required during the campaigns for drinking water supply (CDWS). To solve this problem, we applied the support vector machines (SVMs) to real‐world data to predict the FRs before any drilling operations. First, from the ERP and VES, the features such as shape, type, power, magnitude, pseudo‐fracturing index, and ohmic‐area were defined including the geology of the survey area. Second, the FRs were categorized into four classes (dry: FR0 (FR = 0), unsustainable: FR1 (0 < FR ≤ 1), and productive boreholes: FR2 (1 < FR ≤ 3) and FR3 (FR > 3 m3/hr)) and associated with the features to compose two separated data sets: a multiclass data set () for common prediction during the CDWS and a binary data set (FR < FR2, FR ≥ FR2) addressed to the population living in a rural area. Features were vectorized and data were transformed before feeding to the SVM algorithms. As a result, the SVM models performed 77% of good predictions on and 83% on . Better performances with the optimal hyper‐parameters in (81.61%) and (87.36%) were achieved using the polynomial and radial basis function kernels respectively. Furthermore, the learning curves have shown that the performance scores on can be improved if larger training data becomes available (275 test samples at least) while it is not necessarily so for . As a benefit, the proposed approach could minimize the rate of unsuccessful drillings during future CDWS.