scholarly journals Feature Selection Applying Statistical and Neurofuzzy Methods to EEG-Based BCI

2015 ◽  
Vol 2015 ◽  
pp. 1-17 ◽  
Author(s):  
Juan-Antonio Martinez-Leon ◽  
Jose-Manuel Cano-Izquierdo ◽  
Julio Ibarrola
Keyword(s):  
Feature Selection ◽  
Motor Imagery ◽  
Group Method ◽  
Order Selection ◽  
Excellent Performance ◽  
Data Set ◽  
Selection Step ◽  
Group Method Data Handling ◽  
Selection Stage ◽  
Selection Phase

This paper presents an investigation aimed at drastically reducing the processing burden required by motor imagery brain-computer interface (BCI) systems based on electroencephalography (EEG). In this research, the focus has moved from the channel to the feature paradigm, and a 96% reduction of the number of features required in the process has been achieved maintaining and even improving the classification success rate. This way, it is possible to build cheaper, quicker, and more portable BCI systems. The data set used was provided within the framework of BCI Competition III, which allows it to compare the presented results with the classification accuracy achieved in the contest. Furthermore, a new three-step methodology has been developed which includes a feature discriminant character calculation stage; a score, order, and selection phase; and a final feature selection step. For the first stage, both statistics method and fuzzy criteria are used. The fuzzy criteria are based on the S-dFasArt classification algorithm which has shown excellent performance in previous papers undertaking the BCI multiclass motor imagery problem. The score, order, and selection stage is used to sort the features according to their discriminant nature. Finally, both order selection and Group Method Data Handling (GMDH) approaches are used to choose the most discriminant ones.

An Enhancement of Feature Selection Algorithm for EDM: A Review

2018 ◽  
Vol 8 (5) ◽  
pp. 29
Author(s):  
Manpreet Kaur ◽  
Chamkaur Singh
Keyword(s):  
Feature Selection ◽  
Educational Data Mining ◽  
Problem Formulation ◽  
Research Area ◽  
Education Quality ◽  
Educational Institutions ◽  
Selection Algorithm ◽  
Positive Role ◽  
Data Set ◽  
Selection Algorithms

Educational Data Mining (EDM) is an emerging research area help the educational institutions to improve the performance of their students. Feature Selection (FS) algorithms remove irrelevant data from the educational dataset and hence increases the performance of classifiers used in EDM techniques. This paper present an analysis of the performance of feature selection algorithms on student data set. .In this papers the different problems that are defined in problem formulation. All these problems are resolved in future. Furthermore the paper is an attempt of playing a positive role in the improvement of education quality, as well as guides new researchers in making academic intervention.

scholarly journals Current cancer driver variant predictors learn to recognize driver genes instead of functional variants

BMC Biology ◽  
2021 ◽  
Vol 19 (1) ◽  
Author(s):  
Daniele Raimondi ◽  
Antoine Passemiers ◽  
Piero Fariselli ◽  
Yves Moreau
Keyword(s):  
Data Sets ◽  
Precision Oncology ◽  
Complex Task ◽  
Excellent Performance ◽  
Driver Genes ◽  
Significant Drop ◽  
Data Set ◽  
Gene Effects ◽  
Cancer Driver ◽  
Functional Variants

Abstract Background Identifying variants that drive tumor progression (driver variants) and distinguishing these from variants that are a byproduct of the uncontrolled cell growth in cancer (passenger variants) is a crucial step for understanding tumorigenesis and precision oncology. Various bioinformatics methods have attempted to solve this complex task. Results In this study, we investigate the assumptions on which these methods are based, showing that the different definitions of driver and passenger variants influence the difficulty of the prediction task. More importantly, we prove that the data sets have a construction bias which prevents the machine learning (ML) methods to actually learn variant-level functional effects, despite their excellent performance. This effect results from the fact that in these data sets, the driver variants map to a few driver genes, while the passenger variants spread across thousands of genes, and thus just learning to recognize driver genes provides almost perfect predictions. Conclusions To mitigate this issue, we propose a novel data set that minimizes this bias by ensuring that all genes covered by the data contain both driver and passenger variants. As a result, we show that the tested predictors experience a significant drop in performance, which should not be considered as poorer modeling, but rather as correcting unwarranted optimism. Finally, we propose a weighting procedure to completely eliminate the gene effects on such predictions, thus precisely evaluating the ability of predictors to model the functional effects of single variants, and we show that indeed this task is still open.

Quality inspection of complex-shaped metal parts by vibrations and an integrated Mahalanobis classification system

2020 ◽  
pp. 147592172097970
Author(s):  
Liangliang Cheng ◽  
Vahid Yaghoubi ◽  
Wim Van Paepegem ◽  
Mathias Kersemans
Keyword(s):  
Feature Selection ◽  
Mahalanobis Distance ◽  
Classification System ◽  
Gravitational Search Algorithm ◽  
Particle Swarm ◽  
Classification Performance ◽  
Decision Boundary ◽  
Particle Swarm Optimizer ◽  
Selection Phase

The Mahalanobis–Taguchi system is considered as a promising and powerful tool for handling binary classification cases. Though, the Mahalanobis–Taguchi system has several restrictions in screening useful features and determining the decision boundary in an optimal manner. In this article, an integrated Mahalanobis classification system is proposed which builds on the concept of Mahalanobis distance and its space. The integrated Mahalanobis classification system integrates the decision boundary searching process, based on particle swarm optimizer, directly into the feature selection phase for constructing the Mahalanobis distance space. This integration (a) avoids the need for user-dependent input parameters and (b) improves the classification performance. For the feature selection phase, both the use of binary particle swarm optimizer and binary gravitational search algorithm is investigated. To deal with possible overfitting problems in case of sparse data sets, k-fold cross-validation is considered. The integrated Mahalanobis classification system procedure is benchmarked with the classical Mahalanobis–Taguchi system as well as the recently proposed two-stage Mahalanobis classification system in terms of classification performance. Results are presented on both an experimental case study of complex-shaped metallic turbine blades with various damage types and a synthetic case study of cylindrical dogbone samples with creep and microstructural damage. The results indicate that the proposed integrated Mahalanobis classification system shows good and robust classification performance.

Design of novel multi filter union feature selection framework for breast cancer dataset

2021 ◽  
pp. 1063293X2110160
Author(s):  
Dinesh Morkonda Gunasekaran ◽  
Prabha Dhandayudam
Keyword(s):  
Breast Cancer ◽  
Feature Selection ◽  
Care Center ◽  
Feature Selection Method ◽  
Selection Method ◽  
Cancer Center ◽  
Breast Cancer Dataset ◽  
Data Set ◽  
Health Care Center ◽  
Cancer Data

Nowadays women are commonly diagnosed with breast cancer. Feature based Selection method plays an important step while constructing a classification based framework. We have proposed Multi filter union (MFU) feature selection method for breast cancer data set. The feature selection process based on random forest algorithm and Logistic regression (LG) algorithm based union model is used for selecting important features in the dataset. The performance of the data analysis is evaluated using optimal features subset from selected dataset. The experiments are computed with data set of Wisconsin diagnostic breast cancer center and next the real data set from women health care center. The result of the proposed approach shows high performance and efficient when comparing with existing feature selection algorithms.

Bayesian Classifier for Sparsity-Promoting Feature Selection

2015 ◽  
Vol 29 (06) ◽  
pp. 1550022 ◽  
Author(s):  
Danlei Xu ◽  
Lan Du ◽  
Hongwei Liu ◽  
Penghui Wang
Keyword(s):  
Feature Selection ◽  
Synthetic Data ◽  
Original Data ◽  
Radar Data ◽  
Bayesian Classifier ◽  
Classification Model ◽  
Data Sets ◽  
Data Set ◽  
Classification Boundary ◽  
Nonlinear Mappings

A Bayesian classifier for sparsity-promoting feature selection is developed in this paper, where a set of nonlinear mappings for the original data is performed as a pre-processing step. The linear classification model with such mappings from the original input space to a nonlinear transformation space can not only construct the nonlinear classification boundary, but also realize the feature selection for the original data. A zero-mean Gaussian prior with Gamma precision and a finite approximation of Beta process prior are used to promote sparsity in the utilization of features and nonlinear mappings in our model, respectively. We derive the Variational Bayesian (VB) inference algorithm for the proposed linear classifier. Experimental results based on the synthetic data set, measured radar data set, high-dimensional gene expression data set, and several benchmark data sets demonstrate the aggressive and robust feature selection capability and comparable classification accuracy of our method comparing with some other existing classifiers.

scholarly journals PCA based Regression Decision Tree Classification for Somatic Mutations.

2019 ◽  
Vol 8 (6S3) ◽  
pp. 1095-1102
Keyword(s):  
Feature Selection ◽  
Decision Tree ◽  
Somatic Mutations ◽  
Feature Selection Technique ◽  
Data Set ◽  
Cancer Data ◽  
Classification Feature ◽  
Decision Tree Classification ◽  
Proposed Model ◽  
Feature Selection Techniques

The analization of cancer data and normal data for the predication of somatic mu-tation occurrences in the data set plays an important role and several challenges persist in detectingsomatic mutations which leads to complexity of handling large volumes of data in classifi-cation with good accuracy. In many situations the dataset may consist of redundant and less significant features and there is a need to remove insignificant features in order to improve the performance of classification. Feature selection techniques are useful for dimensionality reduction purpose. PCA is one type of feature selection technique to identify significant attributes and is adopted in this paper. A novel technique, PCA based regression decision tree is proposed for classification of somatic mutations data in this paper.The performance analysis of this clas-sification process for the detection of somatic mutation is compared with existing algorithms and satisfactory results are obtained with the proposed model.

A Survey of Feature Selection Techniques

2011 ◽  
pp. 1888-1895 ◽  
Author(s):  
Barak Chizi ◽  
Lior Rokach ◽  
Oded Maimon
Keyword(s):  
Data Mining ◽  
Feature Selection ◽  
Mining Method ◽  
Data Set ◽  
Data Mining Method ◽  
Data Mining Algorithms ◽  
Wrapper Approach ◽  
Computationally Intensive ◽  
Filter Approach ◽  
Mining Algorithms

Dimensionality (i.e., the number of data set attributes or groups of attributes) constitutes a serious obstacle to the efficiency of most data mining algorithms (Maimon and Last, 2000). The main reason for this is that data mining algorithms are computationally intensive. This obstacle is sometimes known as the “curse of dimensionality” (Bellman, 1961). The objective of Feature Selection is to identify features in the data-set as important, and discard any other feature as irrelevant and redundant information. Since Feature Selection reduces the dimensionality of the data, data mining algorithms can be operated faster and more effectively by using Feature Selection. In some cases, as a result of feature selection, the performance of the data mining method can be improved. The reason for that is mainly a more compact, easily interpreted representation of the target concept. The filter approach (Kohavi , 1995; Kohavi and John ,1996) operates independently of the data mining method employed subsequently -- undesirable features are filtered out of the data before learning begins. These algorithms use heuristics based on general characteristics of the data to evaluate the merit of feature subsets. A sub-category of filter methods that will be refer to as rankers, are methods that employ some criterion to score each feature and provide a ranking. From this ordering, several feature subsets can be chosen by manually setting There are three main approaches for feature selection: wrapper, filter and embedded. The wrapper approach (Kohavi, 1995; Kohavi and John,1996), uses an inducer as a black box along with a statistical re-sampling technique such as cross-validation to select the best feature subset according to some predictive measure. The embedded approach (see for instance Guyon and Elisseeff, 2003) is similar to the wrapper approach in the sense that the features are specifically selected for a certain inducer, but it selects the features in the process of learning.

Improved Feature Selection by Incorporating Gene Similarity into the LASSO

2012 ◽  
Vol 3 (1) ◽  
pp. 1-22 ◽  
Author(s):  
Christopher E. Gillies ◽  
Xiaoli Gao ◽  
Nilesh V. Patel ◽  
Mohammad-Reza Siadat ◽  
George D. Wilson
Keyword(s):  
Gene Expression ◽  
Feature Selection ◽  
Personalized Medicine ◽  
Objective Function ◽  
Expression Profiles ◽  
Gene Expression Profiles ◽  
Genetic Profile ◽  
Data Set ◽  
Coordinate Descent Algorithm ◽  
Gene Similarity

Personalized medicine is customizing treatments to a patient’s genetic profile and has the potential to revolutionize medical practice. An important process used in personalized medicine is gene expression profiling. Analyzing gene expression profiles is difficult, because there are usually few patients and thousands of genes, leading to the curse of dimensionality. To combat this problem, researchers suggest using prior knowledge to enhance feature selection for supervised learning algorithms. The authors propose an enhancement to the LASSO, a shrinkage and selection technique that induces parameter sparsity by penalizing a model’s objective function. Their enhancement gives preference to the selection of genes that are involved in similar biological processes. The authors’ modified LASSO selects similar genes by penalizing interaction terms between genes. They devise a coordinate descent algorithm to minimize the corresponding objective function. To evaluate their method, the authors created simulation data where they compared their model to the standard LASSO model and an interaction LASSO model. The authors’ model outperformed both the standard and interaction LASSO models in terms of detecting important genes and gene interactions for a reasonable number of training samples. They also demonstrated the performance of their method on a real gene expression data set from lung cancer cell lines.

Sign in / Sign up

Export Citation Format

Share Document