Feature grouping and selectionA graph-based approach

Authors Organisations
Type Article
Original languageEnglish
Pages (from-to)1256-1272
Number of pages17
JournalInformation Sciences
Volume546
Early online date08 Oct 2020
DOI
Publication statusPublished - 06 Feb 2021
Links
Permanent link
View graph of relations
Citation formats

Abstract

Most current feature selection techniques are focused on the incremental inclusion or exclusion of single individual features with respect to the candidate feature subset(s). The use of such approaches, where only the individual inclusion/exclusion of features is considered, means that information such as the collaborative contribution or correlation between features may be lost. The result is that the final selected feature subset may contain high levels of inter-feature redundancy, assuming that the key information embedded in the original feature set can still be retained. To address this problem, a general framework based on graph processing and three-way mutual information metrics is proposed in this paper that works by clustering similar features into groups, from which representative features are then drawn. Two different feature selection techniques based on this framework are presented: one by straightforward selection of representative features from the resulting feature groups and the other via a music-inspired metaheuristic search. Comparative experimental evaluation against traditional feature selection techniques over a diverse range of 20 benchmark datasets demonstrates the efficacy of the proposed approach. With these implementations, significant performance gains can be made in terms of classification accuracy in general and dimensionality reduction in particular while retaining feature semantics and considerably lessening the redundancy in the returned feature subsets.

Keywords

  • Feature grouping, Feature selection, Graph processing, Harmony search, Minimum spanning tree

Documents

  • Accepted Manuscript

    Accepted author manuscript, 415 KB, PDF

    Embargo ends: 08 Oct 2021

    Request copy

    Licence: CC BY-NC-ND Show licence