Search

Manual term extraction is similar to literal meaning: A translator browses text, classifies words, and prepares for translation. Terminology, as a centralized carrier of expertise, creation, popularization, and disappearance, dynamically reflects the development and evolution of an industry. The automatic extraction of terminology is a key technology for creating a professional terminology database, and it is also a key topic in the field of natural language processing. The purpose of this paper is to study how to analyse a term extraction algorithm based on machine learning and a comprehensive feature strategy. Focusing on the problems of poor generality and single statistical features of current term extraction algorithms, this paper proposes an improved domain ontology term extraction algorithm based on a comprehensive feature strategy. Moreover, automatic term extraction experiments based on a word-based maximum entropy model and a conditional random field model based on machine learning are conducted in this paper. Its word-based conditional random field model outperforms the maximum entropy model. The experimental results show that the algorithm based on the comprehensive feature strategy improves the accuracy by 8.6% compared with the TF-IDF algorithm and the C-value term extraction algorithm. This algorithm can be used to effectively extract the terms in a text and has good generality. [ABSTRACT FROM AUTHOR]

In the field of machine learning, clustering has become an increasingly popular research topic due to its critical importance. Many clustering algorithms have been proposed utilizing a variety of approaches. This study focuses on clustering of high-dimensional data using the maximum margin clustering approach. In this paper, two methods are introduced: The first method employs the classical maximum margin clustering approach, which separates data into two clusters with the greatest margin between them. The second method takes cluster compactness into account and searches for two parallel hyperplanes that best fit to the cluster samples while also being as far apart from each other as possible. Additionally, robust variants of these clustering methods are introduced to handle outliers and noise within the data samples. The stochastic gradient algorithm is used to solve the resulting optimization problems, enabling all proposed clustering methods to scale well with large-scale data. Experimental results demonstrate that the proposed methods are more effective than existing maximum margin clustering methods, particularly in high-dimensional clustering problems, highlighting the efficacy of the proposed methods. [ABSTRACT FROM AUTHOR]

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

After 70 years of intricate development, machine learning, represented by deep learning, is based on the multilevel structure of the human brain and the layer-by-layer analysis and processing mechanism of neuron connection and interaction information. The powerful parallel information processing ability of self-adaptation and self-learning has allowed for breakthroughs in many fields, among which the most representative is image recognition. Therefore, this paper proposed optimizing the RBF algorithm with machine learning (ML) to improve the recognition rate of spectrum sensing. The results showed that the average detection success rates of the RBF algorithm were 93.62%, 95.07%, 96.91%, 98.78% and 99.37% when the SNRs were − 8 dB, − 4 dB, 0 dB, 4 dB and 8 dB, respectively, and the other conditions were kept the same. The average detection success rates of the SVM/RBF algorithm were 97.65%, 99.63%, 99.76%, 99.91% and 99.88%, respectively. The average detection success rate of the SVM/RBF algorithm was significantly higher than that of the RBF algorithm. This indicates that analyzing the RBF neural network algorithm through ML can improve the success rate of spectrum sensing, which highlights a new direction for the application of ML and neural networks. [ABSTRACT FROM AUTHOR]

Previous major earthquake events have revealed that soils susceptible to liquefaction are one of the factors causing significant damages to the structures. Therefore, accurate prediction of the liquefaction phenomenon is an important task in earthquake engineering. Over the past decade, several researchers have been extensively applied machine learning (ML) methods to predict soil liquefaction. This paper presents the prediction of soil liquefaction from the SPT dataset by using relatively new and robust tree-based ensemble algorithms, namely Adaptive Boosting, Gradient Boosting Machine, and eXtreme Gradient Boosting (XGBoost). The innovation points introduced in this paper are presented briefly as follows. Firstly, Stratified Random Sampling was utilized to ensure equalized sampling between each class selection. Secondly, feature selection methods such as Recursive Feature Elimination, Boruta, and Stepwise Regression were applied to develop models with a high degree of accuracy and minimal complexity by selecting the variables with significant predictive features. Thirdly, the performance of ML algorithms with feature selection methods was compared in terms of four performance metrics, Overall Accuracy, Precision, Recall, and F-measure to select the best model. Lastly, the best predictive model was determined using a statistical significance test called Wilcoxon's sign rank test. Furthermore, computational cost analyses of the tree-based ensemble algorithms were performed based on parallel and non-parallel processing. The results of the study suggest that all developed tree-based ensemble models could reliably estimate soil liquefaction. In conclusion, according to both validation and statistical results, the XGBoost with the Boruta model achieved the most stable and better prediction performance than the other models in all considered cases. [ABSTRACT FROM AUTHOR]

To improve the effect of commercial insurance risk decision, this paper applies neural network algorithms to commercial insurance risk decision under the guidance of machine learning ideas, and selects the neural network algorithm based on the actual situation. Moreover, this paper analyzes the nature of risks of commercial insurance, analyzes the types of risks and risk relevance, constructs a commercial insurance risk decision model based on neural network algorithms, and determines the system process. In addition, this paper uses a combination method of qualitative and quantitative to identify the influencing factors of risk estimation to obtain relevant influencing factors, and verify the model proposed in this paper in combination with experimental research. From the experimental research results, it can be seen that the commercial insurance risk decision system based on neural network algorithm is very good in terms of decision effect. [ABSTRACT FROM AUTHOR]

Deep Neural Networks (DNNs) are widely regarded as the most effective learning tool for dealing with large datasets, and they have been successfully used in thousands of applications in a variety of fields. Based on these large datasets, they are trained to learn the relationships between various variables. The adaptive moment estimation (Adam) algorithm, a highly efficient adaptive optimization algorithm, is widely used as a learning algorithm in various fields for training DNN models. However, it needs to improve its generalization performance, especially when training with large-scale datasets. Therefore, in this paper, we propose HN Adam, a modified version of the Adam Algorithm, to improve its accuracy and convergence speed. The HN_Adam algorithm is modified by automatically adjusting the step size of the parameter updates over the training epochs. This automatic adjustment is based on the norm value of the parameter update formula according to the gradient values obtained during the training epochs. Furthermore, a hybrid mechanism was created by combining the standard Adam algorithm and the AMSGrad algorithm. As a result of these changes, the HN_Adam algorithm, like the stochastic gradient descent (SGD) algorithm, has good generalization performance and achieves fast convergence like other adaptive algorithms. To test the proposed HN_Adam algorithm performance, it is evaluated to train a deep convolutional neural network (CNN) model that classifies images using two different standard datasets: MNIST and CIFAR-10. The algorithm results are compared to the basic Adam algorithm and the SGD algorithm, in addition to other five recent SGD adaptive algorithms. In most comparisons, the HN Adam algorithm outperforms the compared algorithms in terms of accuracy and convergence speed. AdaBelief is the most competitive of the compared algorithms. In terms of testing accuracy and convergence speed (represented by the consumed training time), the HN-Adam algorithm outperforms the AdaBelief algorithm by an improvement of 1.0% and 0.29% for the MNIST dataset, and 0.93% and 1.68% for the CIFAR-10 dataset, respectively. [ABSTRACT FROM AUTHOR]

This paper proposes an e-diagnosis system based on machine learning (ML) algorithms to be implemented on the Internet of Medical Things (IoMT) environment, particularly for diagnosing diabetes mellitus (type 2 diabetes). However, the ML applications tend to be mistrusted because of their inability to show the internal decision-making process, resulting in slow uptake by end-users within certain healthcare sectors. This research delineates the use of three interpretable supervised ML models: Naïve Bayes classifier, random forest classifier, and J48 decision tree models to be trained and tested using the Pima Indians diabetes dataset in R programming language. The performance of each algorithm is analyzed to determine the one with the best accuracy, precision, sensitivity, and specificity. An assessment of the decision process is also made to improve the model. It can be concluded that a Naïve Bayes model works well with a more fine-tuned selection of features for binary classification, while random forest works better with more features. [ABSTRACT FROM AUTHOR]

In sports, advance sensing technologies generate massive amount of unstructured telemedicine data that need to be refined for accurate diagnosis of underlying diseases. For accurate prediction of diseases and classification of athletes' data, deep learning algorithms are frequently used at the cloud. However, the transmission of raw data of athletes to the cloud faces numerous challenges. Among them, security and privacy are a major challenge in view of the sensitive and personal information present within the unstructured data. In this paper, first we present a data block scrambling algorithm (without key management) for secured transmission and storage of ECG (electrocardiogram) data of table tennis players at the cloud. A small piece of original data stored at the cloud is used for scrambling the massive amount of remaining ECG data. The secured telemedicine data is then imported into Hadoop Distributed File System for data management, which is read by Spark framework to form Resilient Distributed Datasets. Finally, a deep learning approach is used that extracts useful features, learns the related information, and weights and sums the feature vectors at different layers for classification. Theoretical analysis proves that our proposed approach is highly robust and resilient to brute force attacks and at the same time has a much better accuracy, sensitivity, and specificity as compared to the existing approaches. [ABSTRACT FROM AUTHOR]

Computations that mimic nature are known as nature-inspired computing. Nature presents a wealthy source of thoughts and ideas for computing. The use of natural galvanized techniques has been found to provide machine solutions to complex problems. One of the challenging issues among researchers is high-dimensional data which contains a large number of unwanted, redundant, and irrelevant features. These redundant or unwanted features reduce the accuracy of machine learning models. Therefore, to solve this problem nowadays metaheuristic techniques are being used. The paper presents both surveys as well as comparison of five metaheuristic algorithms for feature selection. A wrapper-based feature selection approach using five nature-inspired techniques for feature selection has been applied. The binary version of the five swarm-based nature-inspired algorithms (NIAs), namely particle swarm optimization, whale optimization algorithm (WOA), grey wolf optimization (GWO), firefly algorithm, and bat algorithm. WOA and GWO are recent algorithms used for finding optimal feature subsets when there is no empirical information. The S-shape transfer function has been used to convert the continuous value to binary form and K-nearest neighbor is used to calculate the classification accuracy of selected feature subsets. To validate the results of the selected NIAs eleven benchmark datasets from the UCI repository are used. The strength of each NIA has been verified using a nonparametric test called the Friedman rank and Holm test. p value obtained shows that WOA is statistically significant and performs better than other models. [ABSTRACT FROM AUTHOR]

The heat exchanger has been widely used in the energy and chemical industry and plays an irreplaceable role in the featured applications. The design of heat exchanger is a mixed integer complex optimization problem, where the efficient design significantly improves the efficiency and reduces the cost. Many intelligent methods have been developed for heat exchanger optimal design. In this paper, a novel variant of sine and cosine algorithm named EDOLSCA is proposed, enhanced by dynamic opposite learning algorithm and the elite strategy. The proposed method is tested in CEC2014 benchmark and proved to be of significant advantages over the original algorithm. The new algorithm is then validated in the plate-fin heat exchanger (PFHE) optimal design problem. The comparison results of the proposed algorithm and other algorithms prove that EDOLSCA also has demonstrated superiority in heat exchanger optimal design. [ABSTRACT FROM AUTHOR]

Rib segmentation based on chest X-ray images is essential in the computer-aided diagnosis systems of lung cancer, which serves as an important step in the quantitative analysis of various types of lung diseases. However, the traditional methods are unable to segment ribs effectively due to the unclear edges and overlapping regions in X-ray images. A novel rib segmentation framework based on Unpaired Sample Augmentation and Multi-Scale Network is presented in this paper, aiming to improve the accuracy of ribs segmentation with limited labeled samples. First, the algorithm learns pneumonia-related texture changes via unpaired chest x-ray images and generates various augmented samples. Then, a multi-scale network attempts to learn hierarchical features using global supervision. Finally, the refined segmentation result of each organ is achieved by using a deep separation module and a comprehensive loss function. Specifically, the hierarchical features can greatly improve the robustness of multi-organ segmentation networks. The complex multi-organ segmentation task with limited labeled data is simplified with the designed deep separation module. We justify the proposed framework through extensive experiments. It achieves good performance with DSC, Precision, Recall, and Jaccard of 88.03, 88.25, 88.36, and 79.02%, respectively. The DSC value increases nearly by 3% compared to other popular methods. The experimental results show that our algorithm presents better segmentation performance for the overlapping region and fuzzy region of multiple organs, which holds research value and prospects for application. [ABSTRACT FROM AUTHOR]

Learning using privileged information (LUPI) paradigm, which pioneered teacher–student interaction mechanism, makes the learning models use additional information in the training stage. This paper is the first to propose an incremental learning algorithm with LUPI paradigm for random vector functional-link (RVFL) networks, named IRVFL+. This novel algorithm can leverage privileged information into incremental RVFL (IRVFL) networks in the training stage, which provides a new constructive method to train IRVFL networks. In order to solve two scenarios that require fast speed of modeling but low-accuracy requirements and high accuracy but slow speed of modeling requirements, two algorithmic implementations of IRVFL+ , respectively, based on local update and global update strategies are presented for data classification and regression problems in this paper. Specifically, the first algorithm, named IRVFL-I+ , calculates the output weights of the newly added hidden nodes, while the input and output parameters of all the existing hidden nodes are fixed. In contrast to IRVFL-I+ , the second one named IRVFL-II + can update all the parameters of all the existing hidden nodes and newly added hidden nodes. Moreover, the convergences of two implementations have been studied in this paper. Finally, experimental results indicate that IRVFL+ indeed performs favorably. [ABSTRACT FROM AUTHOR]

In this paper, an online optimization approach of a fractional-order PID controller based on a fractional-order actor-critic algorithm (FOPID-FOAC) is proposed. The proposed FOPID-FOAC scheme exploits the advantages of the FOPID controller and FOAC approaches to improve the performance of nonlinear systems. The proposed FOAC is built by developing a FO-based learning approach for the actor-critic neural network with adaptive learning rates. Moreover, a FO rectified linear unit (RLU) is introduced to enable the AC neural network to define and optimize its own activation function. By the means of the Lyapunov theorem, the convergence and the stability analysis of the proposed algorithm are investigated. The FO operators for the FOAC learning algorithm are obtained using the gray wolf optimization (GWO) algorithm. The effectiveness of the proposed approach is proven by extensive simulations based on the tracking problem of the two degrees of freedom (2-DOF) helicopter system and the stabilization issue of the inverted pendulum (IP) system. Moreover, the performance of the proposed algorithm is compared against optimized FOPID control approaches in different system conditions, namely when the system is subjected to parameter uncertainties and external disturbances. The performance comparison is conducted in terms of two types of performance indices, the error performance indices, and the time response performance indices. The first one includes the integral absolute error (IAE), and the integral squared error (ISE), whereas the second type involves the rising time, the maximum overshoot (Max. OS), and the settling time. The simulation results explicitly indicate the high effectiveness of the proposed FOPID-FOAC controller in terms of the two types of performance measurements under different scenarios compared with the other control algorithms. [ABSTRACT FROM AUTHOR]

Deep neural networks (DNNs) have evolved as a beneficial machine learning method that has been successfully used in various applications. Currently, DNN is a superior technique of extracting information from massive sets of data in a self-organized method. DNNs have different structures and parameters, which are usually produced for particular applications. Nevertheless, the training procedures of DNNs can be protracted depending on the given application and the size of the training set. Further, determining the most precise and practical structure of a deep learning method in a reasonable time is a possible problem related to this procedure. Meta-heuristics techniques, such as swarm intelligence (SI) and evolutionary computing (EC), represent optimization frames with specific theories and objective functions. These methods are adjustable and have been demonstrated their effectiveness in various applications; hence, they can optimize the DNNs models. This paper presents a comprehensive survey of the recent optimization methods (i.e., SI and EC) employed to enhance DNNs performance on various tasks. This paper also analyzes the importance of optimization methods in generating the optimal hyper-parameters and structures of DNNs in taking into consideration massive-scale data. Finally, several potential directions that still need improvements and open problems in evolutionary DNNs are identified. [ABSTRACT FROM AUTHOR]

Nowadays, cryptographic systems' designers are facing significant challenges in their designs. They have to constantly search for new ideas of fast unbreakable algorithms with a very powerful key generator. In this paper, we propose a novel hybrid neural-cryptography methodology. It depends on new rule of very fast Backpropagation (BP) instant machine learning (ML). This proposed Hybrid Cryptography system is constructed from Encryptor and Decryptor based on the asymmetric Autoencoder type. The Encryptor encrypts and compresses a set of data to be instant code (i-code) using public key. While the Decryptor recovers this i-code (ciphered-data) based on two keys together. The first is the private key and the other is called instant-key (i-key). This i-key is generated from 3 factors as well (the original data itself, the generated i-code and the private key). The i-key is changing periodically with every transformation of plain data set, so it is powerful unpredictable key against the brute force. [ABSTRACT FROM AUTHOR]

Learning automata (LA), a powerful tool for reinforcement learning in the field of machine learning, could explore its optimal state by continuously interacting with an external environment. Generally, the traditional LA algorithms, especially estimator LA algorithms, can be ultimately abstracted out as P- or Q-models, which are simply located in the stationary environments. A more comprehensive consideration would be S-model operating in the non-stationary environment. For this specific LA, presently the most popular achievement belongs to stochastic estimator LA (SELA). However, synchronously handing four parameters involved in SELA is an intractable job, as these parameters may vary dramatically in values under different environments, making it essential to develop a strategy for parameter tuning. In this paper, we first propose a scheme to determine the parameter searching scope and subsequently present a series of parameter searching methods, including a four-dimensional method and a two-dimensional method, making SELA applicable for any environment with switching non-stationary characteristics. Furthermore, to decrease the tuning cost, a reduced parameter SELA supported by the new two-dimensional parameter searching method emerges. And to break the traditional limit that the environmental reward probability must be symmetrically distributed, the S-model is constructed from a new perspective, thus forming a novel reduced parameter S-model of SELA (rpS-SELA). A detailed mathematical proof theoretically reveals the absolute expediency of rpS-SELA. In addition, it is demonstrated by experimental simulations that rpS-SELA outperforms others with a reduced tuning cost, a minor time consumption, a higher accuracy rate, and above all, a stronger tracking ability to the environmental switches. [ABSTRACT FROM AUTHOR]

Convolutional neural networks also encountered some problems in the development of image recognition. The most prominent problem is that it is costly and time-consuming to collect data sets and train models. Limited data sets will cause the trained models to overfit. This paper proposes two methods to reduce overfitting based on the residual neural network architecture. The first type of method proposes a method of cross-combining waivers, reducing the size of the convolution kernel, and reducing the number of convolution kernels. The fitting method uses cross-combination to make the accuracy of Kaggle cat and dog data on the validation data set reach 95.37% and 90.31% on 30 types of engineering practice verification data set. The second method is based on the finetune residual neural network. A method of recurrent finetune residual neural network is proposed to improve the accuracy of the model. The accuracy of the finetune residual neural network on the Kaggle cat and dog validation dataset is 99.37%, and the accuracy of the dataset is verified in 30 types of engineering practice. The accuracy is 99.30%. The residual neural network method achieves 99.68% accuracy in the Kaggle cat and dog validation dataset and 99.61% in the validation dataset for 30 types of engineering practice. [ABSTRACT FROM AUTHOR]

Dragonfly algorithm (DA) is a novel swarm intelligence meta-heuristic optimization algorithm inspired by the dynamic and static swarming behaviors of artificial dragonflies in nature. It has proved its effectiveness and superiority compared to several well-known meta-heuristics available in the literature. This paper presents a comprehensive review of DA and its new variants classified into modified and hybrid versions. It also describes the main diverse applications of DA in several fields and areas such as machine learning, neural network, image processing, robotics, and engineering. Finally, the paper suggests some possible interesting research on the applications and hybridizations of DA for future works. [ABSTRACT FROM AUTHOR]

This review paper presents a comprehensive and full review of the so-called optimization algorithm, multi-verse optimizer algorithm (MOA), and reviews its main characteristics and procedures. This optimizer is a kind of the most recent powerful nature-inspired meta-heuristic algorithms, where it has been successfully implemented and utilized in several optimization problems in a variety of several fields, which are covered in this context, such as benchmark test functions, machine learning applications, engineering applications, network applications, parameters control, and other applications of MOA. This paper covers all the available publications that have been used MOA in its application, which are published in the literature including the variants of MOA such as binary, modifications, hybridizations, chaotic, and multi-objective. Followed by its applications, the assessment and evaluation, and finally the conclusions, which interested in the current works on the optimization algorithm, recommend potential future research directions. [ABSTRACT FROM AUTHOR]

Spike trains (STs) induced by external stimuli are complex and challenging to decode the embedded spatiotemporal information. Although various methods have been developed to characterize STs, few applications have been reported in tactile discrimination applications. In this paper, a neurocomputing method based on reference spike train (RST) is proposed to establish a neural computation scheme, on which existing ST metrics could be fed into various traditional models directly. Moreover, existing metrics in the field of statistics and vector measurement are introduced together to extract more discriminative features. With the binning technique and feature selection algorithm applied, the neural computation scheme is aimed at taking advantage of as maximal as possible information contained in tactile signals. Based on our designed artificial fingertip, the effect is validated by improving the recognition accuracy from 77.6% to 83.4% when it is applied to the discrimination of eight roughness surfaces. Furthermore, properties of RST, such as spike intervals and distributions, are evaluated and it is found that RSTs with uniform distribution perform the best for tactile discrimination. [ABSTRACT FROM AUTHOR]

It may not be easy to implement complex AI models in edge devices without strong computing capacity (e.g. GPU). The Universal Approximation Theorem states that a shallow neural network (SNN) can represent any nonlinear function. In this paper, we focus on the learnability and robustness of SNNs, obtained by a greedy tight force heuristic algorithm [a Performance Driven Back-Propagation (PDBP)] and a loose force meta-heuristic algorithm [a variant of particle swarm optimization (VPSO)]. From the engineering prospective, all sensors are well justified for a specific task. Hence, all sensor readings should be strongly correlated to the target, and the structure of an SNN should depend on the dimensions of a problem space. The key findings of the research are summarized as follows: (1) The number of hidden neurons of an SNN depends on the nonlinearity of the training data, and the number of hidden neurons up to the dimension number of a problem space could be enough; (2) The learnability of SNNs, produced by error-driven PDBP, is always better than that of SNNs, optimized by error-driven VPSOs; (3) The performances of SNNs, obtained by PDBPs and VPSOs, do not change much for different training rates; and (4) Comparing with other classic machine learning algorithms, such as C4.5, NB and NN in literature, the SNNs, obtained by accuracy-driven PDBPs, win for all tested data sets, and the improvement percentage is up to 32.86%. Hence, the research could provide valued guidance for the implementation of edge intelligence. [ABSTRACT FROM AUTHOR]

Currently, Iris detection is considered as a significant module for robust biometric systems and high-speed applications such as eye tracking. Most iris segmentation models are based on machine learning algorithms or geometric methods. In this paper, we use an elliptical Hough transform to firstly detect the shape of the palpebral fissure. Then, a correlation-based circular Hough transform (we named it CCHT) is proposed to extract iris from the surrounding structures. One of the advantages of the proposed method is its ability to determine the closed-eye images, in order to remove these images in the process of eye tracking procedure. Moreover, the algorithm is simple and fast which make it suitable for on-line eye tracking. Experimental results on UBIRIS, which contains some defocused and eyelid-occluded images as non-ideal and noisy frames, indicate that the proposed method is efficient and much faster, in comparison with the previous approaches and encouraging improved accuracy on iris detection. [ABSTRACT FROM AUTHOR]

Computer-aided diagnosis system is becoming a more and more important tool in clinical treatment, which can provide a verification of the doctors' decisions. In this paper, we proposed a novel abnormal brain detection method for magnetic resonance image. Firstly, a pre-trained AlexNet was modified with batch normalization layers and trained on our brain images. Then, the last several layers were replaced with an extreme learning machine. A searching method was proposed to find the best number of layers to be replaced. Finally, the extreme learning machine was optimized by chaotic bat algorithm to obtain better classification performance. Experiment results based on 5 × hold-out validation revealed that our method achieved state-of-the-art performance. [ABSTRACT FROM AUTHOR]

In this paper, we proposed a novel regularization and variable selection algorithm called Liu–Lasso extreme learning machine (LL-ELM) in order to deal with the ELM's drawbacks like instability, poor generalizability and underfitting or overfitting due to the selection of inappropriate hidden layer nodes. Liu estimator, which is a statistically biased estimator, is considered in the learning phase of the proposed algorithm with Lasso regression approach. The proposed algorithm is compared with the conventional ELM and its variants including ELM forms based on Liu estimator (Liu-ELM), L 1 -norm (Lasso-ELM), L 2 -norm (Ridge-ELM) and elastic net (Enet-ELM). Convenient selection methods for the determination of tuning parameters for each algorithm have been used in comparisons. The results show that there always exists a d value such that LL-ELM overperforms either Lasso-ELM or Enet-ELM in terms of learning and generalization performance. This improvement in LL-Lasso over Lasso-ELM and Enet-ELM in the sense of testing root mean square error varies up to 27 % depending on the proposed d selection methods. Consequently, LL-ELM can be considered as a competitive algorithm for both regressional and classification tasks because of easy integrability property. [ABSTRACT FROM AUTHOR]

Internet is a new type of information exchange tool that has developed with the times. Now, it has been integrated into all aspects of our study and life. At the same time, in the era of the rise of social media, there are more and more platforms on the Internet. A variety of critical texts have also exploded in these platforms. In these opinions and comments, the subjective opinions of the presenters are included, and the emotional tendencies of the commenters are expressed. Nowadays, subjective text information resources are huge. One of the major problems to be solved by management objects facing information management is how to manage them effectively so that users can quickly and accurately find the required information. Therefore, classifying these text tendencies and mining the potential value in the text has broad application prospects. Based on the text granularity and processing efficiency, this paper conducts multi-granularity emotional block partitioning on network texts and compares the sentiment analysis under different granularities. Furthermore, a random subspace integrated learning text sentiment classification method based on BPSO (binary particle swarm optimization) is proposed to analyze text orientation. By simulating news site comments and e-commerce website reviews such as Taobao, the convergence analysis of BPSO in the optimization of the number of base classifiers shows that the BPSO algorithm can be applied to the random subspace method well, and the accuracy of the classification results is high. [ABSTRACT FROM AUTHOR]

Data clustering is one of the important techniques of data mining that is responsible for dividing N data objects into K clusters while minimizing the sum of intra-cluster distances and maximizing the sum of inter-cluster distances. Due to nonlinear objective function and complex search domain, optimization algorithms find difficulty during the search process. Recently, Harris hawks optimization (HHO) algorithm is proposed for solving global optimization problems. HHO has already proved its efficacy in solving a variety of complex problems. In this paper, a chaotic sequence-guided HHO (CHHO) has been proposed for data clustering. The performance of the proposed approach is compared against six state-of-the-art algorithms using 12 benchmark datasets of the UCI machine learning repository. Various comparative performance analysis and statistical tests have justified the effectiveness and competitiveness of the suggested approach. [ABSTRACT FROM AUTHOR]

In recent years, classifier ensemble techniques have drawn the attention of many researchers in the machine learning research community. The ultimate goal of these researches is to improve the accuracy of the ensemble compared to the individual classifiers. In this paper, a novel algorithm for building ensembles called dynamic programming-based ensemble design algorithm (DPED) is introduced and studied in detail. The underlying theory behind DPED is based on cooperative game theory in the first phase and applying a dynamic programming approach in the second phase. The main objective of DPED is to reduce the size of the ensemble while encouraging extra diversity in order to improve the accuracy. The performance of the DPED algorithm is compared empirically with the classical ensemble model and with a well-known algorithm called "the most diverse." The experiments were carried out with 13 datasets from UCI and three ensemble models. Each ensemble model is constructed from 15 different base classifiers. The experimental results demonstrate that DPED outperforms the classical ensembles on all datasets in terms of both accuracy and size of the ensemble. Regarding the comparison with the most diverse algorithm, the number of selected classifiers by DPED across all datasets and all domains is less than or equal to the number selected by the most diverse algorithm. Experiment on blog spam dataset, for instance, shows that DPED provides an accuracy of 96.47 compared to 93.87 obtained by the most diverse using 40% training size. Finally, the experimental results verify the reliability, stability, and effectiveness of the proposed DPED algorithm. [ABSTRACT FROM AUTHOR]

This paper presents an extreme learning machine-based super-twisting repetitive control (ELMSTRC) to improve the tracking accuracy of periodic signal with less chattering. The proposed algorithm is robust against the plant uncertainties caused by mass and viscous friction variations. Moreover, it compensates the nonlinear friction and the backlash by using extreme learning machine based super-twisting algorithm. Firstly, a repetitive control is designed to track the periodic reference and compensate the viscous friction. Then, a stable extreme learning machine-based super-twisting control is constructed to compensate the aperiodic disturbance, nonlinear friction, backlash and plant uncertainties. The stability of ELMSTRC system is analysed based on Lyapunov stability criteria. The proposed algorithm is verified on a brushless DC servo motor with various loading, backlash and friction conditions. The simulation and experimental comparisons highlight the advantages of the proposed algorithm. [ABSTRACT FROM AUTHOR]

Fuzzy cognitive map (FCM) is an important approach for modeling the behavior of dynamic systems. FCM's ability to represent casual relationships between the concepts (factors, attributes, etc.) has attracted the interest of researchers from different disciplines. The construction process of FCMs is mostly initialized with expert knowledge because FCMs can conveniently incorporate available information and expertise in the determination of vital parameters and relations of the system. However, their higher dependence on expert knowledge may significantly influence the reliability of the model due to the increase in subjectivity. In order to avoid weaknesses depending on expert knowledge, learning algorithms that search for the appropriate relationships between the concepts have been used with FCM studies. In this paper, a FCM analysis was performed for tobacco use to understand the cause–effect relationships between demographic characteristics of people (such as gender, age range, and residence type) and likelihood to tobacco use. In order to reduce the impact of external interventions (from experts), a multi-stage learning procedure was applied by integrating two different learning algorithms (nonlinear Hebbian learning algorithm and extended Great Deluge algorithm). The results showed that the multi-stage learning procedure increased the accuracy of the model and provided more reliable maps for the studied system. They also proved that the multi-stage learning procedures can help to reduce the dependency to expert knowledge and improve the robustness of the study. [ABSTRACT FROM AUTHOR]

Label manipulation attacks are a subclass of data poisoning attacks in adversarial machine learning used against different applications, such as malware detection. These types of attacks represent a serious threat to detection systems in environments having high noise rate or uncertainty, such as complex networks and Internet of Thing (IoT). Recent work in the literature has suggested using the K-nearest neighboring algorithm to defend against such attacks. However, such an approach can suffer from low to miss-classification rate accuracy. In this paper, we design an architecture to tackle the Android malware detection problem in IoT systems. We develop an attack mechanism based on silhouette clustering method, modified for mobile Android platforms. We proposed two convolutional neural network-type deep learning algorithms against this Silhouette Clustering-based Label Flipping Attack. We show the effectiveness of these two defense algorithms—label-based semi-supervised defense and clustering-based semi-supervised defense—in correcting labels being attacked. We evaluate the performance of the proposed algorithms by varying the various machine learning parameters on three Android datasets: Drebin, Contagio, and Genome and three types of features: API, intent, and permission. Our evaluation shows that using random forest feature selection and varying ratios of features can result in an improvement of up to 19% accuracy when compared with the state-of-the-art method in the literature. [ABSTRACT FROM AUTHOR]

This paper aims to improve data-driven prognostics by presenting a novel approach of directly estimating the remaining useful life (RUL) of aero-engines without requiring setting any failure threshold information or estimating degradation states. Specifically, based on the sensory data, RUL estimations are directly obtained through the universal function approximation capability of the extreme learning machine (ELM) algorithm. To achieve this, the features related with the RUL are first extracted from the sensory data as the inputs of the ELM model. Besides, to optimize the number of observed sensors, three evaluation metrics of correlation, monotonicity and robustness are defined and combined to automatically select the most relevant sensor values for more effective and efficient remaining useful life predictions. The validity and superiority of the proposed approach is evaluated by the widely used turbofan engine datasets from NASA Ames prognostics data repository. The proposed approach shows improved RUL estimation applicability at any time instant of the degradation process without determining the failure thresholds. This also simplifies the RUL estimation procedure. Moreover, the random properties of hidden nodes in the ELM learning mechanisms ensures the simplification and efficiency for real-time implementation. Therefore, the proposed approach suits to real-world applications in which prognostics estimations are required to be fast. [ABSTRACT FROM AUTHOR]

In this paper, a novel distributed elastic random weights network (DERWN) is proposed to achieve robust surface reconstruction from highly noisy point clouds sampled from real surface. The designed elastic regularization with l 1 and l 2 penalty items makes the network more resilient to noise and effectively capture the intrinsic shape of surface. Sparsity constraints of output weight vectors and threshold-based nodes removal are conducive to determining appropriate number of hidden nodes of network and optimizing the distribution of hidden nodes. The distributed optimization manner in DERWN on the basis of alternating direction method of multipliers solves the problem that traditional RWN learning algorithm suffers from the limitation of memory with large-scale data. The proposed DERWN achieves a solution to global problem by solving local subproblems coordinately. Experimental results show that the proposed DERWN algorithm can robustly reconstruct the unknown surface in case of highly noisy data with satisfying accuracy and smoothness. [ABSTRACT FROM AUTHOR]

Incremental extreme learning machine has been verified that it has the universal approximation capability. However, there are two major issues lowering its efficiency: one is that some "random" hidden nodes are inefficient which decrease the convergence rate and increase the structural complexity, the other is that the final output weight vector is not the minimum norm least-squares solution which decreases the generalization capability. To settle these issues, this paper proposes a simple and efficient algorithm in which the parameters of even hidden nodes are calculated by fitting the residual error vector in the previous phase, and then, all existing output weights are recursively updated based on inverse partitioned matrix. The algorithm can reduce the inefficient hidden nodes and obtain a preferable output weight vector which is always the minimum norm least-squares solution. Theoretical analyses and experimental results show that the proposed algorithm has better performance on convergence rate, generalization capability and structural complexity than other incremental extreme learning machine algorithms. [ABSTRACT FROM AUTHOR]

The growing volume and complexity of data has led to the development of the so-called linear algorithms for neural networks like ELM, which maintain the precision of classic algorithms but with higher training speed. This speed increase is due to a simpler architecture, the random fixing of the input weights without being trained and the analytical calculation of the output weights instead of the slowly classical iterative gradient methods as Backpropagation. However, the random fixing of the input weights increases the sensibility to input perturbations like noise. Recently, No-Propagation (No-Prop) algorithm has been introduced as another linear algorithm, which shares with ELM the architecture and the random input weights (hidden weights) initialization. In this paper, an exhaustive comparison of both algorithms and its regularized versions are presented. The simulations results suggest that No-Prop is a competitive alternative to the ELM algorithm. [ABSTRACT FROM AUTHOR]

Among the extensions of twin support vector machine (TSVM), some scholars have utilized K-nearest neighbor (KNN) graph to enhance TSVM's classification accuracy. However, these KNN-based TSVM classifiers have two major issues such as high computational cost and overfitting. In order to address these issues, this paper presents an enhanced regularized K-nearest neighbor-based twin support vector machine (RKNN-TSVM). It has three additional advantages: (1) Weight is given to each sample by considering the distance from its nearest neighbors. This further reduces the effect of noise and outliers on the output model. (2) An extra stabilizer term was added to each objective function. As a result, the learning rules of the proposed method are stable. (3) To reduce the computational cost of finding KNNs for all the samples, location difference of multiple distances-based K-nearest neighbors algorithm (LDMDBA) was embedded into the learning process of the proposed method. The extensive experimental results on several synthetic and benchmark datasets show the effectiveness of our proposed RKNN-TSVM in both classification accuracy and computational time. Moreover, the largest speedup in the proposed method reaches to 14 times. [ABSTRACT FROM AUTHOR]

Support vector machine (SVM) is a widely used and reliable machine learning algorithm. It has been successfully applied to many real-world problems, with remarkable results. However, it has also been observed that SVM computational complexity increases with the increase in data size. Although many SVM speed optimization techniques have been proposed in the literature, there is still need for further improvement on the performance speed and accuracy of this algorithm. In this paper, a boundary detection algorithm for SVM speed optimization called ant colony optimization instance selection algorithm (ACOISA) is proposed. ACOISA is inspired by edge selection in ant colony optimization (ACO) algorithm, and it performs two primary functions: boundary detection and boundary instance selection. In the algorithm, ACO is used for boundary detection and k-nearest neighbor algorithm is used for boundary instance selection. Different sets of experiments are carried out to validate the efficiency of the proposed technique. All the experiments were performed on 35 datasets containing three well-known e-fraud types (credit card fraud, email spam and phishing email) and 31 other datasets available at UCI data repository. The experimental results showed that the proposed technique efficiently improved SVM training speed in 100% of the datasets used for evaluation, without significantly affecting SVM classification quality. Furthermore, the Freidman's and Holm's post hoc tests were conducted to statistically validate the credibility of the results. The statistical test results revealed that the proposed technique is significantly faster, compared to the standard SVM and some existing instance selection techniques, in all cases. [ABSTRACT FROM AUTHOR]

This paper completely introduces an exhaustive and a comprehensive review of the so-called salp swarm algorithm (SSA) and discussions its main characteristics. SSA is one of the efficient recent meta-heuristic optimization algorithms, where it has been successfully utilized in a wide range of optimization problems in different fields, such as machine learning, engineering design, wireless networking, image processing, and power energy. This review shows the available literature on SSA, including its variants, like binary, modifications and multi-objective. Followed by its applications, assessment and evaluation, and finally the conclusions, which focus on the current works on SSA, suggest possible future research directions. [ABSTRACT FROM AUTHOR]

Job shop scheduling problem is a well-known NP problem. It is limited by various conditions. As the scale of the problem increases, the difficulty of finding the optimal solution will increase. It is a difficult combination problem. Limited by the constraints of the actual production environment, how to effectively arrange the processing order of each part will directly affect the production efficiency, the appropriate production scheduling algorithm can correctly and effectively plan the enterprise resources and rationally arrange the processing order and processing time of the workpiece. Proper use of existing resources, by optimizing production scheduling instructions, to meet the basic requirements of production scheduling, in order to obtain the optimization of total production time, has important theoretical significance for the actual production of enterprises. In this paper, the mathematical model is abstracted on the basis of the production scheduling problem. According to the different parts of the same machine and the different processes of the same part, the corresponding processing time and waiting time are obtained. At the same time, the genetic algorithm is improved by genetic algorithm. A dynamic genetic operator based on the number of iterations is proposed, which further enhances the convergence performance and search ability of the genetic algorithm. Through the simulation of MATLAB simulation program, combined with the scheduling standard example, the performance analysis of different algorithms is carried out, the search efficiency of genetic algorithm is improved, the convergence performance of the algorithm is improved, and different optimization choices are obtained for different time weights. The operation results of the system meet the requirements of production scheduling, which proves the feasibility and practicability of the improved genetic algorithm. [ABSTRACT FROM AUTHOR]

This paper proposes a hybridized machine-learning framework called Extreme Learning Machine using self-adaptive multi-population-based Jaya algorithm for forecasting the currency exchange value. This learning technique attempts to take the advantages of generalization ability of Extreme Learning Machines (ELMs) along with the multi-population search scheme of Jaya optimization technique. This model can very well forecast the exchange price of USD–INR and USD–EURO based on statistical measures, technical indicators and combination of both measures over a time frame varying from 1 day to 1 month ahead. Proposed model has been compared with original ELM and ELM-Jaya along with technical analysis method such as discrete wavelet neural network optimized with self-adaptive multi-population-based Jaya and the comparison of different performance measures like MAPE, Theil's U, ARV and MAE reveal that ELM using self-adaptive multi-population-based Jaya hybrid models possesses superior compared to the rest predictive models. Comparison of different features demonstrates technical indicators outperform other two features such as statistical measures and combination of both technical indicators and statistical measures. [ABSTRACT FROM AUTHOR]

Movie box-office research is an important work for the rapid development of the film industry, and it is also a challenging task. Our study focuses on finding the regular box-office revenue patterns. Clustering algorithm is unsupervised machine learning algorithm which classifies the data in the absence of early knowledge of the classes. Unlike static data, the time series data vary with time. The work focused on time series clustering analysis is relatively less than those focused on static data. In this paper, the sparse subspace clustering (SSC) algorithm is introduced to analyze the time series data. The SSC algorithm has a better performance both on the artificial data set and the daily box-office data than recently developed well-known clustering algorithm such as K-means and spectral clustering algorithm. On the artificial data set, SSC is more suitable for time series, whether from the angle of clustering error or visualization. On the actual data, movies are divided into five clusters by SSC algorithm, and each cluster represents a distinct type of distribution pattern. And these patterns can be used in movie recommendation, film evaluation and can guide theater exhibitors and distributors. In addition, this is the first time to apply SSC to deal with time series clustering problem and get a pleasant effect. [ABSTRACT FROM AUTHOR]

Orthogonal frequency-division multiplexing (OFDM) is one of the most successful digital communication techniques. Nevertheless, the decrease in inter-symbol interference in quadrature amplitude modulation (QAM) over dispersive channels is still challenging. Different researches recently proposed the idea of using unsupervised learning as an alternative to the classic approaches to equalization of OFDM channels. In those purposes, the identification of a received QAM symbol is possible by the comparison of its position on the in-phase/quadrature (IQ) plane relative to the positions of previously arrived symbols, generally processed by the Kohonen’s Self-Organizing Map (SOM) algorithm. This work presents the SOM unsupervised learning method executed on an embedded system applied to QAM symbols identification. The system is implemented on an FPGA, a configurable digital circuit able to meet the low power and parallel process requirements of mobile applications. Also, in order to extend the classical set of experiments to evaluate our system, this paper proposes a theoretical model of the time-varying scheme representing the transition between different channel characteristics, obtained from real measurements available on a public repository. The model is employed to verify our purpose under dynamically both changing and realistic conditions. On the assumption that it is provided enough IQ symbols for the initial training process, the hardware implementation of SOM is able to track and identify the time-varying distorted QAM constellation. No knowledge of channel characteristics is necessary. The system spends only some microseconds at start-up to reach about 100% performance, and no dedicated training phase is needed afterward. [ABSTRACT FROM AUTHOR]

Liao et al. (Neurocomputing 128:81-87, 2014) proposed a meta-learning approach to extreme learning machine (Meta-ELM), which can obtain good generalization performance by training multiple ELMs. However, one of its open problems is overfitting when minimizing training error. In this paper, we propose an improved meta-learning model of ELM (improved Meta-ELM) to handle the problem. The improved Meta-ELM architecture is composed of some base ELMs which are error feedback incremental extreme learning machine (EFI-ELM) and the top ELM. The improved Meta-ELM includes two stages. First, each base ELM with EFI-ELM is trained on a subset of training data. Then, the top ELM learns with the base ELMs as hidden nodes. Simulation results on some artificial and benchmark datasets show that the proposed improved Meta-ELM model is more feasible and effective than Meta-ELM. [ABSTRACT FROM AUTHOR]

Object tracking still remains challenging in computer vision because of the severe object variation, e.g., deformation, occlusion, and rotation. To handle the object variation and achieve robust object tracking performance, we propose a novel relationship-based tracking algorithm using neural networks in this paper. Compared with existing approaches in the literature, our method assumes the targeted object to be consisted of several parts and considers the evolution of the topology structure among these parts. After training a candidate neural network for predicting the probable areas each part may locate at in the successive frame, we then design a novel collaboration neural network to determine the precise area each part will locate at with account for the topology structure among these individual parts, which is learned from their historical physical locations during online tracking process. Experimental results show that the proposed method outperforms state-of-the-art trackers on a benchmark dataset, yielding the significant improvements in accuracy on high-distorted sequences. [ABSTRACT FROM AUTHOR]

This paper presents a new method based on fuzzy cognitive map (FCM) and possibilistic fuzzy c-means (PFCM) clustering algorithm for categorizing celiac disease (CD). CD is a complex disorder whose development is affected by genetics (HLA alleles) and gluten ingestion. The celiac patients who are not treated are at a high risk of cancer, malignant lymphoma, and small bowel neoplasia. Therefore, CD diagnosis and grading are of paramount importance. The proposed FCM models human thinking for the purpose of classifying patients suffering from CD. We used the latest grading method where three grades A, B1, and B2 are used. To improve FCM efficiency and classification capability, a nonlinear Hebbian learning algorithm is applied for adjusting the FCM weights. To this end, 89 cases are studied. Three experts extracted seven main determinant characteristics of CD which were considered as FCM concepts. The mutual effects of these concepts on one another and on the final concept were expressed in the form of fuzzy rules and linguistic variables. Using the center of gravity defuzzifier, we obtained the numerical values of these weights and obtained the total weight matrix. Ultimately, combining the FCM model with PFCM algorithm, we obtained the grades A, B1, and B2 accuracies as 88, 90, and 91%, respectively. The main advantage of the proposed FCM is the good transparency and interpretability in the decision-making procedure, which make it a suitable tool for daily usage in the clinical practice. [ABSTRACT FROM AUTHOR]

In the fields of pattern recognition and machine learning, the use of data preprocessing algorithms has been increasing in recent years to achieve high classification performance. In particular, it has become inevitable to use the data preprocessing method prior to classification algorithms in classifying medical datasets with the nonlinear and imbalanced data distribution. In this study, a new data preprocessing method has been proposed for the classification of Parkinson, hepatitis, Pima Indians, single proton emission computed tomography (SPECT) heart, and thoracic surgery medical datasets with the nonlinear and imbalanced data distribution. These datasets were taken from UCI machine learning repository. The proposed data preprocessing method consists of three steps. In the first step, the cluster centers of each attribute were calculated using k-means, fuzzy c-means, and mean shift clustering algorithms in medical datasets including Parkinson, hepatitis, Pima Indians, SPECT heart, and thoracic surgery medical datasets. In the second step, the absolute differences between the data in each attribute and the cluster centers are calculated, and then, the average of these differences is calculated for each attribute. In the final step, the weighting coefficients are calculated by dividing the mean value of the difference to the cluster centers, and then, weighting is performed by multiplying the obtained weight coefficients by the attribute values in the dataset. Three different attribute weighting methods have been proposed: (1) similarity-based attribute weighting in k-means clustering, (2) similarity-based attribute weighting in fuzzy c-means clustering, and (3) similarity-based attribute weighting in mean shift clustering. In this paper, we aimed to aggregate the data in each class together with the proposed attribute weighting methods and to reduce the variance value within the class. Thus, by reducing the value of variance in each class, we have put together the data in each class and at the same time, we have further increased the discrimination between the classes. To compare with other methods in the literature, the random subsampling has been used to handle the imbalanced dataset classification. After attribute weighting process, four classification algorithms including linear discriminant analysis, k-nearest neighbor classifier, support vector machine, and random forest classifier have been used to classify imbalanced medical datasets. To evaluate the performance of the proposed models, the classification accuracy, precision, recall, area under the ROC curve, κ value, and F-measure have been used. In the training and testing of the classifier models, three different methods including the 50-50% train-test holdout, the 60-40% train-test holdout, and tenfold cross-validation have been used. The experimental results have shown that the proposed attribute weighting methods have obtained higher classification performance than random subsampling method in the handling of classifying of the imbalanced medical datasets. [ABSTRACT FROM AUTHOR]

Single-hidden-layer feedforward neural network (SLFN) is an effective model for data classification and regression. However, it has a very important defect that it is rather time-consuming to explore the training algorithm of SLFN. In order to shorten the learning time, a special non-iterative learning algorithm was proposed, named as extreme learning machine (ELM). The main idea is that the input weights and bias are chosen randomly and the output weights are calculated by a pseudo-inverse matrix. However, ELM also has a very important drawback that it cannot achieve stable solution for different runs because of randomness. In this paper, we propose a stabilized learning algorithm based on iteration correction. The convergence analysis shows that the proposed algorithm can finish the learning process in fewer steps than the number of neurons. Three theorems and their proofs can prove that the proposed algorithm is stable. Several data sets are selected from UCI databases, and the experimental results demonstrate that the proposed algorithm is effective. [ABSTRACT FROM AUTHOR]

Twin support vector machine (TWSVM) has gained increasing interest from various research fields recently. In this paper, we aim to report the current state of the theoretical research and practical advances on TWSVM. We first give the basic thought and theory of TWSVM, including the theory of proximal support vector machine, generalized eigenvalue proximal support vector machine, and TWSVM. Then, we focus on the various improvements made to TWSVM, mainly including least squares twin support vector machine, smooth twin support vector machine, regularized twin support vector machine, projection twin support vector machine, and modified TWSVM on the model selection problem. These newly emerging algorithms greatly expand the applications of TWSVM. In recent years, there is a lot of research on application of TWSVM. Next, we list some research on application of TWSVM in detail. Finally, we try to provide a comprehensive view of these advances in TWSVM and discuss the direction of future research. [ABSTRACT FROM AUTHOR]

In this paper, an adaptive control algorithm is proposed for a class of robot manipulator systems with unknown functions and dead-zone input by using a reinforcement learning scheme. The parameters of the dead zone are supposed to be unknown but bounded. The unknown functions can be approximated based on the neural networks, which is one part of the reinforcement learning scheme, namely an action network. The other part is called critic network which is used to approximate the reinforcement signal. Then, the prominent advantage of the proposed approach is that an optimal control input can be obtained by using two networks compared with the results of robot manipulator with dead zone: an additional term is given to compensate for the effect of the dead zone, and a special design procedure to solve the difficulties in constructing the controllers and adaptation laws. Based on the Lyapunov analysis theory, all the signals of the closed-loop system are proved to be bounded and the system output can track the reference signal to a bounded compact set. Finally, a simulation example is given to illustrate the effectiveness of the approach. [ABSTRACT FROM AUTHOR]

In many real-world applications in the areas of data mining, the distributions of testing data are different from that of training data. And on the other hand, many data are often represented by multiple views which are of importance to learning. However, little work has been done for it. In this paper, we explored to leverage the multi-view information across different domains for knowledge transfer. We proposed a novel transfer learning model which integrates the domain distance and view consistency into a 2-view support vector machine framework, namely DV2S. The objective of DV2S is to find the optimal feature mapping such that under the projections the classification margin is maximized, while both the domain distance and the disagreement between multiple views are minimized simultaneously. Experiments showed that DV2S outperforms a variety of state-of-the-art algorithms. [ABSTRACT FROM AUTHOR]