Search

This Power quality problem is a vital issue in current-day power system with the increased penetration of distributed generation (DG) systems which greatly affects the stability and reliability of the system. This study presents a comprehensive analysis of detection and classification strategies for monitoring power quality (PQ) disturbances. Specifically, the focus is on PQ disturbances caused as a result of load switching and variations in environmental factors, such as changes in solar irradiation and wind speed. Twelve different types of PQ disturbances under various operating scenarios are considered for the detection and classification study. Twelve different statistical features are extracted by passing the disturbances through robust H-infinity filter in order to minimize the data size and computational complexities. The statistical properties of PQ disturbances are initially categorized using the Fast Generalized Fuzzy-C means (FGFCM) clustering approach. Further, the disturbances are correctly classified by pattern classification approach like support vector machines (SVM) in order to distinctly classify them. The validity of the classification analysis is reinforced by the inclusion of experimental data gathered from a prototype wind energy system and photovoltaic (PV) system setup. Again, Genetic algorithm (GA) is used for extracting optimal features and Particle swarm optimization (PSO) is applied for optimising the heuristic parameters of the SVM in order to improvise the classification accuracy under normal, noisy as well as increased penetration of wind and photovoltaic (PV) systems.

Meteorological identification and observation are crucial in production activities closely related to meteorology, such as agricultural production. Currently, some machine learning methods applied in meteorological identification exhibit low richness of semantic features and weak transferability in pre-trained models, leading to insufficient feature extraction capabilities. Additionally, these models often have relatively simple classification layers, and they tend to train as a holistic model. To address the aforementioned shortcomings, this paper proposes a mechanism of fused training, constructing a meteorological identification model based on the enhanced fusion of EVA02 and Linear Support Vector Classification (LinearSVC). The model fine-tunes the pre-trained EVA02 backbone network, fully stimulating the qualitative transformation of transfer learning’s high-level semantic abstractions and meteorological data representations. This enhances feature extraction capabilities. Additionally, the model integrates the Nystroem method with the LinearSVC algorithm for classification, further improving classification accuracy and the robustness of the model on small datasets. Through simulation experiments, the model achieves F1-scores on the public datasets MWD and WEAPD that surpass the current state-of-the-art methods by 0.75% and 9.89%, respectively, demonstrating the effectiveness of the proposed method.

Graphs classification is a relevant problem that arises in many disciplines. Using graphs directly instead of vectorization allows exploiting the intrinsic representations of the data. Support Vector Machines (SVM) is a supervised learning method based on the use of graph kernel functions used for this task. One of the problems of SVM, as the number of samples increases, is the cost of storing and solving the optimization problem related to SVM. In this work, we propose a method capable of finding a small representative subset of the whole graph data set such that an approximate solution of the SVM optimization problem can be obtained in a fraction of the time, and without significantly degrading the classification prediction error. The method is based on the use of Locality-Sensitive Hashing for projecting over the Hilbert spaces defined by appropriate graph kernels that measure similarity between the graphs. A description of the algorithm, as well as numerical results using two graph kernels (Simple Product and Random Walk) on simulated and real life data sets are presented. The numerical experiments compare the training times and the classification error between the SVM obtained with our smart sampling approach, and the SVM obtained over the complete data set or over a random sub-sample. The results offer evidence of the advantages of our proposal for solving large scale graph classification problems when using SVM.

Electromagnetic (EM) brakes are widely applied in many automation and control fields. Assembly quality defects in EM brakes can significantly reduce braking performance and pose potential safety risks. The primary challenge in assembly quality control is the ability to predict product quality and prevent potential failures. In view of the lack of quality information interaction and real-time feedback in the traditional quality prediction process, an intelligent predictive quality control model for the assembly process of EM brakes is proposed in this paper. First, we introduce an assembly quality control model based on digital twin (DT) technology. Second, a data-driven quality prediction algorithm is developed using least-squares support vector regression (LSSVR) and improved particle swarm optimisation (IPSO). To reduce the complexity of the prediction process, grey relational analysis (GRA) is used to analyse and extract key quality characteristics data. EM friction brakes are employed as an example to analyse the product assembly process, and the results provide valuable insights into the implementation of DT technology. Finally, the feasibility of the developed prediction model is verified with real assembly datasets. The results demonstrate the effectiveness and precision of the DT model and the GRA-IPSO-LSSVR method in predicting assembly quality.

Control systems of robotic prostheses should be designed to decode the users’ intent to start, stop, or change locomotion; and to select the suitable control strategy, accordingly. This paper describes a locomotion mode recognition algorithm based on adaptive Dynamic Movement Primitive models used as locomotion templates. The models take foot-ground contact information and thigh roll angle, measured by an inertial measurement unit, for generating continuous model variables to extract features for a set of Support Vector Machines. The proposed algorithm was tested offline on data acquired from 10 intact subjects and 1 subject with transtibial amputation, in ground-level walking and stair ascending/descending activities. Following subject-specific training, results on intact subjects showed that the algorithm can classify initiatory and steady-state steps with up to 100.00% median accuracy medially at 28.45% and 27.40% of the swing phase, respectively. While the transitory steps were classified with up to 87.30% median accuracy medially at 90.54% of the swing phase. Results with data of the transtibial amputee showed that the algorithm classified initiatory, steady-state, and transitory steps with up to 92.59%, 100%, and 93.10% median accuracies medially at 19.48%, 51.47%, and 93.33% of the swing phase, respectively. The results support the feasibility of this approach in robotic prosthesis control.

Devices capable of tracking the user’s gaze have become significantly more affordable over the past few years, thus broadening their application, including in-home and office computers and various customer service equipment. Although such devices have comparatively low operating frequencies and limited resolution, they are sufficient to supplement or replace classic input interfaces, such as the keyboard and mouse. The biometric application we researched verifies a user’s identity based on parameters acquired with a low-cost eye tracker. The use of the eye-tracking device in bank booths has many advantages, including the fact that eye trackers are contactless devices, which, especially in the light of the Covid pandemic, has increasing importance, in addition to providing a solution for confirming the liveness of the user. This paper describes an experiment in which 20 features extracted from eye movement data related mainly to saccades and fixations are used as a complementary biometric modality to authenticate clients at banking kiosks. Data were collected from 39 subjects while operating a banking system using engineered biometric kiosk prototypes. Authentication performance employing eye-movement tracking and parameterizing was compared for two classifiers: Support Vector Machine (SVM) and eXtreme Gradient Boosting (XGBoost). The results showed that the XGBoost-based classifier outperformed the SVM-based one regarding equal error rates (6.76% to 8% vs. 16.21 to 18.78%). Similar differences were obtained for true acceptance rates at different false acceptance rates (0.1 and 0.01), where the SVM-based classifier achieved a maximum of 81.08% and the XGBoost-based achieved 98.65%. Finally, prospects for the broader application of eye movement tracking as a biometric modality are discussed.

Smart contracts based on blockchain are widely used in finance, management, Internet of Things, healthcare, and other fields. However, with the rapid development of smart contracts, the corresponding security vulnerability attack cases occur frequently. Existing Ethereum smart contract vulnerability detection tools based on static analysis techniques rely too much on expert rules, for this reason, this paper proposes an Ethereum smart contract vulnerability detection method SCSVM based on support vector machine technology. A representation of smart contracts is constructed based on the word-to-vector technique, the features of Ethereum smart contracts are extracted based on the support vector machine technique, and these features are combined to identify vulnerabilities. Experiments on Smartbugs and Smartbugs-wild show that SCSVM is significantly effective. It achieves a detection accuracy of 87.51%, outperforming five typical static analysis vulnerability detection tools in terms of F1-score. To alleviate the problems of deep learning methods over-relying on large-scale data to train models and collecting a large number of smart contract attack samples in a short period, this paper proposes a basic learner-meta-learner framework, SCLMF. solc-based acquisition of the bytecode of Ethereum smart contract Solidity, on which smart contract representations are constructed via Python and the use of SCLMF for vulnerability detection. The experiments on WScrawlD show that SCLMF has a certain detection effect. Also, to further verify the effectiveness of SCLMF, experiments were conducted on Omniglot, and the detection accuracy was 96.7% and 98.5% under 5-way 1-shot and 5-way 5-shot conditions, respectively, which exceeded Memory-Augmented Neural Networks and CONVOLUTIONAL SIAMESE NETS. In summary, the experiments proved the effectiveness of SCSVM and SCLMF in Ethereum smart contract vulnerability detection.

The importance of care robots is growing owing to the increasing numbers of the elderly and the shortage of caregivers. For robots to automatically assist the movements of the elderly users, the state of their pose should be estimated. Hence, we proposed a method for estimating the user’s state using candidate positions of the center of gravity of the robot user using a few sensors. In this method, sensor outputs in all states and movements of the user are collected in advance, and a state estimation and abnormality detection model created by machine learning using the relationship between the outputs and state is used as training data. However, it is difficult to collect training data pertaining to elderly people, before use, for this purpose. Therefore, a database of human actions is created for use as the training data. Rich databases of such actions performed sans robots already exist, but not where care robots are used. Conventional methods for simulating human body movements to estimate human states require actual data and expert coordination and do not address detailed state estimation for physical support. Therefore, this study proposed a method for generating training data using a human link model, which enables the creation of a model that can estimate the state of a robot user without requiring the elderly user to stand up and perform other robot-assisted actions before use. Training data is generated using a link model and candidate centers of gravity, a simple method by which the state of the care robot user can be estimated, and physical support for standing, walking, and sitting can be provided. The effectiveness of the state estimation using the link model generated training data is verified off-line using sensor data independently obtained from the actual movements of the robot and user and also through experiments using an actual care robot. The results validated the state estimation since the time error was sufficiently short (0.35–1.85s), and the experiment confirmed that the robot could realize assistive actions with 90% accuracy.

In this paper, we study the classification problem by estimating the conditional probability function of the given data. Different from the traditional expected risk estimation theory on empirical data, we calculate the probability via Fredholm equation, this leads to estimate the distribution of the data. Based on the Fredholm equation, a new expected risk estimation theory by estimating the cumulative distribution function is presented. The main characteristic of the new expected risk estimation is to measure the risk on the distribution of the input space. The corresponding empirical risk estimation is also presented, and an $\varepsilon $ -insensitive $L_{1}$ cumulative support vector machines ( $\varepsilon -L_{1}$ VSVM) is proposed by introducing an insensitive loss. It is worth mentioning that the classification model and the classification evaluation indicator based on the new mechanism are different from the traditional one. Experimental results show the effectiveness of the proposed $\varepsilon -L_{1}$ VSVM and the corresponding cumulative distribution function indicator on validity and interpretability of small data classification.

A substantial body of evidence on traffic accidents indicates that distracted driving is a major cause of accidents. To investigate the relationship between driver performance in both normal and distracted states and to discriminate which state a driver is in based on driving performance, a simulator was used to simulate drivers driving in an urban road environment, and a distraction task was designed to motivate drivers to enter a cognitive distraction state. Data were collected from 80 drivers in each of the two driving states, and a database was built. Deep neural network (DNN) is a multilayer perceptron structure, relative to the defects of other classical algorithms with unclear classification thresholds. DNN can be utilized to process high-dimensional data through its neural node node-linked structure. Combining the Gray Wolf algorithm (GWO) for the initial weights and thresholds of the DNN network as a whole, a four-layer network structure is built to predict the test samples, while support vector machines (SVM) and random forest as controls. The results show that the accuracy of DNN for predicting test samples is 95.13%, that of SVM is 77.56%, and that of random forest is 72.32%. F1 score of the DNN model is higher than that of SVM, and the detection effect is better and can be applied to detect the driving status of drivers.

Internet traffic classification aims to identify the kind of Internet traffic. With the rise of traffic encryption and multi-layer data encapsulation, some classic classification methods have lost their strength. In an attempt to increase classification performance, Machine Learning (ML) strategies have gained the scientific community interest and have shown themselves promising in the future of traffic classification, mainly in the recognition of encrypted traffic. However, some of these methods have a high computational resource consumption, which make them unfeasible for classification of large traffic flows or in real-time. Methods using statistical analysis have been used to classify real-time traffic or large traffic flows, where the main objective is to find statistical differences among flows or find a pattern in traffic characteristics through statistical properties that allow traffic classification. The purpose of this work is to address statistical methods to classify Internet traffic that were little or unexplored in the literature. This work is not generally focused on discussing statistical methodology. It focuses on discussing statistical tools applied to Internet traffic classification Thus, we provide an overview on statistical distances and divergences previously used or with potential to be used in the classification of Internet traffic. Then, we review previous works about Internet traffic classification using statistical methods, namely Euclidean, Bhattacharyya, and Hellinger distances, Jensen-Shannon and Kullback–Leibler (KL) divergences, Support Vector Machines (SVM), Correlation Information (Pearson Correlation), Kolmogorov-Smirnov and Chi-Square tests, and Entropy. We also discuss some open issues and future research directions on Internet traffic classification using statistical methods.

Knee osteoarthritis (Knee OA) is a degenerative disease that often perplexes the elderly and the whole society, and its timely recognition receives interest worldwide. However, traditional imaging examinations cannot reflect dynamic function nor implement long-term monitoring. To address this issue, this article suggests a piezoresistive-based gait monitoring method to recognize patients with Knee OA by assessing the plantar pressure signals during the subjects’ walking, which is mobile, wearable, low-cost, and convenient. Eighteen subjects diagnosed with Knee OA and twenty-two control subjects participated in the experiment. Considering the asymmetric pressure distribution in feet and the landing habits of Knee OA patients, the plantar surface was split into eight areas, calculating the contact time and maximum force of each area in a gait cycle. Using these characteristics to train, the support vector machine (SVM) reached an accuracy of 93.15%, a precision of 92.39%, and a recall of 92.79%. Furthermore, a prediction model was proposed for the application that aggregates all the results in one test and gives a more accurate result, and the classification accuracy for individuals in the ensemble model is 90.90%. Our technique fills the vacancy of the recognition of patients with Knee OA based on wearable instruments. It provides ideas for intelligent healthcare, which benefits potential Knee OA patients’ early diagnosis and treatment.

The data in modern educational information systems are not given enough attention and are not fully utilized. Therefore, the motivations of our study are to preliminarily explore learning behavior patterns by applying process mining to educational datasets, and construct prediction models based on previous learning behavior. The data in modern educational information systems can be used by teaching managers to analyze various aspects of the educational process from different perspectives. The study chooses three datasets randomly which include student number, courses and grades attributes from a university’s educational information systems. This paper firstly applies system clustering to give an overview of students’ academic performance, and roughly determines clustering number. In order to ensure the accuracy which is relevant to the analysis of students’ learning behavior patterns, a semi-biased statistic is proposed to quantitatively determine clustering number. Then, the data are clustered by fast clustering algorithm, and the clustering effect is cross-validated which is aimed at accurately analyzing the behavior patterns of student groups and using data visualization technology to visualize different student groups. Finally, the support vector machine is used to construct a classifier for predicting the learning behavior pattern, and the parameters in the support vector machine are optimized by Bayesian optimization, genetic algorithm optimization and whale optimization algorithm respectively. The research revealed that 1) in the equal test of the group mean, when the significance of most courses is less than 0.05, it means that there is a significant difference among different categories. In this case, using the semi-biased statistic proposed in the paper is helpful to improve clustering effect. 2) The better the students learn, the better the clustering effect of the category which they belong to is. 3) Whale optimization algorithm performs the best.

Oil reheating has a significant impact on global health due to its extensive consumption, especially in South Asia, and severe health risks. Nevertheless, food image analysis using multispectral imaging systems(MISs) has not been applied to oil reheating analysis despite their vast application in rapid food quality screening. To that end, the paper discusses the application of a low-cost MSI to estimate the ‘reheat cycle count classes’ (number of times an oil sample is recursively heated) and identify ‘critical classes’ at which substantial changes in the oil sample have materialized. Firstly, the reheat cycle count class is estimated with Bhattacharyya distance between the reheated and a pure oil sample as the input. The classification was performed using a support vector machine classifier that resulted in an accuracy of 83.34% for reheat cycle count identification. Subsequently, an unsupervised clustering procedure was introduced using a modified spectral clustering (SC) algorithm to distinguish critical classes under reheating. In addition, laboratory experiments were performed to ascertain the ramifications of the reheating process with a chemical analysis. The chemical analysis of the coconut oil samples used in the experiment coincided with the image analysis results and was statistically significant ( $p < 0.05$ ). Accordingly, the proposed work closes the gap for using multispectral imaging for oil reheating and proposes a novel algorithm for unsupervised detection of critical property changes in the oil. Hence, the proposed research work is significant in its practical implications, contribution to food image analysis, and unsupervised classification mechanisms.

While deep convolutional neural networks (DCNNs) have demonstrated superiority in their ability to classify image data, one of the primary downsides of DCNNs is that their training normally requires large sets of labeled “ground truth” images. For that reason, DCNNs do not provide an effective solution in many real-world problems in which large sets of labeled images are not available. Here we propose to use the quick learning of SVMs to provide a solution for learning from small image datasets in a non-parametric manner. Experimental results show that while “conventional” DCNN architectures such as ResNet-50 outperform SVMnet when the size of the training set is large, SVMnet provides a much higher accuracy when the number of “ground truth” training samples is small.

This paper investigates the asymptotic behavior of the soft-margin and hard-margin support vector machine (SVM) classifiers for simultaneously high-dimensional and numerous data (large $n$ and large $p$ with $n/p\to \delta$) drawn from a Gaussian mixture distribution. Sharp predictions of the classification error rate of the hard-margin and soft-margin SVM are provided, as well as asymptotic limits of as such important parameters as the margin and the bias. As a further outcome, the analysis allows for the identification of the maximum number of training samples that the hard-margin SVM is able to separate. The precise nature of our results allows for an accurate performance comparison of the hard-margin and soft-margin SVM as well as a better understanding of the involved parameters (such as the number of measurements and the margin parameter) on the classification performance. Our analysis, confirmed by a set of numerical experiments, builds upon the convex Gaussian min-max Theorem, and extends its scope to new problems never studied before by this framework.

In image classification, traditional kernels or feature mapping functions of Support Vector Machine(SVM) use discriminative features without considering the true nature of the data. Our work in this paper is motivated by the need to consider intrinsic distribution of L1 normalized histograms and develop a flexible feature mapping technique by combining histogram based features and distribution based density features. The proposed mapping technique contains prior knowledge about the the data which provides a flexible representation and thus increases the discriminative power of the classifier. Such flexibility is achieved due to the explanatory capabilities of Dirichlet, generalized Dirichlet and Beta-Liouville distributions to model proportional data. In addition to that, we present a general framework to estimate the parameters of these distributions by taking maximum likelihood (MLE) approach. Experimental results show that the proposed technique increases the effectiveness of SVM kernels for different computer vision tasks such as natural scene recognition, satellite image classification and human action recognition in videos.

Sentiment analysis is an emerging research field that can be integrated with other domains, including data mining, natural language processing and machine learning. In political articles, it is difficult to understand and summarise the state or overall views due to the diversity and size of social media information. A number of studies were conducted in the area of sentiment analysis, especially using English texts, while Arabic language received less attention in the literature. In this study, we propose a detection model for political orientation articles in the Arabic language. We introduce the key assumptions of the model, present and discuss the obtained results, and highlight the issues that still need to be explored to further our understanding of subjective sentences. The main purpose of applying this new approach based on Rough Set (RS) theory is to increase the accuracy of the models in recognizing the orientation of the articles. We present extensive simulation results, which demonstrate the superiority of the proposed model over other algorithms. It is shown that the performance of the proposed approach significantly improves by adding discriminating features. To summarize, the proposed approach demonstrates an accuracy of 85.483%, when evaluating the orientation of political Arabic datasets, compared to 72.58% and 64.516% for the Support Vector Machines and Naïve Bayes methods, respectively.

In recent years, Ransomware has been a critical threat that attacks smartphones. Ransomware is a kind of malware that blocks the mobile’s system and prevents the user of the infected device from accessing their data until a ransom is paid. Worldwide, Ransomware attacks have led to serious losses for individuals and stakeholders. However, the dramatic increase of Ransomware families makes to the process of identifying them more challenging due to their continuously evolved characteristics. Traditional malware detection methods (e.g., statistical-based prevention methods) fail to combat the evolving Ransomware since they result in a high percentage of false positives. Indeed, developing a non-classical, intelligent technique to safeguarding against Ransomware is of significant importance. This paper introduces a new methodology for the detection of Ransomware that is depending on an evolutionary-based machine learning approach. The binary particle swarm optimization algorithm is utilized for tuning the hyperparameters of the classification algorithm, as well as performing feature selection. The support vector machines (SVM) algorithm is used alongside the synthetic minority oversampling technique (SMOTE) for classification. The utilized dataset is collected from various sources, which consists of 10,153 Android applications, where 500 of them are Ransomware. The performance of the proposed approach SMOTE- $t$ BPSO-SVM achieved merits over traditional machine learning algorithms by having the highest scores in terms of sensitivity, specificity, and g-mean.

These days, the classification between normal and cancerous tissues and between different types of cancers represents a very important issue. Selecting the little informative number of genes is considered the main challenge in the cancer diagnosis issue. Therefore, Gene selection is usually the preliminary step for solving the cancer classification problems. Bio-inspired metaheuristic optimization algorithms, when used to solve gene selection and classification problems, they demonstrate their effectiveness. Barnacles Mating Optimizer (BMO) algorithm, which imitates the behavior of mating barnacles in nature for solving optimization problems, is considered one of these algorithms. In this paper, Barnacles Mating Optimizer (BMO) algorithm augmented with Support Vector Machines (SVM) called BMO-SVM is proposed for a microarray gene expression profiling in order to select the most predictive and informative genes for cancer classification. Conducting a comparative experimental study among a set of the most common bio-inspired optimization techniques to specify the most effective. A binary microarray dataset (i.e., leukemia1) and a multi-class microarray dataset (i.e., SRBCT, lymphoma, and leukemia2) are used for testing the performance of the proposed model. The experimental results revealed the superiority of the proposed BMO-SVM approach against several well-known meta-heuristic optimization algorithms, such as the Tunicate Swarm Algorithm (TSA), Genetic Algorithm (GA), Particle Swarm Optimization (PSO), and Artificial Bee Colony (ABC). It is worth mentioning that our proposed algorithm achieves a high informational superiority percentage compared to other algorithms.

Automatic signal recognition (ASR) plays an important role in various applications such as dynamic spectrum access and cognitive radio, hence it will be a key enabler for beyond 5G communications. Recently, many research works have been exploring deep learning (DL) based ASR, where it has been shown that simple convolutional neural networks (CNN) can outperform expert features based techniques. However, such works have been primarily focusing on single-carrier signals. With the advent of spectrally efficient filtered multicarrier waveforms, we propose in this paper, to revisit the DL based ASR to account for the variety and complexity of these new transmission schemes. Specifically, we design two types of classification algorithms. The first one relies on the cyclostationarity characteristics of the investigated waveforms combined with a support vector machine (SVM) classifier; while the second one explores the use of a four-layer CNN which performs both features extraction and classification. The proposed approaches do not require any a priori knowledge of the received signal parameters, and their performance is evaluated in a multipath channel through simulations for a signal-to-noise ratio (SNR) ranging from −8 to 20 dB. The simulation results show that, despite cyclostationary characteristics being highly discriminative, the CNN outperforms the cyclostationary based classification especially for short time received signals, and low SNR levels.

The feature of leaky cable fixture extracted by Local Binary Pattern (LBP) and its variants in high-speed railway tunnel has the defects of lacking description and high dimension. This paper proposes a new operator named Multi-scale Continuous Gradient Local Binary Pattern (MCG-LBP), which can realize the scale transformation of feature maps and ensure the low dimensionality of descriptors. For MCG-LBP, firstly a bi-directional triplet around the central pixel is presented to indicate the specific direction of gradient in circle neighborhood. Then, an effective dimensionality reduction strategy is introduced to perform successive down-sampling iterations. Finally, the multi-scale joint descriptors are encoded by continuous gradient sequences from different down-sampling maps, and Support Vector Machines is used to classify faulty cable fixtures. The proposed MCG-LBP can elicit a discriminative description through complementary gradient information generated by the combination of different single-scale features. While the low dimensionality of descriptor and no complex parameter to deal with both make it has higher computational efficiency. Experimental results show that the Recall and Precision of MCG-LBP reach 92.6% and 83.5% respectively on cable fixture data set, which is superior to the state-of-the-art methods.

Objective: Autonomic Dysreflexia (AD) is a potentially life-threatening syndrome which occurs in individuals with higher level spinal cord injuries (SCI). AD is caused by triggers which can lead to rapid escalation of pathophysiological responses and if the trigger is not removed, AD can be fatal. There is currently no objective, non-invasive and accurate monitoring system available to automatically detect the onset of AD symptoms in real time in a non-clinical setting. Technology or Method: We developed a user-independent method of symptomatic AD detection in real time with a wearable physiological telemetry system (PTS) and a machine learning model using data from eleven participants with SCI. Results: The PTS could detect onset of AD symptoms with an average accuracy of 94.10% and a false negative rate of 4.89%. Conclusions: The PTS can detect the onset of the symptoms AD with high sensitivity and specificity to assist people with SCIs in preventing the occurrence of AD. It would enable persons with high level SCIs to be more independent and pursue vocational activities while granting continuous medical oversight. Clinical Impact: The PTS could serve as a supplementary tool to current solutions to detect the onset of AD and prepare individuals who are newly injured to be better prepared for AD episodes. Moreover, it could be translated into a system to encourage individuals to practice better healthcare management to prevent future occurrences.

The strong airflow generated during the operation of the high-speed train will carry sand and dust, causing high-speed sand and dust to hit the surface of the external equipment of the vehicle body, which will increase the surface roughness of the roof insulators, resulting in the changes of the hydrophobicity, fouling characteristics and insulation performance of the insulator. It poses a hidden danger to the safe and stable operation of the train. In our existing surface roughness testing methods, contact detections and optical stylus methods can cause damage to the insulator surface. Infrared detection methods will be disturbed by leakage current. Most methods need to be disassembled for testing. These methods have certain disadvantages. Therefore, this paper proposes a non-contact detection method for the surface roughness of the roof insulators. Firstly, we extract the image information of the insulator surface by hyperspectral imager, then preprocess the extracted hyperspectral image and use the continuous projection algorithm to reduce the data. Finally, we use the support vector machine to construct the insulator surface roughness discriminant model, and successfully realize the hyperspectral detection method of the surface roughness of the roof insulators, and verify the effectiveness of the proposed method by experiments. As a non-contact detection method, this method can detect the surface roughness of the roof insulators in the non-disassembly conditions, and help the field staffs to grasp the surface roughness of the high-speed train roof insulators in time.

Human-vehicle classification plays an important role in advanced driver assistance systems (ADAS). The use of millimeter wave (mmWave) radar sensor in human-vehicle classification algorithms is of great significance since the sensor maintains to be robust in severe weather (e.g. fog, snow, etc.). To improve classification accuracy under complex scenes of autonomous driving, a new mmWave radar point cloud classification algorithm is proposed in this paper, which realizes human-vehicle classification employing a newly proposed point cloud feature vector with eleven dimensions and based on kernel support vector machine (SVM) classifier. To verify the validity and robustness of the proposed feature vector, a 77 GHz radar is used to collect two datasets for static and moving objects, respectively, with each dataset taken for pedestrians and vehicles at different distances and angles. Experimental results show that the proposed algorithm achieves higher classification accuracy than a conventional one based on signal features. For the comparison based on the same number of dimensions, the number of dimensions of the proposed feature vector is decreased by removing the features with low significance. Experimental results verify that the proposed algorithm maintains advantage over the conventional one.

Rice adulteration is a severe problem in agro-products and food regulatory agencies, suppliers, and consumers. In this study, to effectively distinguish whether high-quality rice is mixed with low-quality rice, detection and analysis of adulterated rice in five levels with different mixing proportions was conducted via terahertz spectroscopy and pattern recognition algorithms. Initially, samples were prepared and spectral data were acquired by using the terahertz transmission mode, and a principal component analysis (PCA) algorithm was applied to extract features from original spectrum information and reduce data dimensions. Subsequently, partial least squares-discriminant analysis (PLS-DA), support vector machine (SVM), and a back propagation neural network (BPNN) combined with the absorption spectra after different pretreatments, including standard normal variate (SNV) transformation, baseline correction (BC), and first derivative (1st derivative), were applied to establish the classification models. Results indicate that an SVM model employing the absorption spectra with a 1st derivative pretreatment exhibits the best discrimination ability, with an accuracy up to 97.33% in the prediction set. This result proves that terahertz spectroscopy combined with chemometric methods can be an effective tool to identify rice adulteration levels.

Biomedical classification problems are of great interest to both medical practitioners and computer scientists. Due to the harmful consequences of a wrong decision in this ambit, computational methods must be carefully designed to provide a reliable tool for helping physicians to obtain accurate predictions on unseen cases. Computational Intelligence (CI) provides robust models to perform optimization, classification and regression tasks. These models have been previously designed, mainly based on the expertise of computer scientists, to solve a vast number of biomedical problems. As the number of both CI algorithms and biomedical problems continues to grow, selecting the right method to solve a given problem becomes more challenging. To deal with this complexity, a systematic methodology for selecting a suitable model for a given classification problem is required. In this work, we review the more promising classification and optimization algorithms and reformulate them into a synergic framework to automatically design and optimize pattern classifiers. Our proposal, including state-of-the-art evolutionary algorithms and support vector machines, is tested on a variety of biomedical problems. Experimental results on benchmark datasets allow us to conclude that the automatically designed classifiers reach higher or equal performance than those designed by computer specialists.

Developmental dysphasia, also known as specific language impairment (SLI), is a language disorder in children that involves difficulty in speaking and understanding spoken words. Detecting SLI at an early stage is very important for successful speech therapy in children. In this paper, we propose a novel approach based on glottal source features for detecting children with SLI using the speech signal. The proposed method utilizes time- and frequency-domain glottal parameters, which are extracted from the voice source signal obtained using glottal inverse filtering (GIF). In addition, Mel-frequency cepstral coefficient (MFCC) and openSMILE based acoustic features are also extracted from speech utterances. Two machine learning algorithms, namely, support vector machine (SVM) and feed-forward neural network (FFNN), are trained separately for the MFCC, openSMILE and glottal features. A leave-fourteen-speakers-out cross-validation strategy is used for evaluating the classifiers. The experiments are conducted using the SLI speech corpus launched by the LANNA research group. Experimental results show that the glottal parameters contain significant discriminative information required for identifying children with SLI. Furthermore, the complementary nature of glottal parameters is investigated by independently combining these features with the MFCC and openSMILE acoustic features. The overall results indicate that the glottal features when used in combination with MFCC feature set provides the best performance with the FFNN classifier in the speaker-independent scenario.

Ordinal classification (OC) is an important niche of supervised pattern recognition, in which the classes constitute an ordinal structure. In general, the ordinal structure can be identified, either according to the natural occurrence of the current task (e.g. healthy - mild condition - moderate condition - severe condition), or by extracting expert knowledge. However, we assume that many multi-class classification tasks might have a hidden ordinal structure, which, once identified, can facilitate and hence leverage the classification process. Therefore, we propose a working definition for OC tasks, which is based on the decision boundaries of standard binary Support Vector Machines. Moreover, resulting from our proposed definition, we introduce a simple algorithm for the detection of ordinal structures. Our proposed definition is easy to interpret and reflects an intuitive understanding of ordinal structures. Another main advantage is that our proposed definition is easy to apply. Therefore, there is no more dependence on expert knowledge for the identification of (non-intuitive) ordinal class structures. In the current study, we include ten benchmark data sets from the field of OC to experimentally evaluate and hence to confirm the validity of our proposed definition. Additionally, we analyse our proposed definition based on a small set of traditionally non-ordinal multi-class classification tasks. Furthermore, we provide an analysis of the computational cost of our proposed detection algorithm, and discuss the limitations of our proposed working definition.

Automatic methods for the detection of pathological voice from healthy speech can be considered as potential clinical tools for medical treatment. This study investigates the effectiveness of glottal source information in the detection of pathological voice by comparing the classical pipeline approach to the end-to-end approach. The traditional pipeline approach consists of a feature extractor and a separate classifier. In the former, two sets of glottal features (computed using the quasi-closed phase glottal inverse filtering method) are used together with the widely used openSMILE features. Using both the glottal and openSMILE features extracted from voice utterances and the corresponding healthy/pathology labels, support vector machine (SVM) classifiers are trained. In building end-to-end systems, both raw speech signals and raw glottal flow waveforms are used to train two deep learning architectures: (1) a combination of convolutional neural network (CNN) and multilayer perceptron (MLP), and (2) a combination of CNN and long short-term memory (LSTM) network. Experiments were carried out using three publicly available databases, including dysarthric (the UA-Speech database and the TORGO database) and dysphonic voices (the UPM database). The performance analysis of the detection system based on the traditional pipeline approach showed best results when the glottal features were combined with the baseline openSMILE features. The results of the end-to-end approach indicated higher accuracies (about 2-3 % improvement in all three databases) when glottal flow was used as the raw time-domain input (87.93 % for UA-Speech, 81.12 % for TORGO and 76.66 % for UPM) compared to using raw speech waveform (85.12 % for UA-Speech, 78.83 % for TORGO and 73.71 % for UPM). The evaluation of both approaches demonstrate that automatic detection of pathological voice from healthy speech benefits from using glottal source information.

Load forecasting is a pivotal part of the power utility companies. To provide load-shedding free and uninterrupted power to the consumer, decision-makers in the utility sector must forecast the future demand for electricity with a minimum error percentage. Load prediction with less percentage of error can save millions of dollars to the utility companies. There are numerous Machine Learning (ML) techniques to amicably forecast electricity demand, among which the hybrid models show the best result. Two or more than two predictive models are amalgamated to design a hybrid model, each of which provides improved performances by the merit of individual algorithms. This paper reviews the current state-of-the-art of electric load forecasting technologies and presents recent works pertaining to the combination of different ML algorithms into two or more methods for the construction of hybrid models. A comprehensive study of each single and multiple load forecasting model is performed with an in-depth analysis of their advantages, disadvantages, and functions. A comparison between their performance in terms of Mean Absolute Error (MAE), Root Mean Squared Error (RMSE), and Mean Absolute Percentage Error (MAPE) values are developed with pertinent literature of several models to aid the researchers with the selection of suitable models for load prediction.

The accurate and fast diagnosis of transformer winding deformation faults is of significance to power suppliers and utilities. An improved winding mechanical deformation fault classification method is proposed. In this study, the transformer frequency response data is used to draw polar plots, and then its texture features are extracted for fault classification. The classification model constructed by multiple support vector machines is successfully obtained and shows good classification effect. Besides, this article uses an improved genetic algorithm based on the Emperor-Selective mating scheme and catastrophic operation, to optimize the parameters of support vector machine. The feasibility and accuracy of the proposed method are verified with experimental data obtained from a model transformer, and the proposed method is demonstrated to exhibit better performance compared with the traditional method.

The energy transition and electrification across many industries place increasingly more weight on the reliability of power electronics. A significant fraction of breakdowns in electronic devices result from capacitor failures. Multilayer ceramic capacitors, the most common capacitor type, are especially prone to mechanical damage, for instance, during the assembly of a printed circuit board. Such damage may dramatically shorten the life span of the component, eventually resulting in failure of the entire electronic device. Unfortunately, current electrical production line testing methods are often unable to reveal these types of damage. While recent studies have shown that acoustic measurements can provide information about the structural condition of a capacitor, reliable detection of damage from acoustic signals remains difficult. Although supervised machine learning classifiers have been proposed as a solution, they require a large training data set containing manually inspected damaged and intact capacitor samples. In this work, acoustic identification of damaged capacitors is demonstrated without a manually labeled data set. Accurate and robust classification is achieved by using a one-class support vector machine, a machine learning model trained solely on intact capacitors. Furthermore, a new algorithm for optimizing the classification performance of the model is presented. By the proposed approach, acoustic testing can be generalized to various capacitor sizes, making it a potential tool for production line testing.

Imbalanced classes are a common problem in machine learning, and the computational costs required for proper resampling increases with the data size. In this study, a simple and effective undersampling method, named particle stacking undersampling (PSU) was proposed. Compared with other competing undersampling methods, PSU can significantly reduce the computational costs, while minimizing information loss to prevent a prediction bias. The performance benchmark applied on 55 binary classification problems indicated that the proposed method not only achieved an enhanced classification performance over other well-known undersampling methods (random undersampling, NearMiss-1, NearMiss-2, cluster centroid, edited nearest neighbor, condensed nearest neighbor, and Tomek Links) but also provided a computational simplicity that can be scalable to large data. Moreover, an experiment verified that two propositions forming the basis of the PSU algorithm can also be applied to other undersampling methods to achieve methodological improvements.

Network traffic in cloud computing is characterized by a large volume of data, with potential high dimensionality and high levels of redundancy. “Big data” not only retard the execution process of intrusion detection systems (IDS) but they can also lead to unsatisfactory classification accuracy. The efficient correlation-based feature selection (ECOFS) approach proposed in this paper, can handle linearly and nonlinearly dependent data and it can eliminate redundant and irrelevant features. Its effectiveness has been evaluated through its employment in an intrusion detection system. A Libsvm-IDS has been built to operate using the features selected by the proposed ECOFS algorithm. The performance of the hybrid Libsvm-IDS + ECOFS approach has been evaluated using two well-known intrusion detection evaluation datasets, namely the KDD Cup 99 and the NSL-KDD. The evaluation results show that our ECOFS algorithm selects the smallest number of features, resulting in the lowest computational cost for the Libsvm-IDS, without any performance compromise. In fact, our algorithm has achieved higher accuracy compared with two well established methods.

Internet of Things (IoT) technology provides a large-scale network for information exchange and communication with big data. Because of the openness of IoT devices in the process of signal transmission, the recognition and access of different IoT devices are directly related to the wide application of its system. The radio frequency fingerprinting (RFF) is a unique characteristic closely related to the hardware of IoT devices themselves, which is difficultly tampered. In this paper, four kinds of RF fingerprint feature extraction algorithms based on statistical features are studied. Robust principle component analysis (RPCA) is used for the dimensionality reduction and the support vector machines (SVM) is used for classification. Through theoretical modeling and experimental verification, the reliability and distinguishability of RFFs are extracted and evaluated, and the classification results are displayed in the real IoT equipment environment.

Loan status prediction is an effective tool for investment decisions in peer-to-peer (P2P) lending market. In P2P lending market, most borrowers fulfill the repayment plan; however, some of them fail to pay back their loans. Therefore, an imbalanced classification method can be utilized to discriminate such default borrowers. In this context, the aim of this paper is to propose an investment decision model in P2P lending market which consists of fully paid loans classified via the instance-based entropy fuzzy support vector machine (IEFSVM). IEFSVM is a modified version of the existing entropy fuzzy support vector machine (EFSVM) in terms of an instance-based scheme. IEFSVM can reflect the pattern of nearest neighbors entropy with respect to the change of its size instead of fixing it in unified neighborhood size. Therefore, IEFSVM allows the class change of nearest neighbors in the determination of fuzzy membership. Applying the model to the lending club dataset, we determine loans that are predicted to be fully paid. Then, we also provide a multiple regression model to generate an investment portfolio based on non-default loans that are predicted to yield high returns. Throughout the experiment, the empirical results reveal that IEFSVM outperforms not only EFSVM but also the six other state-of-the-art classifiers including the cost-sensitive adaptive boosting, cost-sensitive random forest, EasyEnsemble, random undersampling boosting, weighted extreme learning machine, and cost-sensitive extreme gradient boosting in terms of loan status classification. Also, the investment performance of the multiple regression model using IEFSVM is higher and more robust than that of two other benchmarks. In this regard, we conclude that the proposed investment model is a decent and practical approach to support decisions in the P2P lending market.

Generalized eigenvalue proximal support vector machine (GEPSVM) and its improvement IGEPSVM are excellent nonparallel classification methods due to their excellent generalization. However, all of them adopt the square L2-norm metric to implement their empirical risk or penalty, which is sensitive to noise and outliers. Moreover, in many real-world learning tasks, it is a significant challenge for GEPSVMs when the data appears highly correlated. To alleviate the above issues, in this paper, we propose a novel trace lasso regularized robust nonparallel proximal support vector machine (RNPSVM) for noisy classification. Compared with GEPSVMs, our RNPSVM enjoys the following advantages. First, the empirical risk of RNPSVM is implemented by the robust L1-norm metric with a maximum margin criterion. Namely, it aims to maximize the L1-norm inter-class distance dispersion while minimizing the L1-norm intra-class distance dispersion simultaneously. Second, to capture the sparsity and the underlying correlation of data, a trace lasso (adaptive norm-based training data) is further introduced to regularize RNPSVM. Third, an iterative algorithm is designed to solve the maximization optimization problem of RNPSVM, whose convergence is guaranteed theoretically. The extensive experimental results on both synthetic and real-world noisy datasets demonstrate the effectiveness of RNPSVM.

The classification of fresh fruits according to their visual ripeness is typically a subjective and tedious task; consequently, there is a growing interest in the use of non-contact techniques to automate this process. Machine learning techniques, such as artificial neural networks, support vector machines (SVMs), decision trees, and K-nearest neighbor algorithms, have been successfully applied for classification problems in the literature, particularly for images of fruit. However, the particularities of each classification problem make it difficult, if not impossible, to select a general technique that is applicable to all types of fruit. In this paper, the combinations of four machine learning techniques and three color spaces (RGB, HSV, and L*a*b*) were evaluated with regard to their ability to classify Cape gooseberry fruits. To this end, 925 Cape gooseberry fruit samples were collected, and each fruit was manually classified into one of seven different classes according to its level of ripeness. The color values of each fruit image in the three color spaces and their corresponding ripening stages were organized for training and validation following a fivefold cross-validation strategy in an iterative process repeated 100 times. According to the results, the classification of Cape gooseberry fruits by their ripeness level was sensitive to both the color space and the classification technique used. The models based on the L*a*b* color space and the SVM classifier showed the highest f-measure regardless of the color space, and the principal component analysis combination of color spaces improved the performance of the models at the expense of increased complexity.

Functional near-infrared spectroscopy (fNIRS), known as a non-invasive optical neuroimaging technique, is currently used to assess brain dynamics during the performance of complex works and everyday tasks. However, the deep learning approaches to distinguish stress levels based on the changes in hemoglobin concentrations have not yet been extensively investigated. In this paper, we evaluated the efficiencies of advanced methods differentiating the rest and task periods during Stroop task experiments. We first explored that the apparent changes of oxy-hemoglobin and deoxy-hemoglobin concentrations associated with two mental stages did exist across each participant. The preprocessing steps, such as converting raw signals into hemoglobin values and filtering to remove various noises involved in fNIRS signals, were performed to obtain the clean dataset, called non-PCA inputs. Next, we applied the principal component analysis (PCA) algorithm to get PCA-inputs before putting non-PCA inputs into our four classifiers. Then, a novel deep learning-based discrimination framework was studied. The conventional machine learning algorithms, including SVM and AdaBoost, produced the best accuracies of 64.74% ± 1.57% and 71.13% ± 2.96%, respectively. In comparison, the deep learning approaches, including deep belief network and convolutional neural network models, have enabled better classification accuracies of 84.26% ± 2.58% and 72.77% ± 1.92%, respectively.

A method combined ensemble empirical mode decomposition, Volterra model and decision acyclic graph support vector machine was proposed to improve adaptability, feature resolution, and identification accuracy when diagnosing mechanical faults in an on-load tap changer of a transformer. In detail, the ensemble empirical mode decomposition algorithm was applied to decompose the multi-channel vibration signals in the switchover process of the on-load tap changer. Then, a Volterra model for the mechanical state of the on-load tap changer was established based on time-frequency characteristics obtained through the use of the ensemble empirical mode decomposition algorithm. Moreover, a matrix of coefficient vectors was also used in the Volterra model. This method will not only reduce the aliasing effect of empirical mode decomposition but also obtain high-resolution characteristics of nonstationary vibration signals. Furthermore, taking the singular values of the Volterra coefficient matrix as the fault characteristic, the data states of the model for diagnosing the on-load tap changer were automatically classified and identified by establishing a rapid, multi-classification decision acyclic graph support vector machine model with a low misjudgment rate. Finally, based on a certain on-load tap changer, the test platform for simulating mechanical faults was built. On this basis, by using the proposed method, the vibration signals generated due to typical mechanical faults, such as loosening of moving contacts, lessening of transition contact, and motor jam were acquired and analyzed, thus validating the effectiveness of the method through case studies. Compared with other methods, the new method could overcome many defects in existing methods and it has higher fault identification accuracy.

Existing fine-grained categorization methods predominantly conquer challenges independently, while neglecting the fact that patch proposal and feature extraction can reinforce each other. This necessitates to extract the domain-specific representations and localize key (most discriminative) patches alternately, since implicit to fine-grained specialization is the existence of an entry-category visual shared among all categories. In this study, an increasingly specialized perception convolutional neural network (ISP-CNN) is proposed, focusing on a butterfly domain at sub-species level due to the biosystematics structure. Its pipeline is an coarse-to-fine specialization that hierarchically extracts fine-scale features and proposes distinctive patches at multiple scales. Specifically, the framework consists of two highlights, i.e., hierarchical learning support vector machines (HL-SVMs) and patch proposal sub-networks (PPNs). Depending on the confidences obtained in HL-SVMs, the samples are classified at appropriate subset (i.e., sub-family, genus, and sub-species). Then the PPNs zoom the images to shift the focus on the most representational patches by taking previous predictions of HL-SVMs as a reference, while a finer scale network takes as input an amplified attended region from previous scales with gradual steps. As for self-optimization, ISP-CNN is driven by a patch-level loss and a class-level loss, to mutually learn patch proposals and decisions. For effectness verification, a total of 19,368 lab-made images of butterfly specimens spanning 48 sub-species are utilized as testing samples, while 116,208 augmented images are employed for training. ISP-CNN delivers the better or comparable performance, i.e., validation accuracy achieves 93.67% and testing accuracy achieves 92.13%, which outperforms state-of-the-arts.

The identification of low order equivalent system (LOES) models from measured test data is critical to assessing system qualities and design of control law. This paper focuses on the situations with finite data records and the time-response method is employed. In such a case, although least squares (LS) algorithm is efficient for the identification of linear models, it suffers low accuracy in ill-conditioned scenarios. To address this issue, a hierarchical identification method based on the LS algorithm is designed and the optimal solution is attained while maintaining the low computational complexity and small memory requirements. In particular, an LS support vector machine (SVM)-based identification scheme is developed, where the system parameters are estimated in a reproducing kernel Hilbert space. The theoretical analysis and pertaining simulation results demonstrate the effectiveness of the proposed method.

Although radio frequency ablation is the most effective treatment for atrial fibrillation (AF), there is still a high recurrence rate. The purpose of this paper was to initially assess the probability of the recurrence of AF based on the preoperative body surface potential mapping (BSPM) signals, in other words, to predict the efficiency of ablation and assist physicians in developing more effective treatment options. At present, deep learning methods based on convolutional neural networks (CNNs) do not require complex mathematical abstractions or manual interventions; thus, higher computation efficiency can be obtained in such research. However, the use of the fully connected multi-layer perceptron (MLP) algorithms has shown low classification performance. This paper proposes an improved CNN algorithm (CNN-SVM method) for the recurrence classification in AF patients by combining with the support vector machine (SVM) architecture. The algorithm is validated on the preoperative AF signals of 14 patients for classification. All postoperative patients are followed up for one year; ten of them remain in sinus rhythm, whereas the other four turn back to AF. The ECG data for these patients are obtained through the 128-Lead BSPM system. The results show that the proposed CNN-SVM method can automatically extract the characteristic information through the CNN network. The constructed model ultimately achieved an accuracy of 96%, a sensitivity of 88%, and a specificity of 96%. It is concluded that the CNN-SVM method solves the drawbacks of MLP only for separating linear data. It improves the overall performance of AF recurrence classification, thereby providing a valuable reference for doctors to develop personalized treatment plans.

Video-based smoke detection is an effective method for fire alarm systems. Given the widespread use of high-definition cameras, a smoke detection method for high-definition video is needed. This paper proposes a smoke-detection framework for high-definition video, in which the main idea is to use the small smoke image blocks to match the image features of the motion area in the video and to use the support vector machine classifier for smoke recognition. The ViBe algorithm and other methods are used to effectively extract the areas for classification. This detection framework consists of spatial- and frequency-domain features. In the extraction of frequency domain features, we use local phase quantization (LPQ) features. In the local texture features of the spatial domain, we add the compensation of adjacent pixels and consider the gradient of the symmetrical pixels using the center-symmetric local binary pattern feature. To improve results, we also propose the trisection feature fusion scheme for features in the spatial and frequency domains. The experiments show that using the feature extraction and fusion schemes, our smoke-detection framework achieves the good performance in the detection of smoke in the video from different datasets.

Wrapper methods are a type of feature selection method that finds a subset of variables to improve the performance of a classifier by removing redundant and irrelevant variables. The use of a wrapper implies that each time a candidate solution is explored, the classifier is evaluated on the quality measures selected (e.g. accuracy or precision). Though robust, this iteration across several candidate solutions can become computationally intensive and time-consuming. In this paper we propose a wrapper, that is based on binary Covering Arrays (CAs), and binary Incremental Covering Arrays (ICAs), that have been widely used for experimental design and fault detection in software and hardware testing. The new wrapper was evaluated with six classifiers on seven data sets. The results show that the CAs and ICAs with strength 6 significantly improve the performance and reduces the number of variables required by the classifier. A comparative analysis of the proposed method against wrappers based on other search approaches such as genetic algorithms (GA) and particle swarm optimization (PSO), shows that the proposed method yields results similar to GA, but not to PSO, with differences to PSO, in accuracy, which in the majority of cases is below 0.04. This lack of accuracy, by which the new wrapper fails to match PSO, is offset by the fact that the user does not need to fine tune algorithm parameters, such as velocity ranges, timing, cognitive coefficient, and social coefficient, while it is also much easier to program in parallel.

Hydrometallurgy is a metallurgical method for processing complex ores and low-grade ores while reducing environmental pollution. The density of the thickening process in hydrometallurgical production is rather poor, and there are many interference factors, resulting in frequent failures in the density of the thickening process. The main focus of this paper is to propose a method of fault monitoring and diagnosis for the density of the thickening process in hydrometallurgy. First, through the support vector machine (SVM) algorithm, the fault detection model is established to monitor the blockage of the underflow pipeline of the thickener. Second, the fault diagnosis model is established by using the random forest algorithm, and particle swarm optimization is used to optimize the fault diagnosis model. The fault type is judged using the optimized diagnosis model, and the corresponding treatment measures are taken accordingly.

Due to the significant use of Arabic language in social media networks, the demand for Arabic sentiment analysis has increased rapidly. Although, numerous sentiment analysis techniques enable people to obtain valuable insights from the opinions shared on social media. However, these techniques are still in their infancy, and the Arabic sentiment analysis domain lacks a compressive survey. Therefore, this study focused on the various characteristics, State-of-the-Art, and the level of sentiment analysis along with the natural language processing applied in the Arabic sentiment analysis. Furthermore, this study also discussed the sentiment analysis of the modern standards and the dialects of Arabic languages along with various machine learning processes and a few popular algorithms. Moreover, this study adds values by critical analysis of two case studies, which displayed an extensive set of the various research communities in this field of sentiment analysis. Finally, open research challenges are investigated, with a focus on the shortage of lexicons; availability; use of Dialect Arabic (DA); lack of corpora and datasets; right to left reading and compound phrases and idioms.

To operate wastewater treatment plants (WWTPs) with optimized efficiency, influent conditions (ICs) as initial states of inflow fed to WWTPs were monitored to identify potential anomalies that would trigger adverse events or system crash. To employ voluminous measurements for data-driven decisions, the non-linear, non-Gaussian, non-stationary, auto-correlated, cross-correlated, hetero-skedastic, case-specific nature of multivariate environmental datasets must be considered. This research proposed kernel machine learning models, the kernel principal components analysis based one-class support vector machine (KPCA-OCSVM) with various kernels, to learn anomaly-free training set then classify the testing set. A seven-years multivariate ICs time series was introduced with exploratory analysis performed to reveal temporal behaviors and statistical properties. KPCA with polynomial kernels sufficiently output representative features, based on which OCSVM with Gaussian kernels sensitively and specifically identified anomalies in ICs that were previously omitted by WWTP operators. The proposed kernel algorithms surpassed previous linear PCA-based K-nearest-neighbors models, and improved outcomes with limited increase in computation cost. Without requiring linear, Gaussian, stationary, independent, and homo-skedastic qualities from data, the proposed flexible environmental data science approach could be transferred, rebuilt, and tuned conveniently for ICs from different WWTPs.

The Internet of Things (IoT) provides the ability to extend the Internet into devices and everyday objects, in a way that they are uniquely addressable. Sensors, actuators, as well as everyday devices and objects, such as cellphones, cars, and homes, are interconnected and form a network that can be accessed, monitored, and controlled remotely. Security is an important subject in the IoT networks since the devices and the networks can be used as a means of invading the users' privacy. The current work examines the issue of security agent location using indicative intrusion detection techniques for network layer attacks. We analyze the methodology, operation, as well as the complexity of each technique. Through the extensive implementation and experimentation, we are able to conclude that the local security agents have the same performance results with centralized and decentralized approaches, but with negligible overhead. As such, they are useful when internal network communication, or network augmentation with monitoring nodes, is not feasible.