Binary Differential Evolution based Feature Selection Method with Mutual Information for Imbalanced Classification Problems

2021 ◽  
Author(s):  
Arka Ghosh ◽  
Bing Xue ◽  
Mengjie Zhang
Keyword(s):  
Feature Selection ◽  
Mutual Information ◽  
Differential Evolution ◽  
Feature Selection Method ◽  
Selection Method ◽  
Classification Problems ◽  
Imbalanced Classification ◽  
Binary Differential Evolution

A lazy feature selection method for multi-label classification

2021 ◽  
Vol 25 (1) ◽  
pp. 21-34
Author(s):  
Rafael B. Pereira ◽  
Alexandre Plastino ◽  
Bianca Zadrozny ◽  
Luiz H.C. Merschmann
Keyword(s):  
Feature Selection ◽  
Text Categorization ◽  
Feature Selection Method ◽  
Selection Method ◽  
Video Classification ◽  
Classification Problems ◽  
Class Label ◽  
New Feature ◽  
Feature Selection Techniques ◽  
Biomolecular Analysis

In many important application domains, such as text categorization, biomolecular analysis, scene or video classification and medical diagnosis, instances are naturally associated with more than one class label, giving rise to multi-label classification problems. This has led, in recent years, to a substantial amount of research in multi-label classification. More specifically, feature selection methods have been developed to allow the identification of relevant and informative features for multi-label classification. This work presents a new feature selection method based on the lazy feature selection paradigm and specific for the multi-label context. Experimental results show that the proposed technique is competitive when compared to multi-label feature selection techniques currently used in the literature, and is clearly more scalable, in a scenario where there is an increasing amount of data.

Feature Selection Method Based on Mutual Information and Support Vector Machine

2021 ◽  
pp. 2150021
Author(s):  
Gang Liu ◽  
Chunlei Yang ◽  
Sen Liu ◽  
Chunbao Xiao ◽  
Bin Song
Keyword(s):  
Support Vector Machine ◽  
Feature Selection ◽  
Mutual Information ◽  
Classification Accuracy ◽  
Feature Selection Method ◽  
Selection Method ◽  
Support Vector ◽  
Svm Classifier ◽  
Standard Data ◽  
Feature Dimension

A feature selection method based on mutual information and support vector machine (SVM) is proposed in order to eliminate redundant feature and improve classification accuracy. First, local correlation between features and overall correlation is calculated by mutual information. The correlation reflects the information inclusion relationship between features, so the features are evaluated and redundant features are eliminated with analyzing the correlation. Subsequently, the concept of mean impact value (MIV) is defined and the influence degree of input variables on output variables for SVM network based on MIV is calculated. The importance weights of the features described with MIV are sorted by descending order. Finally, the SVM classifier is used to implement feature selection according to the classification accuracy of feature combination which takes MIV order of feature as a reference. The simulation experiments are carried out with three standard data sets of UCI, and the results show that this method can not only effectively reduce the feature dimension and high classification accuracy, but also ensure good robustness.

scholarly journals Mini-Batch Normalized Mutual Information: A Hybrid Feature Selection Method

IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 116875-116885 ◽  
Author(s):  
G. S. Thejas ◽  
Sajal Raj Joshi ◽  
S. S. Iyengar ◽  
N. R. Sunitha ◽  
Prajwal Badrinath
Keyword(s):  
Feature Selection ◽  
Mutual Information ◽  
Feature Selection Method ◽  
Selection Method ◽  
Normalized Mutual Information

scholarly journals Intrusion Detection System using SMIFS and Multi class Multi layer Perceptron

2019 ◽  
Vol 8 (9) ◽  
pp. 2622-2628
Keyword(s):  
Feature Extraction ◽  
Feature Selection ◽  
Mutual Information ◽  
New Technologies ◽  
Detection System ◽  
Feature Selection Method ◽  
Machine Learning Algorithms ◽  
Feature Subset ◽  
Classification Problems ◽  
Data Set

As the new technologies are emerging, data is getting generated in larger volumes high dimensions. The high dimensionality of data may rise to great challenge while classification. The presence of redundant features and noisy data degrades the performance of the model. So, it is necessary to extract the relevant features from given data set. Feature extraction is an important step in many machine learning algorithms. Many researchers have been attempted to extract the features. Among these different feature extraction methods, mutual information is widely used feature selection method because of its good quality of quantifying dependency among the features in classification problems. To cope with this issue, in this paper we proposed simplified mutual information based feature selection with less computational overhead. The selected feature subset is experimented with multilayered perceptron on KDD CUP 99 data set with 2- class classification, 5-class classification and 4-class classification. The accuracy is of these models almost similar with less number of features.

scholarly journals A redundancy-removing feature selection algorithm for nominal data

2015 ◽  
Vol 1 ◽  
pp. e24 ◽  
Author(s):  
Zhihua Li ◽  
Wenqu Gu
Keyword(s):  
Feature Selection ◽  
Mutual Information ◽  
Feature Selection Method ◽  
Selection Method ◽  
Selection Algorithm ◽  
Nominal Data ◽  
New Information ◽  
New Feature ◽  
High Dimensional Datasets ◽  
Experimental Comparisons

No order correlation or similarity metric exists in nominal data, and there will always be more redundancy in a nominal dataset, which means that an efficient mutual information-based nominal-data feature selection method is relatively difficult to find. In this paper, a nominal-data feature selection method based on mutual information without data transformation, called the redundancy-removing more relevance less redundancy algorithm, is proposed. By forming several new information-related definitions and the corresponding computational methods, the proposed method can compute the information-related amount of nominal data directly. Furthermore, by creating a new evaluation function that considers both the relevance and the redundancy globally, the new feature selection method can evaluate the importance of each nominal-data feature. Although the presented feature selection method takes commonly used MIFS-like forms, it is capable of handling high-dimensional datasets without expensive computations. We perform extensive experimental comparisons of the proposed algorithm and other methods using three benchmarking nominal datasets with two different classifiers. The experimental results demonstrate the average advantage of the presented algorithm over the well-known NMIFS algorithm in terms of the feature selection and classification accuracy, which indicates that the proposed method has a promising performance.

Sign in / Sign up

Export Citation Format

Share Document