Search

Automated and accurate detection of power quality (PQ) events is important from the point of view of safety as well as maintaining the reliability of the power transmission and distribution network. However, detection of multiple PQ events in a noisy environment is challenging task. Another important issue is the choice of meaningful features that can directly influence the accuracy of PQ detection. Considering these two aforesaid facts, this paper presents a novel framework for automated classification of PQ signals in a noisy environment employing cross Stockwell Transform (XST). The XST proposed in this paper has better noise suppression capability compared to conventional Stockwell Transform. Here, XST was used to convert 1D PQ signals to 2D time–frequency (T–F) images. To improve the accuracy of PQ detection, an automated feature extraction method employing deep learning is implemented in this work. The noise free T–F images obtained using XST were fed as inputs to several pre-trained convolutional neural networks (CNNs) for deep feature extraction. Transfer learning technique was implemented to reduce the computational cost. The extracted deep features were further undergone selection using one-way analysis of variance test followed by false discovery rate correction. The statistically significant deep features were subsequently fed to three benchmark machine learning classifiers for classification of PQ signals. In addition, tests were also carried out on real-life PQ signals to verify the practicability of the proposed framework. Investigations revealed that the proposed method returned mean accuracy of 99.72% and 96.45% for classification of simulated and real-life PQ signals, respectively. [ABSTRACT FROM AUTHOR]

An intrusion detection system (IDS) is a system that monitors network traffic for malicious activity and generates alerts. In anomaly-based detection, machine learning (ML) algorithms exploit various statistical and probabilistic methods to learn from past or historical experience and detect valuable patterns from large, unstructured, and complex datasets. ML-based network intrusion detection aims to identify malicious behavior and alert a system administrator when an intruder tries to penetrate the network. This paper deals with the study, strategic construction, and implementation of a network intrusion detection model based on ML methods. Among the available IDS datasets, five of the most relevant are chosen for the experimental analysis, which are NSL-KDD-2009, CIC-IDS2017, CIC-IDS2018, IoTID20, and UNSW-NB15 datasets. In order to reduce the computation time in the training sample and achieve computational complexity O (N 2.38 ± δ) , we propose a computationally efficient and feasible algorithmic framework for analyzing the network traffic data. The developed approach mainly consists of two phases, i.e., "Scatter Matrices and Eigenvalue Computation based feature Selection" and "Classification procedure for the reduced dimension data." Experimental evaluation of various test case scenarios for the chosen datasets is carried out in the simulation setting. It is observed that the test results outperform the existing intrusion detection methods for detecting certain attack categories. [ABSTRACT FROM AUTHOR]

This research paper focuses on the challenges associated with learning classifiers from large-scale, highly imbalanced datasets prevalent in many real-world applications. Traditional algorithms learning often need better performance and high computational efficiency when dealing with imbalanced data. Factors such as class imbalance, noise, and class overlap make it demanding to learn effective classifiers. In this study, we propose a novel self-paced ensemble framework for classifying imbalanced data. The framework employs under-sampling to self-harmonize data hardness and build a robust ensemble. Extensive experimental testing demonstrates promising results in handling overlapping classes and skewed distributions while maintaining computational efficiency. The self-paced ensemble method addresses the challenges of high imbalance ratios, class overlap, and noise presence in large-scale imbalanced classification problems. By incorporating the knowledge of these challenges into our learning framework, we establish the concept of classification hardness distribution, and the self-paced ensemble is a revolutionary learning paradigm for massive imbalance categorization, capable of improving the performance of existing learning algorithms on imbalanced data and providing better results for future applications. [ABSTRACT FROM AUTHOR]

Though COVID-19 is no longer a pandemic but rather an endemic, the epidemiological situation related to the SARS-CoV-2 virus is developing at an alarming rate, impacting every corner of the world. The rapid escalation of the coronavirus has led to the scientific community engagement, continually seeking solutions to ensure the comfort and safety of society. Understanding the joint impact of medical and non-medical interventions on COVID-19 spread is essential for making public health decisions that control the pandemic. This paper introduces two novel hybrid machine-learning ensembles that combine supervised and unsupervised learning for COVID-19 data classification and regression. The study utilizes publicly available COVID-19 outbreak and potential predictive features in the USA dataset, which provides information related to the outbreak of COVID-19 disease in the US, including data from each of 3142 US counties from the beginning of the epidemic (January 2020) until June 2021. The developed hybrid hierarchical classifiers outperform single classification algorithms. The best-achieved performance metrics for the classification task were Accuracy = 0.912, ROC-AUC = 0.916, and F1-score = 0.916. The proposed hybrid hierarchical ensemble combining both supervised and unsupervised learning allows us to increase the accuracy of the regression task by 11% in terms of MSE, 29% in terms of the area under the ROC, and 43% in terms of the MPP metric. Thus, using the proposed approach, it is possible to predict the number of COVID-19 cases and deaths based on demographic, geographic, climatic, traffic, public health, social-distancing-policy adherence, and political characteristics with sufficiently high accuracy. The study reveals that virus pressure is the most important feature in COVID-19 spread for classification and regression analysis. Five other significant features were identified to have the most influence on COVID-19 spread. The combined ensembling approach introduced in this study can help policymakers design prevention and control measures to avoid or minimize public health threats in the future. [ABSTRACT FROM AUTHOR]

Citizen science (CS) projects have started to utilize Machine Learning (ML) to sort through large datasets generated in fields like astronomy, ecology and biodiversity, biology, and neuroimaging. Human–machine systems have been created to take advantage of the complementary strengths of humans and machines and have been optimized for efficiency and speed. We conducted qualitative content analysis on meta-summaries of documents reporting the results of 12 citizen science projects that used machine learning to optimize classification tasks. We examined the distribution of tasks between citizen scientists, experts, and algorithms, and how epistemic agency was enacted in terms of whose knowledge shapes the distribution of tasks, who decides what knowledge is relevant to the classification, and who validates it. In our descriptive results, we found that experts, who include professional scientists and algorithm developers, are involved in every aspect of a project, from annotating or labelling data to giving data to algorithms to train them to make decisions from predictions. Experts also test and validate models to improve their accuracy by scoring their outputs when algorithms fail to make correct decisions. Experts are mostly the humans involved in a loop, but when algorithms encounter problems, citizens are also involved at several stages. In this paper, we present three main examples of citizens-in-the-loop: (a) when algorithms provide incorrect suggestions; (b) when algorithms fail to know how to perform classification; and (c) when algorithms pose queries. We consider the implications of the emphasis on optimization on the ideal of science and the role of citizen scientists from a perspective informed by Science and Technology Studies (STS) and Information Systems (IS). Based on our findings, we conclude that ML in CS classification projects, far from being deterministic in its nature and effects, may be open to question. There is no guarantee that these technologies can replace citizen scientists, nor any guarantee that they can provide citizens with opportunities for more interesting tasks. [ABSTRACT FROM AUTHOR]

Software developers and maintainers must address security bug reports (SBRs) before they are publicly disclosed, and their system is left vulnerable to attack. Bug tracking systems may contain securities-related reports which are unlabeled as SBRs, which makes it hard for developers to identify them. Therefore, finding unlabeled SBRs is an essential to help security expert developers identify these security issues fast and accurately. The goal of this paper is to aid software developers to better classify bug reports that identify security vulnerabilities as security bug reports through fasttext classifier. Previous work has applied text analytics and machine learning learners to classify which bug reports are security related. We improve on that work, as shown by our analysis of five open-source projects. We first collected a dataset of 45,940 bug reports from five software repositories (e.g., the work of Peters et al. and Shu et al.). Second, we conducted an experiment throughout the classification of SBRs using machine learning technique; particularly, we built fasttext classifiers. Finally, we investigated the accuracy of our built fasttext classifiers in identifying SBRs. Our experiment results show that our fasttext classifier can achieve an average F1 score of 0.81 when used to identify SBRs. Furthermore, we examined the generalizability of identifying SBRs by applying cross-project validation, and our results showed that the fasttext classifier is able to achieve an average F1 score values of 0.65. Finally, we made our data and results available at Alqahtani (fasttext implementation, 2023. https://github.com/isultane/fasttext%5fclassifications) to help the replication of our work. [ABSTRACT FROM AUTHOR]

In this paper, a novel method is introduced to diagnose the cardiac arrhythmias. Automatic diagnosis of cardiac arrhythmias is crucial for successful treatment of heart diseases, and nowadays, machine learning is used to facilitate this purpose. For accurate classification of arrhythmias, it is vital to extract some appropriate features which distinguish different classes. In this research, a deep convolutional neural network is used to extract the features. Since the heart rates of various patients are very different, arrhythmias of a specific class will be placed in different locations of feature space. To reduce the intra-class variations, each patient's heart rate is mapped with a dedicated function to increase its similarity to the heart rate of a training patient. The proposed patient-specific mapping decreases the intra-class variation and significantly increases the classification accuracy of cardiac arrhythmias. The calculated accuracy is about 91.08%, which shows the better performance compared to other similar works. [ABSTRACT FROM AUTHOR]

In recent years, various studies have been conducted on SVMs and their applications in different area. They have been developed significantly in many areas. SVM is one of the most robust classification and regression algorithms that plays a significant role in pattern recognition. However, SVM has not been developed significantly in some areas like large-scale datasets, unbalanced datasets, and multiclass classification. Efficient SVM training in large-scale datasets is of great importance in the big data era. However, as the number of samples increases, the time and memory required to train SVM increase, making SVM impractical even for a medium-sized problem. With the emergence of big data, this problem becomes more significant. This paper presents a novel distributed method for SVM training in which a very small subset of training samples is used for classification, which reduces the problem size and thus the required memory and computational resources. The solution of this problem almost converges to standard SVM. This method includes three steps: first, detecting a subset of distributed training samples, second, creating local models of SVM and obtaining partial vectors, and finally combining the partial vectors and obtaining the global vector and the final model. In addition, the datasets which suffer from unbalanced number of samples and tend to the majority class, the proposed method balances the samples of the two classes and it can be used in unbalanced datasets. The empirical results show that using this method is efficient for large-scale problems. [ABSTRACT FROM AUTHOR]

The Poisson multinomial distribution (PMD) describes the distribution of the sum of n independent but non-identically distributed random vectors, in which each random vector is of length m with 0/1 valued elements and only one of its elements can take value 1 with a certain probability. Those probabilities are different for the m elements across the n random vectors, and form an n × m matrix with row sum equals to 1. We call this n × m matrix the success probability matrix (SPM). Each SPM uniquely defines a PMD . The PMD is useful in many areas such as, voting theory, ecological inference, and machine learning. The distribution functions of PMD , however, are usually difficult to compute and there is no efficient algorithm available for computing it. In this paper, we develop efficient methods to compute the probability mass function (pmf) for the PMD using multivariate Fourier transform, normal approximation, and simulations. We study the accuracy and efficiency of those methods and give recommendations for which methods to use under various scenarios. We also illustrate the use of the PMD via three applications, namely, in ecological inference, uncertainty quantification in classification, and voting probability calculation. We build an R package that implements the proposed methods, and illustrate the package with examples. This paper has online supplementary materials. [ABSTRACT FROM AUTHOR]

Payment cards offer a simple and convenient method for making purchases. Owing to the increase in the usage of payment cards, especially in online purchases, fraud cases are on the rise. The rise creates financial risk and uncertainty, as in the commercial sector, it incurs billions of losses each year. However, real transaction records that can facilitate the development of effective predictive models for fraud detection are difficult to obtain, mainly because of issues related to confidentially of customer information. In this paper, we apply a total of 13 statistical and machine learning models for payment card fraud detection using both publicly available and real transaction records. The results from both original features and aggregated features are analyzed and compared. A statistical hypothesis test is conducted to evaluate whether the aggregated features identified by a genetic algorithm can offer a better discriminative power, as compared with the original features, in fraud detection. The outcomes positively ascertain the effectiveness of using aggregated features for undertaking real-world payment card fraud detection problems. [ABSTRACT FROM AUTHOR]

Motorway incidents are frequent & varied in nature. Incident management on motorways is critical for both driver safety & road network operation. The expected duration of an incident is a key parameter in the decision-making process for control room operators, however, the actual duration for which an incident will impact the network is never known with true certainty. This paper presents a study which compares the ability of different machine learning algorithms to estimate the duration of motorway incidents on Ireland's M50 motorway, using an extensive historical incident database. Results show that the support vector machine has the best performance in most cases, but a different method may need to be used to improve accuracy in some situations. Results highlight the main challenges in accurately forecasting incident durations in real time & recommendations are made for improving prediction accuracy through systematic recording of various additional incident details. [ABSTRACT FROM AUTHOR]

Classification is a widely used supervised learning technique that enables models to discover the relationship between a set of features and a specified label using available data. Its applications span various fields such as engineering, telecommunication, astronomy, and medicine. In this paper, we propose a novel rule-based classifier called RUCIB (RUle-based Classifier Inspired by BRADO), which draws inspiration from the socio-inspired swarm intelligence algorithm known as BRADO. RUCIB introduces two key aspects: the ability to accommodate multiple values for features within a rule and the capability to explore all data features simultaneously. To evaluate the performance of RUCIB, we conducted experiments using ten databases sourced from the UCI machine learning database repository. In terms of classification accuracy, we compared RUCIB to ten well-known classifiers. Our results demonstrate that, on average, RUCIB outperforms Naive Bayes, SVM, PART, Hoeffding Tree, C4.5, ID3, Random Forest, CORER, CN2, and RACER by 9.32%, 8.97%, 7.58%, 7.4%, 7.34%, 7.34%, 7.22%, 5.06%, 5.01%, and 1.92%, respectively. [ABSTRACT FROM AUTHOR]

With the gradual growth of deep learning in machine vision, efficient extraction of 3D point clouds becomes significant. The raw data of the 3D point cloud are sparse, disordered, and immersed in noise, which makes it difficult to classify and segment. Whether 3D point clouds can be classified and segmented or not, the local feature is an essential ingredient. Therefore, this paper proposes a GateNet-based PointNet++ network (G-PointNet++). G-PointNet++ extracts local features more accurately than PointNet++ by suppressing irrelevant features and emphasizing important features. Meanwhile, it refines the feature adaptively. Besides, the SENet and attention mechanism are introduced into PointNet++. G-PointNet++ was evaluated on the public ModelNet dataset, ShapeNet dataset, and S3DIS dataset, and its effectiveness in classification and segmentation tasks was verified. In the classification task, G-PointNet++ achieves an overall classification accuracy (OA) of 95.5% on ModelNet10 and 93.3% on ModelNet40. In the segmentation task, the mIoU of G-PointNet++ reaches 85.5% on ShapeNet. These experiments show that G-PointNet++ achieves better performance and saves more time than PointNet++, and its overall accuracy is higher than that of PCT network on ModeNet40. [ABSTRACT FROM AUTHOR]

Cyberbullying detection systems rely increasingly on machine learning techniques. However, class imbalance in cyberbullying datasets, where the percentage of normal labeled classes is higher than that of abnormal labeled ones, presents a significant challenge for classification algorithms. This issue is particularly problematic in two-class datasets, where conventional machine learning methods tend to perform poorly on minority class samples due to the influence of the majority class. To address this problem, researchers have proposed various oversampling and undersampling techniques. In this paper, we investigate the effectiveness of such techniques in addressing class imbalance in cyberbullying datasets. We conduct an experimental study that involves a preprocessing step to enhance machine learning algorithm performance. We then examine the impact of imbalanced data on classification performance for four cyberbullying datasets. To study the classification performance on balanced cyberbullying datasets, we employ four resampling techniques, namely random undersampling, random oversampling, SMOTE, and SMOTE + TOMEK. We evaluate the impact of each rebalancing technique on classification performance using eight well-known classification algorithms. Our findings demonstrate that the performance of resampling techniques depends on the dataset size, imbalance ratio, and classifier used. The conducted experiments proved that there are no techniques that will always perform better the others. [ABSTRACT FROM AUTHOR]

One of the most important tasks of a network device is packet classification, the support of which has become particularly important with the increasing development of the Internet. In packet classification, the input packets are matched to a set of rules, so that the rule corresponding to each packet is found, and the relevant action(s) is applied to the packet. With the emergence of software-defined networks, many-field rule sets have been introduced, leading to further challenges in the area. One of the best methods of packet classification for today's applications is to use hash tables, because of the fast update support and reasonable searching speed. A well-known packet classification algorithm using hash tables is tuple space search (TSS). TSS extracts the non-wildcard bit positions pattern of the rules, to be used as a hash key in the hash table. Rules with the same pattern are placed in the same cluster. On the other hand, machine learning techniques can be useful to cluster the rule set in many-filed packet classification, due to the increase in the number and type of fields. In this paper, we try to cluster rules using neural gas networks. In this method, there is a specific pattern of bit positions for each cluster of rules, which is non-wildcard in all the rules belonging to the cluster and used as a hash key. The rules of each cluster is hashed into a hash table. In the classification task, the hash key for each cluster is extracted from the packets header according to the non-wildcard pattern of that cluster. Then, using a hashing function, the related rules are investigated to find the highest-priority matching rule. The experimental results show that 93% improvement of throughput on average compared to TSS. [ABSTRACT FROM AUTHOR]

With the increased use of social network sites, such as Twitter, attackers exploit these platforms to spread counterfeit content. Such content can be fake advertisements or illegal content. Classifying such content is a challenging task, especially in Arabic. The Arabic language has a complex structure and makes classification tasks more difficult. This paper presents an approach to classifying Arabic tweets using classical machine learning (non-deep machine learning) and deep learning techniques. Tweets corpus were collected through Twitter API and labelled manually to get a reliable dataset. For an efficient classifier, feature extraction is applied to the corpus dataset. Then, two learning techniques are used for each feature extraction technique on the created dataset using N-gram models (uni-gram, bi-gram, and char-gram). The applied classical machine learning algorithms are support vector machines, neural networks, logistics regression, and naïve Bayes. Global vector (GloVe) and fastText learning models are utilised for the deep learning approaches. The Precision, Recall, and F1-score are the suggested performance measures calculated in this paper. Afterwards, the dataset is increased using the synthetic minority oversampling technique class to create a balanced dataset. After applying the classical machine learning models, the experimental results show that the neural network algorithm outperforms the other algorithms. Moreover, the GloVe outperforms the fastText model for the deep learning approach. [ABSTRACT FROM AUTHOR]

This paper explores the boosting ridge (BR) framework in the extreme learning machine (ELM) community and presents a novel model that trains the base learners as a global ensemble. In the context of Extreme Learning Machine single-hidden-layer networks, the nodes in the hidden layer are preconfigured before training, and the optimisation is performed on the weights in the output layer. The previous implementation of the BR ensemble with ELM (BRELM) as base learners fix the nodes in the hidden layer for all the ELMs. The ensemble learning method generates different output layer coefficients by reducing the residual error of the ensemble sequentially as more base learners are added to the ensemble. As in other ensemble methodologies, base learners are selected until fulfilling ensemble criteria such as size or performance. This paper proposes a global learning method in the BR framework, where base learners are not added step by step, but all are calculated in a single step looking for ensemble performance. This method considers (i) the configurations of the hidden layer are different for each base learner, (ii) the base learners are optimised all at once, not sequentially, thus avoiding saturation, and (iii) the ensemble methodology does not have the disadvantage of working with strong classifiers. Various regression and classification benchmark datasets have been selected to compare this method with the original BRELM implementation and other state-of-the-art algorithms. Particularly, 71 datasets for classification and 52 for regression, have been considered using different metrics and analysing different characteristics of the datasets, such as the size, the number of classes or the imbalanced nature of them. Statistical tests indicate the superiority of the proposed method in both regression and classification problems in all experimental scenarios. [ABSTRACT FROM AUTHOR]

Today we are living in an era where everything is changing to be smart, whether it be a smart home, smart industries, smart irrigation, or a smart meter, where the word smart refers to the involvement of the Internet of Things (IoT). The increased use of IoT infrastructure in these fields has led to the failure of the nodes, increase in threats, attacks, abnormalities, and spying, which is the primary concern and an important domain of an IoT. The main objective of this paper is to use a supervised learning model to predict anomalies in the historical data which can later be incorporated into real-world scenarios to block the upcoming anomalies and attacks. This paper predicts the anomalies on the 350 K data set using the Machine Learning models and compares its performance based on the state of arts. In this paper, two different approaches are used based on the analysis done on the dataset. The classification algorithms were applied to the whole dataset in the first, and then the same classification algorithms were applied after excluding the data points having binary values (0 and 1) in the feature "value" and have achieved an average of 99.4% accuracy for the first case and 99.99% accuracy for the later. [ABSTRACT FROM AUTHOR]

In the modern era, breast cancer (BC) is one of the most prevalent diseases affecting the lifespan of women. Single nucleotide polymorphism (SNP) elucidates an enormous proportion of the hazard in women with a solid family history. Different types of human disorders have been analyzed using Machine Learning methods to locate the vital SNP. The identification of an optimal feature set is the primary constraint in the existing methods owing to the ill effects of multidimensionality. Thus, a novel Bio-Inspired Ensemble Feature Selection (BIEFS) technique has been proposed in this paper to identify the most relevant SNP for accurate classification of BC. An initial feature subset is generated from each base feature selector such as Membership Weight Salp Swarm Algorithm (MWSSA), Crossover Horse Herd Optimization (CHHO), and Levy Mutation Manta-Ray Foraging Optimization (LMMRFO). Then the proposed BIEFS technique obtains the optimized weight of each feature subset through the mutation operator. Finally, the Self-Organizing Deep Auto-Encoder (SODAE) is employed for BC classification. A Gene Expression Omnibus (GEO) dataset is used to assess the proposed methodology. Simulation results validate that the proposed methodology attains a maximum accuracy of 98.75% as compared to the conventional techniques. [ABSTRACT FROM AUTHOR]

With the advancement of smartphone technology, the development of mobile applications is rapidly growing. These apps are designed to help mobile users with a variety of everyday tasks, such as e-commerce and online services. Because these applications are widely used, they are susceptible to malicious user attacks. As a result, new challenges have emerged, such as the inability to differentiate between benign and malicious malware applications. This paper proposes two methods for classifying mobile applications into either benign or malicious: 1D convolution (Conv1d) and long short-term memory (LSTM). The suggested approaches use two encoding techniques, namely binary and text encoding, which were applied to the Android permissions of each application. In addition, the support vector machine and K-nearest-neighbor classifiers are reported as well. The two primary approaches were tested on the well-known CICMalDroid2020 dataset. Conv1d and LSTM with text encoding performed the best in terms of precision and accuracy (98.16%, 97.72%, and 96.63%, 96.69%, respectively). When compared with the Mal-Prem dataset, the Conv1d on binary classification beat the LSTM model. [ABSTRACT FROM AUTHOR]

Twitter produces a massive amount of data due to its popularity that is one of the reasons underlying big data problems. One of those problems is the classification of tweets due to use of sophisticated and complex language, which makes the current tools insufficient. We present our framework HTwitt, built on top of the Hadoop ecosystem, which consists of a MapReduce algorithm and a set of machine learning techniques embedded within a big data analytics platform to efficiently address the following problems: (1) traditional data processing techniques are inadequate to handle big data; (2) data preprocessing needs substantial manual effort; (3) domain knowledge is required before the classification; (4) semantic explanation is ignored. In this work, these challenges are overcome by using different algorithms combined with a Naïve Bayes classifier to ensure reliability and highly precise recommendations in virtualization and cloud environments. These features make HTwitt different from others in terms of having an effective and practical design for text classification in big data analytics. The main contribution of the paper is to propose a framework for building landslide early warning systems by pinpointing useful tweets and visualizing them along with the processed information. We demonstrate the results of the experiments which quantify the levels of overfitting in the training stage of the model using different sizes of real-world datasets in machine learning phases. Our results demonstrate that the proposed system provides high-quality results with a score of nearly 95% and meets the requirement of a Hadoop-based classification system. [ABSTRACT FROM AUTHOR]

Using the zone fire model CFAST as the simulation engine, time series data for building sensors, such as heat detectors, smoke detectors, and other targets at any arbitrary locations in multi-room compartments with different geometric configurations, can be obtained. An automated process for creating inputs files and summarizing model results, CData, is being developed as a companion to CFAST. An example case is presented to demonstrate the use of CData where synthetic data is generated for a wide range of fire scenarios. Three machine learning algorithms: support vector machine (SVM), decision tree (DT), and random forest (RF), are used to develop classification models that can predict the location of a fire based on temperature data within a compartment. Results show that DT and RF have excellent performance on the prediction of fire location and achieve model accuracy in between 93% and 96%. For SVM, model performance is sensitive to the size of training data. Additional study shows that results obtained from DT and RT can be used to examine the importance of each input feature. This paper contributes a learning-by-synthesis approach to facilitate the utilization of a machine learning paradigm to enhance situational awareness for fire fighting in buildings. [ABSTRACT FROM AUTHOR]

Skin cancer, primarily resulting from the abnormal growth of skin cells, is among the most common cancer types. In recent decades, the incidence of skin cancer cases worldwide has risen significantly (one in every three newly diagnosed cancer cases is a skin cancer). Such an increase can be attributed to changes in our social and lifestyle habits coupled with devastating man-made alterations to the global ecosystem. Despite such a notable increase, diagnosis of skin cancer is still challenging, which becomes critical as its early detection is crucial for increasing the overall survival rate. This calls for advancements of innovative computer-aided systems to assist medical experts with their decision making. In this context, there has been a recent surge of interest in machine learning (ML), in particular, deep neural networks (DNNs), to provide complementary assistance to expert physicians. While DNNs have a high processing capacity far beyond that of human experts, their outputs are deterministic, i.e., providing estimates without prediction confidence. Therefore, it is of paramount importance to develop DNNs with uncertainty-awareness to provide confidence in their predictions. Monte Carlo dropout (MCD) is vastly used for uncertainty quantification; however, MCD suffers from overconfidence and being miss calibrated. In this paper, we use MCD algorithm to develop an uncertainty-aware DNN that assigns high predictive entropy to erroneous predictions and enable the model to optimize the hyper-parameters during training, which leads to more accurate uncertainty quantification. We use two synthetic (two moons and blobs) and a real dataset (skin cancer) to validate our algorithm. Our experiments on these datasets prove effectiveness of our approach in quantifying reliable uncertainty. Our method achieved 85.65 ± 0.18 prediction accuracy, 83.03 ± 0.25 uncertainty accuracy, and 1.93 ± 0.3 expected calibration error outperforming vanilla MCD and MCD with loss enhanced based on predicted entropy. [ABSTRACT FROM AUTHOR]

In this paper, we propose a novel method to classify battery slurries using echo state network (ESN) model with real-time pressure and flow rate signals during circulating channel flows. To collect the signal, a closed circuit flow system with a pump, pressure sensors, and flow rate sensors is installed. The slurries with different states are prepared by two methods: long-term circulation and dispersant content control. Sensor signals are collected while the slurries are flowing through the pipe system. The collected signals show distinctive chaotic fluctuating patterns for different slurries, which are assumed to reflect the states of the slurries. The hidden state of the ESN is generated from these collected data, which are then split into training and test data. Consequently, the ESN can effectively distinguish the slurries by the output (label). We also analyze the accuracy of the network, based on training time and output averaging time. This study demonstrates that the states of the slurries can be detected from the fluctuating flow signals. We argue that the manufacturing process of any complex fluid can be optimized with this approach. [ABSTRACT FROM AUTHOR]

As cataracts are the most common cause of blindness and are responsible for more than half of all occurrences of blindness worldwide, early detection is crucial. It is now recognized that childhood cataract, which was once common among the elderly, is a significant cause of infant and young child blindness and severe visual impairment. The objective of this paper is to develop a machine learning-based optic image-based cataract detection system. The public health dataset has been used to collect the data in this case using the internet of things module. The auto region encoder basis Boltzmann architecture has been used to pre-process and pre-train this data for improved data classification. The detection was carried out using this pre-trained data, and when an image showed signs of cataract in the eye, it was classified using auto region encoder basis Boltzmann architecture. The simulation results show that various optical-based cataract image datasets have the best accuracy, precision, recall, F-1 score, and specificity. [ABSTRACT FROM AUTHOR]

Improving and enhancing the effectiveness of software vulnerability detection methods is urgently needed today. In this study, we propose a new source code vulnerability detection method based on intelligent and advanced computational algorithms. It's a combination of four main processing techniques including (i) Source Embedding, (ii) Feature Learning, (iii) Resampling Data, and (iv) Classification. The Source Embedding method will perform the task of analyzing and standardizing the source code based on the Joern tool and the data mining algorithm. The Feature Learning model has the function of aggregating and extracting source code attribute based on node using machine learning and deep learning methods. The Resampling Data technique will perform equalization of the experimental dataset. Finally, the Classification model has the function of detecting source code vulnerabilities. The novelty and uniqueness of the new intelligent cognitive computing method is the combination and synchronous use of many different data extracting techniques to compute, represent, and extract the properties of the source code. With this new calculation method, many significant unusual properties and features of the vulnerability have been synthesized and extracted. To prove the superiority of the proposed method, we experiment to detect source code vulnerabilities based on the Verum dataset, details of this part are presented in the experimental section. The experimental results show that the method proposed in the paper has brought good results on all measures. These results have shown to be the best research results for the source code vulnerability detection task using the Verum dataset according to our survey to date. With such results, the proposal in this study is not only meaningful in terms of science but also in practical terms when the method of using intelligent cognitive computing techniques to analyze and evaluate source code has helped to improve the efficiency of the source code analysis and vulnerability detection process. [ABSTRACT FROM AUTHOR]

One of the most challenging issues in pattern recognition is the data attribution selection process. Feature selection plays a key role in solving problems with high-dimensional data and is a fundamental step in pre-processing many classifications and machine learning problems. The feature selection method reduces the amount of data and increases the category precision. Unrelated data, which can lead to inappropriate classification, is thus removed to obtain fewer features. In this paper, the Binary Gray Wolf Optimization algorithm uses the Wrapper method for feature selection. The transfer function is an essential part of BGWO to map a continuous value to a binary value. In this study, eight transfer functions are divided into two families: S-shaped and V-shaped. Previous research has used only one transfer function for the whole algorithm, and all wolves in the whole algorithm deal with this transfer function. In this paper, each wolf has its own transfer function. Because algorithms are evolutionary meta-innovations and can optimize themselves, each wolf can play a role in the whole algorithm at any stage while optimizing itself and adapting to its community, and not just depend on one transfer function. In the proposed method, eight transfer functions are divided into two families, S-shaped and V-shaped. This article proposes two approaches for learning the transfer function, by selecting the transfer function and the slope of these functions. In the first approach, we add three or two binary bits to the initial population. If two bits are added, four modes of the transfer function are available, and if three bits are added, eight transfer functions are achievable. These bits are used as a criterion for selecting a predefined transfer function for each wolf. So, in the proposed method, each wolf has its transfer function. During the implementation of the algorithm, the wolves update their position according to the evaluation function and learning. In the second approach, ten or twenty-one binary bits are added to the initial population. If ten binary bits are used, we will have a transfer function, and 2 10 coefficient modes are available for the slope of the transfer function. If twenty-one binary bits are used, we have two transfer functions available. So, there are 2 10 modes for the gradient of the transfer function. These bits are used as a criterion for selecting the transfer function and the coefficient affecting the slope of these functions. In both ideas, after each iteration of the algorithm, the position of the wolves is updated and based on the evaluation function, the alpha wolf is identified and the transfer function is selected. With subsequent iterations, the algorithm learns and optimizes the transfer function to achieve the best feature selection with the smallest error. Experimental results on ten UCI datasets show that selecting the obtained feature subset with high classification accuracy is efficient. [ABSTRACT FROM AUTHOR]

To reliably and accurately classify complicated "big" datasets, machine learning models must be continually improved. This research proposes straightforward yet competitive neural networks for text classification, even though graph neural networks (GNN) have reignited interest in graph-based text classification models. Convolutional neural networks (CNN), artificial neural networks (ANN), and their refined "fine-tuned" models (denoted as FT-CNN and FT-ANN) are the names given to our proposed models. The models presented in this paper demonstrate that our simple models like (CNN, ANN, FT-CNN, and FT-ANN) can perform better than more complex GNN ones such as (SGC, SSGC, and TextGCN) and are comparable to others (i.e., HyperGAT and Bert). The process of fine-tuning is also highly recommended because it improves the performance and reliability of models. The performance of our suggested models on five benchmark datasets (namely, Reuters (R8), R52, 20NewsGroup, Ohsumed, and Mr) is vividly illustrated. According to the experimental findings, on the majority of the target datasets, these models—especially those that have been fine-tuned—perform surprisingly better than SOTA approaches, including GNN-based models. [ABSTRACT FROM AUTHOR]

Big data is a large set of data that is analyzed with the calculation to manifest myriad sources. Big data is capable of handling various challenges to processing huge amounts of data. To handle issues based on large-scale databases, a MapReduce framework is employed which provides robust and simple infrastructure for huge datasets. This paper proposes a novel Elastic collision seeker optimization based Faster R-CNN (ECSO-FRCNN) classifier for efficient big data classification. The proposed ECSO-FRCNN classifier is capable of handling missing attributes, and incremental learning and improves training performance effectively. As the proposed technique deals with large data samples, it necessitates the inclusion of the MapReduce framework. The adaption of MapReduce design in big data classification prevents the classification results from uncertainties such as data redundancy, misclassification, and storage issues. The proposed method is examined with three standard datasets, namely the skin segmentation dataset, mushroom dataset, and localization dataset, collected from the University of California, UCI machine learning repository. Finally, extensive experimental analysis is carried out for various parameters to depict the efficiency of the system. [ABSTRACT FROM AUTHOR]

Cardiac-related disorders are rapidly growing throughout the world. Accurate classification of cardiovascular diseases is an important research topic in healthcare. During COVID-19, auscultating heart sounds was challenging as health workers and doctors wear protective clothing, and direct contact with patients can spread the outbreak. Thus, contactless auscultation of heart sound is necessary. In this paper, a low-cost ear contactless stethoscope is designed where auscultation is done with the help of a bluetooth-enabled micro speaker instead of an earpiece. The PCG recordings are further compared with other standard electronic stethoscopes like Littman 3 M. This work is made to improve the performance of deep learning-based classifiers like recurrent neural networks (RNN) and convolutional neural networks (CNN) for different valvular heart problems using tuning of hyperparameters like learning rate of optimizers, dropout rate, and hidden layer. Hyper-parameter tuning is used to optimize the performances of various deep learning models and their learning curves for real-time analysis. The acoustic, time, and frequency domain features are used in this research. The investigation is made on the heart sounds of normal and diseased patients available from the standard data repository to train the software models. The proposed CNN-based inception network model achieved an accuracy of 99.65 ± 0.06% on the test dataset with a sensitivity of 98.8 ± 0.05% and specificity of 98.2 ± 0.19%. The proposed hybrid CNN-RNN architecture attained 91.17 ± 0.03% accuracy on test data after hyperparameter optimization, whereas the LSTM-based RNN model achieved 82.32 ± 0.11% accuracy. Finally, the evaluated results were compared with machine learning algorithms, and the improved CNN-based Inception Net model is the most effective among others. [ABSTRACT FROM AUTHOR]

Heartbeat classification plays an important role in identifying cardiac arrhythmias. Although automated heartbeat classification approaches have been broadly reported, they still suffer from some disadvantages, such as the inescapable domain knowledge and human ingenuity for hand-crafted heartbeat feature engineering, and the slow learning speed for iterative deep learning heartbeat classification approach. To address the above issues, for the first time, this paper proposes a novel multilayer extreme learning machine (ML-ELM) heartbeat classification approach for feature representation and classification of the heartbeat signals. Different from the iterative optimization scheme in traditional neural networks, ELM autoencoder (ELM-AE) is employed in ML-ELM for random mapping of the input weights and non-iterative learning is implemented for output weights. To realize unsupervised self-encoding heartbeat feature mapping, the output of ELM-AE is consistent with the incoming heartbeat signal, and the optimization objective is to minimize the reconstruction error. Heartbeat feature extraction is efficiently performed by layer-by-layer ELM-AE stacking. In the stage of heartbeat classification, to solve the unstable performance caused by random parameter initialization in ELM hidden nodes, bagging-based ensemble learning is employed to combine several ELM classifiers and thus develops a well-performed heartbeat classification approach. The proposed approach is applied to two-lead ECG signals, which is obtained from the MIT-BIH arrhythmia public dataset. The experimental results show that the ELM-AE based feature extraction can effectively characterize the characteristics of the heartbeat signal with high efficiency compared with other state-of-the-art approaches. Applying the ensemble decision fusion to two leads, the final classification accuracy reaches 99.41%. [ABSTRACT FROM AUTHOR]

Gastric Cancer is the most common malignancy of the digestive tract, which is the third leading cause of cancer-related mortality worldwide. The early prognosis methods, especially Machine Learning (ML)-based approaches are one of the main strategies against GC, which have become a necessity to identify and prognosticate the factors that affect the GC. They enable the specialists to accelerate the subsequent clinical management of patients, who suffer from the GC. This paper aims at creating an Ensemble Method inspired from ML to predict the most significant factors of the GC occurrence. The main objective of this research is to predict the probabilities of the GC occurrence and its associated deaths. To achieve this goal, the created EM benefits from some ML-based methods, including Least Absolute Shrinkage and Selection Operator (LASSO)/Ridge Regression, Elastic Net, Logistic Regression (LR), Random Forest (RF), Gradient Boosting Decision Trees (GBDTs), and Deep Neural Network (DNN). The purpose of the provided EM is to lessen the prediction errors for the large number of the patients' features. The main novelties of this research include: (i) A sequential EM created by a Stacking method to predict the probability of the GC and associated deaths; (ii) Benefiting from the significance level to make an accurate prediction; (iii) Employing two Chi-square tests to select the influent features; (iv) Tuning the parameters of the applied ML models to avoid over-fitting and intensifying the errors; (v) Applying different kinds of the regression methods to treat hyper-dimension cases; (vi) A new model for weighting the applied ML models. The outcomes of the implementation of the created EM in seven pioneer hospitals in the field of GC show that the designed EM generates more precise predictions with an accuracy of 97.9% and 76.3% to predict the GC and its associated deaths, respectively. Moreover, the obtained results from the Area Under Curve (AUC) validates and confirms the capability of the created EM to predict the probability of the GC and its related deaths with an accuracy of 98% and 90% to predict the GC and its associated deaths, respectively. [ABSTRACT FROM AUTHOR]

In recent decades, breast cancer has become one of the leading causes of mortality among women. This disease is not preventable because of its unknown causes; however, its early diagnosis increases patients' recovery chances. Machine learning (ML) can be utilized to improve treatment outcomes in healthcare operations while diminishing costs and time. In this research, we suggest two novel feature selection (FS) methods based upon an imperialist competitive algorithm (ICA) and a bat algorithm (BA) and their combination with ML algorithms. This study aims to enhance diagnostic models' efficiency and present a comprehensive analysis to help clinical physicians make more precise and reliable decisions. K-nearest neighbors (KNN), support vector machine (SVM), decision tree (DT), Naive Bayes, AdaBoost (AB), linear discriminant analysis (LDA), random forest (RF), logistic regression (LR), and artificial neural network (ANN) are some of the methods employed. Sensitivity, accuracy, precision, mean absolute error F-score, root mean square error, Kappa, and relative absolute error calculated the performance of the methods. This paper applied a distinctive integration of evaluation measures and ML algorithms using the wrapper feature selection based on ICA (WFSIC) and BA (WFSB) separately. We compared two proposed approaches for the performance of the classifiers. Also, we compared our best diagnostic model with previous works reported in the literature survey. Experimentations were performed on the Wisconsin diagnostic breast cancer (WDBC) dataset. Results reveal that the proposed framework that uses the BA with an accuracy of 99.12% surpasses the framework using the ICA and most previous works. Additionally, the RF classifier in the approach of FS based on BA emerges as the best model and outperforms others regarding its criteria. Besides, the results illustrate the role of our techniques in reducing the dataset dimensions up to 90% and increasing the performance of diagnostic models by over 99%. Moreover, the result demonstrates that there are more critical features than the optimum dataset obtained by proposed FS approaches that have been selected by most ML models, including the standard error of area, concavity, smoothness, perimeter, the worst of texture, compactness, radius, symmetry, smoothness, concavity, and the mean of concave points, fractal dimension, compactness, concavity that can remarkably affect the efficiency of breast cancer prediction. This study illustrates the role of our approaches in enhancing treatment outcomes in healthcare operations. [ABSTRACT FROM AUTHOR]

The spread of the COVID-19 started back in 2019; and so far, more than 4 million people around the world have lost their lives to this deadly virus and its variants. In view of the high transmissibility of the Corona virus, which has turned this disease into a global pandemic, artificial intelligence can be employed as an effective tool for an earlier detection and treatment of this illness. In this review paper, we evaluate the performance of the deep learning models in processing the X-Ray and CT-Scan images of the Corona patients' lungs and describe the changes made to these models in order to enhance their Corona detection accuracy. To this end, we introduce the famous deep learning models such as VGGNet, GoogleNet and ResNet and after reviewing the research works in which these models have been used for the detection of COVID-19, we compare the performances of the newer models such as DenseNet, CapsNet, MobileNet and EfficientNet. We then present the deep learning techniques of GAN, transfer learning, and data augmentation and examine the statistics of using these techniques. Here, we also describe the datasets introduced since the onset of the COVID-19. These datasets contain the lung images of Corona patients, healthy individuals, and the patients with non-Corona pulmonary diseases. Lastly, we elaborate on the existing challenges in the use of artificial intelligence for COVID-19 detection and the prospective trends of using this method in similar situations and conditions. [ABSTRACT FROM AUTHOR]

Uniform Resource Locator (URL) is a unique identifier composed of protocol and domain name used to locate and retrieve a resource on the Internet. Like any Internet service, URLs (also called websites) are vulnerable to compromise by attackers to develop Malicious URLs that can exploit/devastate the user's information and resources. Malicious URLs are usually designed with the intention of promoting cyber-attacks such as spam, phishing, malware, and defacement. These websites usually require action on the user's side and can reach users across emails, text messages, pop-ups, or devious advertisements. They have a potential impact that can reach, in some cases, to compromise the machine or network of the user, especially those arriving by email. Therefore, developing systems to detect malicious URLs is of great interest nowadays. This paper proposes a high-performance machine learning-based detection system to identify Malicious URLs. The proposed system provides two layers of detection. Firstly, we identify the URLs as either benign or malware using a binary classifier. Secondly, we classify the URL classes based on their feature into five classes: benign, spam, phishing, malware, and defacement. Specifically, we report on four ensemble learning approaches, viz. the ensemble of bagging trees (En_Bag) approach, the ensemble of k-nearest neighbor (En_kNN) approach, and the ensemble of boosted decision trees (En_Bos) approach, and the ensemble of subspace discriminator (En_Dsc) approach. The developed approaches have been evaluated on an inclusive and contemporary dataset for uniform resource locators (ISCX-URL2016). ISCX-URL2016 provides a lightweight dataset for detecting and categorizing malicious URLs according to their attack type and lexical analysis. Conventional machine learning evaluation measurements are used to evaluate the detection accuracy, precision, recall, F Score, and detection time. Our experiential assessment indicates that the ensemble of bagging trees (En_Bag) approach provides better performance rates than other ensemble methods. Alternatively, the ensemble of the k-nearest neighbor (En_kNN) approach provides the highest inference speed. We also contrast our En_Bag model with state-of-the-art solutions and show its superiority in binary classification and multi-classification with accuracy rates of 99.3% and 97.92%, respectively. [ABSTRACT FROM AUTHOR]

Recently, graph convolutional networks (GCNs) has demonstrated great success in the text classification. However, the GCN only focuses on the fitness between the ground-truth labels and the predicted ones. Indeed, it ignores the local intra-class diversity and local inter-class similarity that is implicitly encoded by the graph, which is an important cue in machine learning field. In this paper, we propose a local discriminative graph convolutional network (LDGCN) to boost the performance of text classification. Different from the text GCN that minimize only the cross entropy loss, our proposed LDGCN is trained by optimizing a new discriminative objective function. So that, in the new LDGCN feature spaces, the texts from the same scene class are mapped closely to each other and the texts of different classes are mapped as farther apart as possible. So as to ensure that the features extracted by GCN have good discriminative ability, achieve the maximum separability of samples. Experimental results demonstrate its superiority against the baselines. [ABSTRACT FROM AUTHOR]

With the recent surge of interest in machine learning, Positive and Unlabeled learning (PU learning) has also attracted much attention of scholars. A key bottleneck for addressing PU classification is the absence of training negative data, and thus many popular approaches belonging to the "two-step" strategy have been proposed. However, almost none of the existing two-step methods can thoroughly learn the feature information of samples, which makes the extracted negative samples unreliable and easily leads to undesirable results. Therefore, in this paper, we propose a two-phase projective dictionary pair learning (TPDPL) method for PU learning. The first phase of TPDPL determines reliable negatives by exploiting the reconstruction residuals and the second phase trains the DPL-based classifier with the extracted reliable negative and original positive samples to perform classification. Our experimental results demonstrate that the TPDPL approach can achieve highly competitive classification performance when compared with conventional and state-of-the-art PU learning algorithms. More importantly, due to the special dictionary pair learning framework, the computational complexity of TPDPL is extraordinarily low. [ABSTRACT FROM AUTHOR]

Linear regression is a simple and widely used machine learning algorithm. It is a statistical approach for modeling the relationship between a scalar variable and one or more variables. In this paper, a classification by principal component regression (CbPCR) strategy is proposed. This strategy depends on performing regression of each data class in terms of its principal components. This CbPCR formulation leads to a new formulation of the Linear Regression Classification (LRC) problem that preserves the key information of the data classes while providing more compact closed-form solutions. For the sake of image classification, this strategy is also extended to the 4D hypercomplex domains to take into account the color information of the image. Quaternion and reduced biquaternion CbPCR strategies are proposed by representing each channel of the color image as one of the imaginary parts of a quaternion or reduced biquaternion number. Experiments on two color face recognition benchmark databases show that the proposed methods achieve better accuracies by a margin of about 3% over the original LRC and like methods. [ABSTRACT FROM AUTHOR]

This study aims to use a machine learning (ML)-based enhanced diagnosis and survival model to predict heart disease and survival in heart failure by combining the cuckoo search (CS), flower pollination algorithm (FPA), whale optimization algorithm (WOA), and Harris hawks optimization (HHO) algorithms, which are meta-heuristic feature selection algorithms. To achieve this, experiments are conducted on the Cleveland heart disease dataset and the heart failure dataset collected from the Faisalabad Institute of Cardiology published at UCI. CS, FPA, WOA, and HHO algorithms for feature selection are applied for different population sizes and are realized based on the best fitness values. For the original dataset of heart disease, the maximum prediction F-score of 88% is obtained using K-nearest neighbour (KNN) when compared to logistic regression (LR), support vector machine (SVM), Gaussian Naive Bayes (GNB), and random forest (RF). With the proposed approach, the heart disease prediction F-score of 99.72% is obtained using KNN for population sizes 60 with FPA by selecting eight features. For the original dataset of heart failure, the maximum prediction F-score of 70% is obtained using LR and RF compared to SVM, GNB, and KNN. With the proposed approach, the heart failure prediction F-score of 97.45% is obtained using KNN for population sizes 10 with HHO by selecting five features. Experimental findings show that the applied meta-heuristic algorithms with ML algorithms significantly improve prediction performances compared to performances obtained from the original datasets. The motivation of this paper is to select the most critical and informative feature subset through meta-heuristic algorithms to improve classification accuracy. [ABSTRACT FROM AUTHOR]

This survey is devoted to the task of network traffic classification, specifically, to the use of machine learning algorithms in this task. The survey begins with the description of the task, its different statements, and possible real-world applications. It then proceeds to the description of the methods historically used for network traffic classification, as well as their limitations and evolution of traffic making machine learning, which is the main way to solve the problem. The most popular machine learning algorithms used in this task are described and accompanied with examples of research papers that provide insight into their advantages and disadvantages. The problem of feature selection is discussed with subsequent consideration of a more global problem of acquiring a suitable dataset for network traffic classification; examples of popular datasets and their descriptions are provided. The paper concludes with an overview of some current problems in this field of research: model training and comparison, user data protection, and network traffic volatility. [ABSTRACT FROM AUTHOR]

Research on image retrieval and classification in the food field has become one of the more and more concerned research topics in the field of multimedia analysis and applications. In recent years, with the rapid development of the Internet industry and multimedia technology, image classification and retrieval technology has become a research hotspot at home and abroad. Traditional keyword-based image retrieval and image classification have been unable to meet people's daily needs; so, image recognition methods based on image content came into being. The most representative of image feature description methods are mainly two aspects: image visual features and image abstract semantics extracted based on machine learning algorithms. These two algorithms have their own key points in describing images, which are difficult to achieve the desired results in image classification and image retrieval. Based on this, this paper proposes research on food image classification and image retrieval methods based on visual features and machine learning. This paper proposes a food image retrieval and classification method based on Faster R-CNN network. This paper selects food image sets from the visual gene database to fine-tune the Faster R-CNN network to ensure the accuracy of Faster R-CNN food area detection, and experimented on the Dish-233 food dataset, which is a subset of the dish dataset, including 233 dishes and 49,168 images. The experimental results in this paper show that the performance of this method is better than other methods in terms of image classification performance. Compared with CNN-GF, the performance is improved by 5%. In terms of image retrieval, this method also shows its superiority This proves that compared with other methods, the proposed method has more discriminative visual features, and its performance has been improved in food image retrieval and classification tasks. [ABSTRACT FROM AUTHOR]

Machine learning techniques aim to mimic the human ability to automatically learn how to perform tasks through training examples. They have proven capable of tasks such as prediction, learning and adaptation based on experience and can be used in virtually any scientific application, ranging from biomedical, robotic, to business decision applications, and others. However, the lack of domain knowledge for a particular application can make feature extraction ineffective or even unattainable. Furthermore, even in the presence of pre-processed datasets, the iterative process of optimizing Machine Learning parameters, which do not translate from one domain to another, maybe difficult for inexperienced practitioners. To address these issues, we present in this paper a Vectorized Automated ML Pre-processIng and post-pRocEssing framework, approximately named (VAMPIRE), which implements feature extraction algorithms capable of converting large time-series recordings into datasets. Also, it introduces a new concept, the Activation Engine, which is attached to the output of a Multi Layer Perceptron and extracts the optimal threshold to apply binary classification. Moreover, a tree-based algorithm is used to achieve multi-class classification using the Activation Engine. Furthermore, the internet of things gives rise to new applications such as remote sensing and communications, so consequently applying Machine Learning to improve operation accuracy, latency, and reliability is beneficial in such systems. Therefore, all classifications in this paper were performed on the edge in order to reach high accuracy with limited resources. Moreover, forecasts were applied on three unrelated biomedical datasets, and on two other pre-processed urban and activity detection datasets. Features were extracted when required, and training and testing were performed on the Raspberry Pi remotely, where high accuracy and inference speed were achieved in every experiment. Additionally, the board remained competitive in terms of power consumption when compared with a laptop which was optimized using a Graphical Processing Unit. [ABSTRACT FROM AUTHOR]

This paper proposes a novel deep learning-based approach for financial chart patterns classification. Convolutional neural networks (CNNs) have made notable achievements in image recognition and computer vision applications. These networks are usually based on two-dimensional convolutional neural networks (2D CNNs). In this paper, we describe the design and implementation of one-dimensional convolutional neural networks (1D CNNs) for the classification of chart patterns from financial time series. The proposed 1D CNN model is compared against support vector machine, extreme learning machine, long short-term memory, rule-based and dynamic time warping. Experimental results on synthetic datasets reveal that the accuracy of 1D CNN is highest among all the methods evaluated. Results on real datasets also reveal that chart patterns identified by 1D CNN are also the most recognized instances when they are compared to those classified by other methods. [ABSTRACT FROM AUTHOR]

The concurrence of state-of-the-art Industrial 5G, Cyber-Physical Systems, Smart-Systems, Industrial Internet of Things, and Additive Manufacturing paves the next-level digital remodeling. However, the transfiguration unwittingly tailpiece an operational onus on the smart-environment operators. The multiplicity and classes of IoT devices operating in the intelligent environment are myriad. The characterization of ingress network traffic and the accurate classification of devices is necessary to efficiently manage the devices and offer cutting-edge security solutions and quality of Service (QoS). The paper addresses these challenges by offering a novel intelligent framework for traffic classification leveraging behavioral attributes of IoT traffic. The paper's contributions to the research community are fourfold. Firstly, the paper proposes a novel IoT classification framework based on Stack-Ensemble for real-time high-volume IoT traffic. The experimental results indicate that the proposed novel Stack Ensemble model can extract the best out of base models and demonstrate an accuracy of 99.94%. The intelligent models are evaluated over multiple dimensions to project the isometric view of the model performance and the experimental results. To achieve that goal, all the performance metrics that most researchers most often miss have been elucidated. Secondly, the paper comprehends the flow-level statistical characteristics of IoT devices. Third, the paper offers the distributed, scalable, and portable framework architecture. The architecture is horizontally scalable, distributing the computational load. The framework offers an end-to-end industry-grade machine-learning pipeline and triumphs the vulnerabilities of existing solutions. Finally, the paper discusses the statistical insights into the intelligent model and the results of the experimentation study. The proposed work paves the opportunities for researchers, smart-environment operators, and developers to unfold the architecture and supplement the security solutions against cyber-attacks. [ABSTRACT FROM AUTHOR]

This paper promotes better life quality and lifestyle for patients. We attain this goal by creating a mobile application that analyses patient's medical records, such as diabetes, hypertension, and chronic kidney diseases. Then, we implement the system to diagnose patients with chronic conditions using machine learning techniques. Machine learning classifiers are used in this paper to decide whether a person has any chronic diseases. The investigated diseases are hypertension, diabetes, and chronic kidney disease. Four datasets were used to build the classifying models. Orange3 from Anaconda-Navigator, a data mining tool, was used to test machine learning algorithms. The study findings revealed the superiority of the tree algorithm with 100% accuracy for hypertension; it was the highest outcome for both males and females using Orange3. The highest precision, which is 100%, is observed by SVM, k-NN, decision trees, logistic regression, and CART for hypertension males' data collection. In comparison, the highest precision is 100% in SVM, MLP, decision tree, random forest, logistic regression, and CART for the female dataset. We conclude that the two datasets for the same diseases share mostly the same algorithm accuracy. For kidneys, the Random Forest algorithm produced 100% accuracy, which is the highest value among other algorithms. For diabetes, neural networks have attested the best accuracy. It was 76.3%, yet the accuracy increased slightly as the kNN algorithm showed 83% accuracy. [ABSTRACT FROM AUTHOR]

Multi-layer perceptron (MLP) in artificial neural networks (ANN) is one among the trained neural models which can hold several layers as a hidden layer for intensive training to obtain optimal results. On the other hand, the classification problem has a high level of attraction towards researchers to increase the accuracy in classification. In ANN, feedforward neural network (FNN) is one model that possesses the art of solving classification and regression problems. When input data is given to FNN, it will apply the sum of product rule and the activation function to map the input with its appropriate output. In the sum of product rule, a term called weights is to be chosen appropriately to map between the input and output. In standard FNN, the weights are chosen in a random way which may lead to slower convergence towards the optimal choice of weight values. In this paper, an effective optimization model is proposed to optimize the weights of MLP of FNN for effective classification problems. Four different datasets were chosen, and the results are interpreted with statistical performance measures. [ABSTRACT FROM AUTHOR]

Recently, the leading cause of preventable blindness is diabetic retinopathy (DR). Although there are several undiagnosed and non-treated cases of DR, accurate and adequate retinal screening could facilitate the early detection and treatment of DR. The goal of this research is to develop a reliable DR screening and detection model to reduce the risk of DR-related blindness. DR-infected eyes describe ophthalmologist for further examination and diagnosis might reduce the risk of vision loss and provide timely and accurate diagnostic information. Hence, this paper proposes a hybrid inductive machine learning algorithm (HIMLA) as an automated DR detection diagnostic tool. HIMLA processes and classifies colored fundus images as healthy (no retinopathy) or unhealthy (presence of DR) by identifying the appropriate medical DR cases. The proposed algorithm comprises four stages: pre-processing, segmentation, feature extraction, and classification. At the pre-processing stage, colored fundus images are normalized to a specific brightness level to enhance the quality of the images. In the segmentation stage, the processed image is encoded and decoded to segment the images for improving image quality. Furthermore, feature extraction and classification are performed using multiple instance learning (MIL). The proposed method was evaluated on CHASE datasets for the detection of DR. The accuracy, sensitivity, and specificity of the proposed approach are 96.62%, 95.31%, and 96.88%, respectively. These results indicates that HIMLA outperforms other DR models, such as ML-based neovascularization detection in the optic disc (MLB-NVD), genetic algorithm–based diabetic retinopathy (GAB-DR), DL algorithm diabetic retinopathy (DLA-DR), and diagnostic assessment–based DL for diabetic retinopathy (DAD-DR), which reduces the risk of vision loss. [ABSTRACT FROM AUTHOR]

With the increasing awareness of user privacy protection and communication security, encrypted traffic has increased dramatically. Usually utilizing the flow information of the traffic, flow statistics-based methods are able to classify encrypted traffic. However, these methods require a large number of packets and manual selection of statistical features. In this paper, we propose a novel encrypted traffic classification method (Seq2Path), which fuses flow features by using path signature theory to translate feature sequences into a traffic path. Then, the statistical features of the traffic path are generated by computing its signature; and finally, these features are used to train a machine learning classifier. Our experiments on four datasets containing three types of traffic (HTTPS, VPN and Tor) show that Seq2Path achieves stable performance and generally outperforms state-of-the-art methods. [ABSTRACT FROM AUTHOR]

Data imbalance is one of the most difficult problems in machine learning. The improved ensemble learning model is a promising solution to mitigate this challenge. In this paper, an improved multi-class imbalanced data classification framework is proposed by combining the Focal Loss with Boosting model (FL-Boosting). By addressing the confusion of the second-order derivation of Focal Loss in the traditional ensemble learning model, the proposed model achieves a more efficient and accurate classification of the imbalanced data. More specifically, a Highly Adaptive Focal Loss (HAFL) is proposed to ensure that the model maintains lasting attention to the minority samples, which could be combined with boosting model to build HAFL-Boosting to achieve better performance. The framework has the scalability to adapt to different situations according to typical ensemble learning algorithms such as LightGBM, XGBoost and CatBoost. In addition, to implement the application of the proposed framework on deep models, a two-stage classification method combining ConvNeXt with the improved boosting model is proposed, which could improve the recognition ability to high-dimensional imbalanced data. We evaluate the HAFL-Boosting and the two-stage class imbalance classification method by ablation experiments and benchmark experiments, which demonstrated that the proposed methods obviously improved the scores on several evaluation indexes. The comparative experiments with the latest classification models show that the proposed methods could achieve leading performance from multiple perspectives. [ABSTRACT FROM AUTHOR]

When it comes to offering song suggestions to a user, the music genre is one of the most used tags considered by music streaming services. Motivated by the growing number of songs available, automatic music genre classification systems have become a valuable tool for the creation of user-personalised playlists. Considering that feature engineering represents a major task to be addressed when one develops such systems, this work discusses the generation of new handcrafted features over songs, originally exploring high-order features' moments combined with their derivatives. Additionally, this paper proposes a new wrapper-based selection procedure rigorously based on statistical tests to identify a subset of features that maximise the performance of these systems, irrespective of the classification approach adopted, named Robust Selector of Basis Feature Sets. Based on a synergistic combination of both strategies, a compact subset with 81 features is derived over the GTZAN Dataset. When compared with alternative solutions, this feature set boosted the classification accuracy in datasets containing a wide range of music genres, such as ISMIR2004, BALLROOM, HOMBURG, and FMA Datasets. [ABSTRACT FROM AUTHOR]