Search

In keratoconus, the cornea assumes a conical shape due to its thinning and protrusion. Early detection of keratoconus is vital in preventing vision loss or costly repairs. In corneal topography maps, curvature and steepness can be distinguished by the colour scales, with warm colours representing curved steep areas and cold colours representing flat areas. With the advent of machine learning algorithms like convolutional neural networks (CNN), the identification and classification of keratoconus from these topography maps have been made faster and more accurate. The classification and grading of keratoconus depend on the colour scales used. Artefacts and minimal variations in the corneal shape, in mild or developing keratoconus, are not represented clearly in the image gradients. Segmentation of the maps needs to be carried out for identifying the severity of the keratoconus as well as for identifying the changes in the severity. In this paper, we are considering the use of particle swarm optimisation and its modifications for segmenting the topography image. Pretrained CNN models are then trained with the dataset and tested. Results show that the performance of the system in terms of accuracy is 95.9% compared to 93%, 95.3%, and 84% available in the literature for a 3-class classification that involved mild keratoconus or forme fruste keratoconus. [ABSTRACT FROM AUTHOR]

Gesture recognition utilizes deep learning network model to automatically extract deep features of data; however, traditional machine learning algorithms rely on manual feature extraction and poor model generalization ability. In this paper, a multimodal gesture recognition algorithm based on convolutional long-term memory network is proposed. First, a convolutional neural network (CNN) is employed to automatically extract the deeply hidden features of multimodal gesture data. Then, a time series model is constructed using a long short-term memory (LSTM) network to learn the long-term dependence of multimodal gesture features on the time series. On this basis, the classification of multimodal gestures is realized by the SoftMax classifier. Finally, the method is experimented and evaluated on two dynamic gesture datasets, VIVA and NVGesture. Experimental results indicate that the accuracy rates of the proposed method on the VIVA and NVGesture datasets are 92.55% and 87.38%, respectively, and its recognition accuracy and convergence performance are better than those of other comparison algorithms. [ABSTRACT FROM AUTHOR]

In this paper, we develop a healthcare biclustering model in the field of healthcare to reduce the inconveniences linked to the data clustering on gene expression. The present study uses two separate healthcare biclustering approaches to identify specific gene activity in certain environments and remove the duplication of broad gene information components. Moreover, because of its adequacy in the problem where populations of potential solutions allow exploration of a greater portion of the research area, machine learning or heuristic algorithm has become extensively used for healthcare biclustering in the field of healthcare. The study is evaluated in terms of average match score for nonoverlapping modules, overlapping modules through the influence of noise for constant bicluster and additive bicluster, and the run time. The results show that proposed FCM blustering method has higher average match score, and reduced run time proposed FCM than the existing PSO-SA and fuzzy logic healthcare biclustering methods. [ABSTRACT FROM AUTHOR]

In this paper, we develop a healthcare biclustering model in the field of healthcare to reduce the inconveniences linked to the data clustering on gene expression. The present study uses two separate healthcare biclustering approaches to identify specific gene activity in certain environments and remove the duplication of broad gene information components. Moreover, because of its adequacy in the problem where populations of potential solutions allow exploration of a greater portion of the research area, machine learning or heuristic algorithm has become extensively used for healthcare biclustering in the field of healthcare. The study is evaluated in terms of average match score for nonoverlapping modules, overlapping modules through the influence of noise for constant bicluster and additive bicluster, and the run time. The results show that proposed FCM blustering method has higher average match score, and reduced run time proposed FCM than the existing PSO-SA and fuzzy logic healthcare biclustering methods. [ABSTRACT FROM AUTHOR]

This work delivers a novel technique to detect brain tumor with the help of enhanced watershed modeling integrated with a modified ResNet50 architecture. It also involves stochastic approaches to help in developing enhanced watershed modeling. Cancer diseases, primarily the brain tumor, have been exponentially raised which has alarmed researchers from academia and industry. Nowadays, researchers need to attain a more effective, accurate, and trustworthy brain tumor tissue detection and classification approach. Different from traditional machine learning methods that are just targeting to enhance classification efficiency, this work highlights the process to extract several deep features to diagnose brain tumor effectively. This paper explains the modeling of a novel technique by integrating the modified ResNet50 with the Enhanced Watershed Segmentation (EWS) algorithm for brain tumor classification and deep feature extraction. The proposed model uses the ResNet50 model with a modified layer architecture including five convolutional layers and three fully connected layers. The proposed method can retain the optimal computational efficiency with high-dimensional deep features. This work obtains a comprised feature set by retrieving the diverse deep features from the ResNet50 deep learning model and feeds them as input to the classifier. The good performing capability of the proposed model is achieved by using hybrid features of ResNet50. The brain tumor tissue images were extracted by the suggested hybrid deep feature-based modified ResNet50 model and the EWS-based modified ResNet50 model with a high classification accuracy of 92% and 90%, respectively. [ABSTRACT FROM AUTHOR]

In this paper, we develop a healthcare biclustering model in the field of healthcare to reduce the inconveniences linked to the data clustering on gene expression. The present study uses two separate healthcare biclustering approaches to identify specific gene activity in certain environments and remove the duplication of broad gene information components. Moreover, because of its adequacy in the problem where populations of potential solutions allow exploration of a greater portion of the research area, machine learning or heuristic algorithm has become extensively used for healthcare biclustering in the field of healthcare. The study is evaluated in terms of average match score for nonoverlapping modules, overlapping modules through the influence of noise for constant bicluster and additive bicluster, and the run time. The results show that proposed FCM blustering method has higher average match score, and reduced run time proposed FCM than the existing PSO-SA and fuzzy logic healthcare biclustering methods. [ABSTRACT FROM AUTHOR]

The prediction research of the stock market prices is of great significance. Based on the secondary decomposition techniques of variational mode decomposition (VMD) and ensemble empirical mode decomposition (EEMD), this paper constructs a new hybrid prediction model by combining with extreme learning machine (ELM) optimized by the differential evolution (DE) algorithm. The hybrid model applies VMD technology to the original stock index price sequence to obtain different modal components and the residual item, then applies EEMD technology to the residual item, and then superimposes the prediction results of the DE-ELM model for each modal component and the residual item to obtain the final prediction results. In order to verify the validity of the model, this paper constructs a series of benchmark models and, respectively, tests the samples of the S&P 500 index and the HS300 index by one-step, three-step, and five-step forward forecasting. The empirical results show that the hybrid model proposed in this paper achieves the best prediction performance in all prediction scenarios, which indicates that the modeling idea focusing on the residual term effectively improves the prediction performance of the model. In addition, the prediction effect of the model combined with the decomposition technology is superior to the single DE-ELM model, where the secondary decomposition technique has a significant decomposition advantage compared to the single decomposition technique. [ABSTRACT FROM AUTHOR]

The quantitative evaluation of the importance degree of spare parts is essential as spare parts' maintenance is critical for inventory management. Most of the methods used in previous research are subjective. For this reason, an accurate method for the evaluation of the importance degree combining an improved clustering algorithm with a back-propagation neural network (BPNN) is proposed in the present paper. First, we classified the spare parts by analyzing their historical maintenance and inventory data. Second, we evaluated the effectiveness of classification using the Davies–Bouldin index and the Calinski–Harabasz indicator and verified it using the training data. Finally, we used BPNN to determine the training data necessary for an accurate assessment of the importance degree of spare parts. The previous importance evaluation methods were susceptible to subjective factors during the evaluation process. The model established in this paper used the actual data of the company for machine learning and used the improved clustering algorithm to implement training and classification of spare parts data. The importance value of each spare part was output, which additionally reduced the impact of subjective factors on the importance evaluation. At the same time, the use of less data to evaluate the importance of spare parts was achieved, which improved the evaluation efficiency. [ABSTRACT FROM AUTHOR]

The neuromuscular disorders are diagnosed using electromyographic (EMG) signals. Machine learning algorithms are employed as a decision support system to diagnose neuromuscular disorders. This paper compares bagging and boosting ensemble learning methods to classify EMG signals automatically. Even though ensemble classifiers' efficacy in relation to real-life issues has been presented in numerous studies, there are almost no studies which focus on the feasibility of bagging and boosting ensemble classifiers to diagnose the neuromuscular disorders. Therefore, the purpose of this paper is to assess the feasibility of bagging and boosting ensemble classifiers to diagnose neuromuscular disorders through the use of EMG signals. It should be understood that there are three steps to this method, where the step number one is to calculate the wavelet packed coefficients (WPC) for every type of EMG signal. After this, it is necessary to calculate statistical values of WPC so that the distribution of wavelet coefficients could be demonstrated. In the last step, an ensemble classifier used the extracted features as an input of the classifier to diagnose the neuromuscular disorders. Experimental results showed the ensemble classifiers achieved better performance for diagnosis of neuromuscular disorders. Results are promising and showed that the AdaBoost with random forest ensemble method achieved an accuracy of 99.08%, F-measure 0.99, AUC 1, and kappa statistic 0.99. [ABSTRACT FROM AUTHOR]

Alzheimer's disease (AD) is the most generally known neurodegenerative disorder, leading to a steady deterioration in cognitive ability. Deep learning models have shown outstanding performance in the diagnosis of AD, and these models do not need any handcrafted feature extraction over conventional machine learning algorithms. Since the 2012 AlexNet accomplishment, the convolutional neural network (CNN) has been progressively utilized by the medical community to assist practitioners to early diagnose AD. This paper explores the current cutting edge applications of CNN on single and multimodality (combination of two or more modalities) neuroimaging data for the classification of AD. An exhaustive systematic search is conducted on four notable databases: Google Scholar, IEEE Xplore, ACM Digital Library, and PubMed in June 2021. The objective of this study is to examine the effectiveness of classification approaches on AD to analyze different kinds of datasets, neuroimaging modalities, preprocessing techniques, and data handling methods. However, CNN has achieved great success in the classification of AD; still, there are a lot of challenges particularly due to scarcity of medical imaging data and its possible scope in this field. [ABSTRACT FROM AUTHOR]

The existing face detection methods were affected by the network model structure used. Most of the face recognition methods had low recognition rate of face key point features due to many parameters and large amount of calculation. In order to improve the recognition accuracy and detection speed of face key points, a real-time face key point detection algorithm based on attention mechanism was proposed in this paper. Due to the multiscale characteristics of face key point features, the deep convolution network model was adopted, the attention module was added to the VGG network structure, the feature enhancement module and feature fusion module were combined to improve the shallow feature representation ability of VGG, and the cascade attention mechanism was used to improve the deep feature representation ability. Experiments showed that the proposed algorithm not only can effectively realize face key point recognition but also has better recognition accuracy and detection speed than other similar methods. This method can provide some theoretical basis and technical support for face detection in complex environment. [ABSTRACT FROM AUTHOR]

Federated learning (FL) is an emerging subdomain of machine learning (ML) in a distributed and heterogeneous setup. It provides efficient training architecture, sufficient data, and privacy-preserving communication for boosting the performance and feasibility of ML algorithms. In this environment, the resultant global model produced by averaging various trained client models is vital. During each round of FL, model parameters are transferred from each client device to the server while the server waits for all models before it can average them. In a realistic scenario, waiting for all clients to communicate their model parameters, where client models are trained on low-power Internet of Things (IoT) devices, can result in a deadlock. In this paper, a novel temporal model averaging algorithm is proposed for asynchronous federated learning (AFL). Our approach uses a dynamic expectation function that computes the number of client models expected in each round and a weighted averaging algorithm for continuous modification of the global model. This ensures that the federated architecture is not stuck in a deadlock all the while increasing the throughput of the server and clients. To implicate the importance of asynchronicity in cybersecurity, the proposed algorithm is tested using NSL-KDD intrusion detection system datasets. The performance accuracy of the global model is about 99.5% on the dataset, outperforming traditional FL models in anomaly detection. In terms of asynchronicity, we get an increased throughput of almost 10.17% for every 30 timesteps. [ABSTRACT FROM AUTHOR]

In this paper, we have proposed a novel methodology based on statistical features and different machine learning algorithms. The proposed model can be divided into three main stages, namely, preprocessing, feature extraction, and classification. In the preprocessing stage, the median filter has been used in order to remove salt-and-pepper noise because MRI images are normally affected by this type of noise, the grayscale images are also converted to RGB images in this stage. In the preprocessing stage, the histogram equalization has also been used to enhance the quality of each RGB channel. In the feature extraction stage, the three channels, namely, red, green, and blue, are extracted from the RGB images and statistical measures, namely, mean, variance, skewness, kurtosis, entropy, energy, contrast, homogeneity, and correlation, are calculated for each channel; hence, a total of 27 features, 9 for each channel, are extracted from an RGB image. After the feature extraction stage, different machine learning algorithms, such as artificial neural network, k -nearest neighbors' algorithm, decision tree, and Naïve Bayes classifiers, have been applied in the classification stage on the features extracted in the feature extraction stage. We recorded the results with all these algorithms and found that the decision tree results are better as compared to the other classification algorithms which are applied on these features. Hence, we have considered decision tree for further processing. We have also compared the results of the proposed method with some well-known algorithms in terms of simplicity and accuracy; it was noted that the proposed method outshines the existing methods. [ABSTRACT FROM AUTHOR]

Detection of substation equipment can promptly and effectively discover equipment overheating defects and prevent equipment failures. Traditional manual diagnosis methods are difficult to deal with the massive infrared images generated by the autonomous inspection of substation robots and drones. At present, most of the infrared image defect recognition is based on traditional machine learning algorithms, with low recognition accuracy and poor generalization capability. Therefore, this paper develops a method for identifying infrared defects of substation equipment based on the improvement of traditional ones. First, based on the Faster RCNN, target detection is performed on 6 types of substation equipment including bushings, insulators, wires, voltage transformers, lightning rods, and circuit breakers to achieve precise positioning of the equipment. Afterwards, different classes are identified based on the sparse representation-based classification (SRC), so the actual label of the input sample can be obtained. Finally, based on the temperature threshold discriminant algorithm, defects are identified in the equipment area. The measured infrared images are used for experiments. The average detection accuracy achieved by the proposed method for the 6 types of equipment reaches 92.34%. The recognition rate of different types of equipment is 98.57%, and the defect recognition accuracy reaches 88.75%. The experimental results show the effectiveness and accuracy of the proposed method. [ABSTRACT FROM AUTHOR]

Traditional and typical iterative learning control algorithm shows that the convergence rate of error is very low for a class of regular linear systems. A fast iterative learning control algorithm is designed to deal with this problem in this paper. The algorithm is based on the traditional P-type iterative learning control law, which increases the composition of adjacent two overlapping quantities, the tracking error of previous cycle difference signals, and the current error difference. Using convolution to promote Young inequalities proved strictly that, in terms of Lebesgue-p norm, when the number of iterations tends to infinity, the tracking error converges to zero in the system and presents the convergence condition of the algorithm. Compared with the traditional P-type iterative learning control algorithm, the proposed algorithm improves convergence speed and evades the defect using the norm metric's tracking error. Finally, the validation of the effectiveness of the proposed algorithm is further proved by simulation results. [ABSTRACT FROM AUTHOR]

As a new brain-inspired computational model of artificial neural networks, spiking neural networks transmit and process information via precisely timed spike trains. Constructing efficient learning methods is a significant research field in spiking neural networks. In this paper, we present a supervised learning algorithm for multilayer feedforward spiking neural networks; all neurons can fire multiple spikes in all layers. The feedforward network consists of spiking neurons governed by biologically plausible long-term memory spike response model, in which the effect of earlier spikes on the refractoriness is not neglected to incorporate adaptation effects. The gradient descent method is employed to derive synaptic weight updating rule for learning spike trains. The proposed algorithm is tested and verified on spatiotemporal pattern learning problems, including a set of spike train learning tasks and nonlinear pattern classification problems on four UCI datasets. Simulation results indicate that the proposed algorithm can improve learning accuracy in comparison with other supervised learning algorithms. [ABSTRACT FROM AUTHOR]

With the rapid development of deep learning algorithms, it is gradually applied in UAV (Unmanned Aerial Vehicle) driving, visual recognition, target tracking, behavior recognition, and other fields. In the field of sports, many scientists put forward the research of target tracking and recognition technology based on deep learning algorithms for athletes' trajectory and behavior capture. Based on the target tracking algorithm, a regional proposal network RPN algorithm combined with the twin regional proposal network Siamese algorithm is proposed to study the tracking and recognition technology of athletes' behavior. Then, the adaptive updating network is used to track the behavior target of athletes, and the simulation model of behavior recognition is established. This algorithm is different from the traditional twin network algorithm. It can accurately take the athlete's behavior as the target candidate box in model training and reduce the interference of environment and other factors on model recognition. The results show that the Siamese-RPN algorithm can reduce the interference from the background and environment when tracking the athletes' target behavior trajectory. This algorithm can improve the training behavior recognition model, ignore the background interference elements of the behavior image, and improve the accuracy and overall performance of the model. Compared with the traditional twin network method for sports behavior recognition, the Siamese-RPN algorithm studied in this paper can perform offline operations and distinguish the interference factors of athletes' background environment. It can quickly capture the characteristic points of athletes' behavior as the data input of the tracking model, so it has excellent popularization and application value. [ABSTRACT FROM AUTHOR]

Target threat assessment technology is one of the key technologies of intelligent tactical aid decision-making system. Aiming at the problem that traditional beyond-visual-range air combat threat assessment algorithms are susceptible to complex factors, there are correlations between assessment indicators, and accurate and objective assessment results cannot be obtained. A target threat assessment algorithm based on linear discriminant analysis (LDA) and improved glowworm swarm optimization (IGSO) algorithm to optimize extreme learning machine (ELM) is proposed in this paper. Firstly, the linear discriminant analysis method is used to classify the threat assessment indicators, eliminate the correlation between the assessment indicators, and achieve dimensionality reduction of the assessment indicators. Secondly, a prediction model with multiple parallel extreme learning machines as the core is constructed, and the input weights and thresholds of extreme learning machines are optimized by the improved glowworm swarm optimization algorithm, and the weighted integration is carried out according to the training level of the kernel. Then, the threat assessment index functions of angle, speed, distance, altitude, and air combat capability are constructed, respectively, and the sample data of air combat target threat assessment are obtained by combining the structure entropy weight method. Finally, the air combat data is selected from the air combat maneuvering instrument (ACMI), and the accuracy and real-time performance of the LDA-IGSO-ELM algorithm are verified through simulation. The results show that the algorithm can quickly and accurately assess target threats. [ABSTRACT FROM AUTHOR]

This study is aimed at modeling biodigestion systems as a function of the most influencing parameters to generate two robust algorithms on the basis of the machine learning algorithms, including adaptive network-based fuzzy inference system (ANFIS) and least square support vector machine (LSSVM). The models are assessed utilizing multiple statistical analyses for the actual values and model outcomes. Results from the suggested models indicate their great capability of predicting biogas production from vegetable food, fruits, and wastes for a variety of ranges of input parameters. The values that are calculated for the mean relative error (MRE %) and mean squared error (MSE) were 29.318 and 0.0039 for ANFIS, and 2.951 and 0.0001 for LSSVM which shows that the latter model has a better ability to predict the target data. Finally, in order to have additional certainty, two analyses of outlier identification and sensitivity were performed on the input parameter data that proved the proposed model in this paper has higher reliability in assessing output values compared with the previous model. [ABSTRACT FROM AUTHOR]

Evaluation of music teaching is a highly subjective task often depending upon experts to assess both the technical and artistic characteristics of performance from the audio signal. This article explores the task of building computational models for evaluating music teaching using machine learning algorithms. As one of the widely used methods to build classifiers, the Naïve Bayes algorithm has become one of the most popular music teaching evaluation methods because of its strong prior knowledge, learning features, and high classification performance. In this article, we propose a music teaching evaluation model based on the weighted Naïve Bayes algorithm. Moreover, a weighted Bayesian classification incremental learning approach is employed to improve the efficiency of the music teaching evaluation system. Experimental results show that the algorithm proposed in this paper is superior to other algorithms in the context of music teaching evaluation. [ABSTRACT FROM AUTHOR]

The spread of COVID-19 worldwide continues despite multidimensional efforts to curtail its spread and provide treatment. Efforts to contain the COVID-19 pandemic have triggered partial or full lockdowns across the globe. This paper presents a novel framework that intelligently combines machine learning models and the Internet of Things (IoT) technology specifically to combat COVID-19 in smart cities. The purpose of the study is to promote the interoperability of machine learning algorithms with IoT technology by interacting with a population and its environment to curtail the COVID-19 pandemic. Furthermore, the study also investigates and discusses some solution frameworks, which can generate, capture, store, and analyze data using machine learning algorithms. These algorithms can detect, prevent, and trace the spread of COVID-19 and provide a better understanding of the disease in smart cities. Similarly, the study outlined case studies on the application of machine learning to help fight against COVID-19 in hospitals worldwide. The framework proposed in the study is a comprehensive presentation on the major components needed to integrate the machine learning approach with other AI-based solutions. Finally, the machine learning framework presented in this study has the potential to help national healthcare systems in curtailing the COVID-19 pandemic in smart cities. In addition, the proposed framework is poised as a pointer for generating research interests that would yield outcomes capable of been integrated to form an improved framework. [ABSTRACT FROM AUTHOR]

Feature selection is the process of decreasing the number of features in a dataset by removing redundant, irrelevant, and randomly class-corrected data features. By applying feature selection on large and highly dimensional datasets, the redundant features are removed, reducing the complexity of the data and reducing training time. The objective of this paper was to design an optimizer that combines the well-known metaheuristic population-based optimizer, the grey wolf algorithm, and the gradient descent algorithm and test it for applications in feature selection problems. The proposed algorithm was first compared against the original grey wolf algorithm in 23 continuous test functions. The proposed optimizer was altered for feature selection, and 3 binary implementations were developed with final implementation compared against the two implementations of the binary grey wolf optimizer and binary grey wolf particle swarm optimizer on 6 medical datasets from the UCI machine learning repository, on metrics such as accuracy, size of feature subsets, F -measure, accuracy, precision, and sensitivity. The proposed optimizer outperformed the three other optimizers in 3 of the 6 datasets in average metrics. The proposed optimizer showed promise in its capability to balance the two objectives in feature selection and could be further enhanced. [ABSTRACT FROM AUTHOR]

Nuclear power plant operating data are characterized by a large variety, strong coupling, and low data value density. When using machine learning techniques for fault diagnosis and other related research, feature selection enables dimensionality reduction while maintaining the physical meaning of the original features, thus improving the computational efficiency and generalization ability of the learning model. In this paper, a correlation-based feature selection algorithm is developed to implement feature selection of nuclear power plant operating data. The proposed algorithm is verified by experiments and compared with traditional correlation-based feature selection algorithms. The experiments and comparison results show that the proposed algorithm is effective in realizing the dimensionality reduction of nuclear power plant operating data. [ABSTRACT FROM AUTHOR]

With the development of civil aviation, the number of flights keeps increasing and the flight delay has become a serious issue and even tends to normality. This paper aims to prove that Stacking algorithm has advantages in airport flight delay prediction, especially for the algorithm selection problem of machine learning technology. In this research, the principle of the Stacking classification algorithm is introduced, the SMOTE algorithm is selected to process imbalanced datasets, and the Boruta algorithm is utilized for feature selection. There are five supervised machine learning algorithms in the first-level learner of Stacking including KNN, Random Forest, Logistic Regression, Decision Tree, and Gaussian Naive Bayes. The second-level learner is Logistic Regression. To verify the effectiveness of the proposed method, comparative experiments are carried out based on Boston Logan International Airport flight datasets from January to December 2019. Multiple indexes are used to comprehensively evaluate the prediction results, such as Accuracy, Precision, Recall, F1 Score, ROC curve, and AUC Score. The results show that the Stacking algorithm not only could improve the prediction accuracy but also maintains great stability. [ABSTRACT FROM AUTHOR]

Artificial intelligence technologies such as machine learning have been applied to protein engineering, with unique advantages in protein structure, function prediction, catalytic activity, and other issues in recent years. Screening better mutants is still a bottleneck in protein engineering. In this paper, a new sequence-activity relationship method was analyzed for its application in improving the thermal stability of Aspergillus terreus (R)-ω-selective amine transaminase. The experimental data from 6 single-point mutated enzymes were used as a learning dataset to build models and predict the thermostability of 26 mutants. Based on digital signal processing (DSP), this method digitized the amino acid sequence of proteins by fast Fourier transform (FFT) and then established the best model applying partial least squares regression (PLSR) to screen out all possible mutants, especially those with high performance. In protein engineering, the innovative sequence activity relationship (ISAR) method can make a reasonable prediction using limited experimental data and significantly reduce the experimental cost. The half-life ( T 1 / 2 ) of (R)-ω-transaminase was fitted with the amino acid sequence by the ISAR algorithm, resulting in an R 2 of 0.8929 and a cvRMSE of 4.89. At the same time, the mutants with higher T 1 / 2 than the existing ones were predicted, laying the groundwork for better (R)-ω-transaminase in the later stage. The ISAR algorithm is expected to provide a new technique for protein evolution and screening. [ABSTRACT FROM AUTHOR]

Traffic safety is affected by many complex factors. Mind wandering (MW) is a fatal cause affecting driving safety and is hard to be detected and prevented due to its uncertain and complex occurrence mechanism. The aim of this study was to propose a framework for analyzing and predicting MW based on readily available driving status data. The data used in this study are the single-trip information collected by the questionnaire, which includes drivers' personal characteristics, contextual information in which MW occurs, and in-vehicle environmental factors. After investigating the extent of factors that influence MW, these chosen factors are used to forecast MW. Based on these results, we select factors reliable to be obtained in real life to forecast MW. To verify that the new factors explored are useful in improving the forecast accuracy, the compared analysis is conducted with the results found by our approach and the existing approaches. We compare results obtained by four machine-learning-enabled forecasting approaches on a real-life data set. The result shows that the factors found in this paper can significantly improve forecast accuracy. The confusion matrix, ROC curves, and AUC are conducted, and the performance of the gradient boosting decision tree algorithm is better than other forecast approaches. The importance rankings of most factors obtained by the Gradient Boosting Decision Tree and questionnaire are the same. [ABSTRACT FROM AUTHOR]

In this paper, the Trolox equivalent antioxidant capacity (TEAC) is estimated through a robust machine-learning algorithm known as the Particle Swarm Optimization-based Extreme Learning Machine (PSO-ELM) model. For this purpose, a large dataset from previously published reports was gathered. Various analyses were performed to evaluate the proposed model. The results of the statistical analysis showed that this model can predict the actual values with high accuracy, so that the calculated R 2 and RMSE values were equal to 0.973 and 3.56, respectively. Sensitivity analysis was also performed on the effective input parameters. The leverage technique was also performed to check the accuracy of real data, and the results showed that the majority of data are reliable. This simple yet accurate model can be very powerful in predicting the Trolox equivalent antioxidant capacity values and can be a good alternative to laboratory data. [ABSTRACT FROM AUTHOR]

The reinforcement learning algorithms based on policy gradient may fall into local optimal due to gradient disappearance during the update process, which in turn affects the exploration ability of the reinforcement learning agent. In order to solve the above problem, in this paper, the cross-entropy method (CEM) in evolution policy, maximum mean difference (MMD), and twin delayed deep deterministic policy gradient algorithm (TD3) are combined to propose a diversity evolutionary policy deep reinforcement learning (DEPRL) algorithm. By using the maximum mean discrepancy as a measure of the distance between different policies, some of the policies in the population maximize the distance between them and the previous generation of policies while maximizing the cumulative return during the gradient update. Furthermore, combining the cumulative returns and the distance between policies as the fitness of the population encourages more diversity in the offspring policies, which in turn can reduce the risk of falling into local optimal due to the disappearance of the gradient. The results in the MuJoCo test environment show that DEPRL has achieved excellent performance on continuous control tasks; especially in the Ant-v2 environment, the return of DEPRL ultimately achieved a nearly 20% improvement compared to TD3. [ABSTRACT FROM AUTHOR]

With the continuous development of neural network theory itself and related theories and related technologies, neural network is one of the main branches of intelligent control technology. Artificial neural network is a nonlinear and adaptive information processing composed of a large number of processing units. In this paper, an adaptive fuzzy neural network (FNN) is used to construct an intelligent system architecture for English learning, and activation function is used to apply the knowledge of computer science and linguistics to English learning. The network neural structure diagram is presented. English machine learning model framework is established based on recursive neural network. On this basis, feature vector extraction and normalization algorithm are used to meet the needs of neural network model. After acquiring the feature vectors of users' learning styles, the clustering algorithm is used to effectively form a variety of learning styles. The validity of the English learning model was verified by designing the functional flow based on tests. Accurate mastery can activate the corresponding brain regions not only to improve the efficiency of learning, but also to better facilitate language learning. [ABSTRACT FROM AUTHOR]

With the rapid development of the Internet and the rapid development of big data analysis technology, data mining has played a positive role in promoting industry and academia. Classification is an important problem in data mining. This paper explores the background and theory of support vector machines (SVM) in data mining classification algorithms and analyzes and summarizes the research status of various improved methods of SVM. According to the scale and characteristics of the data, different solution spaces are selected, and the solution of the dual problem is transformed into the classification surface of the original space to improve the algorithm speed. Research Process. Incorporating fuzzy membership into multicore learning, it is found that the time complexity of the original problem is determined by the dimension, and the time complexity of the dual problem is determined by the quantity, and the dimension and quantity constitute the scale of the data, so it can be based on the scale of the data Features Choose different solution spaces. The algorithm speed can be improved by transforming the solution of the dual problem into the classification surface of the original space. Conclusion. By improving the calculation rate of traditional machine learning algorithms, it is concluded that the accuracy of the fitting prediction between the predicted data and the actual value is as high as 98%, which can make the traditional machine learning algorithm meet the requirements of the big data era. It can be widely used in the context of big data. [ABSTRACT FROM AUTHOR]

As one of important epigenetic modifications, DNA N4-methylcytosine (4mC) plays a crucial role in controlling gene replication, expression, cell cycle, DNA replication, and differentiation. The accurate identification of 4mC sites is necessary to understand biological functions. In the paper, we use ensemble learning to develop a model named i4mC-EL to identify 4mC sites in the mouse genome. Firstly, a multifeature encoding scheme consisting of Kmer and EIIP was adopted to describe the DNA sequences. Secondly, on the basis of the multifeature encoding scheme, we developed a stacked ensemble model, in which four machine learning algorithms, namely, BayesNet, NaiveBayes, LibSVM, and Voted Perceptron, were utilized to implement an ensemble of base classifiers that produce intermediate results as input of the metaclassifier, Logistic. The experimental results on the independent test dataset demonstrate that the overall rate of predictive accurate of i4mC-EL is 82.19%, which is better than the existing methods. The user-friendly website implementing i4mC-EL can be accessed freely at the following. [ABSTRACT FROM AUTHOR]

A fault diagnosis framework based on extreme learning machine (ELM) and AdaBoost.SAMME is proposed in a nuclear power plant (NPP) in this paper. After briefly describing the principles of ELM and AdaBoost.SAMME algorithm, the fault diagnosis framework sets ELM algorithm as the weak classifier and then integrates several weak classifiers into a strong one using the AdaBoost.SAMME algorithm. Furthermore, some experiments are put forward for the setting of two algorithms. The results of simulation experiments on the HPR1000 simulator show that the combined method has higher precision and faster speed by improving the performance of weak classifiers compared to the BP neural network and verify the feasibility and validity of the ensemble learning method for fault diagnosis. Meanwhile, the results also indicate that the proposed method can meet the requirements of a real-time diagnosis of the nuclear power plant. [ABSTRACT FROM AUTHOR]

3D multiobject tracking (MOT) is an important part of road condition detection and hazard warning algorithm in roadside systems and autonomous driving systems. There is a tricky problem in 3D MOT that the identity of occluded object switches after it reappears. Given the good performance of the 2D MOT, this paper proposes a 3D MOT algorithm with deep learning based on the multiobject tracking algorithm. Firstly, a 3D object detector was used to obtain oriented 3D bounding boxes from point clouds. Secondly, a 3D Kalman filter was used for state estimation, and reidentification algorithm was used to match feature similarity. Finally, data association was conducted by combining Hungarian algorithm. Experiments show that the proposed method can still match the original trajectory after the occluded object reappears and run at a rate of 59 FPS, which has achieved advanced results in the existing 3D MOT system. [ABSTRACT FROM AUTHOR]

In order to make full use of nonlocal and local similarity and improve the efficiency and adaptability of the NPB-DL algorithm, this paper proposes a signal reconstruction algorithm based on dictionary learning algorithm combined with structure similarity clustering. Nonparametric Bayesian for Dirichlet process is firstly introduced into the prior probability modeling of clustering labels, and then, Dirichlet prior distribution is applied to the prior probability of cluster labels so as to ensure the analyticity and conjugation of the probability model. Experimental results show that the proposed algorithm is not only superior to other comparison algorithms in numerical evaluation indicators but also closer to the original image in terms of visual effects. [ABSTRACT FROM AUTHOR]

In order to make full use of nonlocal and local similarity and improve the efficiency and adaptability of the NPB-DL algorithm, this paper proposes a signal reconstruction algorithm based on dictionary learning algorithm combined with structure similarity clustering. Nonparametric Bayesian for Dirichlet process is firstly introduced into the prior probability modeling of clustering labels, and then, Dirichlet prior distribution is applied to the prior probability of cluster labels so as to ensure the analyticity and conjugation of the probability model. Experimental results show that the proposed algorithm is not only superior to other comparison algorithms in numerical evaluation indicators but also closer to the original image in terms of visual effects. [ABSTRACT FROM AUTHOR]

3D multiobject tracking (MOT) is an important part of road condition detection and hazard warning algorithm in roadside systems and autonomous driving systems. There is a tricky problem in 3D MOT that the identity of occluded object switches after it reappears. Given the good performance of the 2D MOT, this paper proposes a 3D MOT algorithm with deep learning based on the multiobject tracking algorithm. Firstly, a 3D object detector was used to obtain oriented 3D bounding boxes from point clouds. Secondly, a 3D Kalman filter was used for state estimation, and reidentification algorithm was used to match feature similarity. Finally, data association was conducted by combining Hungarian algorithm. Experiments show that the proposed method can still match the original trajectory after the occluded object reappears and run at a rate of 59 FPS, which has achieved advanced results in the existing 3D MOT system. [ABSTRACT FROM AUTHOR]

Background and Aim: Gastric cancer (GC) is the common leading cause of cancer-related death worldwide. Immune-related genes (IRGs) may potentially predict lymph node metastasis (LNM). We aimed to develop a preoperative model to predict LNM based on these IRGs. Methods: In this paper, we compared and evaluated three machine learning models to predict LNM based on publicly available gene expression data from TCGA-STAD. The Pearson correlation coefficient (PCC) method was utilized to feature selection according to its relationships with LN status. The performance of the model was assessed using the area under the curve (AUC) and F1 score. Results: The Naive Bayesian model showed better performance and was constructed based on 26 selected gene features, with AUCs of 0.741 in the training set and 0.688 in the test set. The F1 score in the training set and test set was 0.652 and 0.597, respectively. Furthermore, Naive Bayesian model based on 26 IRGs is the first diagnostic tool for the identification of LNM in advanced GC. Conclusion: These results indicate that our new methods have the value of auxiliary diagnosis with promising clinical potential. [ABSTRACT FROM AUTHOR]

Proximal point algorithm is a type of method widely used in solving optimization problems and some practical problems such as machine learning in recent years. In this paper, a framework of accelerated proximal point algorithm is presented for convex minimization with linear constraints. The algorithm can be seen as an extension to G u ¨ ler's methods for unconstrained optimization and linear programming problems. We prove that the sequence generated by the algorithm converges to a KKT solution of the original problem under appropriate conditions with the convergence rate of O 1 / k 2 . [ABSTRACT FROM AUTHOR]

FxLMS (Filtered-x Least Mean Square) algorithm is widely used in the field of AVC (active vibration control) for its good convergence and strong adaptability. However, the convergence rate and steady-state error are mutually restricted for the fixed step FxLMS algorithm. Increasing step size μ to accelerate the convergence rate will result in larger steady-state error and even cause control divergence. In this paper, a new DVSFxLMS (error signal Differential term feedback Variable Step size FxLMS) algorithm is proposed by establishing nonlinear function between μ and error signal, while using differential term of the error signal as the feedback control function. Subsequently, a DVSFxLMS controller is designed to carry out the AVC simulation and experiments on cantilever beam with PSA (piezoelectric stack actuator). Simulation and experimental results show that the proposed DVSFxLMS algorithm has faster convergence rate and smaller steady-state error than the traditional FxLMS algorithm, which also has strong antinoise ability and adaptive control ability to quickly track the variable external disturbance. [ABSTRACT FROM AUTHOR]

The actualization of the befitting sampling strategy and the application of an appropriate evaluation algorithm have been elementary issues in the coordinate metrology. The decisions regarding their choice for a given geometrical feature customarily rely upon the user's instinct or experience. As a consequence, the measurement results have to be accommodated between the accuracy and the inspection time. Certainly, a reliable and efficient sampling plan is imperative to accomplish a dependable inspection in minimal time, effort, and cost. This paper deals with the determination of an optimal sampling plan that minimizes the inspection cost, while still promising a measurement quality. A cylindrical-shaped component has been utilized in this work to achieve the desired objective. The inspection quality of the cylinder using a coordinate measuring machine (CMM) can be enhanced by controlling the three main parameters, which are used as input variables in the data file, namely, point distribution schemes, total number of points, and form evaluation algorithms. These factors affect the inspection output, in terms of cylindricity and measurement time, which are considered as target variables. The dataset, which comprises input and intended parameters, has been acquired through experimentation on the CMM machine. This work has utilized state-of-the-art machine learning algorithms to establish predictive models, which can predict the inspection output. The different algorithms have been examined and compared to seek for the most relevant machine learning regression method. The best performance has been observed using the support vector regression for cylindricity, with a mean absolute error of 0.000508 mm and a root-mean-squared error of 0.000885 mm. Likewise, the best prediction performance for measuring time has been demonstrated by the decision trees. Finally, the optimal parameters are estimated by employing the grey relational analysis (GRA) and the fuzzy technique for order performance by similarity to ideal solution (FTOPSIS). It has been approved that the values obtained from GRA are comparable with those of the FTOPSIS. Moreover, the quality of the optimal results is bettered by incorporating the measurement uncertainty in the outcome. [ABSTRACT FROM AUTHOR]

In the collaborative filtering (CF) recommendation applications, the sparsity of user rating data, the effectiveness of cold start, the strategy of item information neglection, and user profiles construction are critical to both the efficiency and effectiveness of the recommendation algorithm. In order to solve the above problems, a personalized recommendation approach combining semisupervised support vector machine and active learning (AL) is proposed in this paper, which combines the benefits of both TSVM (Transductive Support Vector Machine) and AL. Firstly, a "maximum-minimum segmentation" of version space-based AL strategy is developed to choose the most informative unlabeled samples for human annotation; it aims to choose the least data which is enough to train a high-quality model. And then, an AL-based semisupervised TSVM algorithm is proposed to make full use of the distribution characteristics of unlabeled samples by adding a manifold regularization into objective function, which is helpful to make the proposed algorithm to overcome the traditional drawbacks of TSVM. Furthermore, during the procedure of recommendation model construction, not only user behavior information and item information, but also demographic information is utilized. Due to the benefits of the above design, the quality of unlabeled sample annotation can be improved; meanwhile, both the data sparsity and cold start problems are alleviated. Finally, the effectiveness of the proposed algorithm is verified based on UCI datasets, and then it is applied to personalized recommendation. The experimental results show the superiority of the proposed method in both effectiveness and efficiency. [ABSTRACT FROM AUTHOR]

Domain-transfer learning is a machine learning task to explore a source domain data set to help the learning problem in a target domain. Usually, the source domain has sufficient labeled data, while the target domain does not. In this paper, we propose a novel domain-transfer convolutional model by mapping a target domain data sample to a proxy in the source domain and applying a source domain model to the proxy for the purpose of prediction. In our framework, we firstly represent both source and target domains to feature vectors by two convolutional neural networks and then construct a proxy for each target domain sample in the source domain space. The proxy is supposed to be matched to the corresponding target domain sample convolutional representation vector well. To measure the matching quality, we proposed to maximize their squared-loss mutual information (SMI) between the proxy and target domain samples. We further develop a novel neural SMI estimator based on a parametric density ratio estimation function. Moreover, we also propose to minimize the classification error of both source domain samples and target domain proxies. The classification responses are also smoothened by manifolds of both the source domain and proxy space. By minimizing an objective function of SMI, classification error, and manifold regularization, we learn the convolutional networks of both source and target domains. In this way, the proxy of a target domain sample can be matched to the source domain data and thus benefits from the rich supervision information of the source domain. We design an iterative algorithm to update the parameters alternately and test it over benchmark data sets of abnormal behavior detection in video, Amazon product reviews sentiment analysis, etc. [ABSTRACT FROM AUTHOR]

With the rapid development of intelligent transportation, intelligent algorithms and path planning have become effective methods to relieve traffic pressure. Intelligent algorithm can realize the priority selection mode in realizing traffic optimization efficiency. However, there is local optimization in intelligence and it is difficult to realize global optimization. In this paper, the antilearning model is used to solve the problem that the gray wolf algorithm falls into local optimization. The positions of different wolves are updated. When falling into local optimization, the current position is optimized to realize global optimization. Extreme Learning Machine (ELM) algorithm model is introduced to accelerate Improved Gray Wolf Optimization (IGWO) optimization and improve convergence speed. Finally, the experiment proves that IGWO-ELM algorithm is compared in path planning, and the algorithm has an ideal effect and high efficiency. [ABSTRACT FROM AUTHOR]

Summary: Microgrid is a new era in the power system and it has more scope of investigation on research. Due to an increase in demand and future expansion of the power system, analyzing the complexities of the network becomes a challenging task. Artificial intelligence plays a vital role in resolving such issues in a microgrid in various aspects. Owing to the rapid growth of periodical update in computational cost reduction, enhanced data analysis‐based algorithm artificial intelligence enters into new epoch Artificial Intelligence AI 2.0. Based on such approach, machine learning has been evolved as AI 2.0 initially. Now, it develops branches like deep learning, reinforcement learning, and a combination of both deep reinforcement learning algorithms. These algorithms are precise to attain higher priority in decision‐making under a complex network. This paper deals with numerous challenges of the above algorithm to state the significance of AI 2.0 and summarization of their application toward microgrid is useful to analyze the power system. [ABSTRACT FROM AUTHOR]

In this paper, we propose a semantic segmentation algorithm (RoadNet) for auxiliary edge detection tasks with an attention mechanism. RoadNet improves the dispersion of the low-level features of the network model and further enhances the performance and applicability of the semantic segmentation algorithm. In RoadNet, a fully convolutional neural network is used as the basic model, an auxiliary loss in the image classification, multitask learning in machine learning, and attention mechanism in natural language processing. To improve the generalization of the model, we select and analyze a proper domain difference measure. Subsequently, the context semantic distribution module and the annotation distribution loss are designed based on the context semantic encoding structure. The domain discriminator based on the adversarial training and the adversarial training algorithm based on transfer learning are then well integrated to provide a transfer learning-based semantic segmentation algorithm (TransRoadNet). The experimental results indicate that the proposed TransRoadNet and RoadNet overperform their equivalent comparison models. [ABSTRACT FROM AUTHOR]

Fault diagnosis is essentially the identification of multiple fault modes. How to extract sensitive features and improve diagnostic accuracy is the key to fault diagnosis. In this paper, a new manifold learning method (Mass Laplacian Discriminant Analysis, MLDA) is proposed. Firstly, it is assumed that each data point in the space is a point with mass, and the mass is defined as the number of data points in a certain area. Then, the idea of universal gravitation is introduced to calculate the virtual universal gravitation between data points. Based on the Laplace eigenmaps algorithm, the gravitational Laplacian matrix between the same kind of data and the heterogeneous data is obtained, and the discriminant function is constructed by the ratio of the virtual gravitation between the heterogeneous data and the virtual gravitation between the similar data; the projection function with the largest discriminant function value is the optimal feature mapping function. Finally, based on the mapping function, the eigenvalues of the training data and the test data are calculated, and the softmax algorithm is used to classify the test data. Experiments on gear fault diagnosis show that this method has higher diagnostic accuracy than other manifold learning algorithms. [ABSTRACT FROM AUTHOR]

Summary: This study addressed the problem of multi‐area state estimation in a clustered distribution system. Distribution networks are inherently expansive and comprise a multitude of nodes. This issue increases the state estimation computation time and makes it inapplicable for control of sophisticated distribution networks. Multi‐area state estimation is a technique to reduce computation time while concerning computation accuracy. Many efforts are required to reach a perfect algorithm, followed by the optimization of different parameters of the proposed algorithms. This paper performed a precise mathematical analysis of the impact made by the common (shared) node exchanged information between the areas in the multi‐area state estimation algorithm. Furthermore, a new iterative multi‐area state estimation algorithm equipped with machine learning tools was designed based on analytical detections for enhancing the convergence speed and accuracy of the estimation results. The improvement was evaluated in two clustered networks with 356 and 711 nodes. The results indicated the benefits provided by the proposed modification in terms of convergence speed and accuracy with minimum data exchanges in an iterative multi‐area distribution network. [ABSTRACT FROM AUTHOR]

The Industry 4.0 revolution is insisting strongly for use of machine learning-based processes and condition monitoring. In this paper, emphasis is given on machine learning-based approach for condition monitoring of shaft misalignment. This work highlights combined approach of artificial neural network and support vector machine for identification and measure of shaft misalignment. The measure of misalignment requires more features to be extracted under variable load conditions. Hence, primary objective is to measure misalignment with a minimum number of extracted features. This is achieved through normalization of vibration signal. An experimental setup is prepared to collect the required vibration signals. The normalized time domain nonstationary signals are given to discrete wavelet transform for features extraction. The extracted features such as detailed coefficient is considered for feature selection viz. Skewness, Kurtosis, Max, Min, Root mean square, and Entropy. The ReliefF algorithm is used to decide best feature on rank basis. The ratio of maximum energy to Shannon entropy is used in wavelet selection. The best feature is used to train machine learning algorithm. The rank-based feature selection has improved classification accuracy of support vector machine. The result obtained with the combined approach are discussed for different misalignment conditions. [ABSTRACT FROM AUTHOR]

Extreme learning machine (ELM) has been put forward for single hidden layer feedforward networks. Because of its powerful modeling ability and it needs less human intervention, the ELM algorithm has been used widely in both regression and classification experiments. However, in order to achieve required accuracy, it needs many more hidden nodes than is typically needed by the conventional neural networks. This paper considers a new efficient learning algorithm for ELM with smoothing L 0 regularization. A novel algorithm updates weights in the direction along which the overall square error is reduced the most and then this new algorithm can sparse network structure very efficiently. The numerical experiments show that the ELM algorithm with smoothing L 0 regularization has less hidden nodes but better generalization performance than original ELM and ELM with L 1 regularization algorithms. [ABSTRACT FROM AUTHOR]

Breast cancer is the most diagnosed cancer among women around the world. The development of computer-aided diagnosis tools is essential to help pathologists to accurately interpret and discriminate between malignant and benign tumors. This paper proposes the development of an automated proliferative breast lesion diagnosis based on machine-learning algorithms. We used Tabu search to select the most significant features. The evaluation of the feature is based on the dependency degree of each attribute in the rough set. The categorization of reduced features was built using five machine-learning algorithms. The proposed models were applied to the BIDMC-MGH and Wisconsin Diagnostic Breast Cancer datasets. The performance measures of the used models were evaluated owing to five criteria. The top performing models were AdaBoost and logistic regression. Comparisons with others works prove the efficiency of the proposed method for superior diagnosis of breast cancer against the reviewed classification techniques. [ABSTRACT FROM AUTHOR]