Search

With the continuous deepening of the urbanization process and the progress of science and technology, people transform nature and develop nature on a larger and larger scale, among which the most iconic transformation is a variety of building structures built by people. And with the passage of time, the building structure in the perennial wind and sun, there will be signs of "illness", if not timely treatment, it will have a huge impact on the stability and safety of the building structure. Based on this, in this paper, according to the characteristics of crack identification on the surface of concrete structure, background subtraction algorithm is selected for image noise reduction processing. Through three steps of digital image noise reduction, crack extraction and crack parameter identification, the quantitative recognition of cracks is completed and a complete system of crack parameter identification is formed. The experimental results show that the machine learning model of building structure health monitoring and damage recognition algorithm proposed in this paper has excellent statistical performance, and the relative error accuracy of recognition can be controlled within 10%. [ABSTRACT FROM AUTHOR]

The research of biomedical data is crucial for disease diagnosis, health management, and medicine development. However, biomedical data are usually characterized by high dimensionality and class imbalance, which increase computational cost and affect the classification performance of minority class, making accurate classification difficult. In this paper, we propose a biomedical data classification method based on feature selection and data resampling. First, use the minimal-redundancy maximal-relevance (mRMR) method to select biomedical data features, reduce the feature dimension, reduce the computational cost, and improve the generalization ability; then, a new SMOTE oversampling method (Spectral-SMOTE) is proposed, which solves the noise sensitivity problem of SMOTE by an improved spectral clustering method; finally, the marine predators algorithm is improved using piecewise linear chaotic maps and random opposition-based learning strategy to improve the algorithm's optimization seeking ability and convergence speed, and the key parameters of the spectral-SMOTE are optimized using the improved marine predators algorithm, which effectively improves the performance of the over-sampling approach. In this paper, five real biomedical datasets are selected to test and evaluate the proposed method using four classifiers, and three evaluation metrics are used to compare with seven data resampling methods. The experimental results show that the method effectively improves the classification performance of biomedical data. Statistical test results also show that the proposed PRMPA-Spectral-SMOTE method outperforms other data resampling methods. [ABSTRACT FROM AUTHOR]

Structure learning is the core of graph model Bayesian Network learning, and the current mainstream single search algorithm has problems such as poor learning effect, fuzzy initial network, and easy falling into local optimum. In this paper, we propose a heuristic learning algorithm HC-PSO combining the HC (Hill Climbing) algorithm and PSO (Particle Swarm Optimization) algorithm, which firstly uses HC algorithm to search for locally optimal network structures, takes these networks as the initial networks, then introduces mutation operator and crossover operator, and uses PSO algorithm for global search. Meanwhile, we use the DE (Differential Evolution) strategy to select the mutation operator and crossover operator. Finally, experiments are conducted in four different datasets to calculate BIC (Bayesian Information Criterion) and HD (Hamming Distance), and comparative analysis is made with other algorithms, the structure shows that the HC-PSO algorithm is superior in feasibility and accuracy. [ABSTRACT FROM AUTHOR]

PCB defect detection aims to identify the presence of gaps, open circuits, short circuits, and other defects in the PCB boards produced in the industry. Designing effective deep learning algorithms is crucial to finding a solution. Previously proposed PCB defect detection algorithms are limited in detecting tiny objects in high-density. Directly applying previous models to tackle PCB defect detection tasks will cause serious issues, such as missed detection and false detection. In this paper, we present a detection algorithm for tiny PCB defect targets in high-density regions to solve the above-mentioned problems. We firstly propose a detection head to detect tiny objects. Then, we design a four-channel feature fusion mechanism to fuse four different scale features and add an attention mechanism to find the attention region in scenarios with dense objects. Finally, we achieved accurate detection of tiny targets in high-density areas. Experiments were performed on the publicly available PCB defect dataset from Peking University. Our mAP@.5:.95 achieves 48.6%, while mAP@0.5 exceeds 90%. Compared with YOLOX and YOLOv5, our improved model can better localize tiny objects in high-density scenes. The experimental results certify that our model can obtain higher performance in comparison with the baseline and the state of the art. [ABSTRACT FROM AUTHOR]

Designers refer to existing product cases and innovate products to develop new products. However, when designers screen product cases, there is no user participation, which leads to the lack of user-side knowledge and emotional drive that is very important for design. Therefore, it is necessary to play the role of user emotional knowledge in promoting the whole design process. This paper proposes the concept of the positive perceptual sample, which applies the knowledge emotion integration of designers and users to the screening sample case stage at the beginning of the design process. This study is based on the lack of user-side knowledge and emotional drive of reference cases and integrates user emotion into the reference case screening process. Then, in the emotion measurement process, users' cognitive data in the screening process are obtained through the eye-brain fusion cognitive experiment. Finally, the XGBoost algorithm is used to process feature index data to realize the classification and recognition of cognitive data and applied to the positive perceptual classification of products. The results show that the classification accuracy of physiological cognitive data with user emotional representation by the XGBoost algorithm is 90.87%. The results of cognitive data classification are applied to the screening of positive perceptual samples, and the satisfaction rate is 98.35%. The results show that the method proposed in this paper provides a new source of ideas for obtaining positive perceptual samples and can be applied to new product development. [ABSTRACT FROM AUTHOR]

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

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

In this paper, we formulate the problem of estimating the resident population, i.e. correcting for over-counts in administrative register data, as a binary classification problem. We propose a solution based on machine learning algorithms. The selection and the optimisation of the best algorithm is shown to depend on the goal of prediction. We illustrate this method for two important cases of official statistics, Census resident population and survey design with minimum non-response. The performance of the algorithms, the uncertainty of estimates and of the evaluation metrics are described in detail and implemented in shared, open source code. We exemplify with the results obtained by applying this method to Icelandic register and survey data. [ABSTRACT FROM AUTHOR]

The traditional negative selection algorithm with a randomly generated hypersphere detector is unable to satisfy the development needs of continuous learning due to the inherent defects of the detector. This paper proposes a novel negative selection algorithm for hyper-rectangle detectors that overcomes the shortcomings of randomly generated hyper-sphere detectors and lays the foundation for a negative selection algorithm with continuous learning capability. It uses self-sample clusters of equal-sized hypercubes instead of self-samples for training. The hyper-rectangle detectors are generated by cutting the nonself-space along the boundary of the self-sample clusters. The state space is covered without overlapping each other by self-sample clusters and detectors. The anomaly detection performance of the proposed method was demonstrated using Iris data, vowel recognition data (Vowel), and Wisconsin Breast Cancer (BCW) data. The experimental results show that the proposed method outperforms other artificial immune algorithms and clustering algorithms under the same parameter conditions. [ABSTRACT FROM AUTHOR]

The traditional fuzzy C-means clustering technology only considers one performance Angle of image segmentation process when processing data, resulting in low accuracy of image segmentation. In this paper, the traditional FCM algorithm is analyzed, and the low clustering accuracy, noise interference and lack of flexibility and other problems are fully considered from the relationship between parameter components, non-local spatial information elements and noise sensitivity. Firstly, a distance calculation method based on robust statistics theory is proposed, which can deal with abnormal noise stably. Secondly, based on the extreme learning machine theory, the non-local spatial information coefficient is introduced to improve the identification ability of the influence factors. This method not only guarantees the anti-noise performance of the algorithm, but also preserves the image data, improving the iteration efficiency and segmentation accuracy of the algorithm. The test results show that the accuracy of the improved C-means clustering algorithm for image segmentation is 95.5%, which is compared with the traditional C-means clustering technique and other optimization algorithms. [ABSTRACT FROM AUTHOR]

In this paper, a novel hybrid approach for deterministic and probabilistic occupancy detection is proposed with a novel heuristic optimization and Back-Propagation (BP) based algorithms. Generally, PB based neural network (BPNN) suffers with the optimal value of weight, bias, trapping problem in local minima and sluggish convergence rate. In this paper, the GSA (Gravitational Search Algorithm) is implemented as a new training technique for BPNN is order to enhance the performance of the BPNN algorithm by decreasing the problem of trapping in local minima, enhance the convergence rate and optimize the weight and bias value to reduce the overall error. The experimental results of BPNN with and without GSA are demonstrated and presented for fair comparison and adoptability. The demonstrated results show that BPNNGSA has outperformance for training and testing phase in form of enhancement of processing speed, convergence rate and avoiding the trapping problem of standard BPNN. The whole study is analyzed and demonstrated by using R language open access platform. The proposed approach is validated with different hidden-layer neurons for both experimental studies based on BPNN and BPNNGSA. [ABSTRACT FROM AUTHOR]

The use of command and control (C2) servers in cyberattacks has risen considerably, attackers frequently employ the domain generated algorithm (DGA) technique to conceal their C2 servers. Various machine learning models have been suggested for binary identification of domain names as either benign or DGA domain. The Existing techniques are inefficient and have real-time detection issues and are also very data hypersensitive, therefore, they can be circumvented by the attackers. The main problem this article addresses is how to automatically detect DGA in a way that does not rely solely on reverse engineering, not strongly affected by data size, and allows detection of this DGA in real time. This paper presents DTFS-DGA model that combine neural networks models with traditional machine learning models and maintains its performance even if the data size changes to detect DGA in real time. The model uses 15 linguistics and networks features with the features extracted by long short-term memory and convolutional neural network to classify domain names using random forest and support vector machines. The comprehensive experimental findings confirm the suggested model's accuracy. To be precise, the model achieve an average accuracy of 99.8 % for the classification. [ABSTRACT FROM AUTHOR]

The XAI community is currently studying and developing symbolic knowledge-extraction (SKE) algorithms as a means to produce human-intelligible explanations for black-box machine learning predictors, so as to achieve believability in human-machine interaction. However, many extraction procedures exist in the literature, and choosing the most adequate one is increasingly cumbersome, as novel methods keep on emerging. Challenges arise from the fact that SKE algorithms are commonly defined based on theoretical assumptions that typically hinder practical applicability. This paper focuses on hypercube-based SKE methods, a quite general class of extraction techniques mostly devoted to regression-specific tasks. We first show that hypercube-based methods are flexible enough to support classification problems as well, then we propose a general model for them, and discuss how they support SKE on datasets, predictors, or learning tasks of any sort. Empirical examples are reported as well –based upon the PSyKE framework –, showing the applicability of hypercube-based methods to actual classification tasks. [ABSTRACT FROM AUTHOR]

With the development of the Intelligent Transportation System, various distributed sensors (including GPS, radar, infrared sensors) process massive data and make decisions for emergencies. Federated learning is a new distributed machine learning paradigm, in which system heterogeneity is the difficulty of fairness design. This paper designs a system heterogeneous fair federated learning algorithm (SHFF). SHFF introduces the equipment influence factor I into the optimization target and dynamically adjusts the equipment proportion with other performance. By changing the global fairness parameter θ , the algorithm can control fairness according to the actual needs. Experimental results show that, compared with the popular q-FedAvg algorithm, the SHFF algorithm proposed in this paper improves the average accuracy of the Worst 10% by 26% and reduces the variance by 61%. [ABSTRACT FROM AUTHOR]

Non-negative Tucker decomposition of tensor data has a wide range of applications in machine learning. With the non-negative constraints, tensor data can be decomposed into the mode product of a core tensor and a series of projection matrices. The core tensor usually is be regarded as the low-dimensional representation of the original tensor. The process of dimensionality reduction preserves the global properties of tensor data. But many applications in machine learning expect the continuous dependencies of data local feature to remain unchanged during dimensionality reduction. To this end, this paper proposes a local homeomorphism regularized non-negative Tucker decomposition algorithm for tensor data. The proposed method introduce a local homeomorphism regularized term to tensor non-negative Tucker decomposition constrain for effectively preserving the global and local characters of tensor. Experiments on four commonly used real data sets and six compared algorithms have demonstrate the well performance of the proposed algorithms. [ABSTRACT FROM AUTHOR]

This paper is devoted to the problem of class imbalance in machine learning, focusing on the intrusion detection of rare classes in computer networks. The problem of class imbalance occurs when one class heavily outnumbers examples from the other classes. In this paper, we are particularly interested in classifiers, as pattern recognition and anomaly detection could be solved as a classification problem. As still a major part of data network traffic of any organization network is benign, and malignant traffic is rare, researchers therefore have to deal with a class imbalance problem. Substantial research has been undertaken in order to identify these methods or data features that allow to accurately identify these attacks. But the usual tactic to deal with the imbalance class problem is to label all malignant traffic as one class and then solve the binary classification problem. In this paper, however, we choose not to group or to drop rare classes but instead investigate what could be done in order to achieve good multi-class classification efficiency. Rare class records were up-sampled using SMOTE method (Chawla et al., 2002) to a preset ratio targets. Experiments with the 3 network traffic datasets, namely CIC-IDS2017, CSE-CIC-IDS2018 (Sharafaldin et al., 2018) and LITNET-2020 (Damasevicius et al., 2020) were performed aiming to achieve reliable recognition of rare malignant classes available in these datasets. Popular machine learning algorithms were chosen for comparison of their readiness to support rare class detection. Related algorithm hyper parameters were tuned within a wide range of values, different data feature selection methods were used and tests were executed with and without over-sampling to test the multiple class problem classification performance of rare classes. Machine learning algorithms ranking based on Precision, Balanced Accuracy Score, G ¯ , and prediction error Bias and Variance decomposition, show that decision tree ensembles (Adaboost, Random Forest Trees and Gradient Boosting Classifier) performed best on the network intrusion datasets used in this research. [ABSTRACT FROM AUTHOR]

The current technology related to athlete gait recognition has shortcomings such as complicated equipment and high cost, and there are also certain problems in recognition accuracy and recognition efficiency. In order to improve the efficiency of athletes' gait recognition, this paper studies the different recognition technologies of athletes based on machine learning and spectral feature technology and applies computer vision technology to sports. Moreover, according to the calf angular velocity signal, the occurrence of leg movement is detected in real time, and the gait cycle is accurately divided to reduce the influence of the signal unrelated to the behavior on the recognition process. In addition, this study proposes a gait behavior recognition method based on event-driven strategies. This method uses a gyroscope as the main sensor and uses a wearable sensor node to collect the angular velocity signals of the legs and waist. In addition, this study analyzes the performance of the algorithm proposed by this paper through experimental research. The comparison results show that the method proposed by this paper has improved the number of recognition action types and accuracy and has certain advantages from the perspective of computation and scalability. [ABSTRACT FROM AUTHOR]

The use of intelligent college English writing training system will certainly promote the traditional teaching structure and realize a new and efficient English writing teaching mode. On the basis of machine learning and the herd effect algorithm, this article constructs an artificial intelligence-based English intelligent writing system. Moreover, in view of the shortcomings of traditional models and the characteristics of intelligent English writing, this paper proposes an improved algorithm for optimization of swarm particle walking paths. In addition, this article proposes a relative attractiveness to initialize the formation of small-scale groups based on the herd effect. Then, in the process of intelligent writing, by establishing an information sharing mechanism between groups, each group is continuously updated and reorganized according to the relative attractiveness of the group, so that the writing process can be simulated more realistically. From the experimental research, it can be seen that the model constructed in this paper has a certain degree of intelligence. [ABSTRACT FROM AUTHOR]

The communication energy efficiency of the English intelligent learning system is affected by many factors. In order to improve the system operation efficiency, it is necessary to carry out analysis from the perspective of the mobile edge server and the system structure. However, there are still many research gaps and deficiencies. Based on a dynamic and heterogeneous English intelligent learning system, this paper designs an adaptive offloading decision algorithm ADCO and an online spring slide task scheduling algorithm SSLS. Moreover, this paper has proposed corresponding solutions to the computational offloading problem and online scheduling problem in a dynamic environment and compared and analyzed the performance of this research algorithm through simulation experiments. The research results show that the method proposed in this paper has certain effects. [ABSTRACT FROM AUTHOR]

With the continuous progress of the times, the development of college education is also constantly tending to enrich and diversify. In the course of curriculum setting in many colleges and universities, more and more attention is paid to the teaching of computer courses for college students. In the course of setting up and teaching, we still follow the traditional teaching mode and do not pay more attention to students' practical practice. By observing the computer course materials selected by many colleges and universities for students, we can see that most of the textbooks still focus on arranging some exercises from the point of view that science and engineering are students, and lack the basic knowledge of the curriculum. Because the understanding and research of computer course is not deep enough, the teaching effect obtained since the course is not ideal. By studying the relevant knowledge of machine learning and some important problems in the development of neural network algorithm theory, this paper puts forward some viewpoints based on the current curriculum system in colleges and universities in order to improve the learning quality of computer courses. And hope to build a variant learning model to improve students' interest in computer courses. The exploration and inference of some knowledge in this paper are mostly my own views, some places are not professional enough, the majority of experts and scholars can criticize and correct at will. [ABSTRACT FROM AUTHOR]

In order to improve the evaluation effect of classroom education, this paper proposes the MFO intelligent optimization algorithm based on the idea of machine learning, and builds the classroom education effect evaluation model based on the MFO intelligent optimization algorithm. Moreover, this paper uses a logarithmic spiral to simulate the path of the moth to the flame and invert the pending parameters in the mathematical model, and adds vertical and horizontal algorithms and chaos operators on this basis. The crisscross algorithm allows different moth individuals and the same moth to perform cross calculations with different computing dimensions to increase the diversity of moth populations, so that moths in the search space can traverse the entire search space as much as possible to find a better solution. Moreover, in view of the problems of BP neural network such as low fitting accuracy, this paper applies the CCMFO algorithm to improve the BP neural network to form the CCMFO-BP algorithm, and improves the weight and threshold update process of the BP neural network to make the network operation more efficient and accurate. Finally, this paper designs experiments to analyze the performance of the model constructed in this paper. The research results show that the model constructed in this paper meets the expected requirements. [ABSTRACT FROM AUTHOR]

In order to improve the effect of the teaching method evaluation model, based on the grid model, this paper constructs an artificial intelligence model based on the grid model. Moreover, this paper proposes a hexahedral grid structure simplification method based on weighted sorting, which comprehensively sorts the elimination order of candidate base complexes in the grid with three sets of sorting items of width, deformation and price improvement. At the same time, for the elimination order of basic complex strings, this paper also proposes a corresponding priority sorting algorithm. In addition, this paper proposes a smoothing regularization method based on the local parameterization method of the improved SLIM algorithm, which uses the regularized unit as the reference unit in the local mapping in the SLIM algorithm. Furthermore, this paper proposes an adaptive refinement method that maintains the uniformity of the grid and reduces the surface error, which can better slow down the occurrence of geometric constraints caused by insufficient number of elements in the process of grid simplification. Finally, this paper designs experiments to study the performance of the model. The research results show that the model constructed in this paper is effective. [ABSTRACT FROM AUTHOR]

In the era of artificial intelligence, the traditional English teaching model can no longer meet the needs of society, and online English teaching has become the main development direction of English teaching in the future. In order to study the efficiency of English online teaching system, based on machine learning algorithms, this paper constructs an efficiency improvement model of English online teaching system. Moreover, in view of the shortcomings of current situation estimation algorithms that cannot coexist in terms of flexibility, causal interpretability and complexity, this paper proposes a biological immune algorithm framework that uses GBDT algorithm coding, which objectively and accurately shows the spread of the situation. In addition, for the problem that redundant information between features will reduce the accuracy of the framework, this paper proposes a streaming feature selection algorithm based on bagging learning. Finally, this paper designs a control experiment to analyze the performance of the model. The research results show that the model constructed in this paper is highly reliable. [ABSTRACT FROM AUTHOR]

Machine learning-based network intrusion detection systems have demonstrated state-of-the-art accuracy in flagging malicious traffic. However, machine learning has been shown to be vulnerable to adversarial examples, particularly in domains such as image recognition. In many threat models, the adversary exploits the unconstrained nature of images–the adversary is free to select some arbitrary amount of pixels to perturb. However, it is not clear how these attacks translate to domains such as network intrusion detection as they contain domain constraints, which limit which and how features can be modified by the adversary. In this paper, we explore whether the constrained nature of networks offers additional robustness against adversarial examples versus the unconstrained nature of images. We do this by creating two algorithms: (1) the Adapative-JSMA, an augmented version of the popular JSMA which obeys domain constraints, and (2) the Histogram Sketch Generation which generates adversarial sketches: targeted universal perturbation vectors that encode feature saliency within the envelope of domain constraints. To assess how these algorithms perform, we evaluate them in a constrained network intrusion detection setting and an unconstrained image recognition setting. The results show that our approaches generate misclassification rates in network intrusion detection applications that were comparable to those of image recognition applications (greater than 95%). Our investigation shows that the constrained attack surface exposed by network intrusion detection systems is still sufficiently large to craft successful adversarial examples – and thus, network constraints do not appear to add robustness against adversarial examples. Indeed, even if a defender constrains an adversary to as little as five random features, generating adversarial examples is still possible. [ABSTRACT FROM AUTHOR]

Intelligent education is an intelligent education platform that integrates correct education concept and Internet of things, big data, cloud computing and other technologies. This paper hopes to use the construction of the composition scoring model to further construct a computer scoring system for college English translation, which can give students a translation score and give feedback evaluation based on the quality of the translation. In this paper, according to the knowledge of the existing automatic scoring system at home and abroad, the feature selection method (TF-IDF, IG, CHI) is discussed and analyzed. Moreover, this paper studies the impact of our composition automatic scoring from the perspective of linguistics. In addition, this paper uses the multiple regression method to evaluate the final score. The features considered in this paper mainly include simple linguistic features and complex linguistic features. Finally, performance analysis of the algorithm model is performed by setting up a control experiment. The research results show that the proposed algorithm model has certain effects. The future trend is to form adult auxiliary machines through various human-computer interaction technologies, which will reshape future learning and education and form a new teaching form. [ABSTRACT FROM AUTHOR]

Most of the research on stressors is in the medical field, and there are few analysis of athletes' stressors, so it can not provide reference for the analysis of athletes' stressors. Based on this, this study combines machine learning algorithms to analyze the pressure source of athletes' stadium. In terms of data collection, it is mainly obtained through questionnaire survey and interview form, and it is used as experimental data after passing the test. In order to improve the performance of the algorithm, this paper combines the known K-Means algorithm with the layering algorithm to form a new improved layered K-Means algorithm. At the same time, this paper analyzes the performance of the improved hierarchical K-Means algorithm through experimental comparison and compares the clustering results. In addition, the analysis system corresponding to the algorithm is constructed based on the actual situation, the algorithm is applied to practice, and the user preference model is constructed. Finally, this article helps athletes find stressors and find ways to reduce stressors through personalized recommendations. The research shows that the algorithm of this study is reliable and has certain practical effects and can provide theoretical reference for subsequent related research. [ABSTRACT FROM AUTHOR]

Fuzzy English recognition is affected by many factors, which leads to certain accuracy problems in intelligent recognition results. In order to improve the automatic recognition efficiency of fuzzy English, based on machine learning technology, this study constructs a neural network model. At the same time, this paper analyzes the research status and existing problems of handwritten character recognition, analyzes the model, and adopts multiple modules for automatic English recognition. In addition, the system is built on the basis of algorithms and model support, which makes fuzzy English recognition intelligent. Finally, in order to study the algorithm and model performance, the fuzzy English recognition is carried out through experiments. The research shows that the model constructed in this paper has certain recognition effect, which can be applied to practice, and can provide theoretical reference for subsequent related research. [ABSTRACT FROM AUTHOR]

The badminton movement speed is fast, and the movement is complicated. Therefore, it is difficult to effectively recognize the athlete's movement through the monitoring level in the competition and training, which makes it difficult for the athlete to effectively improve his skill. In order to effectively improve the training effect and the quality of the athletes, this study uses badminton as the research object, analyzes the sports characteristics research algorithm through literature review, and finds the shortcomings of traditional algorithms. At the same time, this paper combines the actual situation to improve the algorithm and combines GMM and HMM to builds the GMM-HMM model. In addition, this paper uses the Baum-Welch unsupervised learning algorithm for data processing, and based on the learning machine training, the recognition results are obtained. Finally, in order to verify the validity of the model, this study uses the mobile phone badminton action as the data foundation and performs training recognition in the model to summarize the recognition results. The research shows that the algorithm has good performance and can meet the actual needs and can be used as a reference for the subsequent related research corporal punishment theory. [ABSTRACT FROM AUTHOR]

Artificial intelligence speech recognition mostly judges the accuracy of grammar or sentence in the detection of pronunciation error, but has little research on pronunciation judgment, so it cannot effectively correct the pronunciation. This study analyzes the application of image target recognition in English learning task. Task-based approach emphasizes the process of English learning, not the result, the purposeful communication and meaning expression, encourages learners to open their mouths, and emphasizes that English language learning activities and their tasks are realistic in life. In addition, this paper introduces the DNN adaptive technique based on KL divergence regularization to adapt the acoustic model. Finally, this paper uses the experimental contrast method to compare and analyze the algorithm of this research with the traditional algorithm. The research shows that the recognition ability of the algorithm for confusing phonemes is improved than that of traditional algorithms, and this conclusion provides a powerful result for the introduction of error correction algorithms into education networks. By using the platform of autonomous learning center, students can improve their English level by completing the tasks chosen by teachers or by themselves and through training. [ABSTRACT FROM AUTHOR]

It is of great theoretical significance and practical value to analyze the characteristics of users and behaviors in social networks, to study the personalized recommendation algorithms of users, to explore the inherent laws of event development, and to predict the movement of information or opinions. This paper analyzes the Weibo behavior through machine learning and cloud computing technology. Moreover, this paper studies and analyzes traditional network algorithms, and proposes a microblog recommendation algorithm based on statistical features. At the same time, the research content of this paper focuses on microblog contents, user characteristics, user preferences, and influence levels. The algorithm has simple structure and strong computing performance and performs feature data mining through cloud computing big data method, which is suitable for online mining microblog behavior. In addition, the performance of the algorithm was analyzed by design comparison experiments. The research indicates that the research algorithm proposed in this paper has certain advantages, which can be applied to network behavior analysis mining, and can provide theoretical reference for subsequent related research. [ABSTRACT FROM AUTHOR]

At present, the automatic attendance mode of distance education is not conducive to the confirmation and analysis of information after class. In order to study the effective automatic recognition algorithm of remote education classroom, this study takes the educational classroom of intelligent innovation and entrepreneurship of Internet + as an example for analysis. Moreover, this paper adopts facial features as the basis of recognition, establishes corresponding positioning points, and constructs precise positioning methods for real-time feature capture. At the same time, the ASM algorithm is used to extract facial features, and the algorithm is improved to improve the extraction effect. In addition, this paper proposes Gabor-wavelet packet set and Gabor beamlet set for auxiliary recognition, which improves the recognition rate. Finally, this paper designs experiments to analyze the performance of the algorithm of this study. The results show that the proposed algorithm has certain practical effects and can provide theoretical reference for subsequent related research. [ABSTRACT FROM AUTHOR]

Recommender systems apply machine learning and data mining techniques for filtering unseen information, and they can provide an opportunity to predict whether a user would be interested in a given item. The main types of recommender systems are collaborative filtering (CF) and content-based filtering, which suffer from scalability and data sparsity resulting in poor quality recommendations and reduced coverage. There are two incremental algorithms based on Singular Value Decomposition (SVD) with high scalability for recommender systems which are named the incremental SVD algorithm and incremental Approximating the Singular Value Decomposition (ApproSVD) algorithm. In both mentioned methods, the estimated value of rank for approximating the recommender systems' data matrix is chosen experimentally in the related literature. In this paper, we investigate the role of singular values for estimating a more reliable amount of rank in the mentioned dimensionality reduction techniques to improve the recommender systems' performance. In other words, we offered a strategy for choosing the optimal rank that approximates the data matrix more accurately in incremental algorithms with the help of singular values. The numerical results illustrate that the suggested strategy improves the accuracy of the recommendations and run times of both algorithms when employs for Movielens, Netflix, and Jester dataset. [ABSTRACT FROM AUTHOR]

As national statistical offices (NSOs) modernize, interest in integrating machine learning (ML) into official statisticians' toolbox is growing. Two challenges to such an integration are the potential loss of transparency from using "black-boxes" and the need to develop a quality framework. In 2019, the High-Level Group for the Modernisation of Official Statistics (HLG-MOS) launched a project on machine learning with one of the objectives being to address these two challenges. One of the outputs of the HLG-MOS project is a Quality Framework for Statistical Algorithms (QF4SA). While many quality frameworks exist, they have been conceived with traditional methods in mind, and they tend to target statistical outputs. Currently, machine learning methods are being looked at for use in processes producing intermediate outputs, which lead to a final statistical output. Therefore, the QF4SA does not replace existing quality frameworks; it complements them. As the QF4SA targets intermediate outputs and not necessarily the final statistical output, it should be used in conjunction with existing quality frameworks to ensure that high-quality outputs are produced. This paper presents the QF4SA, as well as some recommendations for NSOs considering the use of machine learning in the production of official statistics. [ABSTRACT FROM AUTHOR]

Nowadays, the existence of continuous optimization problems has led researchers to come up with a variety of methods to solve continues optimization problems. The metaheuristic algorithms are one of the most popular and common ways to solve continuous optimization problems. Firefly Algorithm (FA) is a successful metaheuristic algorithm for solving continuous optimization problems; however, although this algorithm performs very well in local search, it has weaknesses and disadvantages in finding solution in global search. This problem has caused this algorithm to be trapped locally and the balance between exploration and exploitation cannot be well maintained. In this paper, three different approaches based on the Dragonfly Algorithm (DA) processes and the OBL method are proposed to improve exploration, performance, efficiency and information-sharing of the FA and to avoid the FA getting stuck in local trap. In the first proposed method (FADA), the robust processes of DA are used to improve the exploration, performance and efficiency of the FA; and the second proposed method (OFA) uses an Opposition-Based Learning (OBL) algorithm to accelerate the convergence and exploration of the FA. Finally, in the third approach, which is referred to as OFADA in this paper, a hybridization of the hybrid FADA and the OBL method is used to improve the convergence and accuracy of the FA. The three proposed methods were implemented on functions with 2, 4, 10, and 30 dimensions. The results of the implementation of these three proposed methods showed that OFADA approach outperformed the other two proposed methods and other compared metaheuristic algorithms in different dimensions. In addition, all the three proposed methods provided better results compared with other metaheuristic algorithms on small-dimensional functions. However, performance of many metaheuristic algorithms decreased with increasing the dimensions of the functions. While the three proposed methods, in particular the OFADA approach, have been able to make better converge with the higher-dimensional optimization functions toward the target in comparison with other metaheuristic algorithms, and to show a high performance. [ABSTRACT FROM AUTHOR]

Imbalanced dataset classification is challenging because of the severely skewed class distribution. The traditional machine learning algorithms show degraded performance for these skewed datasets. However, there are additional characteristics of a classification dataset that are not only challenging for the traditional machine learning algorithms but also increase the difficulty when constructing a model for imbalanced datasets. Data complexity metrics identify these intrinsic characteristics, which cause substantial deterioration of the learning algorithms' performance. Though many research efforts have been made to deal with class noise, none of them focused on imbalanced datasets coupled with other intrinsic factors. This paper presents a novel hybrid pre-processing algorithm focusing on treating the class-label noise in the imbalanced dataset, which suffers from other intrinsic factors such as class overlapping, non-linear class boundaries, small disjuncts, and borderline examples. This algorithm uses the wCM complexity metric (proposed for imbalanced dataset) to identify noisy, borderline, and other difficult instances of the dataset and then intelligently handles these instances. Experiments on synthetic datasets and real-world datasets with different levels of imbalance, noise, small disjuncts, class overlapping, and borderline examples are conducted to check the effectiveness of the proposed algorithm. The experimental results show that the proposed algorithm offers an interesting alternative to popular state-of-the-art pre-processing algorithms for effectively handling imbalanced datasets along with noise and other difficulties. [ABSTRACT FROM AUTHOR]

In classification, a decision tree is a common model due to its simple structure and easy understanding. Most of decision tree algorithms assume all instances in a dataset have the same degree of confidence, so they use the same generation and pruning strategies for all training instances. In fact, the instances with greater degree of confidence are more useful than the ones with lower degree of confidence in the same dataset. Therefore, the instances should be treated discriminately according to their corresponding confidence degrees when training classifiers. In this paper, we investigate the impact and significance of degree of confidence of instances on the classification performance of decision tree algorithms, taking the classification and regression tree (CART) algorithm as an example. First, the degree of confidence of instances is quantified from a statistical perspective. Then, a developed CART algorithm named C_CART is proposed by introducing the confidence of instances into the generation and pruning processes of CART algorithm. Finally, we conduct experiments to evaluate the performance of C_CART algorithm. The experimental results show that our C_CART algorithm can significantly improve the generalization performance as well as avoiding the over-fitting problem to a certain extend. [ABSTRACT FROM AUTHOR]

Multiclass data classification, where the goal is to segment data into classes, is an important task in machine learning. However, the task is challenging due to reasons including the scarcity of labeled training data; in fact, most machine learning algorithms require a large amount of labeled examples to perform well. Moreover, the accuracy of a classifier can be dependent on the accuracy of the training labels which can be corrupted. In this paper, we present an efficient and unconditionally stable semi-supervised graph-based method for multiclass data classification which requires considerably less labeled training data to accurately classify a data set compared to current techniques, due to properties such as the embedding of data into a similarity graph. In particular, it performs very well and more accurately than current approaches in the common scenario of few labeled training elements. Morever, we show that the algorithm performs with good accuracy even with a large number of mislabeled examples and is also able to incorporate class size information. The proposed method uses a modified auction dynamics technique. Extensive experiments on benchmark datasets are performed and the results are compared to other methods. [ABSTRACT FROM AUTHOR]

Detecting vehicle at night is critical to both assistant driving systems and autonomous driving systems. In this paper, we propose a deep network scheme assisted by light information with good generalization to detect vehicle at night. Our approach is divided into two branches, the object stream and the pixel stream. The object stream generates a batch of bounding boxes, and the pixel stream utilizes the vehicle light information to calibrate the bounding boxes of the object stream. In the object stream, we propose a new structure, Direction Attention Pooling (DAP), to improve the accuracy of the prior boxes. DAP leads into attention mechanism. The feature maps obtained from backbone network is divided into two branches. One branch obtains direction perception information through IRNN layer, and the other branch learns attention weights. The weights are multiplied with the direction perception features in an element-wise manner. In the pixel stream, we propose a corner localization algorithm based on Bayes to get more accurate corners with the vehicle light pixels. The locations of the corners are considered as a discrete random variable. When the mask of the object is known, solving the probability distribution of the corner of the object is the next step. The corners with the highest probability is the correct corner. On the nighttime vehicle detection datasets CHUK and SYSU, our method achieves the accuracy of 97.2% and 96.86%, which outperforms other state-of-the-art methods by at least 0.31% and 0.34%. [ABSTRACT FROM AUTHOR]

In this paper, a problem of scheduling jobs with different sizes and fuzzy processing times (FPT) on non-identical parallel batch machines to minimize makespan is investigated. Moreover, the processing time (PT) of each batch is subject to the location-based learning and total-PT-based deterioration effect. Since this is an NP-hard combinatorial optimization problem, an improved intelligent algorithm based on fruit fly optimization algorithm (IFOA) is proposed. To verify the performance of the algorithm, the IFOA is compared with three state-of-the-art algorithms. The comparative results demonstrate that the proposed IFOA outperforms the other compared algorithms. [ABSTRACT FROM AUTHOR]

Bagging has attracted much attention due to its simple implementation and the popularity of bootstrapping. By learning diverse classifiers from resampled datasets and averaging the outcomes, bagging investigates the possibility of achieving substantial classification performance of the base classifier. Diversity has been recognized as a very important characteristic in bagging. This paper presents an efficient and effective bagging approach, that learns a set of independent Bayesian network classifiers (BNCs) from disjoint data subspaces. The number of bits needed to describe the data is measured in terms of log likelihood, and redundant edges are identified to optimize the topologies of the learned BNCs. Our extensive experimental evaluation on 54 publicly available datasets from the UCI machine learning repository reveals that the proposed algorithm achieves a competitive classification performance compared with state-of-the-art BNCs that use or do not use bagging procedures, such as tree-augmented naive Bayes (TAN), k -dependence Bayesian classifier (KDB), bagging NB or bagging TAN. [ABSTRACT FROM AUTHOR]

Breast cancer is a severe disease for women health, however, with expensive diagnostic cost or obsolete medical technique, many patients are hard to obtain prompt medical treatment. Thus, efficient detection result of breast cancer while lower medical cost may be a promising way to protect women health. Breast cancer detection using all features will take a lot of time and computational resources. Thus, in this paper, we proposed a novel framework with surrogate-assisted firefly algorithm (FA) for breast cancer detection (SFA-BCD). As an advanced evolutionary algorithm (EA), FA is adopted to make feature selection, and the machine learning as classifier identify the breast cancer. Moreover, the surrogate model is utilized to decrease computation cost and expensive computation, which is the approximation function built by offline data to the real object function. The comprehensive experiments have been conducted under several breast cancer dataset derived from UCI. Experimental results verified that the proposed framework with surrogate-assisted FA significantly reduced the computation cost. [ABSTRACT FROM AUTHOR]

Compared with the traditional negative selection algorithms produce detectors randomly in whole state space, the boundary-fixed negative selection algorithm (FB-NSA) non-randomly produces a layer of detectors closely surrounding the self space. However, the false alarm rate of FB-NSA is higher than many anomaly detection methods. Its detection rate is very low when normal data close to the boundary of state space. This paper proposed an improved FB-NSA (IFB-NSA) to solve these problems. IFB-NSA enlarges the state space and adds auxiliary detectors in appropriate places to improve the detection rate, and uses variable-sized training samples to reduce the false alarm rate. We present experiments on synthetic datasets and the UCI Iris dataset to demonstrate the effectiveness of this approach. The results show that IFB-NSA outperforms FB-NSA and the other anomaly detection methods in most of the cases. [ABSTRACT FROM AUTHOR]

Classroom teaching in the context of artificial intelligence needs to be combined with modern intelligent recognition technology to improve classroom teaching efficiency. In order to study the auxiliary teaching system for classroom student management, this article is based on neural network technology and emotional feature recognition algorithm, and according to the actual situation of classroom teaching, an intelligent analysis system for classroom student status is constructed. The system simulates the RFID mode to tag the students. Moreover, this article sets the system function module according to the actual teaching management needs and designs the learning algorithm of the quantitative assessment model. In addition, this study uses machine learning methods to design the quantitative evaluation index system, logistic regression scoring algorithm and model training algorithm. Finally, this study uses the neural network algorithm as the comparison algorithm to verify the performance of the constructed model and analyzes the comparison results through chart comparison. The research results show that the model proposed in this paper has good performance and can be applied to practical classrooms. [ABSTRACT FROM AUTHOR]

In this paper, we propose a new iterative learning control algorithm for sensor faults in nonlinear systems. The algorithm does not depend on the initial value of the system and is combined with the open-loop D-type iterative learning law. We design a period that shortens as the number of iterations increases. During this period, the controller corrects the state deviation, so that the system tracking error converges to the boundary unrelated to the initial state error, which is determined only by the system's uncertainty and interference. Furthermore, based on the λ norm theory, the appropriate control gain is selected to suppress the tracking error caused by the sensor fault, and the uniform convergence of the control algorithm and the boundedness of the error are proved. The simulation results of the speed control of the injection molding machine system verify the effectiveness of the algorithm. [ABSTRACT FROM AUTHOR]

Cognitive Developmental Robotics relies on lifelong open-ended learning processes, where mechanisms are needed to allow the robot to self-discover and self-select goals as well as to self-define its state space evaluation with regards to them. Thus, this paper addresses the problem of finding and using goals in continuous state spaces and automatically obtaining sub-goal hierarchies that allow autonomous development. In particular, the main purpose of this paper is to propose a new approach to the creation of utility models based on the concept of separable utility regions (SURs), which reduce the complexity of standard value function like utility models. These regions exhibit a correlation between the expected utility and the response of one sensor of the robot. Once they are discovered, the evaluation of the candidate states is only based on the changes of one sensor, which provides a strong independence from noise or dynamism in the utility models. A non-static variation of the classical collect-a-ball scenario and a robot gathering problem were used to test this approach in simulation and on real robots in order to identify goals and sub-goals in an autonomous way. The results confirm the good response of the method as a highly promising approach towards autonomous learning of continuous domains in cognitive robotics. [ABSTRACT FROM AUTHOR]

The paper reviews classification algorithms based on Gene Expression Programming (GEP) used for mining the real-life datasets. Our aim is to show, chronologically, most important developments as well as the current state-of-the-art in the area of GEP-based classifiers, with a view to attract further real life applications. We begin with reviewing approaches to building basic, stand alone, GEP classifiers and eventually, combining them into the classifier ensemble. In the following part of the paper we describe and illustrate with example several hybrid solutions where GEP is integrated with other methods. Next, we review specialized and dedicated methods including multiple criteria and incremental GEP-based classification tools. Final part of the paper reviews specialized GEP-based classifiers used to mine the real-life datasets. [ABSTRACT FROM AUTHOR]

Multigranulation rough set (MGRS) theory provides an effective manner for the problem solving by making use of multiple equivalence relations. As the information systems always dynamically change over time due to the addition or deletion of multiple objects, how to efficiently update the approximations in multigranulation spaces by making fully utilize the previous results becomes a crucial challenge. Incremental learning provides an efficient manner because of the incorporation of both the current information and previously obtained knowledge. In spite of the success of incremental learning, well-studied findings performed to update approximations in multigranulation spaces have relatively been scarce. To address this issue, in this paper, we propose matrix-based incremental approaches for updating approximations from the perspective of multigranulation when multiple objects vary over time. Based on the matrix characterization of multigranulation approximations, the incremental mechanisms for relevant matrices are systematically investigated while adding or deleting multiple objects. Subsequently, in accordance with the incremental mechanisms, the corresponding incremental algorithms for maintaining multigranulation approximations are developed to reduce the redundant computations. Finally, extensive experiments on eight datasets available from the University of California at Irvine (UCI) are conducted to verify the effectiveness and efficiency of the proposed incremental algorithms in comparison with the existing non-incremental algorithm. [ABSTRACT FROM AUTHOR]

Protecting information from manipulation is important challenge in current days. Digital images are one of the most popular information representation. Images could be used in several fields such as military, social media, security purposes, intelligence fields, evidences in courts, and newspapers. Digital image forgeries mean adding unusual patterns to the original images that cause a heterogeneity manner in form of image properties. Copy move forgery is one of the hardest types of image forgeries to be detected. It is happened by duplicating part or section of the image then adding again in the image itself but in another location. Forgery detection algorithms are used in image security when the original content is not available. This paper illustrates a new approach for Copy Move Forgery Detection (CMFD) built basically on deep learning. The proposed model is depending on applying (Convolution Neural Network) CNN in addition to Convolutional Long Short-Term Memory (CovLSTM) networks. This method extracts image features by a sequence number of Convolutions (CNVs) layers, ConvLSTM layers, and pooling layers then matching features and detecting copy move forgery. This model had been applied to four aboveboard available databases: MICC-F220, MICC-F2000, MICC-F600, and SATs-130. Moreover, datasets have been combined to build new datasets for all purposes of generalization testing and coping with an over-fitting problem. In addition, the results of applying ConvLSTM model only have been added to show the differences in performance between using hybrid ConvLSTM and CNN compared with using CNN only. The proposed algorithm, when using number of epoch's equal 100, gives high accuracy reached to 100% for some datasets with lowest Testing Time (TT) time nearly 1 second for some datasets when compared with the different previous algorithms. [ABSTRACT FROM AUTHOR]

Background: The quantitative features of a capnogram signal are important clinical metrics in assessing pulmonary function. However, these features should be quantified from the regular (artefact-free) segments of the capnogram waveform.Objective: This paper presents a machine learning-based approach for the automatic classification of regular and irregular capnogram segments.Methods: Herein, we proposed four time- and two frequency-domain features experimented with the support vector machine classifier through ten-fold cross-validation. MATLAB simulation was conducted on 100 regular and 100 irregular 15 s capnogram segments. Analysis of variance was performed to investigate the significance of the proposed features. Pearson's correlation was utilized to select the relatively most substantial ones, namely variance and the area under normalized magnitude spectrum. Classification performance, using these features, was evaluated against two feature sets in which either time- or frequency-domain features only were employed.Results: Results showed a classification accuracy of 86.5%, which outperformed the other cases by an average of 5.5%. The achieved specificity, sensitivity, and precision were 84%, 89% and 86.51%, respectively. The average execution time for feature extraction and classification per segment is only 36 ms.Conclusion: The proposed approach can be integrated with capnography devices for real-time capnogram-based respiratory assessment. However, further research is recommended to enhance the classification performance. [ABSTRACT FROM AUTHOR]

A robust disruption prediction system is mandatory in a Tokamak control system as the disruption can cause malfunctioning of the plasma-facing components and impair irrecoverable structural damage to the vessel. To mitigate the disruption, in this article, a data-driven based disruption predictor is developed using an ensemble technique. The ensemble algorithm classifies disruptive and non-disruptive discharges in the GOLEM Tokamak system. Ensemble classifiers combine the predictive capacity of several weak learners to produce a single predictive model and are utilized both in supervised and unsupervised learning. The resulting final model reduces the bias, minimizes variance and is unlikely to over-fit when compared to the individual model from a single algorithm. In this paper, popular ensemble techniques such as Bagging, Boosting, Voting, and Stacking are employed on the time-series Tokamak dataset, which consists of 117 normal and 70 disruptive shots. Stacking ensemble with REPTree (Reduced Error Pruning Tree) as a base learner and Multi-response Linear Regression as meta learner produced better results in comparison to other ensembles. A comparison with the widely employed stand-alone machine learning algorithms and ensemble algorithms are illustrated. The results show the excellent performance of the Stacking model with an F1 score of 0.973. The developed predictive model would be capable of warning the human operator with feedback about the feature(s) causing the disruption. [ABSTRACT FROM AUTHOR]