Search

• Pinch force strength is accurately predicted using sEMG. • Different pinch movements are accurately classified using sEMG. • Similarity of EMG features is evaluated. • An EMG feature-to-image method is proposed. The movement of intelligent EMG-driven prosthesis mainly relies on the synergy of different fingers to achieve function of grasping objects. The paper proposes a novel scheme for force prediction and movement classification about pinch between different fingers based on surface electromyography (sEMG) using machine learning. The pinch force and sEMG signals are recorded synchronously by a data acquisition device. Eight features are extracted, which are proven to have better performance in the estimation of sEMG-to-force. We present a novel feature selection method that uses the one-dimensional time series similarity assessment based on Manhattan distance to eliminate the repetitive information between features. Three optimal features carrying less repetitive information are retained. Seven machine learning algorithms are used to predict force strength. The results show that the Long Short Term Memory (LSTM) has the best performance of force prediction, achieving a R 2 of 0.9517 and RMSE of 3.2723. The paper proposes a novel method of converting EMG feature sequences to the normalized gray image in order to classify the finger movement. Five classifiers based on image feature extraction and the Convolutional Neural Network (CNN) are developed respectively. The experimental results indicate that the CNN performs best, achieving an accuracy of 97.66%. In this way, it not only realizes the accurate force prediction, but also realizes the movement classification between different fingers. The proposed methodology has the potential to realize simultaneous force and movement control of prosthetic hand. [ABSTRACT FROM AUTHOR]

In semiconductor manufacturing, wafer map defect pattern provides critical information for facility maintenance and yield management, so the classification of defect patterns is one of the most important tasks in the manufacturing process. In this paper, we propose a novel way to represent the shape of the defect pattern as a finite-dimensional vector, which will be used as an input for a neural network algorithm for classification. The main idea is to extract the topological features of each pattern by using the theory of persistent homology from topological data analysis (TDA). Through some experiments with a simulated dataset, we show that the proposed method is faster and much more efficient in training with higher accuracy, compared with the method using convolutional neural networks (CNN) which is the most common approach for wafer map defect pattern classification. Moreover, it was shown that our method outperforms the CNN-based method when the number of training data is not enough and is imbalanced. • A novel approach for wafer map defect pattern classification is proposed. • This new method is based on the theory from topological data analysis. • The proposed method is accurate and computationally efficient. • This algorithm is fast enough to provide a real-ti me prediction. • This method is robust against a small and imbalanced dataset. [ABSTRACT FROM AUTHOR]

The aim of this paper is, first, to recall fuzzy relational compositions (products) and, to introduce an idea, how excluding features could be incorporated into the theoretical background. Apart from definitions, we provide readers with a theoretical investigation. This investigation addresses two natural questions. Firstly, under which conditions (in which underlying algebraic structures) the given three natural approaches to the incorporation of excluding symptoms coincide. And secondly, under which conditions, the proposed incorporation of excluding features preserves the same natural and desirable properties similar to those preserved by fuzzy relational compositions. The positive impact of the incorporation on reducing the suspicions provided by the basic “circlet” composition without losing the possibly correct suspicion is demonstrated on a real taxonomic identification (classification) of Odonata. Here, we demonstrate how the proposed concept may eliminate the weaknesses provided by the classical fuzzy relational compositions and, at the same time, compete with powerful machine learning methods. The aim of the demonstration is not to show that proposed concept outperforms classical approaches, but to show, that its potential is strong enough in order to complete them or in order to be combined with them and to use its different nature. [ABSTRACT FROM AUTHOR]

Over the last few decades, classification applied to numerous applications in science, engineering, business and industries have rapidly been increased, especially for big data. However, classifiers dealing with complicated high dimension problems with non-conforming patterns with high accuracy are rare, especially for bit-level features. It is a challenging research problem. This paper proposed a novel efficient classifier based on cellular automata model, called Cellular Automata-based Classifier (CAC). CAC possesses the promising capability to deal with non-conforming patterns in the bit-level features. It was developed on a new kind of the proposed elementary cellular automata, called Decision Support Elementary Cellular Automata (DS-ECA). The classification capability of DS-ECA is promising since it can describe very complicated decision rule in high dimension problems with less complexity. CAC comprises double rule vectors and a decision function, the structure of which has two layers; the first layer is employed to evolve an input pattern into feature space and the other interprets the patterns in feature space as binary answer through the decision function. It has a time complexity of learning at O( n 2 ), while the classification for one instance is O(1), where n is a number of bit patterns. For classification performance, 12 datasets consisting of binary and non-binary features are empirically implemented in comparison with Support Vector Machines (SVM) using k -fold cross validation. In this respect, CAC outperforms SVM with the best kernel for binary features, and provides the promising results equivalent to SVM on average for non-binary features. [ABSTRACT FROM AUTHOR]

Hierarchical multi-label text classification (HMTC) has been gaining popularity in recent years thanks to its applicability to a plethora of real-world applications. The existing HMTC algorithms largely focus on the design of classifiers, such as the local, global, or a combination of them. However, very few studies have focused on hierarchical feature extraction and explore the association between the hierarchical labels and the text. In this paper, we propose a L abel-based A ttention for H ierarchical Multi-label Text C lassification Neural N etwork (LA-HCN), where the novel label-based attention module is designed to hierarchically extract important information from the text based on the labels from different hierarchy levels. Besides, hierarchical information is shared across levels while preserving the hierarchical label-based information. Separate local and global document embeddings are obtained and used to facilitate the respective local and global classifications. In our experiments, LA-HCN outperforms other state-of-the-art neural network-based HMTC algorithms on four public HMTC datasets. The ablation study also demonstrates the effectiveness of the proposed label-based attention module as well as the novel local and global embeddings and classifications. By visualizing the learned attention (words), we find that LA-HCN is able to extract meaningful information corresponding to the different labels which provides explainability that may be helpful for the human analyst. • Proposed label-based attention can improve performance and provide interpretability. • Information can be shared across hierarchical layers while avoiding error propagation. • Respective document embedding is generated for local and global classification to prevent error propagation. [ABSTRACT FROM AUTHOR]

Abstract: When classifying search queries into a set of target categories, machine learning based conventional approaches usually make use of external sources of information to obtain additional features for search queries and training data for target categories. Unfortunately, these approaches rely on large amount of training data for high classification precision. Moreover, they are known to suffer from inability to adapt to different target categories which may be caused by the dynamic changes observed in both Web topic taxonomy and Web content. In this paper, we propose a feature-free classification approach using semantic distance. We analyze queries and categories themselves and utilizes the number of Web pages containing both a query and a category as a semantic distance to determine their similarity. The most attractive feature of our approach is that it only utilizes the Web page counts estimated by a search engine to provide the search query classification with respectable accuracy. In addition, it can be easily adaptive to the changes in the target categories, since machine learning based approaches require extensive updating process, e.g., re-labeling outdated training data, re-training classifiers, to name a few, which is time consuming and high-cost. We conduct experimental study on the effectiveness of our approach using a set of rank measures and show that our approach performs competitively to some popular state-of-the-art solutions which, however, frequently use external sources and are inherently insufficient in flexibility. [Copyright &y& Elsevier]

Abstract: This paper aims at designing better performing feature-projection based classification algorithms and presents two new such algorithms. These algorithms are batch supervised learning algorithms and represent induced classification knowledge as feature intervals. In both algorithms, each feature participates in the classification by giving real-valued votes to classes. The prediction for an unseen example is the class receiving the highest vote. The first algorithm, OFP.MC, learns on each feature pairwise disjoint intervals which minimize feature classification error. The second algorithm, GFP.MC, constructs feature intervals by greedily improving the feature classification error. The new algorithms are empirically evaluated on twenty datasets from the UCI repository and are compared with the existing feature-projection based classification algorithms (FIL.IF, VFI5, CFP, k-NNFP, and NBC). The experiments demonstrate that the OFP.MC algorithm outperforms other feature-projection based classification algorithms. The GFP.MC algorithm is slightly inferior to the OFP.MC algorithm, but, if it is used for datasets with large number of instances, then it reduces the space requirement of the OFP.MC algorithm. The new algorithms are insensitive to boundary noise unlike the other feature-projection based classification algorithms considered here. [Copyright &y& Elsevier]

Abstract: Support Vector Machines (SVM) has been developed for Chinese official document classification in One-against-All (OAA) multi-class scheme. Several data retrieving techniques including sentence segmentation, term weighting, and feature extraction are used in preprocess. We observe that most documents of which contents are indistinguishable make poor classification results. The traditional solution is to add misclassified documents to the training set in order to adjust classification rules. In this paper, indistinguishable documents are observed to be informative for strengthening prediction performance since their labels are predicted by the current model in low confidence. A general approach is proposed to utilize decision values in SVM to identify indistinguishable documents. Based on verified classification results and distinguishability of documents, four learning strategies that select certain documents to training sets are proposed to improve classification performance. Experiments report that indistinguishable documents are able to be identified in a high probability and are informative for learning strategies. Furthermore, LMID that adds both of misclassified documents and indistinguishable documents to training sets is the most effective learning strategy in SVM classification for large set of Chinese official documents in terms of computing efficiency and classification accuracy. [Copyright &y& Elsevier]

Abstract: In this paper, we developed a diagnosis model based on support vector machines (SVM) with a novel hybrid feature selection method to diagnose erythemato-squamous diseases. Our proposed hybrid feature selection method, named improved F-score and Sequential Forward Search (IFSFS), combines the advantages of filter and wrapper methods to select the optimal feature subset from the original feature set. In our IFSFS, we improved the original F-score from measuring the discrimination of two sets of real numbers to measuring the discrimination between more than two sets of real numbers. The improved F-score and Sequential Forward Search (SFS) are combined to find the optimal feature subset in the process of feature selection, where, the improved F-score is an evaluation criterion of filter method, and SFS is an evaluation system of wrapper method. The best parameters of kernel function of SVM are found out by grid search technique. Experiments have been conducted on different training-test partitions of the erythemato-squamous diseases dataset taken from UCI (University of California Irvine) machine learning database. Our experimental results show that the proposed SVM-based model with IFSFS achieves 98.61% classification accuracy and contains 21 features. With these results, we conclude our method is very promising compared to the previously reported results. [ABSTRACT FROM AUTHOR]

Abstract: Bearings in the machines are the major components of interest for condition monitoring. Their failure causes increase in down time and maintenance cost. A possible solution to the problem is developing an on-line condition monitoring system. The vibration characteristics can be a determining factor that will reveal the condition of the bearing parts. Visual inspection of frequency-domain features of the vibration signals may be sufficient to identify the faults, but it requires large domain knowledge and it is a function of speed. Automatic diagnostic techniques allow relatively unskilled operators to make important decisions. In this context, machine learning algorithms have been successfully used to solve the problem with the help of vibration signals. The machine learning procedure has three important phases: feature extraction, feature selection and feature classification. Feature selection involves identifying the good features that contributes greatly for classification and determining the number of such features. Often researchers overlook the later issue and arbitrarily choose the number of features. As there is no science that will tell the right number of features, for a given problem, an extensive study is needed to find the optimum number of features and this paper presents the results of such a study using SVM and PSVM classifiers for statistical and histogram features of time domain signal. The findings are very interesting and challenging; some useful conclusions were drawn and presented. [ABSTRACT FROM AUTHOR]

Abstract: This paper presents a procedure to add broader diversity at the beginning of the evolutionary process. It consists of creating two initial populations with different parameter settings, evolving them for a small number of generations, selecting the best individuals from each population in the same proportion and combining them to constitute a new initial population. At this point the main loop of an evolutionary algorithm is applied to the new population. The results show that our proposal considerably improves both the efficiency of previous methodologies and also, significantly, their efficacy in most of the data sets. We have carried out our experimentation on twelve data sets from the UCI repository and two complex real-world problems which differ in their number of instances, features and classes. [Copyright &y& Elsevier]

Abstract: In this paper, we propose a novel Hybrid Higher Order Neural Classifier (HHONC) which contains different high-order units. In contrast with conventional fully-connected higher order neural networks (HONN), our proposed method uses fewer learning parameters and allocates the best fitted model in dealing with different datasets by modifying the orders of different high-order units and updating the learning parameters. Structure, model selection and updating the learning parameters of HHONC is introduced and is applied in classification of the Iris data set, the breast cancer data set, the Wine recognition data set, the Glass identification data set, the Balance scale data set, and the Pima diabetes data set. Acquired results are compared with the methods presented in . It is observed that the fewer features the dataset contains, the more accurate the HHONC performs, however the accuracy of datasets with more features are acceptable. Experimental results show about 3.5% and 0.6% improvements compared to the best accuracy obtained in previously methods for classifying the Pima diabetes and Iris datasets, respectively. In addition, by using a same method for reducing the feature number, it’s shown the proposed method perform more accurate than methods presented in . In this case, improvements compared to the best acquired accuracy of mentioned methods are about 1.7%, 1.3% and 0.2% in classification of Pima, Iris and Breast cancer datasets, respectively. [Copyright &y& Elsevier]

Abstract: The inclusion of irrelevant, redundant, and inconsistent features in the data-mining model results in poor predictions and high computational overhead. This paper proposes a novel information theoretic-based interact (IT-IN) algorithm, which concerns the relevance, redundancy, and consistency of the features. The proposed IT-IN algorithm is compared with existing Interact, FCBF, Relief and CFS feature selection algorithms. To evaluate the classification accuracy of IT-IN and remaining four feature selection algorithms, Naïve Bayes, SVM, and ELM classifier are used for ten UCI repository datasets. The proposed IT-IN performs better than existing above algorithms in terms of number of features. The specially designed hash function is used to speed up the IT-IN algorithms and provides minimum computation time than the Interact algorithms. The result clearly reveals that the proposed feature selection algorithm improves the classification accuracy for ELM, Naïve Bayes, and SVM classifiers. The performance of proposed IT-IN with ELM classifier is superior to other classifiers. [ABSTRACT FROM AUTHOR]

Abstract: This paper is concerned with a two stage procedure for designing a sequential SVM committee and selecting features for the committee from multiple feature sets. It is assumed that features of one type comprise one feature set. Selection of both features and hyper-parameters of SVM classifiers comprising the committee is integrated into one learning process based on genetic search. The designing process focuses on feature selection for pair-wise classification implemented by the SVM. In the first stage, a series of pair-wise SVM are designed starting from the original feature sets as well as from sets created by simple random selection from the original ones. Outputs of the SVM are then converted into probabilities and used as inputs to the second stage SVM. When testing the technique in a three-class classification problem of voice data, a statistically significant improvement in classification accuracy was obtained if compared to parallel committees. The number of feature types and features selected for the pair-wise classification are class specific. [Copyright &y& Elsevier]

Abstract: There are irrelevant features that are redundant or significantly degrade the learning accuracy in the real-world complex classification tasks. This paper presents a new hybrid learning algorithm based on a cooperative coevolutionary algorithm (Co-CEA) with dual populations for designing the radial basis function neural network (RBFNN) models with an explicit feature selection. This approach attempts to complete both the RBFNN construction and the feature selection simultaneously. The proposed algorithm utilizes the Co-CEA’s divide-and-cooperative mechanism, which utilizes the evolutionary algorithms executing in parallel to coevolve subpopulations, corresponding to the hidden layer structure and the dominate features respectively. The algorithm adopts the binary encoding to represent the feature subset and the matrix-form mixed encoding to represent the RBFNN hidden layer structure, and a complete solution is formed via collaborations among the two subpopulations. Experimental results illustrate that the proposed algorithm outperforms other algorithms in references in terms of the classification accuracy, and it is able to obtain both prominent features and good RBFNN structure with higher prediction capability. [Copyright &y& Elsevier]

In this paper, an automatic diagnosis system based on Linear Discriminant Analysis (LDA) and Adaptive Network based on Fuzzy Inference System (ANFIS) for hepatitis diseases is introduced. This automatic diagnosis system deals with the combination of feature extraction and classification. This automatic hepatitis diagnosis system has two stages, which feature extraction ¿ reduction and classification stages. In the feature extraction ¿ reduction stage, the hepatitis features were obtained from UCI Repository of Machine Learning Databases. Then, the number of these features was reduced to 8 from 19 by using Linear Discriminant Analysis (LDA). In the classification stage, these reduced features are given to inputs ANFIS classifier. The correct diagnosis performance of the LDA-ANFIS automatic diagnosis system for hepatitis disease is estimated by using classification accuracy, sensitivity and specificity analysis, respectively. The classification accuracy of this LDA-ANFIS automatic diagnosis system for the diagnosis of hepatitis disease was obtained in about 94.16%. [Copyright &y& Elsevier]