Search

As computer and multimedia technology advances and as the variety of knowledge display forms expands, there are more ways for people to obtain knowledge and information. The best course in musicology is voice performance. A crucial issue is how to select and categorize valuable curriculum materials of varying quality levels. This paper implements an automatic classification and integration algorithm for vocal performance learning materials using machine learning technology and tests it on the corresponding dataset, beginning with multidimensional association rule mining technology and the premise that multimedia data contain numerous useful characteristics. Experiments demonstrate the classification precision and data integration capacity of the proposed algorithm. Vocal performance is the most engaging course in musicology. To cultivate corresponding talents, we can rely on college and university offline courses and the rapidly developing multimedia technology to train talents online. An important topic is how to efficiently select and classify curriculum materials of varying quality in order to provide them to students with different learning needs. We can achieve the automatic classification of the course content by leveraging the superior learning capabilities of artificial intelligence and machine learning technology. Consequently, this paper implements an automatic classification and integration algorithm for vocal performance learning materials using machine learning-related technology and conducts an experimental test on the corresponding dataset, beginning with multidimensional association rule mining technology and the perspective that multimedia information itself contains a large number of useful characteristics. Experiments demonstrate that the proposed algorithm has a high level of classification accuracy and data integration capability. [ABSTRACT FROM AUTHOR]

Irony recognition is an important research direction in text sentiment analysis, which contributes to discover ironic tone to judge text emotion correctly. The object of this paper is the application of deep learning to irony recognition, and the research aims to solve the problem that existing machine learning algorithms have difficulty in discriminating ironic tones. Aiming at the irony recognition of Chinese social comments, DC-BiGRU-CNN is proposed from the perspective of structural optimization rather than a text vectorization mechanism point of view, which is a dual-channel CNN combined with BiGRU, and incorporates attention mechanism and multigranularity convolutional neural network as the main framework. This paper first briefly discusses the difficulties of irony recognition and provides an overview of existing text sentiment analysis algorithms. This is followed by a detailed discussion of DC-BiGRU-CNN. Furtherly, it is compared with the main irony recognition methods on a social comment dataset containing Chinese ironic comments, and the experimental results show that DC-BiGRU-CNN can improve the accuracy of irony recognition. [ABSTRACT FROM AUTHOR]

The K-Nearest Neighbor (KNN) algorithm is a classical machine learning algorithm. Most KNN algorithms are based on a single metric and do not further distinguish between repeated values in the range of K values, which can lead to a reduced classification effect and thus affect the accuracy of fault diagnosis. In this paper, a hybrid metric-based KNN algorithm is proposed to calculate a composite metric containing distance and direction information between test samples, which improves the discriminability of the samples. In the experiments, the hybrid metric KNN (HM-KNN) algorithm proposed in this paper is compared and validated with a variety of KNN algorithms based on a single distance metric on six data sets, and an HM-KNN application method is given for the forward gait stability control of a bipedal robot, where the abnormal motion is considered as a fault, and the distribution of zero moment points when the abnormal motion is generated is compared. The experimental results show that the algorithm has good data differentiation and generalization ability for different data sets, and it is feasible to apply it to the walking stability control of bipedal robots based on deep neural network control. [ABSTRACT FROM AUTHOR]

In order to achieve a quantitative analysis of the training effects of athletes, this paper combines machine learning algorithms to evaluate and analyze athletes' training effects and analyzes the evaluation algorithms based on machine learning interpretable models. Moreover, after analyzing a variety of algorithms, this paper selects an intelligent evaluation method suitable for this model and builds an intelligent evaluation system based on the current athletes' training needs. In addition, this paper verifies the effect of the system with the support of intelligent algorithms and experiments. The experimental research results show that the athlete training effect evaluation system based on the machine learning algorithm proposed in this paper has good results, and it can be applied to subsequent athletes' sports training evaluation. [ABSTRACT FROM AUTHOR]

In the order picking process of the warehouse center, considering the rapid increase in the volume of orders arriving at the picking center at the time of the promotional festival, a hybrid operation mode with multiple picking tables is used to meet the picking requirements of the huge number of real-time orders. Therefore, in this paper, a hybrid picking mode is proposed, taking into account both the idle degree of picking stations and their order item centers of gravity, and a new reinforcement learning algorithm embedding mechanism (PRL) with placeholder control is designed to solve the problem of a huge number of real-time item orders arriving at the picking center system on promotional holidays and in inconsistent quantities, and numerical simulations are performed for this algorithm. The experimental results show that the PRL algorithm in hybrid picking mode can handle a huge number of orders simultaneously and improve picking efficiency effectively. [ABSTRACT FROM AUTHOR]

With the rapid development of the Internet, various forms of network attack have emerged, so how to detect abnormal behavior effectively and to recognize their attack categories accurately have become an important research subject in the field of cyberspace security. Recently, many hot machine learning-based approaches are applied in the Intrusion Detection System (IDS) to construct a data-driven model. The methods are beneficial to reduce the time and cost of manual detection. However, the real-time network data contain an ocean of redundant terms and noises, and some existing intrusion detection technologies have lower accuracy and inadequate ability of feature extraction. In order to solve the above problems, this paper proposes an intrusion detection method based on the Decision Tree-Recursive Feature Elimination (DT-RFE) feature in ensemble learning. We firstly propose a data processing method by the Decision Tree-Based Recursive Elimination Algorithm to select features and to reduce the feature dimension. This method eliminates the redundant and uncorrelated data from the dataset to achieve better resource utilization and to reduce time complexity. In this paper, we use the Stacking ensemble learning algorithm by combining Decision Tree (DT) with Recursive Feature Elimination (RFE) methods. Finally, a series of comparison experiments by cross-validation on the KDD CUP 99 and NSL-KDD datasets indicate that the DT-RFE and Stacking-based approach can better improve the performance of the IDS, and the accuracy for all kinds of features is higher than 99%, except in the case of U2R accuracy, which is 98%. [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]

In this paper, a fault-tolerant control system based on back-stepping integral sliding mode controller (BISMC) is designed and analyzed for both nonlinear translational and rotational subsystems of the quadrotor unmanned aerial vehicles (UAVs). The novelty of this paper is about combination of a classic controller with a repetitive algorithm to reduce the response time to actuator faults and have better tracking performance. The actuator fault is defined based on the loss of effectiveness and bias fault. Next, the iterative learning control algorithm (ILCA) is used to compensate for the unknown fault input according to previous recorded experiences. In the normal condition (without actuators fault), BISMC can force the actual trajectories toward the desired commands and reduce chattering about control signals, and in the presence of the actuators fault or external disturbances, the mentioned learning algorithm can incline the accuracy of the tracking performance and compensate for the occurred error. The Lyapunov theory illustrates that the proposed control strategy can stabilize the system despite the actuators' fault and external disturbances. The simulation results show the effectiveness of the proposed scheme in comparison with another method. [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]

Small and micro enterprises play a very important role in economic growth, technological innovation, employment and social stability etc. Due to the lack of credible financial statements and reliable business records of small and micro enterprises, they are facing financing difficulties, which has become an important factor hindering the development of small and micro enterprises. Therefore, a credit risk measurement model based on the integrated algorithm of improved GSO (Glowworm Swarm Optimization) and ELM (Extreme Learning Machine) is proposed in this paper. First of all, according to the growth and development characteristics of small and micro enterprises in the big data environment, the formation mechanism of credit risk of small and micro enterprises is analyzed from the perspective of granularity scaling, cross-border association and global view driven by big data, and the index system of credit comprehensive measurement is established by summarizing and analyzing the factors that affect the credit evaluation index. Secondly, a new algorithm based on the parallel integration of the good point set adaptive glowworm swarm optimization algorithm and the Extreme learning machine is built. Finally, the integrated algorithm based on improved GSO and ELM is applied to the credit risk measurement modeling of small and micro enterprises, and some sample data of small and micro enterprises in China are collected, and simulation experiments are carried out with the help of MATLAB software tools. The experimental results show that the model is effective, feasible, and accurate. The research results of this paper provide a reference for solving the credit risk measurement problem of small and micro enterprises and also lay a solid foundation for the theoretical research of credit risk management. [ABSTRACT FROM AUTHOR]

Accurate identification of lithology is the basis and key process of fine logging interpretation and evaluation. However, reservoirs formed by different sedimentary environments and tectonic movements generally have the characteristics of complex and diverse lithology and strong heterogeneity, which brings great difficulty to the identification of reservoir lithology. This paper proposes an automatic identification technology for lithology logging based on the GWO-SVM algorithm model. The technology is actually applied, and the results are compared with the results of the support vector machine cross-validation optimization model, PNN (probabilistic neural network) model, and ELM (extreme learning machine) model. The results show that the GWO-SVM lithology logging recognition model can efficiently solve the lithology recognition and classification problems in complex reservoir analysis and has strong adaptability and higher recognition accuracy. [ABSTRACT FROM AUTHOR]

The restricted Boltzmann machine (RBM) is one of the widely used basic models in the field of deep learning. Although many indexes are available for evaluating the advantages of RBM training algorithms, the classification accuracy is the most convincing index that can most effectively reflect its advantages. RBM training algorithms are sampling algorithms essentially based on Gibbs sampling. Studies focused on algorithmic improvements have mainly faced challenges in improving the classification accuracy of the RBM training algorithms. To address the above problem, in this paper, we propose a fast Gibbs sampling (FGS) algorithm to learn the RBM by adding accelerated weights and adjustment coefficient. An important link based on Gibbs sampling theory was established between the update of the network weights and mixing rate of Gibbs sampling chain. The proposed FGS method was used to accelerate the mixing rate of Gibbs sampling chain by adding accelerated weights and adjustment coefficients. To further validate the FGS method, numerous experiments were performed to facilitate comparisons with the classical RBM algorithm. The experiments involved learning the RBM based on standard data. The results showed that the proposed FGS method outperformed the CD, PCD, PT5, PT10, and DGS algorithms, particularly with respect to the handwriting database. The findings of our study suggest the potential applications of FGS to real-world problems and demonstrate that the proposed method can build an improved RBM for classification. [ABSTRACT FROM AUTHOR]

To a large extent, classical boosting denoising algorithms can improve denoising performance. However, these algorithms can only work well when the denoisers are linear. In this paper, we propose a boosting algorithm that can be used for a nonlinear denoiser. We further implement the proposed algorithm into a shrinkage curve learning denoising algorithm, which is a nonlinear denoiser. Concurrently, the convergence of the proposed algorithm is proved. Experimental results indicate that the proposed algorithm is effective and the dependence of the shrinkage curve learning denoising algorithm on training samples has improved. In addition, the proposed algorithm can achieve better performance in terms of visual quality and peak signal-to-noise ratio (PSNR). [ABSTRACT FROM AUTHOR]

Image recognition tasks involve an increasingly high amount of symmetric positive definite (SPD) matrices data. SPD manifolds exhibit nonlinear geometry, and Euclidean machine learning methods cannot be directly applied to SPD manifolds. The kernel trick of SPD manifolds is based on the concept of projecting data onto a reproducing kernel Hilbert space. Unfortunately, existing kernel methods do not consider the connection of SPD matrices and linear projections. Thus, a framework that uses the correlation between SPD matrices and projections to model the kernel map is proposed herein. To realize this, this paper formulates a Hilbert–Schmidt independence criterion (HSIC) regularization framework based on the kernel trick, where HSIC is usually used to express the interconnectedness of two datasets. The proposed framework allows us to extend the existing kernel methods to new HSIC regularization kernel methods. Additionally, this paper proposes an algorithm called HSIC regularized graph discriminant analysis (HRGDA) for SPD manifolds based on the HSIC regularization framework. The proposed HSIC regularization framework and HRGDA are highly accurate and valid based on experimental results on several classification tasks. [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]

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]

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]

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 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]

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]

This work provides an enhanced attention model by addressing the drawbacks of standard English semantic analysis methods. This work provides the semantic component analysis and intelligent algorithm structure in order to investigate the intelligent algorithm of sentence component-focused English semantic analysis. In addition, the whole process of intelligently analyzing English semantics is investigated. In the process of English semantic analysis, semantic ambiguity, poor semantic analysis accuracy, and incorrect quantifiers are continually optimized and solved based on semantic analysis. It improves the accuracy of English semantic analysis. In the long sentence semantic analysis test, improving the performance of attention mechanism semantic analysis model is also ideal. It is proved that the performance of the proposed algorithm model is obviously improved compared with the traditional model in order to continuously promote the accuracy and quality of English language semantic analysis. [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]

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]

Extreme learning machine (ELM) as an emerging technology has recently attracted many researchers’ interest due to its fast learning speed and state-of-the-art generalization ability in the implementation. Meanwhile, the incremental extreme learning machine (I-ELM) based on incremental learning algorithm was proposed which outperforms many popular learning algorithms. However, the incremental algorithms with ELM do not recalculate the output weights of all the existing nodes when a new node is added and cannot obtain the least-squares solution of output weight vectors. In this paper, we propose orthogonal convex incremental learning machine (OCI-ELM) with Gram-Schmidt orthogonalization method and Barron’s convex optimization learning method to solve the nonconvex optimization problem and least-squares solution problem, and then we give the rigorous proofs in theory. Moreover, in this paper, we propose a deep architecture based on stacked OCI-ELM autoencoders according to stacked generalization philosophy for solving large and complex data problems. The experimental results verified with both UCI datasets and large datasets demonstrate that the deep network based on stacked OCI-ELM autoencoders (DOC-IELM-AEs) outperforms the other methods mentioned in the paper with better performance on regression and classification problems. [ABSTRACT FROM AUTHOR]

Counselling students remains a pre-eminence for most tertiary institutions in Ghana to the extent that institutions now have counselling units that extend to the departmental level. This study used the K-prototype machine learning algorithm to cluster students' behaviour based on 28 relevant attributes and further proposed a classification model. The analysis of the experimental outcomes using the elbow method reveals the formation of three distinct clusters with decreasing intra-cluster similarities and increasing inter-cluster distances. The first cluster uniquely consists of active learners with three or more roommates, primarily in the first year. The second cluster with the highest membership consists mainly of second-year students who exhibit passive classroom conduct and reside in a two-occupancy hostel. The third cluster contains a mixture of third and final-year students who are highly passive in class and live in a tenancy occupancy of two. After clustering, the K-nearest neighbours, logistic regression, naïve Bayes (NB), and AdaBoost ensemble algorithms were implemented to create a model for future learner cluster prediction. Simulation results using the tenfold cross-validation technique show that AdaBoost (NB) has the highest accuracy of 99.88% with an F-measure score of 0.999 and receiver operating characteristic–area under the curve value of 1.00. [ABSTRACT FROM AUTHOR]

Dictionary learning problem has become an active topic for decades. Most existing learning methods train the dictionary to adapt to a particular class of signals. But as the number of the dictionary atoms is increased to represent the signals much more sparsely, the coherence between the atoms becomes higher. According to the greedy and compressed sensing theories, this goes against the implementation of sparse coding. In this paper, a novel approach is proposed to learn the dictionary that minimizes the sparse representation error according to the training signals with the coherence taken into consideration. The coherence is constrained by making the Gram matrix of the desired dictionary approximate to an identity matrix of proper dimension. The method for handling the proposed model is mainly based on the alternating minimization procedure and, in each step, the closed-form solution is derived. A series of experiments on synthetic data and audio signals is executed to demonstrate the promising performance of the learnt incoherent dictionary and the superiority of the learning method to the existing ones. [ABSTRACT FROM AUTHOR]

Cutting parameter optimization dramatically affects the production time, cost, profit rate, and the quality of the final products, in milling operations. Aiming to select the optimum machining parameters in multitool milling operations such as corner milling, face milling, pocket milling, and slot milling, this paper presents a novel version of TLBO, TLBO with dynamic assignment learning strategy (DATLBO), in which all the learners are divided into three categories based on their results in “Learner Phase”: good learners, moderate learners, and poor ones. Good learners are self-motivated and try to learn by themselves; each moderate learner uses a probabilistic approach to select one of good learners to learn; each poor learner also uses a probabilistic approach to select several moderate learners to learn. The CEC2005 contest benchmark problems are first used to illustrate the effectiveness of the proposed algorithm. Finally, the DATLBO algorithm is applied to a multitool milling process based on maximum profit rate criterion with five practical technological constraints. The unit time, unit cost, and profit rate from the Handbook (HB), Feasible Direction (FD) method, Genetic Algorithm (GA) method, five other TLBO variants, and DATLBO are compared, illustrating that the proposed approach is more effective than HB, FD, GA, and five other TLBO variants. [ABSTRACT FROM AUTHOR]

As an important part of intelligent transportation systems, path planning algorithms have been extensively studied in the literature. Most of existing studies are focused on the global optimization of paths to find the optimal path between Origin-Destination (OD) pairs. However, in urban road networks, the optimal path may not be always available when some unknown emergent events occur on the path. Thus a more practical method is to calculate several suboptimal paths instead of finding only one optimal path. In this paper, a cooperative Q-learning path planning algorithm is proposed to seek a suboptimal multipath set for OD pairs in urban road networks. The road model is abstracted to the form that Q-learning can be applied firstly. Then the gray prediction algorithm is combined into Q-learning to find the suboptimal paths with reliable constraints. Simulation results are provided to show the effectiveness of the proposed algorithm. [ABSTRACT FROM AUTHOR]

Aiming at improving the video visual resolution quality and details clarity, a novel learning-based video superresolution reconstruction algorithm using spatiotemporal nonlocal similarity is proposed in this paper. Objective high-resolution (HR) estimations of low-resolution (LR) video frames can be obtained by learning LR-HR correlation mapping and fusing spatiotemporal nonlocal similarities between video frames. With the objective of improving algorithm efficiency while guaranteeing superresolution quality, a novel visual saliency-based LR-HR correlation mapping strategy between LR and HR patches is proposed based on semicoupled dictionary learning. Moreover, aiming at improving performance and efficiency of spatiotemporal similarity matching and fusion, an improved spatiotemporal nonlocal fuzzy registration scheme is established using the similarity weighting strategy based on pseudo-Zernike moment feature similarity and structural similarity, and the self-adaptive regional correlation evaluation strategy. The proposed spatiotemporal fuzzy registration scheme does not rely on accurate estimation of subpixel motion, and therefore it can be adapted to complex motion patterns and is robust to noise and rotation. Experimental results demonstrate that the proposed algorithm achieves competitive superresolution quality compared to other state-of-the-art algorithms in terms of both subjective and objective evaluations. [ABSTRACT FROM AUTHOR]

Class imbalance situations, where one class is rare compared to the other, arise frequently in machine learning applications. It is well known that the usual misclassification error is not suitable in such settings. A wide range of performance measures such as AM and QM have been proposed for this problem. However, due to computational difficulties, few learning techniques have been developed to directly optimize for AM or QM metric. To fill the gap, in this paper, we present a general structural SVM framework for directly optimizing AM and QM. We define the loss functions oriented to AM and QM, respectively, and adopt the cutting plane algorithm to solve the outer optimization. For the inner problem of finding the most violated constraint, we propose two efficient algorithms for the AM and QM problem. Empirical studies on the various imbalanced datasets justify the effectiveness of the proposed approach. [ABSTRACT FROM AUTHOR]

An ODL centralized control strategy is designed to study the problem of heavy load in the power communication network, in which the machine learning method is introduced. SDN technology is used to establish SDN cluster control structure, and different algorithms, such as genetic algorithm, are utilized to optimize resource scheduling. The results show that the improved algorithm obtains the shortest link path through 28 iterations. At the same time, AHP is used to switch the network spectrum. Moreover, the application effect of the control strategy is simulated and analyzed, and its effect on network communication application is verified. [ABSTRACT FROM AUTHOR]

This paper proposes a novel algorithm called low dimensional space incremental learning (LDSIL) to estimate the human motion in 3D from the silhouettes of human motion multiview images. The proposed algorithm takes the advantage of stochastic extremum memory adaptive searching (SEMAS) and incremental probabilistic dimension reduction model (IPDRM) to collect new high dimensional data samples. The high dimensional data samples can be selected to update the mapping from low dimensional space to high dimensional space, so that incremental learning can be achieved to estimate human motion from small amount of samples. Compared with three traditional algorithms, the proposed algorithm can make human motion estimation achieve a good performance in disambiguating silhouettes, overcoming the transient occlusion, and reducing estimation error. [ABSTRACT FROM AUTHOR]

Face detection has been an important and active research topic in computer vision and image processing. In recent years, learning-based face detection algorithms have prevailed with successful applications. In this paper, we propose a new face detection algorithm that works directly in wavelet compressed domain. In order to simplify the processes of image decompression and feature extraction, we modify the AdaBoost learning algorithm to select a set of complimentary joint-coefficient classifiers and integrate them to achieve optimal face detection. Since the face detection on the wavelet compression domain is restricted by the limited discrimination power of the designated feature space, the proposed learning mechanism is developed to achieve the best discrimination from the restricted feature space. The major contributions in the proposed AdaBoost face detection learning algorithm contain the feature space warping, joint feature representation, ID3-like plane quantization, and weak probabilistic classifier, which dramatically increase the discrimination power of the face classifier. Experimental results on the CBCL benchmark and the MIT + CMU real image dataset show that the proposed algorithm can detect faces in the wavelet compressed domain accurately and efficiently. [ABSTRACT FROM AUTHOR]

Simplicial depth (SD) plays an important role in discriminant analysis, hypothesis testing, machine learning, and engineering computations. However, the computation of simplicial depth is hugely challenging because the exact algorithm is an NP problem with dimension d and sample size n as input arguments. The approximate algorithm for simplicial depth computation has extremely low efficiency, especially in high-dimensional cases. In this study, we design an importance sampling algorithm for the computation of simplicial depth. As an advanced Monte Carlo method, the proposed algorithm outperforms other approximate and exact algorithms in accuracy and efficiency, as shown by simulated and real data experiments. Furthermore, we illustrate the robustness of simplicial depth in regression analysis through a concrete physical data experiment. [ABSTRACT FROM AUTHOR]

We consider the problem of learning nondeterministic finite statemachines (NFSMs) from systems where their internal structures are implicit and nondeterministic. Recently, an algorithm for inferring observable NFSMs (ONFSMs), which are the potentially learnable subclass ofNFSMs, has been proposed based on the hypothesis that the complete testing assumption is satisfied. According to this assumption, with an input sequence (query), the complete set of all possible output sequences is given by the so-called Teacher, so the number of times for asking the same query is not taken into account in the algorithm. In this paper, we propose LMN*, a refined ONFSM learning algorithm that considers the amount for repeating the same query as one parameter. Unlike the previous work, our approach does not require all possible output sequences in one answer. Instead, it tries to observe the possible output sequences by asking the same query many times to the Teacher. We have proved that LMN* can infer the corresponding ONFSMs of the unknown systems when the number of tries for the same query is adequate to guarantee the complete testing assumption. Moreover, the proof shows that our algorithm will eventually terminate no matter whether the assumption is fulfilled or not. We also present the theoretical time complexity analysis of LMN. In addition, experimental results demonstrate the practical efficiency of our approach. [ABSTRACT FROM AUTHOR]

The feature selection process constitutes a commonly encountered problem of global combinatorial optimization. The process reduces the number of features by removing irrelevant and redundant data. This paper proposed a novel immune clonal genetic algorithm based on immune clonal algorithm designed to solve the feature selection problem. The proposed algorithm has more exploration and exploitation abilities due to the clonal selection theory, and each antibody in the search space specifies a subset of the possible features. Experimental results show that the proposed algorithm simplifies the feature selection process effectively and obtains higher classification accuracy than other feature selection algorithms. [ABSTRACT FROM AUTHOR]

Multilabel learning is now receiving an increasing attention from a variety of domains and many learning algorithms have been witnessed. Similarly, the multilabel learning may also suffer from the problems of high dimensionality, and little attention has been paid to this issue. In this paper, we propose a new ensemble learning algorithms for multilabel data. The main characteristic of our method is that it exploits the features with local discriminative capabilities for each label to serve the purpose of classification. Specifically, for each label, the discriminative capabilities of features on positive and negative data are estimated, and then the top features with the highest capabilities are obtained. Finally, a binary classifier for each label is constructed on the top features. Experimental results on the benchmark data sets show that the proposed method outperforms four popular and previously published multilabel learning algorithms. [ABSTRACT FROM AUTHOR]

In practical engineerings, structures are often excited by different kinds of loads at the same time. How to effectively analyze and simulate this kind of dynamic environment of structure, named combined dynamic environment, is one of the key issues. In this paper, a novel prediction method of combined dynamic environment is proposed from the perspective of data analysis. First, the existence of dynamic similarity between vibration responses of the same structure under different boundary conditions is theoretically proven. It is further proven that this similarity can be established by a multiple-input multiple-output regression model. Second, two machine learning algorithms, multiple-dimensional support vectormachine and extreme learningmachine, are introduced to establish thismodel. To test the effectiveness of this method, shock and stochastic white noise excitations are acted on a cylindrical shell with two clamps to simulate different dynamic environments. The prediction errors on variousmeasuring points are all less than ±3 dB, which shows that the proposed method can predict the structural vibration response under one boundary condition by means of the response under another condition in terms of precision and numerical stability. [ABSTRACT FROM AUTHOR]

We attempt to predict the accidental fall of human beings due to sudden abnormal changes in their health parameters such as blood pressure, heart rate, and sugar level. In medical terminology, this problem is known as Syncope. The primary motivation is to prevent such falls by predicting abnormal changes in these health parameters that might trigger a sudden fall. We apply various machine learning algorithms such as logistic regression, a decision tree classifier, a random forest classifier, K-Nearest Neighbours (KNN), a support vector machine, and a naive Bayes classifier on a relevant dataset and verify our results with the cross-validation method. We observe that the KNN algorithm provides the best accuracy in predicting such a fall. However, the accuracy results of some other algorithms are also very close. Thus, we move one step further and propose an ensemble model, Majority Voting, which aggregates the prediction results of multiple machine learning algorithms and finally indicates the probability of a fall that corresponds to a particular human being. The proposed ensemble algorithm yields 87.42% accuracy, which is greater than the accuracy provided by the KNN algorithm. [ABSTRACT FROM AUTHOR]

Aiming at the problem that traditional heuristic algorithm is difficult to extract the empirical model in time from large sample terrain data, a multi-UAV collaborative path planning method based on attention reinforcement learning is proposed. The method draws on a combined consideration of influencing factors, such as survival probability, path length, and load balancing and endurance constraints, and works as a support system for multimachine collaborative optimizing. The attention neural network is used to generate the cooperative reconnaissance strategy of the UAV, and a large amount of simulation data is tested to optimize the attention network using the REINFORCE algorithm. Experimental results show that the proposed method is effective in solving the multi-UAV path planning issue with high real-time requirements, and the solving time is less than the traditional algorithms. [ABSTRACT FROM AUTHOR]

Consumer feedback is highly valuable in business to assess their performance and is also beneficial to customers as it gives them an idea of what to expect from new products. In this research, the aim is to evaluate different deep learning approaches to accurately predict the opinion of customers based on mobile phone reviews obtained from Amazon.com. The prediction is based on analysing these reviews and categorizing them as positive, negative, or neutral. Different deep learning algorithms have been implemented and evaluated such as simple RNN with its four variants, namely, Long Short-Term Memory Networks (LRNN), Group Long Short-Term Memory Networks (GLRNN), gated recurrent unit (GRNN), and update recurrent unit (UGRNN). All evaluated algorithms are combined with word embedding as feature extraction approach for sentiment analysis including Glove, word2vec, and FastText by Skip-grams. The five different algorithms with the three feature extraction methods are evaluated based on accuracy, recall, precision, and F1-score for both balanced and unbalanced datasets. For the unbalanced dataset, it was found that the GLRNN algorithms with FastText feature extraction scored the highest accuracy of 93.75%. This result achieved the highest accuracy on this dataset when compared with other methods mentioned in the literature. For the balanced dataset, the highest achieved accuracy was 88.39% by the LRNN algorithm. [ABSTRACT FROM AUTHOR]

Educational Data Mining (EDM) is a rich research field in computer science. Tools and techniques in EDM are useful to predict student performance which gives practitioners useful insights to develop appropriate intervention strategies to improve pass rates and increase retention. The performance of the state-of-the-art machine learning classifiers is very much dependent on the task at hand. Investigating support vector machines has been used extensively in classification problems; however, the extant of literature shows a gap in the application of linear support vector machines as a predictor of student performance. The aim of this study was to compare the performance of linear support vector machines with the performance of the state-of-the-art classical machine learning algorithms in order to determine the algorithm that would improve prediction of student performance. In this quantitative study, an experimental research design was used. Experiments were set up using feature selection on a publicly available dataset of 1000 alpha-numeric student records. Linear support vector machines benchmarked with ten categorical machine learning algorithms showed superior performance in predicting student performance. The results of this research showed that features like race, gender, and lunch influence performance in mathematics whilst access to lunch was the primary factor which influences reading and writing performance. [ABSTRACT FROM AUTHOR]

Data scientists use various machine learning algorithms to discover patterns in large data that can lead to actionable insights. In general, high-dimensional data are reduced by obtaining a set of principal components so as to highlight similarities and differences. In this work, we deal with the reduced data using a bivariate mixture model and learning with a bivariate Gaussian mixture model. We discuss a heuristic for detecting important components by choosing the initial values of location parameters using two different techniques: cluster means, k-means and hierarchical clustering, and default values in the "mixtools" R package. The parameters of the model are obtained via an expectation maximization algorithm. The criteria from Bayesian point are evaluated for both techniques, demonstrating that both techniques are efficient with respect to computation capacity. The effectiveness of the discussed techniques is demonstrated through a simulation study and using real data sets from different fields. [ABSTRACT FROM AUTHOR]

Aiming at how to achieve optimal control of joint pitch angles in the process of the robot surmounting obstacle, taking the developed coal mine rescue snake robot as an experimental platform, a pose control algorithm based on particle swarm optimization weight coefficient of extreme learning machine (PSOELM) is proposed. In order to obtain the optimized hidden layer matrix of the extreme learning machine (ELM), particle swarm optimization (PSO) is applied to optimize the weight coefficient of hidden layer matrix. The simulation and experiment results prove that, compared with the ELM algorithm, the smaller mean square error (MSE) between the joint pitch angles of robot and the expected values is acquired by the PSOELM, which overcomes the shortcoming that traditional extreme learning machine cannot reach the best performance because of the random selection of the parameters of the hidden layer nodes. PSOELM is superior to ELM algorithm in control accuracy, fast searching for the optimal and stability. Optimal control of robot’s joint pitch angles is achieved. The algorithm is applied to the surmounting obstacle control of the developed snake robot, and it lays the foundation for further implement of the coal mine rescue. [ABSTRACT FROM AUTHOR]