A Feature Adaptive Learning Method for High-Density sEMG-Based Gesture Recognition

2021 ◽  
Vol 5 (1) ◽  
pp. 1-26
Author(s):  
Yingwei Zhang ◽  
Yiqiang Chen ◽  
Hanchao Yu ◽  
Xiaodong Yang ◽  
Ruizhe Sun ◽  
...  
Keyword(s):  
Ensemble Learning ◽  
Gesture Recognition ◽  
Adaptive Learning ◽  
State Of The Art ◽  
Learning Method ◽  
Cloud Server ◽  
The Matrix ◽  
Benchmark Datasets ◽  
World Environment ◽  
Server Collaboration

Surface electromyography (sEMG) array based gesture recognition, which is widely-used, could provide natural surfaces for human-computer interaction. Currently, most existing gesture recognition methods with sEMG array only work with the fixed and pre-defined electrodes configuration. However, changes in the number of electrodes (i.e., increment or decrement) is common in real scenarios due to the variability of physiological electrodes. In this paper, we study this challenging problem and propose a random forest based ensemble learning method, namely feature incremental and decremental ensemble learning (FIDE). FIDE is able to support continuous changes in the number of electrodes by dynamically maintaining the matrix sketches of every sEMG electrode and spatial structure of sEMG array. To evaluate the performance of FIDE, we conduct extensive experiments on three benchmark datasets, including NinaPro, CSL-hdemg, and CapgMyo. Experimental results demonstrate that FIDE outperforms other state-of-the-art methods and has the potential to adapt to the evolution of electrodes in the changing environments. Moreover, based on FIDE, we implement a multi clients/server collaboration system, namely McS, to support feature adaption in real-world environment. By collecting sEMG using two clients (smartphone and personal computer) and adaptively recognizing gestures in the cloud server, FIDE significantly improves the gesture recognition accuracy in electrode increment and decrement circumstances.

scholarly journals Random Fourier Features via Fast Surrogate Leverage Weighted Sampling

2020 ◽  
Vol 34 (04) ◽  
pp. 4844-4851
Author(s):  
Fanghui Liu ◽  
Xiaolin Huang ◽  
Yudong Chen ◽  
Jie Yang ◽  
Johan Suykens
Keyword(s):  
State Of The Art ◽  
Sampling Strategy ◽  
Prediction Performance ◽  
Current State ◽  
Kernel Approximation ◽  
Sampling Process ◽  
New Strategy ◽  
The Matrix ◽  
Benchmark Datasets ◽  
Random Fourier Features

In this paper, we propose a fast surrogate leverage weighted sampling strategy to generate refined random Fourier features for kernel approximation. Compared to the current state-of-the-art method that uses the leverage weighted scheme (Li et al. 2019), our new strategy is simpler and more effective. It uses kernel alignment to guide the sampling process and it can avoid the matrix inversion operator when we compute the leverage function. Given n observations and s random features, our strategy can reduce the time complexity for sampling from O(ns2+s3) to O(ns2), while achieving comparable (or even slightly better) prediction performance when applied to kernel ridge regression (KRR). In addition, we provide theoretical guarantees on the generalization performance of our approach, and in particular characterize the number of random features required to achieve statistical guarantees in KRR. Experiments on several benchmark datasets demonstrate that our algorithm achieves comparable prediction performance and takes less time cost when compared to (Li et al. 2019).

scholarly journals Measuring academic entities’ impact by content-based citation analysis in a heterogeneous academic network

2021 ◽  
Author(s):  
Fang Zhang ◽  
Shengli Wu
Keyword(s):  
Citation Analysis ◽  
Ensemble Learning ◽  
Impact Evaluation ◽  
Heterogeneous Network ◽  
State Of The Art ◽  
Government Agencies ◽  
Learning Method ◽  
Research Organizations ◽  
Academic Network ◽  
The Impact

AbstractEvaluating the impact of papers, researchers and venues objectively is of great significance to academia and beyond. This may help researchers, research organizations, and government agencies in various ways, such as helping researchers find valuable papers and authoritative venues and helping research organizations identify good researchers. A few studies find that rather than treating citations equally, differentiating them is a promising way for impact evaluation of academic entities. However, most of those methods are metadata-based only and do not consider contents of cited and citing papers; while a few content-based methods are not sophisticated, and further improvement is possible. In this paper, we study the citation relationships between entities by content-based approaches. Especially, an ensemble learning method is used to classify citations into different strength types, and a word-embedding based method is used to estimate topical similarity of the citing and cited papers. A heterogeneous network is constructed with the weighted citation links and several other features. Based on the heterogeneous network that consists of three types of entities, we apply an iterative PageRank-like method to rank the impact of papers, authors and venues at the same time through mutual reinforcement. Experiments are conducted on an ACL dataset, and the results demonstrate that our method greatly outperforms state-of-the art competitors in improving ranking effectiveness of papers, authors and venues, as well as in being robust against malicious manipulation of citations.

BiLabel-Specific Features for Multi-Label Classification

2021 ◽  
Vol 16 (1) ◽  
pp. 1-23
Author(s):  
Min-Ling Zhang ◽  
Jun-Peng Fang ◽  
Yi-Bo Wang
Keyword(s):  
Predictive Models ◽  
Comparative Studies ◽  
State Of The Art ◽  
Classification Model ◽  
Generation Process ◽  
Prototype Selection ◽  
Class Label ◽  
Benchmark Datasets ◽  
Label Correlations ◽  
Class Labels

In multi-label classification, the task is to induce predictive models which can assign a set of relevant labels for the unseen instance. The strategy of label-specific features has been widely employed in learning from multi-label examples, where the classification model for predicting the relevancy of each class label is induced based on its tailored features rather than the original features. Existing approaches work by generating a group of tailored features for each class label independently, where label correlations are not fully considered in the label-specific features generation process. In this article, we extend existing strategy by proposing a simple yet effective approach based on BiLabel-specific features. Specifically, a group of tailored features is generated for a pair of class labels with heuristic prototype selection and embedding. Thereafter, predictions of classifiers induced by BiLabel-specific features are ensembled to determine the relevancy of each class label for unseen instance. To thoroughly evaluate the BiLabel-specific features strategy, extensive experiments are conducted over a total of 35 benchmark datasets. Comparative studies against state-of-the-art label-specific features techniques clearly validate the superiority of utilizing BiLabel-specific features to yield stronger generalization performance for multi-label classification.

scholarly journals An All-Batch Loss for Constructing Prediction Intervals

2021 ◽  
Vol 11 (4) ◽  
pp. 1728
Author(s):  
Hua Zhong ◽  
Li Xu
Keyword(s):  
Gradient Descent ◽  
State Of The Art ◽  
Prediction Interval ◽  
Feedforward Neural Networks ◽  
Important Research ◽  
Likelihood Principle ◽  
High Quality ◽  
Construction Methods ◽  
Important Research Topic ◽  
Benchmark Datasets

The prediction interval (PI) is an important research topic in reliability analyses and decision support systems. Data size and computation costs are two of the issues which may hamper the construction of PIs. This paper proposes an all-batch (AB) loss function for constructing high quality PIs. Taking the full advantage of the likelihood principle, the proposed loss makes it possible to train PI generation models using the gradient descent (GD) method for both small and large batches of samples. With the structure of dual feedforward neural networks (FNNs), a high-quality PI generation framework is introduced, which can be adapted to a variety of problems including regression analysis. Numerical experiments were conducted on the benchmark datasets; the results show that higher-quality PIs were achieved using the proposed scheme. Its reliability and stability were also verified in comparison with various state-of-the-art PI construction methods.

Green composites and their contribution toward sustainability: A review

2021 ◽  
pp. 096739112110093
Author(s):  
Edgar Vázquez-Núñez ◽  
Andrea M Avecilla-Ramírez ◽  
Berenice Vergara-Porras ◽  
María del Rocío López-Cuellar
Keyword(s):  
Natural Fiber ◽  
World Market ◽  
Raw Material ◽  
Green Composites ◽  
Green Materials ◽  
Global Problems ◽  
The Matrix ◽  
Green Economies ◽  
Green Polymer ◽  
World Environment

The current world environment scenario demands new and more eco-friendly solutions to global problems that cover the demands for materials. This sector has included green polymer-based composites and natural reinforcers from origins of renewable sources, these Green Composites (GC), natural-fiber-reinforced bio-composites in which the matrix is a bio-based polymer, have shown attractive characteristics. Biodegradability is one of the most important attributes for these new “green” materials, in that this characteristic allows for their introduction into the world market as an environmental solution. The manufacturing processes for obtaining these materials have observed important improvements because each raw material exhibits different properties and characteristics and their eco-friendly character has facilitated its incorporation into diverse sectors, such as construction, automotive, packaging, and medicine, among others. At present, this segment represents an important income for some economies, especially those where these resources are available, enhancing the creation of green economies, strengthening the world’s efforts toward sustainability.

Towards corpus and model: Hierarchical structured-attention-based features for Indonesian named entity recognition

2021 ◽  
pp. 1-12
Author(s):  
Yingwen Fu ◽  
Nankai Lin ◽  
Xiaotian Lin ◽  
Shengyi Jiang
Keyword(s):  
Language Processing ◽  
State Of The Art ◽  
Named Entity Recognition ◽  
Entity Recognition ◽  
Language Models ◽  
Neural Models ◽  
Performance Models ◽  
Named Entity ◽  
High Resource ◽  
Benchmark Datasets

Named entity recognition (NER) is fundamental to natural language processing (NLP). Most state-of-the-art researches on NER are based on pre-trained language models (PLMs) or classic neural models. However, these researches are mainly oriented to high-resource languages such as English. While for Indonesian, related resources (both in dataset and technology) are not yet well-developed. Besides, affix is an important word composition for Indonesian language, indicating the essentiality of character and token features for token-wise Indonesian NLP tasks. However, features extracted by currently top-performance models are insufficient. Aiming at Indonesian NER task, in this paper, we build an Indonesian NER dataset (IDNER) comprising over 50 thousand sentences (over 670 thousand tokens) to alleviate the shortage of labeled resources in Indonesian. Furthermore, we construct a hierarchical structured-attention-based model (HSA) for Indonesian NER to extract sequence features from different perspectives. Specifically, we use an enhanced convolutional structure as well as an enhanced attention structure to extract deeper features from characters and tokens. Experimental results show that HSA establishes competitive performance on IDNER and three benchmark datasets.

scholarly journals Efficient Graph Collaborative Filtering via Contrastive Learning

Sensors ◽  
2021 ◽  
Vol 21 (14) ◽  
pp. 4666
Author(s):  
Zhiqiang Pan ◽  
Honghui Chen
Keyword(s):  
Collaborative Filtering ◽  
State Of The Art ◽  
Representation Learning ◽  
First Order ◽  
Satisfactory Performance ◽  
Potential Applications ◽  
Benchmark Datasets ◽  
Bayesian Personalized Ranking ◽  
Graph Neural Networks ◽  
Training Efficiency

Collaborative filtering (CF) aims to make recommendations for users by detecting user’s preference from the historical user–item interactions. Existing graph neural networks (GNN) based methods achieve satisfactory performance by exploiting the high-order connectivity between users and items, however they suffer from the poor training efficiency problem and easily introduce bias for information propagation. Moreover, the widely applied Bayesian personalized ranking (BPR) loss is insufficient to provide supervision signals for training due to the extremely sparse observed interactions. To deal with the above issues, we propose the Efficient Graph Collaborative Filtering (EGCF) method. Specifically, EGCF adopts merely one-layer graph convolution to model the collaborative signal for users and items from the first-order neighbors in the user–item interactions. Moreover, we introduce contrastive learning to enhance the representation learning of users and items by deriving the self-supervisions, which is jointly trained with the supervised learning. Extensive experiments are conducted on two benchmark datasets, i.e., Yelp2018 and Amazon-book, and the experimental results demonstrate that EGCF can achieve the state-of-the-art performance in terms of Recall and normalized discounted cumulative gain (NDCG), especially on ranking the target items at right positions. In addition, EGCF shows obvious advantages in the training efficiency compared with the competitive baselines, making it practicable for potential applications.

Sign in / Sign up

Export Citation Format

Share Document