A METHODOLOGY FOR IMPROVING THE PERFORMANCE OF NON-RANKER FEATURE SELECTION FILTERS

2007 ◽  
Vol 21 (05) ◽  
pp. 809-830 ◽  
Author(s):  
LIOR ROKACH ◽  
BARAK CHIZI ◽  
ODED MAIMON
Keyword(s):  
Feature Selection ◽  
General Framework ◽  
Learning Algorithms ◽  
Classification Performance ◽  
Feature Subset ◽  
Selection Methods ◽  
Ensemble Of Classifiers ◽  
Empirical Results ◽  
Work Done

Feature selection is the process of identifying relevant features in the dataset and discarding everything else as irrelevant and redundant. Since feature selection reduces the dimensionality of the data, it enables the learning algorithms to operate more effectively and rapidly. In some cases, classification performance can be improved; in other instances, the obtained classifier is more compact and can be easily interpreted. There is much work done on feature selection methods for creating ensemble of classifiers. Thus, these works examine how feature selection can help ensemble of classifiers to gain diversity. This paper examines a different direction, i.e. whether ensemble methodology can be used for improving feature selection performance. In this paper we present a general framework for creating several feature subsets and then combine them into a single subset. Theoretical and empirical results presented in this paper validate the hypothesis that this approach can help to find a better feature subset.

scholarly journals Feature Selection Based on Binary Tree Growth Algorithm for the Classification of Myoelectric Signals

Machines ◽  
2018 ◽  
Vol 6 (4) ◽  
pp. 65 ◽  
Author(s):  
Jingwei Too ◽  
Abdul Abdullah ◽  
Norhashimah Mohd Saad ◽  
Nursabillilah Mohd Ali
Keyword(s):  
Feature Selection ◽  
Tree Growth ◽  
Binary Tree ◽  
Feature Vector ◽  
Classification Performance ◽  
Feature Reduction ◽  
Feature Subset ◽  
Selection Methods ◽  
Time Frequency ◽  
Mutation Operators

Electromyography (EMG) has been widely used in rehabilitation and myoelectric prosthetic applications. However, a recent increment in the number of EMG features has led to a high dimensional feature vector. This in turn will degrade the classification performance and increase the complexity of the recognition system. In this paper, we have proposed two new feature selection methods based on a tree growth algorithm (TGA) for EMG signals classification. In the first approach, two transfer functions are implemented to convert the continuous TGA into a binary version. For the second approach, the swap, crossover, and mutation operators are introduced in a modified binary tree growth algorithm for enhancing the exploitation and exploration behaviors. In this study, short time Fourier transform (STFT) is employed to transform the EMG signals into time-frequency representation. The features are then extracted from the STFT coefficient and form a feature vector. Afterward, the proposed feature selection methods are applied to evaluate the best feature subset from a large available feature set. The experimental results show the superiority of MBTGA not only in terms of feature reduction, but also the classification performance.

scholarly journals Liver Cancer Classification Model Using Hybrid Feature Selection Based on Class-Dependent Technique for the Central Region of Thailand

Information ◽  
2019 ◽  
Vol 10 (6) ◽  
pp. 187
Author(s):  
Rattanawadee Panthong ◽  
Anongnart Srivihok
Keyword(s):  
Feature Selection ◽  
Liver Cancer ◽  
Predictive Model ◽  
Information Gain ◽  
Classification Performance ◽  
Cancer Classification ◽  
Feature Subset Selection ◽  
Classification Model ◽  
Feature Subset ◽  
Cancer Data

Liver cancer data always consist of a large number of multidimensional datasets. A dataset that has huge features and multiple classes may be irrelevant to the pattern classification in machine learning. Hence, feature selection improves the performance of the classification model to achieve maximum classification accuracy. The aims of the present study were to find the best feature subset and to evaluate the classification performance of the predictive model. This paper proposed a hybrid feature selection approach by combining information gain and sequential forward selection based on the class-dependent technique (IGSFS-CD) for the liver cancer classification model. Two different classifiers (decision tree and naïve Bayes) were used to evaluate feature subsets. The liver cancer datasets were obtained from the Cancer Hospital Thailand database. Three ensemble methods (ensemble classifiers, bagging, and AdaBoost) were applied to improve the performance of classification. The IGSFS-CD method provided good accuracy of 78.36% (sensitivity 0.7841 and specificity 0.9159) on LC_dataset-1. In addition, LC_dataset II delivered the best performance with an accuracy of 84.82% (sensitivity 0.8481 and specificity 0.9437). The IGSFS-CD method achieved better classification performance compared to the class-independent method. Furthermore, the best feature subset selection could help reduce the complexity of the predictive model.

Fuzzy Mutual Information Feature Selection Based on Representative Samples

2018 ◽  
Vol 6 (1) ◽  
pp. 58-72
Author(s):  
Omar A. M. Salem ◽  
Liwei Wang
Keyword(s):  
Feature Selection ◽  
Mutual Information ◽  
Classification Performance ◽  
Feature Subset ◽  
Classification Models ◽  
Negative Effect ◽  
Benchmark Datasets ◽  
Real World Datasets ◽  
And Storage ◽  
Representative Samples

Building classification models from real-world datasets became a difficult task, especially in datasets with high dimensional features. Unfortunately, these datasets may include irrelevant or redundant features which have a negative effect on the classification performance. Selecting the significant features and eliminating undesirable features can improve the classification models. Fuzzy mutual information is widely used feature selection to find the best feature subset before classification process. However, it requires more computation and storage space. To overcome these limitations, this paper proposes an improved fuzzy mutual information feature selection based on representative samples. Based on benchmark datasets, the experiments show that the proposed method achieved better results in the terms of classification accuracy, selected feature subset size, storage, and stability.

Benefiting feature selection by the discovery of false irrelevant attributes

2015 ◽  
Vol 13 (04) ◽  
pp. 1550023 ◽  
Author(s):  
Lidia S. Chao ◽  
Derek F. Wong ◽  
Philip C. L. Chen ◽  
Wing W. Y. Ng ◽  
Daniel S. Yeung
Keyword(s):  
Feature Selection ◽  
Execution Time ◽  
Classification Accuracy ◽  
State Of The Art ◽  
Classification Task ◽  
Selection Methods ◽  
Empirical Results ◽  
Selection Accuracy ◽  
Irrelevant Attributes ◽  
Selection Methodology

The ordinary feature selection methods select only the explicit relevant attributes by filtering the irrelevant ones. They trade the selection accuracy for the execution time and complexity. In which, the hidden supportive information possessed by the irrelevant attributes may be lost, so that they may miss some good combinations. We believe that attributes are useless regarding the classification task by themselves, sometimes may provide potentially useful supportive information to other attributes and thus benefit the classification task. Such a strategy can minimize the information lost, therefore is able to maximize the classification accuracy. Especially for the dataset contains hidden interactions among attributes. This paper proposes a feature selection methodology from a new angle that selects not only the relevant features, but also targeting at the potentially useful false irrelevant attributes by measuring their supportive importance to other attributes. The empirical results validate the hypothesis by demonstrating that the proposed approach outperforms most of the state-of-the-art filter based feature selection methods.

On the Stability of Feature Selection Methods in Software Quality Prediction: An Empirical Investigation

2015 ◽  
Vol 25 (09n10) ◽  
pp. 1467-1490 ◽  
Author(s):  
Huanjing Wang ◽  
Taghi M. Khoshgoftaar ◽  
Naeem Seliya
Keyword(s):  
Feature Selection ◽  
Software Quality ◽  
Software Metrics ◽  
Subset Selection ◽  
Feature Subset ◽  
Selection Methods ◽  
Statistical Measures ◽  
Quality Modeling ◽  
The Stability ◽  
Stable Feature

Software quality modeling is the process of using software metrics from previous iterations of development to locate potentially faulty modules in current under-development code. This has become an important part of the software development process, allowing practitioners to focus development efforts where they are most needed. One difficulty encountered in software quality modeling is the problem of high dimensionality, where the number of available software metrics is too large for a classifier to work well. In this case, many of the metrics may be redundant or irrelevant to defect prediction results, thereby selecting a subset of software metrics that are the best predictors becomes important. This process is called feature (metric) selection. There are three major forms of feature selection: filter-based feature rankers, which uses statistical measures to assign a score to each feature and present the user with a ranked list; filter-based feature subset evaluation, which uses statistical measures on feature subsets to find the best feature subset; and wrapper-based subset selection, which builds classification models using different subsets to find the one which maximizes performance. Software practitioners are interested in which feature selection methods are best at providing the most stable feature subset in the face of changes to the data (here, the addition or removal of instances). In this study we select feature subsets using fifteen feature selection methods and then use our newly proposed Average Pairwise Tanimoto Index (APTI) to evaluate the stability of the feature selection methods. We evaluate the stability of feature selection methods on a pair of subsamples generated by our fixed-overlap partitions algorithm. Four different levels of overlap are considered in this study. 13 software metric datasets from two real-world software projects are used in this study. Results demonstrate that ReliefF (RF) is the most stable feature selection method and wrapper based feature subset selection shows least stability. In addition, as the overlap of partitions increased, the stability of the feature selection strategies increased.

A feature selection model based on genetic rank aggregation for text sentiment classification

2016 ◽  
Vol 43 (1) ◽  
pp. 25-38 ◽  
Author(s):  
Aytuğ Onan ◽  
Serdar Korukoğlu
Keyword(s):  
Feature Selection ◽  
Text Mining ◽  
Language Processing ◽  
Rank Aggregation ◽  
Sentiment Classification ◽  
Feature Subset ◽  
Individual Feature ◽  
Selection Methods ◽  
Training Time ◽  
Main Challenge

Sentiment analysis is an important research direction of natural language processing, text mining and web mining which aims to extract subjective information in source materials. The main challenge encountered in machine learning method-based sentiment classification is the abundant amount of data available. This amount makes it difficult to train the learning algorithms in a feasible time and degrades the classification accuracy of the built model. Hence, feature selection becomes an essential task in developing robust and efficient classification models whilst reducing the training time. In text mining applications, individual filter-based feature selection methods have been widely utilized owing to their simplicity and relatively high performance. This paper presents an ensemble approach for feature selection, which aggregates the several individual feature lists obtained by the different feature selection methods so that a more robust and efficient feature subset can be obtained. In order to aggregate the individual feature lists, a genetic algorithm has been utilized. Experimental evaluations indicated that the proposed aggregation model is an efficient method and it outperforms individual filter-based feature selection methods on sentiment classification.

Identification and analysis of the cleavage site in a signal peptide using SMOTE, dagging, and feature selection methods

2018 ◽  
Vol 14 (1) ◽  
pp. 64-73 ◽  
Author(s):  
ShaoPeng Wang ◽  
Deling Wang ◽  
JiaRui Li ◽  
Tao Huang ◽  
Yu-Dong Cai
Keyword(s):  
Machine Learning ◽  
Feature Selection ◽  
Signal Peptide ◽  
Cleavage Site ◽  
Learning Algorithms ◽  
Machine Learning Algorithms ◽  
Cleavage Sites ◽  
Selection Methods

Several machine learning algorithms were adopted to investigate cleavage sites in a signal peptide. An optimal dagging based classifier was constructed and 870 important features were deemed to be important for this classifier.

Chinese Sentiment Classifier Machine Learning Based on Optimized Information Gain Feature Selection

2014 ◽  
Vol 988 ◽  
pp. 511-516 ◽  
Author(s):  
Jin Tao Shi ◽  
Hui Liang Liu ◽  
Yuan Xu ◽  
Jun Feng Yan ◽  
Jian Feng Xu
Keyword(s):  
Machine Learning ◽  
Feature Selection ◽  
Word Frequency ◽  
Chinese Text ◽  
Information Gain ◽  
Classification Performance ◽  
Selection Methods ◽  
Text Feature ◽  
Important Solution ◽  
Feature Word

Machine learning is important solution in the research of Chinese text sentiment categorization , the text feature selection is critical to the classification performance. However, the classical feature selection methods have better effect on the global categories, but it misses many representative feature words of each category. This paper presents an improved information gain method that integrates word frequency and degree of feature word sentiment into traditional information gain methods. Experiments show that classifier improved by this method has better classification .

Sign in / Sign up

Export Citation Format

Share Document