Search

Many intrusion detection algorithms that use optimization have been developed and are commonly used to detect intrusions. The process of selecting features and the parameters of the classifier are essential parts of how well an intrusion detection system works. This paper provides a detailed explanation and discussion of an improved intrusion detection method for multiclass classification. The proposed solution uses a combination of the modified teaching–learning-based optimization (MTLBO) algorithm, the modified JAYA (MJAYA) algorithm, and a support vector machine (SVM). MTLBO is used with supervised machine learning (ML) to select subsets of features. Selection of the fewest features possible without impairing the accuracy of the results in feature subset selection (FSS) is a multiobjective optimization issue. This paper presents MTLBO as a mechanism and investigates its algorithm-specific, parameter-free idea. This study used the modified JAYA (MJAYA) algorithm to optimize the C and gamma parameters of the support vector machine (SVM) classifier. When the proposed MTLBO-MJAYA-SVM algorithm was compared with the original TLBO and JAYA algorithms on a well-known intrusion detection dataset, it was found to outperform them significantly. [ABSTRACT FROM AUTHOR]

Sleep monitoring has become a prevalent area of research where body position and physiological data, such as heart rate and respiratory rate, are monitored. Numerous critical health problems are associated with poor sleep, such as pressure sore development, sleep disorders, and low sleep quality, which can lead to an increased risk of falls, cardiovascular diseases, and obesity. Current monitoring systems can be costly, laborious, and taxing on hospital resources. This paper reviews the most recent solutions for contactless textile technology in the form of bed sheets or mats to monitor body positions, vital signs, and sleep, both commercially and in the literature. This paper is organized into four categories: body position and movement monitoring, physiological monitoring, sleep monitoring, and commercial products. A detailed performance evaluation was carried out, considering the detection accuracy as well as the sensor types and algorithms used. The areas that need further research and the challenges for each category are discussed in detail. [ABSTRACT FROM AUTHOR]

Background: Cancer diagnosis based on machine learning has become a popular application direction. Support vector machine (SVM), as a classical machine learning algorithm, has been widely used in cancer diagnosis because of its advantages in high-dimensional and small sample data. However, due to the high-dimensional feature space and high feature redundancy of gene expression data, SVM faces the problem of poor classification effect when dealing with such data. Methods: Based on this, this paper proposes a hybrid feature selection algorithm combining information gain and grouping particle swarm optimization (IG-GPSO). The algorithm firstly calculates the information gain values of the features and ranks them in descending order according to the value. Then, ranked features are grouped according to the information index, so that the features in the group are close, and the features outside the group are sparse. Finally, grouped features are searched using grouping PSO and evaluated according to in-group and out-group. Results: Experimental results show that the average accuracy (ACC) of the SVM on the feature subset selected by the IG-GPSO is 98.50%, which is significantly better than the traditional feature selection algorithm. Compared with KNN, the classification effect of the feature subset selected by the IG-GPSO is still optimal. In addition, the results of multiple comparison tests show that the feature selection effect of the IG-GPSO is significantly better than that of traditional feature selection algorithms. Conclusion: The feature subset selected by IG-GPSO not only has the best classification effect, but also has the least feature scale (FS). More importantly, the IG-GPSO significantly improves the ACC of SVM in cancer diagnostic. [ABSTRACT FROM AUTHOR]

Collecting and analyzing data from all devices to improve the efficiency of business processes is an important task of Industrial Internet of Things (IIoT). In the age of data explosion, extensive text data generated by the IIoT have given birth to a variety of text representation methods. The task of text representation is to convert the natural language to a form that computer can understand with retaining the original semantics. However, these methods are difficult to effectively extract the semantic features among words and distinguish polysemy in natural language. Combining the advantages of convolutional neural network (CNN) and variational autoencoder (VAE), this paper proposes an intelligent CNN-VAE text representation algorithm as an advanced learning method for social big data within next-generation IIoT, which help users identify the information collected by sensors and perform further processing. This method employs the convolution layer to capture the local features of the context and uses the variational technique to reconstruct feature space to make it conform to the normal distribution. In addition, the improved word2vec model based on topical word embedding (TWE) is utilized to add topical information to word vectors to distinguish polysemy. This paper takes the social big data as an example to illustrate the way of the proposed algorithm applied in the next-generation IIoT and utilizes Cnews dataset to verify the performance of proposed method with four evaluating metrics (i.e., recall, accuracy, precision, and F1-score). Experimental results indicate that the proposed method outperforms word2vec-avg and CNN-AE in K-nearest neighbor (KNN), random forest (RF), and support vector machine (SVM) classifiers and distinguishes polysemy effectively. [ABSTRACT FROM AUTHOR]

In order to protect Cyber-Physical Systems (CPS) against constantly changing cyberattacks, machine learning (ML) algorithms must be integrated. The goal of this survey is to investigate attack-resistant machine learning methods that improve CPS security. The limits of standard techniques are emphasized while discussing notable issues in CPS security. The survey thoroughly explores a range of machine learning methods, such as K-Nearest Neighbor (KNN), Support Vector Machines (SVM), and Deep Neural Networks (DNN), that are utilized in CPS for behavior analysis, anomaly identification, and intrusion detection. We discuss the importance of having solid training data and the difficulties in ML model adaptation to the dynamic nature of CPS situations. We examine the trade-offs between responsiveness and precision as well as the effects of false positives and false negatives on attack detection. This papers aims to provide a quick overview of the strengths, limitations, and future prospects of these algorithms, enabling stakeholders to formulate effective strategies for CPS security. [ABSTRACT FROM AUTHOR]

Twin support vector regression (TSVR) has been widely applied in regression problems. TSVR seeks a pair of ε -insensitive proximal planes by solving two support vector machine type problems. TSVR assumes that the matrices appearing in the dual formulation are positive definite. However, in real-world scenarios, such an assumption may not be fulfilled and, hence, leads to suboptimal performance. ε -Twin support vector regression (ε -TSVR) improved the TSVR by introducing the regularisation term to avoid the singularity issues. Most of the twin support vector machine models involve the computation of matrix inverses. Also, TSVR implements the empirical risk minimization principle. In this paper, we propose an improved twin support vector regression (ITSVR) for brain age estimation by introducing different Lagrangian functions for the primal problems of the TSVR. The proposed ITSVR implements the structural risk minimization principle and avoids the computation of the matrix inverses. To solve the optimization problem more efficiently, we used successive overrelaxation (SOR) technique. We evaluated the proposed ITSVR on cognitively healthy subjects, mild cognitive impairment subjects and Alzheimer's disease subjects. The experimental results demonstrate that the proposed ITSVR has superior performance compared to the baseline models for brain age estimation. [ABSTRACT FROM AUTHOR]

In machine learning, models are derived from labeled training data where labels signify classes and features define sample attributes. However, noise from data collection can impair the algorithm's performance. Blanco, Japón, and Puerto proposed mixed-integer programming (MIP) models within support vector machines (SVM) to handle label noise in training datasets. Nonetheless, it is imperative to underscore that their models demonstrate an observable escalation in the number of variables as sample size increases. The nonparallel support vector machine (NPSVM) is a binary classification method that merges the strengths of both SVM and twin SVM. It accomplishes this by determining two nonparallel hyperplanes by solving two optimization problems. Each hyperplane is strategically positioned to be closer to one of the classes while maximizing its distance from the other class. In this paper, to take advantage of NPSVM's features, NPSVM-based relabeling (RENPSVM) MIP models are developed to deal with the label noises in the dataset. The proposed model adjusts observation labels and seeks optimal solutions while minimizing computational costs by selectively focusing on class-relevant observations within an ε-intensive tube. Instances exhibiting similarities to the other class are excluded from this ε-intensive tube. Experiments on 10 UCI datasets show that the proposed NPSVM-based MIP models outperform their counterparts in accuracy and learning time on the majority of datasets. [ABSTRACT FROM AUTHOR]

This study utilizes classification models to provide a robust algorithm for imbalanced data where the minority class is of the interest, that is, in the context of default payments. In developing an integrated predictive accuracy algorithm, this study proposes machine learning classifiers and applies DNN, SVM, KNN, and ANN. The proposed algorithm utilizes a 30,000 imbalanced dataset to improve the accuracy of the prediction of default payments by implementing oversampling and undersampling strategies, such as synthetic minority oversampling technique (SMOTE), SVM SMOTE, random undersampling, and ALL-KNN. The results indicate that the SVM under the ALL-KNN sampling technique is able to achieve an accuracy of 98.6%, with the lowest cross entropy loss measurement of 0.028. Through the accurate implementation of the neural networks and neurons used in the proposed algorithm, this paper presents better insights into the functioning of the neural networks when used in conjunction with the resampling techniques. Using the methodology and algorithm presented in this study, credit risk assessments can be more accurately predicted in practical applications where most of the clients are categorized as non-default payments. [ABSTRACT FROM AUTHOR]

There is a widespread use of cluster-based routing in wireless sensor networks since it is the most energy-efficient. Idealizing cluster heads, on the other hand, is NP-hard and hence requires heuristic or metaheuristic approaches. However, while outperforming algorithms, metaheuristics computation time restricts its ability to respond to routing requests as rapidly as algorithms can today. A network's or an application's parameters can't be easily accommodated by routing methods. This paper offers the HMML, a combination model combining hybrid metaheuristics and machine-learning. Our HMML model makes use of an automated tuning metaheuristic (e.g. evolutionary algorithm) to fine-tune the heuristic technique for each specific configuration. For a variety of combinations, this is done. A network simulation is run using the modified heuristic algorithm in each configuration to arrive at a solution. As a result, a comprehensive dataset for a variety of conditions is produced (e.g., support vector machine). These characteristics include local (round-state), global (network-state), and application-specific aspects of the input feature vector. After training, the HMML model may be used to quickly cluster data. Machine learning's capacity to generalize helps us comprehend the metaheuristic algorithm's behavior in identifying optimal paths for previous configurations. Simulation studies show that HMML can adapt to varied applications while extending network life which increases upto 5% for total energy consumption. [ABSTRACT FROM AUTHOR]

Identifying and assessing Parkinson's disease in its early stages is critical to effectively monitoring the disease's progression. Methodologies based on machine learning enhanced speech analysis are gaining popularity as the potential of this field is revealed. Acoustic features, in particular, are used in a variety of algorithms for machine learning and could serve as indicators of the general health of subjects' voices. In this research paper, a novel method is introduced for the automated detection of Parkinson's disease through speech signal analysis, a support vector machines classifier (SVM) and an Artificial Neural Network (ANN) are used to evaluate and classify the data based on two acoustic features: Bark Frequency Cepstral Coefficients (BFCC) and Mel Frequency Cepstral Coefficients (MFCC). These features are extracted from the denoised signals using Empirical Mode Decomposition (EMD). The most relevant results obtained for a dataset of 38 participants are by the BFCC coefficients with an accuracy up to 92.10%. These results confirm that EMD-BFCC-SVM method can contribute to the detection of Parkinson's disease. [ABSTRACT FROM AUTHOR]

Introduction: Multi-modal neuroimaging metrics in combination with advanced machine learning techniques have attracted more and more attention for an effective multi-class identification of Alzheimer’s disease (AD), mild cognitive impairment (MCI) and health controls (HC) recently. Methods: In this paper, a total of 180 subjects consisting of 44 AD, 66 MCI and 58 HC subjects were enrolled, and the multi-modalities of the resting-state functional magnetic resonance imaging (rs-fMRI) and the structural MRI (sMRI) for all participants were obtained. Then, four kinds of metrics including the Hurst exponent (HE) metric and bilateral hippocampus seed independently based connectivity metrics generated from fMRI data, and the gray matter volume (GMV) metric obtained from sMRI data, were calculated and extracted in each region of interest (ROI) based on a newly proposed automated anatomical Labeling (AAL3) atlas after data pre-processing. Next, these metrics were selected with a minimal redundancy maximal relevance (MRMR) method and a sequential feature collection (SFC) algorithm, and only a subset of optimal features were retained after this step. Finally, the support vector machine (SVM) based classification methods and artificial neural network (ANN) algorithm were utilized to identify the multi-class of AD, MCI and HC subjects in single modal and multi-modal metrics respectively, and a nested ten-fold cross-validation was utilized to estimate the final classification performance. Results: The results of the SVM and ANN based methods indicated the best accuracies of 80.36 and 74.40%, respectively, by utilizing all the multi-modal metrics, and the optimal accuracies for AD, MCI and HC were 79.55, 78.79 and 82.76%, respectively, in the SVM based method. In contrast, when using single modal metric, the SVM based method obtained a best accuracy of 72.62% with the HE metric, and the accuracies for AD, MCI and HC subjects were just 56.82, 80.30 and 75.86%, respectively. Moreover, the overlapping abnormal brain regions detected by multi-modal metrics were mainly located at posterior cingulate gyrus, superior frontal gyrus and cuneus. Conclusion: Taken together, the SVM based method with multi-modal metrics could provide effective diagnostic information for identifying AD, MCI and HC subject. [ABSTRACT FROM AUTHOR]

This paper gives a performance analysis of multiple vote classifiers based on metaclassification methods for estimating the risk of diabetes. The study's dataset includes a number of biological and clinical risk variables that can result in the development of diabetes. In the analysis, classifiers like Random Forest, Logistic Regression, Gradient Boosting, Support Vector Machines, and Artificial Neural Networks were used. In the study, each classifier was trained and evaluated separately, and the outcomes were compared to those attained using meta-classification methods. Some of the meta-classifiers used in the analysis included Majority Voting, Weighted Majority Voting, and Stacking. The effectiveness of each classifier was evaluated using a number of measures, including accuracy, precision, recall, F1-score, and Area under the Curve (AUC). The results show that meta-classification techniques often outperform solo classifiers in terms of prediction precision. Random Forest and Gradient Boosting, two different classifiers, had the highest accuracy, while Logistic Regression performed the worst. The best performing meta-classifier was stacking, which achieved an accuracy of 84.25%. Weighted Majority Voting came in second (83.86%) and Majority Voting came in third (82.95%). [ABSTRACT FROM AUTHOR]

This paper aims to provide results of empirical experiments on the accuracy of different machine learning algorithms for detecting spam messages, using a public dataset of spam messages. The originality of our study lies in the integration of topic modeling, specifically employing Latent Dirichlet Allocation (LDA) alongside machine learning algorithms for spam detection. By extracting hidden topics and uncovering patterns in spam and non-spam messages, we provide unique insights into the distinguishing characteristics of spam messages. Moreover, the integration of machine learning is a powerful tool in bolstering risk control measures ensuring the sustainability of digital platforms and communication channels. The research tests the accuracy of spam detection classifiers on an open-source dataset of spam messages. The key findings of this study reveal that the Logistic Regression classifier achieved the highest F score of 0.986, followed by the Support Vector Machine classifier with a score of 0.98 and the Naive Bayes classifier with a score of 0.955. The study concludes that Logistic Regression outperforms Naive Bayes and Support Vector Machine in text classification, particularly in spam detection, emphasizing the role of machine learning techniques in optimizing risk management strategies for sustained digital ecosystems. This capability stems from Logistic Regression's adeptness in modeling complex relationships, enabling it to achieve high accuracy on training and test datasets. [ABSTRACT FROM AUTHOR]

The automatic calculation of sediment maps from hydroacoustic data is of great importance for habitat and sediment mapping as well as monitoring tasks. For this reason, numerous papers have been published that are based on a variety of algorithms and different kinds of input data. However, the current literature lacks comparative studies that investigate the performance of different approaches in depth. Therefore, this study aims to provide recommendations for suitable approaches for the automatic classification of side-scan sonar data that can be applied by agencies and researchers. With random forests, support vector machines, and convolutional neural networks, both traditional machine-learning methods and novel deep learning techniques have been implemented to evaluate their performance regarding the classification of backscatter data from two study sites located in the Sylt Outer Reef in the German Bight. Simple statistical values, textural features, and Weyl coefficients were calculated for different patch sizes as well as levels of quantization and then utilized in the machine-learning algorithms. It is found that large image patches of 32 px size and the combined use of different feature groups lead to the best classification performances. Further, the neural network and support vector machines generated visually more appealing sediment maps than random forests, despite scoring lower overall accuracy. Based on these findings, we recommend classifying side-scan sonar data with image patches of 32 px size and 6-bit quantization either directly in neural networks or with the combined use of multiple feature groups in support vector machines. [ABSTRACT FROM AUTHOR]

Over the past two decades, support vector machines (SVMs) have become a popular supervised machine learning model, and plenty of distinct algorithms are designed separately based on different KKT conditions of the SVM model for classification/regression with different losses, including convex and or nonconvex loss. In this paper, we propose an algorithm that can train different SVM models in a unified scheme. First, we introduce a definition of the least squares type of difference of convex loss (LS-DC) and show that the most commonly used losses in the SVM community are LS-DC loss or can be approximated by LS-DC loss. Based on the difference of convex algorithm (DCA), we then propose a unified algorithm called UniSVM which can solve the SVM model with any convex or nonconvex LS-DC loss, wherein only a vector is computed by the specifically chosen loss. UniSVM has a dominant advantage over all existing algorithms for training robust SVM models with nonconvex losses because it has a closed-form solution per iteration, while the existing algorithms always need to solve an L1SVM/L2SVM per iteration. Furthermore, by the low-rank approximation of the kernel matrix, UniSVM can solve large-scale nonlinear problems efficiently. To verify the efficacy and feasibility of the proposed algorithm, we perform many experiments on small artificial problems and large benchmark tasks both with and without outliers for classification and regression for comparison with state-of-the-art algorithms. The experimental results demonstrate that UniSVM can achieve comparable performance in less training time. The foremost advantage of UniSVM is that its core code in Matlab is less than 10 lines; hence, it can be easily grasped by users or researchers. [ABSTRACT FROM AUTHOR]

This paper employs two data-driven methods, Random Forest (RF) and Support Vector Machines (SVM), to develop mineral prospectivity models for an epithermal Au deposit. Four distinct models are presented for comparison: one employing RF and three using SVM with different kernel functions—namely linear, Radial Basis Function (RBF), and polynomial. The analysis leverages a compact training dataset, encompassing just 20 deposits, with deposit and non-deposit locations chosen from known mineral occurrences. Fourteen predictor maps are constructed based on the available data and the exploration model. The findings indicate that RF is more stable and robust than SVM, regardless of the kernel function implemented. While all SVM models outperformed the RF model in terms of classification capability on the training dataset achieving an accuracy exceeding 89% versus 78% for the RF model, the success rate curves suggest superior predictive abilities of RF over SVM models. This implies that the SVM models may be overfitting the training data due to the limited quantity of training deposits. [ABSTRACT FROM AUTHOR]

Parkinson's disease (PD) is a neurological condition that is chronic and worsens over time, which presents a challenging diagnosis. An accurate diagnosis is required to recognize PD patients from healthy individuals. Diagnosing PD at early stages can reduce the severity of this disorder and improve the patient's living conditions. Algorithms based on associative memory (AM) have been applied in PD diagnosis using voice samples of patients with this health condition. Even though AM models have achieved competitive results in PD classification, they do not have any embedded component in the AM model that can identify and remove irrelevant features, which would consequently improve the classification performance. In this paper, we present an improvement to the smallest normalized difference associative memory (SNDAM) algorithm by means of a learning reinforcement phase that improves classification performance of SNDAM when it is applied to PD diagnosis. For the experimental phase, two datasets that have been widely applied for PD diagnosis were used. Both datasets were gathered from voice samples from healthy people and from patients who suffer from this condition at an early stage of PD. These datasets are publicly accessible in the UCI Machine Learning Repository. The efficiency of the ISNDAM model was contrasted with that of seventy other models implemented in the WEKA workbench and was compared to the performance of previous studies. A statistical significance analysis was performed to verify that the performance differences between the compared models were statistically significant. The experimental findings allow us to affirm that the proposed improvement in the SNDAM algorithm, called ISNDAM, effectively increases the classification performance compared against well-known algorithms. ISNDAM achieves a classification accuracy of 99.48%, followed by ANN Levenberg–Marquardt with 95.89% and SVM RBF kernel with 88.21%, using Dataset 1. ISNDAM achieves a classification accuracy of 99.66%, followed by SVM IMF1 with 96.54% and RF IMF1 with 94.89%, using Dataset 2. The experimental findings show that ISNDAM achieves competitive performance on both datasets and that statistical significance tests confirm that ISNDAM delivers classification performance equivalent to that of models published in previous studies. [ABSTRACT FROM AUTHOR]

Due to subjectivity in refereeing, the results of race walking are often questioned. To overcome this limitation, artificial-intelligence-based technologies have demonstrated their potential. The paper aims at presenting WARNING, an inertial-based wearable sensor integrated with a support vector machine algorithm to automatically identify race-walking faults. Two WARNING sensors were used to gather the 3D linear acceleration related to the shanks of ten expert race-walkers. Participants were asked to perform a race circuit following three race-walking conditions: legal, illegal with loss-of-contact and illegal with knee-bent. Thirteen machine learning algorithms, belonging to the decision tree, support vector machine and k-nearest neighbor categories, were evaluated. An inter-athlete training procedure was applied. Algorithm performance was evaluated in terms of overall accuracy, F1 score and G-index, as well as by computing the prediction speed. The quadratic support vector was confirmed to be the best-performing classifier, achieving an accuracy above 90% with a prediction speed of 29,000 observations/s when considering data from both shanks. A significant reduction of the performance was assessed when considering only one lower limb side. The outcomes allow us to affirm the potential of WARNING to be used as a referee assistant in race-walking competitions and during training sessions. [ABSTRACT FROM AUTHOR]

Breast cancer (BC) is the leading cause of death among women worldwide. It affects in general women older than 40 years old. Medical images analysis is one of the most promising research areas since it provides facilities for diagnosis and decision-making of several diseases such as BC. This paper conducts a Structured Literature Review (SLR) of the use of Machine Learning (ML) and Image Processing (IP) techniques to deal with BC imaging. A set of 530 papers published between 2000 and August 2019 were selected and analyzed according to ten criteria: year and publication channel, empirical type, research type, medical task, machine learning techniques, datasets used, validation methods, performance measures and image processing techniques which include image pre-processing, segmentation, feature extraction and feature selection. Results showed that diagnosis was the most used medical task and that Deep Learning techniques (DL) were largely used to perform classification. Furthermore, we found out that classification was the most ML objective investigated followed by prediction and clustering. Most of the selected studies used Mammograms as imaging modalities rather than Ultrasound or Magnetic Resonance Imaging with the use of public or private datasets with MIAS as the most frequently investigated public dataset. As for image processing techniques, the majority of the selected studies pre-process their input images by reducing the noise and normalizing the colors, and some of them use segmentation to extract the region of interest with the thresholding method. For feature extraction, we note that researchers extracted the relevant features using classical feature extraction techniques (e.g. Texture features, Shape features, etc.) or DL techniques (e. g. VGG16, VGG19, ResNet, etc.), and finally few papers used feature selection techniques in particular the filter methods. [ABSTRACT FROM AUTHOR]

The quality of sleep plays a crucial role in physical well-being, and individuals are becoming increasingly concerned about sleep quality and its associated health issues. Although various sleep monitoring devices exist, there remains a need for a highly accurate sleep state identification algorithm. To address this, we present a paper that utilizes machine learning techniques to identify human sleep states based on electroencephalogram (EEG) signals collected by an EEG instrument. We propose a model that incorporates two nonlinear characteristic parameters, MSE and PSE, extracted from artificially designed EEG signals as input. Additionally, we employ a Support Vector Machine (SVM) classifier algorithm to accurately identify sleep states, eliminating uncertainties associated with manually designed feature parameters. Experimental results demonstrate the superior accuracy of our proposed model for sleep state analysis, offering valuable insights for improving sleep quality and addressing related health concerns. [ABSTRACT FROM AUTHOR]

Copyright of Firat University Journal of Experimental & Computational Engineering (FUJECE) is the property of Firat University Journal of Experimental & Computational Engineering (FUJECE) and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

An improved version of the mayfly algorithm called the golden annealing crossover-mutation mayfly algorithm (GSASMA) is proposed to address the low convergence efficiency and insufficient search capability of existing mayfly algorithms. First, the speed of individual mayflies is optimized using a simulated annealing algorithm to improve the update rate. The position of individuals is improved using the golden sine algorithm. Second, the impact of using different crossover and mutation methods in the algorithm is compared, and the optimal strategy is selected from the algorithm. To evaluate the performance of the algorithm, simulation experiments were carried out for 10 different test functions, and the results were compared with those of existing algorithms. The simulation results show that the algorithm developed in this paper converges faster and the solutions obtained are closer to the global optimum. Finally, GSASMA was used to optimize a support vector machine (SVM) that was used to identify the P300 signal for five subjects. The experimental results show that the SVM optimized by the algorithm proposed in this paper has higher recognition accuracy than an extreme learning machine. [ABSTRACT FROM AUTHOR]

To avoid the considerable challenges and losses caused by stuck drilling to normal drilling operations, this article analyses the mechanism of stuck drilling, then combines the artificial fish swarm algorithm (AFSA) and support vector machine (SVM), and finally proposes an early warning model for the stuck-in medical drilling process based on the AFSA and SVM. The model realizes real-time sticking risk warnings by using the four parameters of riser pressure, torque, speed and hook load collected in real time and promotes real-time drilling parameter monitoring for the real-time dynamic warning of sticking risk. By comparing the AFSA-SVM sticking prediction model with the particle swarm optimization model and the traditional cross-validation optimization model, it is found that the AFSA-SVM stuck prediction model accuracy can reach 97.561% and that the training and testing times are 5.874 s and 0.76 s, respectively. Its accuracy and computational efficiency are higher than those of the particle swarm optimization model and traditional cross-validation optimization model. In comparison with the existing technology, the four-parameter early sticking warning model based on AFSA-SVM presented in this paper shows powerful comprehensive performance and field application value. [ABSTRACT FROM AUTHOR]

In this paper, we present difference of convex algorithms for solving bilevel programs in which the upper level objective functions are difference of convex functions, and the lower level programs are fully convex. This nontrivial class of bilevel programs provides a powerful modelling framework for dealing with applications arising from hyperparameter selection in machine learning. Thanks to the full convexity of the lower level program, the value function of the lower level program turns out to be convex and hence the bilevel program can be reformulated as a difference of convex bilevel program. We propose two algorithms for solving the reformulated difference of convex program and show their convergence to stationary points under very mild assumptions. Finally we conduct numerical experiments to a bilevel model of support vector machine classification. [ABSTRACT FROM AUTHOR]

Vibration failure in the pumping system is a significant issue for industries that rely on the pump as a critical device which requires regular maintenance. To save energy and money, a new automated system must be developed that can detect anomalies at an early stage. This paper presents a case study of a machine learning (ML)-based computational technique for automatic fault detection in a cascade pumping system based on variable frequency drive (VFD). Since the intensity of the vibrational effect depends on which axis has the most significant effect, a three-axis accelerometer is used to measure it in the pumping system. The emphasis is on determining the vibration effect on different axes. For experiment, various ML algorithms are investigated on collected vibratory data through Matlab software in x, y, z axes and performances of the algorithms are compared based on accuracy rate, prediction speed and training time. Based on the proposed research results, the multiclass support vector machine (MSVM) is found to be the best suitable algorithm compared to other algorithms. It has been demonstrated that ML algorithms can detect faults automatically rather than conventional methods. MSVM is used for the proposed work because it is less complex and produces better results with a limited data set. [ABSTRACT FROM AUTHOR]

With the development of teaching evaluation program, colleges and universities have reformed according to the actual situation of the school. With the development of evaluation activities, many universities are eager to establish their own teaching quality evaluation system, so as to pre-evaluate the teaching quality of schools. SVM is one of the most widely used machine learning algorithms that enables efficient statistical learning with a very limited number of samples. Considering the excellent learning performance of SVM, it is very suitable for the teaching quality evaluation system. In this paper, we optimize the existing multiple classification algorithm for binary trees and propose a new method. Learning the popular teaching quality evaluation system in colleges and universities, the binary tree support vector machine classification algorithm, and design comparison experiment, the experimental results show that the evaluation model proposed in this paper has strong generalization ability and higher classification accuracy and better classification efficiency. [ABSTRACT FROM AUTHOR]

In the face of the batch, dynamic access data, or the flow of data that continuous changes over time, the traditional support vector machine algorithm cannot dynamically adjust the previous classification model. To overcome this shortcoming, the incremental support vector machine (ISVM) algorithm is proposed. However, many incremental support vector algorithms still have shortcomings such as low efficiency, memory limitation, and poor generalization. This paper puts forward the new ISVM algorithm, HDFC-ISVM ∗ algorithm, based on the high-dimensional distance and forgetting characteristics. This paper firstly proposes the original HDFC-ISVM algorithm that first learns the distribution characteristics of the samples according to the distance between the samples and the normative hyperplane. Then, it introduces the forgetting factor. In the incremental learning process, the classifier gradually accumulates the spatial distribution knowledge of samples, eliminates the samples that have no contributions to the classifier, and selectively forgets some useless samples according to the forgetting factor, which overcomes the shortcomings such as low efficiency and poor accuracy of some algorithms. But, the original HDFC-ISVM algorithm is sensitive to parameters, and different settings of the parameters have a great impact on the final classification accuracy of the algorithm. Therefore, on the basis of the original algorithm, an improved algorithm HDFC-ISVM ∗ based on the adjustments to the initialization strategy and updating rules of the forgetting factor is proposed. The initialization strategy and updating rules of the forgetting factor are adjusted to adapt datasets with different distributions in this improved algorithm. The rationality of the improved strategy about the forgetting factor is discussed theoretically. At the same time, the proposed algorithm has better classification accuracy, classification efficiency, and better generalization ability than other algorithms, which is verified by experiments. [ABSTRACT FROM AUTHOR]

Suicidal behavior is a complex phenomenon that is contextually dependent and changes rapidly from one day to another. The problem in predicting suicidal behavior is identifying individuals and at-risk groups in crisis and at risk for suicide. The current predictive model, which uses machine learning techniques, has been shown to lack accuracy, and no study has attempted to use a voting ensemble model to predict suicidal behavior. The soft voting ensemble model demonstrated good performance in the healthcare setting, but assigning optimal weights for machine learning models is challenging. Therefore, this paper aims to propose a hybrid voting ensemble model to achieve optimal weights in predicting an individual with suicidal behavior. The results show that the proposed hybrid voting ensemble model can effectively classify an individual with suicidal behavior with an accuracy of 0.84 compared to other machine learning models (logistic regression, support vector machine, random forest, gradient boosting). Hybridization of soft voting with brute force algorithm has shown that the proposed hybrid ensemble model can find the optimal weights for the machine learning model in the context of predicting suicidal behavior. Furthermore, the proposed hybrid ensemble model shows that clinical data can be used to improve the performance of machine learning models in predicting an individual with suicidal behavior. [ABSTRACT FROM AUTHOR]

The construction disturbance mechanism of rectangular pipe-jacking tunnels is more intricate than that of circular tunnels, leading to potential issues such as excessive accumulation and deformation of the surrounding formation, which can result in engineering disasters. However, there is currently a lack of reliable methods for predicting these disturbances. Machine-learning techniques have the capability to analyze the influence of multiple independent variables on a dependent variable, offering a new approach for predicting surface settlement in the construction of rectangular pipe-jacking tunnels. To address the sensitivity of existing machine-learning models to initial parameters, an improved particle swarm optimization (IPSO) method is employed. This method incorporates an adaptive mutation technique, adaptive inertia weight, and postoptimization method for mutant particles to enhance the particle size and determine the probability of obtaining the optimal value. By leveraging the strong mapping and nonlinear fitting abilities of the backpropagation (BP) algorithm, the IPSO-BP algorithm model is developed and compared with the BP, support vector machine, and random forest (RF) models using actual monitoring data. The findings indicate that in the presence of specific noise in the surface settlement data, the IPSO-BP prediction model demonstrates an enhanced accuracy of 26%, 25%, and 10% for the left amplitude. This approach can serve as a valuable reference for settlement prediction in similar projects. [ABSTRACT FROM AUTHOR]

Background: Determination of batch-to-batch consistency of botanical drugs (BDs) has long been the bottleneck in quality evaluation primarily due to the chemical diversity inherent in BDs. This diversity presents an obstacle to achieving comprehensive standardization for BDs. Basically, a single detection mode likely leads to substandard analysis results as different classes of structures always possess distinct physicochemical properties. Whereas representing a workaround for multi-target standardization using multi-modal data, data processing for information from diverse sources is of great importance for the accuracy of classification. Methods: In this research, multi-modal data of 78 batches of Guhong injections (GHIs) consisting of 52 normal and 26 abnormal samples were acquired by employing HPLC-UV, -ELSD, and quantitative 1H NMR (q1HNMR), of which data obtained was then individually used for Pearson correlation coefficient (PCC) calculation and partial least square-discriminant analysis (PLS-DA). Then, a mid-level data fusion method with data containing qualitative and quantitative information to establish a support vector machine (SVM) model for evaluating the batch-to-batch consistency of GHIs. Results: The resulting outcomes showed that datasets from one detection mode (e.g., data from UV detectors only) are inadequate for accurately assessing the product's quality. The mid-level data fusion strategy for the quality evaluation enabled the classification of normal and abnormal batches of GHIs at 100% accuracy. Conclusions: A quality assessment strategy was successfully developed by leveraging a mid-level data fusion method for the batch-to-batch consistency evaluation of GHIs. This study highlights the promising utility of data from different detection modes for the quality evaluation of BDs. It also reminds manufacturers and researchers about the advantages of involving data fusion to handle multi-modal data. Especially when done jointly, this strategy can significantly increase the accuracy of product classification and serve as a capable tool for studies of other BDs. [ABSTRACT FROM AUTHOR]

Background: Previous studies have developed the Migraine Aura Complexity Score (MACS) system. MACS shows great potential in studying the complexity of migraine with aura (MwA) pathophysiology especially when implemented in neuroimaging studies. The use of sophisticated machine learning (ML) algorithms, together with deep profiling of MwA, could bring new knowledge in this field. We aimed to test several ML algorithms to study the potential of structural cortical features for predicting the MACS and therefore gain a better insight into MwA pathophysiology. Methods: The data set used in this research consists of 340 MRI features collected from 40 MwA patients. Average MACS score was obtained for each subject. Feature selection for ML models was performed using several approaches, including a correlation test and a wrapper feature selection methodology. Regression was performed with the Support Vector Machine (SVM), Linear Regression, and Radial Basis Function network. Results: SVM achieved a 0.89 coefficient of determination score with a wrapper feature selection. The results suggest a set of cortical features, located mostly in the parietal and temporal lobes, that show changes in MwA patients depending on aura complexity. Conclusions: The SVM algorithm demonstrated the best potential in average MACS prediction when using a wrapper feature selection methodology. The proposed method achieved promising results in determining MwA complexity, which can provide a basis for future MwA studies and the development of MwA diagnosis and treatment. [ABSTRACT FROM AUTHOR]

Objective: This research addresses the challenges of maintaining proper yoga postures, an issue that has been exacerbated by the COVID-19 pandemic and the subsequent shift to virtual platforms for yoga instruction. This research aims to develop a mechanism for detecting correct yoga poses and providing real-time feedback through the application of computer vision and machine learning (ML) techniques. Methods and Procedures: This study utilized computer vision-based pose estimation methods to extract features and calculate yoga pose angles. A variety of models, including extremely randomized trees, logistic regression, random forest, gradient boosting, extreme gradient boosting, and deep neural networks, were trained and tested to classify yoga poses. Our study employed the Yoga-82 dataset, consisting of many yoga pose images downloaded from the web. Results: The results of this study show that the extremely randomized trees model outperformed the other models, achieving the highest prediction accuracy of 91% on the test dataset and 92% in a fivefold cross-validation experiment. Other models like random forest, gradient boosting, extreme gradient boosting, and deep neural networks achieved accuracies of 90%, 89%, 90%, and 85%, respectively, while logistic regression underperformed, having the lowest accuracy. Conclusion: This research concludes that the extremely randomized trees model presents superior predictive power for yoga pose recognition. This suggests a valuable avenue for future exploration in this domain. Moreover, the approach has significant potential for implementation on low-powered smartphones with minimal latency, thereby enabling real-time feedback for users practicing yoga at home. [ABSTRACT FROM AUTHOR]

Despite recent advancements in prosthetic technology, lower-limb amputees often remain limited to passive prostheses, which leads to an asymmetric gait and increased energy expenditure. Developing active prostheses with effective control systems is important to improve mobility for these individuals. This study presents a machine-learning-based approach to classify five distinct locomotion tasks: ground-level walking (GWL), ramp ascent (RPA), ramp descent (RPD), stairs ascent (SSA), and stairs descent (SSD). The dataset comprises fused electromyographic (EMG) and inertial measurement unit (IMU) signals from twenty non-amputated and five transtibial amputated participants. EMG sensors were strategically positioned on the thigh muscles, while IMU sensors were placed on various leg segments. The performance of two classification algorithms, support vector machine (SVM) and long short-term memory (LSTM), were evaluated on segmented data. The results indicate that SVM models outperform LSTM models in accuracy, precision, and F1 score in the individual evaluation of amputee and non-amputee datasets for 80–20 and 50–50 data distributions. In the 80–20 distribution, an accuracy of 95.46% and 95.35% was obtained with SVM for non-amputees and amputees, respectively. An accuracy of 93.33% and 93.30% was obtained for non-amputees and amputees by using LSTM, respectively. LSTM models show more robustness and inter-population generalizability than SVM models when applying domain-adaptation techniques. Furthermore, the average classification latency for SVM and LSTM models was 19.84 ms and 37.07 ms, respectively, within acceptable limits for real-time applications. This study contributes to the field by comprehensively comparing SVM and LSTM classifiers for locomotion tasks, laying the foundation for the future development of real-time control systems for active transtibial prostheses. [ABSTRACT FROM AUTHOR]

Recent years have witnessed booming data on drugs and their associated adverse drug reactions (ADRs). It was reported that these ADRs have resulted in a high hospitalisation rate worldwide. Therefore, a tremendous amount of research has been carried out to predict ADRs in the early phases of drug development, with the goal of reducing possible future risks. The pre-clinical and clinical phases of drug research can be time-consuming and cost-ineffective, so academics are looking forward to more extensive data mining and machine learning methods to be applied in this field of study. In this paper, we try to construct a drug-to-drug network based on non-clinical data sources. The network presents underlying relationships between drug pairs according to their common ADRs. Then, multiple node-level and graph-level network features are extracted from this network, e.g., weighted degree centrality, weighted PageRanks, etc. After concatenating the network features to the original drug features, they were fed into seven machine learning models, e.g., logistic regression, random forest, support vector machine, etc., and were compared to the baseline, where there were no network-based features considered. These experiments indicate that all the tested machine-learning methods would benefit from adding these network features. Among all these models, logistic regression (LR) had the highest mean AUROC score (82.1%) across all ADRs tested. Weighted degree centrality and weighted PageRanks were identified to be the most critical network features in the LR classifier. These pieces of evidence strongly indicate that the network approach can be vital in future ADR prediction, and this network-based approach could also be applied to other health informatics datasets. [ABSTRACT FROM AUTHOR]

The failure of insulators may seriously threaten the safe operation of the power system, where the state detection of high-voltage insulators is a must for the normal and safe operation of the power system. Based on the data of insulators in aerial images, this work explored an enhanced particle swarm algorithm to optimize the parameters of the support vector machine. A support vector machine model was therefore established for the identification of the normal and defective states of the insulators. This methodology works with the structure minimization principle of SVM and the characteristics of particle swarm fast optimization. First, the aerial insulator image was segmented as a target by way of the seed region growth based on double-layer cascade morphological improvements, and then, HOG features plus GLCM features were extracted as sample data. Finally, an ameliorated PSO-SVM classifier was designed to realize insulator state identification. Comparisons were made between PSO-SVM and conventional machine learning algorithms, SVM and Random Forest, and an optimization algorithm, Gray Wolf Optimization Support Vector Machine (GWO-SVM), and advanced neural network CNN. The experimental results showed that the performance of the algorithm proposed in this paper touched the top level, where the recognition accuracy rate was 92.11%, the precision rate 90%, the recall rate 94.74%, and the F1-score 92.31%. [ABSTRACT FROM AUTHOR]

Copyright of Telecommunication Engineering is the property of Telecommunication Engineering and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Conventional methodology in the field for the sampling of coffee leaf rust, caused by Hemileia vastatrix, has proven to be impractical. This paper proposes a method for the early detection of this disease, which is the most significant pathogen of coffee plants worldwide, using multispectral images acquired using a Mapir Survey3W camera and an unmanned aerial vehicle (UAV). For this purpose, 160 coffee seedlings of the coffee cultivar 'Mundo Novo' were inoculated with urediniospores of H. vastatrix and compared with 160 control (non-inoculated) seedlings to determine the most favorable interval for distinguishing healthy and infected plants. The 320 seedlings were placed on a dark surface to perform the imaging flights. In vitro analyses of the physiological parameters of 20 specimens were then performed for each condition (inoculated/non-inoculated) to obtain the hyperspectral curves, and this process was repeated three times at 15, 30, and 45 days after inoculation (DAI). Based on the simulated hyperspectral curves, a discrepancy between the red and near-infrared (NIR) bands was identified at 15 DAI, with the inoculated plants showing greater absorption in the red band and a greater spectral response in the NIR band. Thus, multispectral images were able to distinguish H. vastatrix infection in coffee seedlings at an asymptomatic stage (15 DAI) using a support vector machines (SVM) algorithm. Detection accuracy was 80% and the Kappa index of agreement was moderate (0.6). The early detection of this pathogen in the field using low-cost technology can be an important tool for the monitoring of coffee leaf rust and, consequently, a more sustainable management of the pathogen, causing farmers to make applications of chemical fungicides only when necessary. [ABSTRACT FROM AUTHOR]

The problem of oil displacement was solved using neural networks and machine learning classifiers. The Buckley Leverett model is selected, which describes the process of oil displacement by water. It consists of the equation of continuity of oil, water phases and Darcy’s law. The challenge is to optimize the oil displacement problem. Optimization will be performed at three levels: vectorization of calculations; implementation of classical algorithms; implementation of the algorithm using neural networks. A feature of the method proposed in the work is the identification of the method with high accuracy and the smallest errors, comparing the results of machine learning classifiers and types of neural networks. The research paper is also one of the first papers in which a comparison was made with machine learning classifiers and neural and recurrent neural networks. The classification was carried out according to three classification algorithms, such as decision tree, support vector machine (SVM) and gradient boosting. As a result of the study, the Gradient Boosting classifier and the neural network showed high accuracy, respectively 99.99 % and 97.4 %. The recurrent neural network trained faster than the others. The SVM classifier has the lowest accuracy score. To achieve this goal, a dataset was created containing over 67,000 data for class 10. These data are important for the problems of oil displacement in porous media. The proposed methodology provides a simple and elegant way to instill oil knowledge into machine learning algorithms. This removes two of the most significant drawbacks of machine learning algorithms: the need for large datasets and the robustness of extrapolation. The presented principles can be generalized in countless ways in the future and should lead to a new class of algorithms for solving both forward and inverse oil problems. [ABSTRACT FROM AUTHOR]

Various machine-learning methods have been applied to anomaly intrusion detection. However, the Intrusion Detection System still faces challenges in improving Detection Rate and reducing False Positive Rate. In this paper, a Class-Level Soft-Voting Ensemble (CLSVE) scheme based on the Chaos Bat Algorithm (CBA), called CBA-CLSVE, is proposed for intrusion detection. The Support Vector Machine (SVM), K-Nearest Neighbor (KNN) and Decision Tree (DT) are selected as the base learners of the ensemble. The Chaos Bat Algorithm is used to generate class-level weights to create the weighted voting ensemble. A weighted fitness function considering the tradeoff between maximizing Detection Rate and minimizing False Positive Rate is proposed. In the experiments, the NSL-KDD, UNSW-NB15 and CICIDS2017 datasets are used to verify the scheme. The experimental results show that the class-level weights generated by CBA can be used to improve the combinative performance. They also show that the same ensemble performance can be achieved using about half the total number of features or fewer. [ABSTRACT FROM AUTHOR]

The Intrusion Detection System (IDS) is an important feature that should be integrated in high density sensor networks, particularly in wireless sensor networks (WSNs). Dynamic routing information communication and an unprotected public media make them easy targets for a wide variety of security threats. IDSs are helpful tools that can detect and prevent system vulnerabilities in a network. Unfortunately, there is no possibility to construct advanced protective measures within the basic infrastructure of the WSN. There seem to be a variety of machine learning (ML) approaches that are used to combat the infiltration issues plaguing WSNs. The Slime Mould Algorithm (SMA) is a recently suggested ML approach for optimization problems. Therefore, in this paper, SMA will be integrated into an IDS for WSN for anomaly detection. The SMA's role is to reduce the number of features in the dataset from 41 to five features. The classification was accomplished by two methods, Support Vector Machine with polynomial core and decision tree. The SMA showed comparable results based on the NSL-KDD dataset, where 99.39%, 0.61%, 99.36%, 99.42%, 99.33%, 0.58%, and 99.34%, corresponding to accuracy, error rate, sensitivity, specificity, precision, false positive rate, and F-measure, respectively, are obtained, which are significantly improved values when compared to other works. [ABSTRACT FROM AUTHOR]

In this paper, various machine learning algorithms were used in order to predict the evolution of open-angle glaucoma (POAG). The datasets were built containing clinical observations and objective measurements made at the Countess of Chester Hospital in the UK and at the "St. Spiridon" Hospital of Iași, Romania. Using these datasets, different classification problems were proposed. The evaluation of glaucoma progression was conducted based on parameters such as VFI (Visual field index), MD (Mean Deviation), PSD (Pattern standard deviation), and RNFL (Retinal Nerve Fiber Layer). As classification tools, the following algorithms were used: Multilayer Perceptron, Random Forest, Random Tree, C4.5, k-Nearest Neighbors, Support Vector Machine, and Non-Nested Generalized Exemplars. The best results, with an accuracy of over 90%, were obtained with Multilayer Perceptron and Random Forest algorithms. The NNGE algorithm also proved very useful in creating a hierarchy of the input values according to their influence (weight) on the considered outputs. On the other hand, the decision tree algorithms gave us insight into the logic used in their classification, which is of practical importance in obtaining additional information regarding the rationale behind a certain rule or decision. [ABSTRACT FROM AUTHOR]

: Energy and security remain the main two challenges in Wireless Sensor Networks (WSNs). Therefore, protecting these WSN networks from Denial of Service (DoS) and Distributed DoS (DDoS) is one of the WSN networks security tasks. Traditional packet deep scan systems that rely on open field inspection in transport layer security packets and the open field encryption trend are making machine learning-based systems the only viable choice for these types of attacks. This paper contributes to the evaluation of the use machine learning algorithms in WSN nodes traffic and their effect on WSN network life time. We examined the performance metrics of different machine learning classification categories such as K-Nearest Neighbour (KNN), Logistic Regression (LR), Support Vector Machine (SVM), Gboost, Decision Tree (DT), Naïve Bayes, Long Short Term Memory (LSTM), and Multi-Layer Perceptron (MLP) on a WSN-dataset in different sizes. The test results proved that the statistical and logical classification categories performed the best on numeric statistical datasets, and the Gboost algorithm showed the best performance compared to different algorithms on average of all performance metrics. The performance metrics used in these validations were accuracy, F1-score, False Positive Ratio (FPR), False Negative Ratio (FNR), and the training execution time. Moreover, the test results showed the Gboost algorithm got 99.6%, 98.8%, 0.4% 0.13% in accuracy, F1-score, FPR, and FNR, respectively. At training execution time, it obtained 1.41 s for the average of all training time execution datasets. In addition, this paper demonstrated that for the numeric statistical data type, the best results are in the size of the dataset ranging from 3000 to 6000 records and the percentage between categories is not less than 50% for each category with the other categories. Furthermore, this paper investigated the effect of Gboost on the WSN lifetime, which resulted in a 32% reduction compared to other Gboost-free scenarios. [ABSTRACT FROM AUTHOR]

This paper is proposing an machine learning based expert system for preliminary prediction of the insulation fire resisting performance of shallow floor systems when subject to exposure to the ISO 834 Standard Fire Curve. The proposed system is a digital tool which incorporates a machine learning algorithm trained on the outcomes of pre-run two-dimensional finite element heat transfer analyses of shallow floor system details. The algorithm predicts the insulation performance of similar details with a measurable accuracy of 96% (i.e the insulation rating band was predicted correctly in 96% of the cases) without the requirement for an explicit deterministic analysis. The paper presents the challenges and prerequisites to build such an expert system and acts as a proof of concept for the use of machine learning for the assessment of the insulation performance of shallow floor system under the guidance of BS EN 1363-1:2012. A Support Vector Machine machine learning algorithm is adopted in this work. The required processes that were needed for the development of the expert system include the stages of data acquisition, exploratory data analysis, choice of machine learning algorithm, model training, tuning, and validation. This expert system is useful for practitioners to rapidly assess the feasibility of different construction details at early stages of the design process. [ABSTRACT FROM AUTHOR]

In recent years, the consumption of social media content to keep up with global news and to verify its authenticity has become a considerable challenge. Social media enables us to easily access news anywhere, anytime, but it also gives rise to the spread of fake news, thereby delivering false information. This also has a negative impact on society. Therefore, it is necessary to determine whether or not news spreading over social media is real. This will allow for confusion among social media users to be avoided, and it is important in ensuring positive social development. This paper proposes a novel solution by detecting the authenticity of news through natural language processing techniques. Specifically, this paper proposes a novel scheme comprising three steps, namely, stance detection, author credibility verification, and machine learning-based classification, to verify the authenticity of news. In the last stage of the proposed pipeline, several machine learning techniques are applied, such as decision trees, random forest, logistic regression, and support vector machine (SVM) algorithms. For this study, the fake news dataset was taken from Kaggle. The experimental results show an accuracy of 93.15%, precision of 92.65%, recall of 95.71%, and F1-score of 94.15% for the support vector machine algorithm. The SVM is better than the second best classifier, i.e., logistic regression, by 6.82%. [ABSTRACT FROM AUTHOR]

Principles of typical motion planning algorithms are investigated and analyzed in this paper. These algorithms include traditional planning algorithms, classical machine learning algorithms, optimal value reinforcement learning, and policy gradient reinforcement learning. Traditional planning algorithms investigated include graph search algorithms, sampling-based algorithms, interpolating curve algorithms, and reaction-based algorithms. Classical machine learning algorithms include multiclass support vector machine, long short-term memory, Monte-Carlo tree search and convolutional neural network. Optimal value reinforcement learning algorithms include Q learning, deep Q-learning network, double deep Q-learning network, dueling deep Q-learning network. Policy gradient algorithms include policy gradient method, actor-critic algorithm, asynchronous advantage actor-critic, advantage actor-critic, deterministic policy gradient, deep deterministic policy gradient, trust region policy optimization and proximal policy optimization. New general criteria are also introduced to evaluate the performance and application of motion planning algorithms by analytical comparisons. The convergence speed and stability of optimal value and policy gradient algorithms are specially analyzed. Future directions are presented analytically according to principles and analytical comparisons of motion planning algorithms. This paper provides researchers with a clear and comprehensive understanding about advantages, disadvantages, relationships, and future of motion planning algorithms in robots, and paves ways for better motion planning algorithms in academia, engineering, and manufacturing. [ABSTRACT FROM AUTHOR]

Introduction: Nowadays human immunodeficiency virus (HIV)/acquired immunodeficiency syndrome (AIDS) is very dangerous. HIV targets the resistant system and weakens people's denial against many contaminations and some kinds of cancer. As the virus breaks up and impairs the function of immunity, infected people gradually become immunodeficient. Both deep learning and machine learning models play a great role in the prediction of diseases. The function of immunity is CD4 cell count. In this study both the machine learning and deep learning algorithms were applied. Material and methods: In this paper the data were collected from data world. Support vector machine, random forest, naïve Bayes, gated recurrent unit, and long short-term memory were used to fit the incidence data. The performance of the model was evaluated by accuracy, precision, sensitivity, and F-score with respective errors. Results: Based on the evaluation, deep learning models achieve better results in the metrics of accuracy, precision, and F-score than machine learning models. But in sensitivity metrics machine learning models achieve better result than deep learning. Machine learning algorithms SVM, RF, and NB provide accuracy of 89.00%, 87.00%, and 86.94%; precision of 75.89%, 74.97%, and 75.78%; sensitivity of 87.96%, 84.00%, and 84.12%; F-score of 82.87%, 80.03%, and 79.05%, respectively. LSTM, GRU provides accuracy of 97.65%, 96.00%, precision of 77.35%, 84.00%, sensitivity of 87.93%, 82.98%, and F-score of 82.03%, 83.20%, respectively. Conclusions: The possibility survival of the illness is less than no illness. The existence of TB negative is higher than TB positive. In the machine learning model SVM provides better sensitivity with 87.96%, long short-term memory provides accuracy of 97.65%, precision of 77.35%, sensitivity of 87.93%, and F-score of 82.03%. [ABSTRACT FROM AUTHOR]