Fast multi-label feature selection based on information-theoretic feature ranking
Multi-label feature selection involves selecting important features from multi-label data sets. This can be achieved by ranking features based on their importance and then selecting the top-ranked features. Many multi-label feature selection methods for finding a feature subset that can improve mult...
Saved in:
Published in | Pattern recognition Vol. 48; no. 9; pp. 2761 - 2771 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
Elsevier Ltd
01.09.2015
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | Multi-label feature selection involves selecting important features from multi-label data sets. This can be achieved by ranking features based on their importance and then selecting the top-ranked features. Many multi-label feature selection methods for finding a feature subset that can improve multi-label learning accuracy have been proposed. In contrast, computationally efficient multi-label feature selection methods have not been studied extensively. In this study, we propose a fast multi-label feature selection method based on information-theoretic feature ranking. Experimental results demonstrate that the proposed method generates a feature subset significantly faster than several other multi-label feature selection methods for large multi-label data sets.
•A score function from mutual information between a feature and labels was derived.•Unnecessary computations from the score function were discarded.•A strategy to identify important labels from sparse label set was proposed.•The computational cost of each component was analyzed theoretically. |
---|---|
ISSN: | 0031-3203 1873-5142 |
DOI: | 10.1016/j.patcog.2015.04.009 |