scholarly journals Gradient-Based Multi-Objective Feature Selection for Gait Mode Recognition of Transfemoral Amputees

2018 ◽  
Author(s):  
Gholamreza Khademi ◽  
Hanieh Mohammadi ◽  
Dan Simon
Keyword(s):  
Feature Selection ◽  
Feature Subset Selection ◽  
Feature Subset ◽  
User Intent ◽  
Multi Objective ◽  
Mode Recognition ◽  
Gradient Based ◽  
Transfemoral Amputees ◽  
Optimal Feature Subset ◽  
Optimal Feature

One control challenge in prosthetic legs is seamless transition from one gait mode to another. User intent recognition (UIR) is a high-level controller that tells a low-level controller to switch to the identified activity mode, depending on the user’s intent and environment. We propose a new framework to design an optimal UIR system with simultaneous maximum performance and parsimony for gait mode recognition. We use multi-objective optimization (MOO) to find an optimal feature subset that creates a trade-off between these two conflicting objectives. The main contribution of this paper is two-fold: (1) a new gradient-based multi-objective feature selection (GMOFS) method for optimal UIR design; and (2) the application of advanced evolutionary MOO methods for UIR. GMOFS is an embedded method that simultaneously performs feature selection and classification by incorporating an elastic net in multilayer perceptron neural network training. Experimental data are collected from six subjects, including three able-bodied subjects and three transfemoral amputees. We implement GMOFS and four variants of multi-objective biogeography-based optimization (MOBBO) for optimal feature subset selection, and we compare their performances using normalized hypervolume and relative coverage. GMOFS demonstrates competitive performance compared to the four MOBBO methods. We achieve a mean classification accuracy of 97.14% ± 1.51% and 98.45% ± 1.22% with the optimal selected subset for able-bodied and amputee subjects, respectively, while using only 23% of the available features. Results thus indicate the potential of advanced optimization methods to simultaneously achieve accurate, reliable, and compact UIR for locomotion mode detection of lower-limb amputees with prostheses.

scholarly journals Gradient-Based Multi-Objective Feature Selection for Gait Mode Recognition of Transfemoral Amputees

Sensors ◽  
2019 ◽  
Vol 19 (2) ◽  
pp. 253 ◽  
Author(s):  
Gholamreza Khademi ◽  
Hanieh Mohammadi ◽  
Dan Simon
Keyword(s):  
Feature Selection ◽  
Feature Subset Selection ◽  
Feature Subset ◽  
User Intent ◽  
Multi Objective ◽  
Mode Recognition ◽  
Gradient Based ◽  
Transfemoral Amputees ◽  
Optimal Feature Subset ◽  
Optimal Feature

One control challenge in prosthetic legs is seamless transition from one gait mode to another. User intent recognition (UIR) is a high-level controller that tells a low-level controller to switch to the identified activity mode, depending on the user’s intent and environment. We propose a new framework to design an optimal UIR system with simultaneous maximum performance and minimum complexity for gait mode recognition. We use multi-objective optimization (MOO) to find an optimal feature subset that creates a trade-off between these two conflicting objectives. The main contribution of this paper is two-fold: (1) a new gradient-based multi-objective feature selection (GMOFS) method for optimal UIR design; and (2) the application of advanced evolutionary MOO methods for UIR. GMOFS is an embedded method that simultaneously performs feature selection and classification by incorporating an elastic net in multilayer perceptron neural network training. Experimental data are collected from six subjects, including three able-bodied subjects and three transfemoral amputees. We implement GMOFS and four variants of multi-objective biogeography-based optimization (MOBBO) for optimal feature subset selection, and we compare their performances using normalized hypervolume and relative coverage. GMOFS demonstrates competitive performance compared to the four MOBBO methods. We achieve a mean classification accuracy of 97.14 % ± 1.51 % and 98.45 % ± 1.22 % with the optimal selected subset for able-bodied and amputee subjects, respectively, while using only 23% of the available features. Results thus indicate the potential of advanced optimization methods to simultaneously achieve accurate, reliable, and compact UIR for locomotion mode detection of lower-limb amputees with prostheses.

scholarly journals Gradient-Based Multi-Objective Feature Selection for Gait Mode Recognition of Transfemoral Amputees

2018 ◽  
Author(s):  
Gholamreza Khademi ◽  
Hanieh Mohammadi ◽  
Dan Simon
Keyword(s):  
Feature Selection ◽  
Feature Subset Selection ◽  
Feature Subset ◽  
User Intent ◽  
Multi Objective ◽  
Mode Recognition ◽  
Gradient Based ◽  
Transfemoral Amputees ◽  
Optimal Feature Subset ◽  
Optimal Feature

One control challenge in prosthetic legs is seamless transition from one gait mode to another. User intent recognition (UIR) is a high-level controller that tells a low-level controller to switch to the identified activity mode, depending on the user’s intent and environment. We propose a new framework to design an optimal UIR system with simultaneous maximum performance and parsimony for gait mode recognition. We use multi-objective optimization (MOO) to find an optimal feature subset that creates a trade-off between these two conflicting objectives. The main contribution of this paper is two-fold: (1) a new gradient-based multi-objective feature selection (GMOFS) method for optimal UIR design; and (2) the application of advanced evolutionary MOO methods for UIR. GMOFS is an embedded method that simultaneously performs feature selection and classification by incorporating an elastic net in multilayer perceptron neural network training. Experimental data are collected from six subjects, including three able-bodied subjects and three transfemoral amputees. We implement GMOFS and four variants of multi-objective biogeography-based optimization (MOBBO) for optimal feature subset selection, and we compare their performances using normalized hypervolume and relative coverage. GMOFS demonstrates competitive performance compared to the four MOBBO methods. We achieve a mean classification accuracy of 97.14% ± 1.51% and 98.45% ± 1.22% with the optimal selected subset for able-bodied and amputee subjects, respectively, while using only 23% of the available features. Results thus indicate the potential of advanced optimization methods to simultaneously achieve accurate, reliable, and compact UIR for locomotion mode detection of lower-limb amputees with prostheses.

scholarly journals Optimal Feature Subset Selection for Imbalanced Class Data using SMOTE and Binary ALO Algorithm

2020 ◽  
Vol 9 (3) ◽  
pp. 344-349
Keyword(s):  
Feature Selection ◽  
Class Imbalance ◽  
Classification Performance ◽  
Selection Model ◽  
Feature Subset Selection ◽  
Feature Subset ◽  
Spatial Features ◽  
Imbalanced Classes ◽  
Optimal Feature Subset ◽  
Optimal Feature

Feature selection in multispectral high dimensional information is a hard labour machine learning problem because of the imbalanced classes present in the data. The existing Most of the feature selection schemes in the literature ignore the problem of class imbalance by choosing the features from the classes having more instances and avoiding significant features of the classes having less instances. In this paper, SMOTE concept is exploited to produce the required samples form minority classes. Feature selection model is formulated with the objective of reducing number of features with improved classification performance. This model is based on dimensionality reduction by opt for a subset of relevant spectral, textural and spatial features while eliminating the redundant features for the purpose of improved classification performance. Binary ALO is engaged to solve the feature selection model for optimal selection of features. The proposed ALO-SVM with wrapper concept is applied to each potential solution obtained during optimization step. The working of this methodology is tested on LANDSAT multispectral image.

scholarly journals Accelerated Simulated Annealing and Mutation Operator Feature Selection method for Big Data

2019 ◽  
Vol 8 (2) ◽  
pp. 910-916
Keyword(s):  
Feature Selection ◽  
Simulated Annealing ◽  
Feature Selection Method ◽  
Classification Problem ◽  
Feature Subset Selection ◽  
Feature Subset ◽  
Mutation Operator ◽  
Knn Classifier ◽  
Optimal Feature Subset ◽  
Optimal Feature

The optimal feature subset selection over very high dimensional data is a vital issue. Even though the optimal features are selected, the classification of those selected features becomes a key complicated task. In order to handle these problems, a novel, Accelerated Simulated Annealing and Mutation Operator (ASAMO) feature selection algorithm is suggested in this work. For solving the classification problem, the Fuzzy Minimal Consistent Class Subset Coverage (FMCCSC) problem is introduced. In FMCCSC, consistent subset is combined with the K-Nearest Neighbour (KNN) classifier known as FMCCSC-KNN classifier. The two data sets Dorothea and Madelon from UCI machine repository are experimented for optimal feature selection and classification. The experimental results substantiate the efficiency of proposed ASAMO with FMCCSC-KNN classifier compared to Particle Swarm Optimization (PSO) and Accelerated PSO feature selection algorithms.

AN OPTIMAL FEATURE SUBSET SELECTION METHOD BASED ON DISTANCE DISCRIMINANT AND DISTRIBUTION OVERLAPPING

2009 ◽  
Vol 23 (08) ◽  
pp. 1577-1597 ◽  
Author(s):  
JIANNING LIANG ◽  
SU YANG ◽  
YUANYUAN WANG
Keyword(s):  
Feature Selection ◽  
Computational Cost ◽  
Difficult Problem ◽  
Exhaustive Search ◽  
Feature Subset Selection ◽  
Search Problem ◽  
Feature Subset ◽  
Ranking Problem ◽  
Optimal Feature Subset ◽  
Optimal Feature

The goal of feature selection is to search the optimal feature subset with respect to the evaluation function. Exhaustively searching all possible feature subsets requires high computational cost. The alternative suboptimal methods are more efficient and practical but they cannot promise globally optimal results. We propose a new feature selection algorithm based on distance discriminant and distribution overlapping (HFSDD) for continuous features, which overcomes the drawbacks of the exhaustive search approaches and those of the suboptimal methods. The proposed method is able to find the optimal feature subset without exhaustive search or Branch and Bound algorithm. The most difficult problem for optimal feature selection, the search problem, is converted into a feature ranking problem following rigorous theoretical proof such that the computational complexity can be greatly reduced. Since the distribution of overlapping degrees between every two classes can provide useful information for feature selection, HFSDD also takes them into account by using a new approach to estimate the overlapping degrees. In this sense, HFSDD is a distance discriminant and distribution overlapping based solution. HFSDD was compared with ReliefF and mrmrMID on ten data sets. The experimental results show that HFSDD outperforms the other methods.

An effective feature subset selection approach based on Jeffries-Matusita distance for multiclass problems

2021 ◽  
pp. 1-18
Author(s):  
Rikta Sen ◽  
Saptarsi Goswami ◽  
Ashis Kumar Mandal ◽  
Basabi Chakraborty
Keyword(s):  
Feature Selection ◽  
Computational Cost ◽  
Feature Subset Selection ◽  
Feature Ranking ◽  
Data Sets ◽  
Feature Subset ◽  
Simulation Experiments ◽  
Benchmark Data ◽  
Optimal Feature Subset ◽  
Optimal Feature

Jeffries-Matusita (JM) distance, a transformation of the Bhattacharyya distance, is a widely used measure of the spectral separability distance between the two class density functions and is generally used as a class separability measure. It can be considered to have good potential to be used for evaluation of the effectiveness of a feature in discriminating two classes. The capability of JM distance as a ranking based feature selection technique for binary classification problems has been verified in some research works as well as in our earlier work. It was found by our simulation experiments with benchmark data sets that JM distance works equally well compared to other popular feature ranking methods based on mutual information, information gain or Relief. Extension of JM distance measure for feature ranking in multiclass problems has also been reported in the literature. But all of them are basically rank based approaches which deliver the ranking of the features and do not automatically produce the final optimal feature subset. In this work, a novel heuristic approach for finding out the optimum feature subset from JM distance based ranked feature lists for multiclass problems have been developed without explicitly using any specific search technique. The proposed approach integrates the extension of JM measure for multiclass problems and the selection of the final optimal feature subset in a unified process. The performance of the proposed algorithm has been evaluated by simulation experiments with benchmark data sets in comparison with two other previously developed rank based feature selection algorithms with multiclass JM distance measures (weighted average JM distance and another multiclass extension equivalent to Bhattacharyya bound) and some other popular filter based feature ranking algorithms. It is found that the proposed algorithm performs better in terms of classification accuracy, F-measure, AUC with a reduced set of features and computational cost.

Modulation Recognition of Digital Multimedia Signal Based on Data Feature Selection

2017 ◽  
Vol 8 (3) ◽  
pp. 90-111 ◽  
Author(s):  
Hui Wang ◽  
Li Li Guo ◽  
Yun Lin
Keyword(s):  
Feature Selection ◽  
Information Entropy ◽  
Feature Subset ◽  
Selection Algorithm ◽  
Feature Selection Algorithm ◽  
Modulation Recognition ◽  
Signal Modulation ◽  
Digital Multimedia ◽  
Optimal Feature Subset ◽  
Optimal Feature

Automatic modulation recognition is very important for the receiver design in the broadband multimedia communication system, and the reasonable signal feature extraction and selection algorithm is the key technology of Digital multimedia signal recognition. In this paper, the information entropy is used to extract the single feature, which are power spectrum entropy, wavelet energy spectrum entropy, singular spectrum entropy and Renyi entropy. And then, the feature selection algorithm of distance measurement and Sequential Feature Selection(SFS) are presented to select the optimal feature subset. Finally, the BP neural network is used to classify the signal modulation. The simulation result shows that the four-different information entropy can be used to classify different signal modulation, and the feature selection algorithm is successfully used to choose the optimal feature subset and get the best performance.

Sign in / Sign up

Export Citation Format

Share Document