Multilabel Feature Selection Using Mutual Information and ML-ReliefF for Multilabel Classification

Abstract

Recently, multilabel classification algorithms play an increasingly significant role in data mining and machine learning. However, some existing mutual information-based algorithms ignore the influence of the proportions of labels on the correlation degree between features and label sets. Besides, the correlation degree of label sets cannot be accurately measured in most traditional ReliefF algorithms, and the repeated calculation arises from the division of heterogeneous neighbors. To overcome these shortcomings, this paper proposes a multilabel feature selection method using mutual information and improved multilabel ReliefF (ML-ReliefF). First, the proportion of each label is calculated in label space and combined with the mutual information of features and labels to construct a novel correlation degree between features and label sets to preprocess multilabel datasets, which is used to reduce runtime of ML-ReliefF. Second, the mutual information of label sets is introduced into improving accuracy of the correlation degree among label sets. Furthermore, two types of correlation degree for label sets based on ML-ReliefF are developed to divide similar and heterogeneous samples more clearly. Third, a divided method of heterogeneous neighbors is presented to effectively avoid the repeated calculation in ML-ReliefF, and a novel method of feature weighting based on ML-ReliefF is constructed to evaluate the importance of features. Finally, a multilabel feature selection algorithm based on mutual information and ML-ReliefF for multilabel classification is designed to improve the performance of multilabel classification. Experiments under fourteen multilabel datasets show the effectiveness of our algorithm and improve the classification performance for multilabel datasets.

Complexity Graph-Based Multilabel Classification Method of Human Action in Rope Skipping Scene

“…e larger the frequency shift, the quicker the tag travels away from the antenna; when the tag is far away from the antenna, the echo signal has a lower frequency than the original signal. e larger the frequency shift, the quicker the tag travels relative to the antenna [14].…”

Multi-Branch Line Fault Arc Detection Method Based on the Improved Northern Goshawk Optimization Adaptive Base Class LogitBoost Algorithm

“…The ReliefF algorithm is a typical filtered feature selection method that is computationally simple and widely used. When analyzing the classification problem, each time a sample R is randomly taken out from the training sample set, k-nearest neighbor samples K are identified from the set of similar samples, k-nearest neighbor samples M are identified from the set of dissimilar samples, and the score of each feature is updated according to Equation (4) [26]. Feature selection follows the principle of "aggregation within classes and dispersion between classes."…”

A filter-based feature selection approach in multilabel classification

“…It suggested the need for improvements in classifier accuracy and also reported a gap in work based on the wrapper and embedded approaches. An algorithm for feature selection for improving multi-label classification performance is proposed in [6], which produced significant outcomes for the fourteen multi-label datasets. Another MOMFS-multi-objective multi-label feature selection algorithm based on two-particle swarms is introduced in [7].…”