Cost-sensitive feature selection using random forest: Selecting low-cost subsets of informative features

作者:

Highlights:

摘要

Feature selection aims to select a small subset of informative features that contain most of the information related to a given task. Existing feature selection methods often assume that all the features have the same cost. However, in many real world applications, different features may have different costs (e.g., different tests a patient might take in medical diagnosis). Ignoring the feature cost may produce good feature subsets in theory but they can not be used in practice. In this paper, we propose a random forest-based feature selection algorithm that incorporates the feature cost into the base decision tree construction process to produce low-cost feature subsets. In particular, when constructing a base tree, a feature is randomly selected with a probability inversely proportional to its associated cost. We evaluate the proposed method on a number of UCI datasets and apply it to a medical diagnosis problem where the real feature costs are estimated by experts. The experimental results demonstrate that our feature-cost-sensitive random forest (FCS-RF) is able to select a low-cost subset of informative features and achieves better performance than other state-of-art feature selection methods in real-world problems.

论文关键词:Cost sensitive,Feature selection,Random forest

论文评审过程:Received 31 March 2015, Revised 9 September 2015, Accepted 11 November 2015, Available online 11 December 2015, Version of Record 27 January 2016.

论文官网地址:https://doi.org/10.1016/j.knosys.2015.11.010