A Robust-Equitable Measure for Feature Ranking and Selection

被引:0
|
作者
Ding, A. Adam [1 ]
Dy, Jennifer G. [2 ]
Li, Yi [1 ]
Chang, Yale [2 ]
机构
[1] Northeastern Univ, Dept Math, Boston, MA 02115 USA
[2] Northeastern Univ, Dept Elect & Comp Engn, Boston, MA 02115 USA
基金
美国国家科学基金会;
关键词
dependence measure; feature selection; copula; equitability; mutual information; MUTUAL INFORMATION; DENSITY-FUNCTION; CONVERGENCE; DEPENDENCE; CLASSIFICATION; RELEVANCE; ENTROPY; RATES;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In many applications, not all the features used to represent data samples are important. Often only a few features are relevant for the prediction task. The choice of dependence measures often affect the final result of many feature selection methods. To select features that have complex nonlinear relationships with the response variable, the dependence measure should be equitable, a concept proposed by Reshef et al. (2011); that is, the dependence measure treats linear and nonlinear relationships equally. Recently, Kinney and Atwal (2014) gave a mathematical definition of self-equitability. In this paper, we introduce a new concept of robust-equitability and identify a robust-equitable copula dependence measure, the robust copula dependence (RCD) measure. RCD is based on the L-1-distance of the copula density from uniform and we show that it is equitable under both equitability definitions. We also prove theoretically that RCD is much easier to estimate than mutual information. Because of these theoretical properties, the RCD measure has the following advantages compared to existing dependence measures: it is robust to different relationship forms and robust to unequal sample sizes of different features. Experiments on both synthetic and real-world data sets confirm the theoretical analysis, and illustrate the advantage of using the dependence measure RCD for feature selection.
引用
收藏
页码:1 / 46
页数:46
相关论文
共 50 条
  • [1] A Robust-Equitable Copula Dependence Measure for Feature Selection
    Chang, Yale
    Li, Yi
    Ding, Adam
    Dy, Jennifer G.
    ARTIFICIAL INTELLIGENCE AND STATISTICS, VOL 51, 2016, 51 : 84 - 92
  • [2] A new ranking-based stability measure for feature selection algorithms
    Deepak Kumar Rakesh
    Raj Anwit
    Prasanta K. Jana
    Soft Computing, 2023, 27 : 5377 - 5396
  • [3] A new ranking-based stability measure for feature selection algorithms
    Rakesh, Deepak Kumar
    Anwit, Raj
    Jana, Prasanta K.
    SOFT COMPUTING, 2023, 27 (09) : 5377 - 5396
  • [4] The Feature Importance Ranking Measure
    Zien, Alexander
    Kraemer, Nicole
    Sonnenburg, Soeren
    Raetsch, Gunnar
    MACHINE LEARNING AND KNOWLEDGE DISCOVERY IN DATABASES, PT II, 2009, 5782 : 694 - +
  • [5] Wrapper for ranking feature selection
    Ruiz, R
    Aguilar-Ruiz, JS
    Riquelme, JC
    INTELLIGENT DAA ENGINEERING AND AUTOMATED LEARNING IDEAL 2004, PROCEEDINGS, 2004, 3177 : 384 - 389
  • [6] Ranking a random feature for variable and feature selection
    Stoppiglia, Hervé
    Dreyfus, Gérard
    Dubois, Rémi
    Oussar, Yacine
    Journal of Machine Learning Research, 2003, 3 : 1399 - 1414
  • [7] A new unsupervised fuzzy feature ranking measure for feature evaluation
    Foroutan, Farzane
    Eftekhari, Mahdi
    2013 13TH IRANIAN CONFERENCE ON FUZZY SYSTEMS (IFSC), 2013,
  • [8] A Stratified Feature Ranking Method for Supervised Feature Selection
    Chen, Renjie
    Chen, Xiaojun
    Yuan, Guowen
    Sun, Wenya
    Wu, Qingyao
    THIRTY-SECOND AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTIETH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE / EIGHTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2018, : 8059 - 8060
  • [9] An Efficient Feature Ranking Measure for Text Categorization
    Tan, Songbo
    Wang, Yuefen
    Cheng, Xueqi
    APPLIED COMPUTING 2008, VOLS 1-3, 2008, : 407 - +
  • [10] Multigranularity Data Analysis With Zentropy Uncertainty Measure for Efficient and Robust Feature Selection
    Yuan, Kehua
    Miao, Duoqian
    Pedrycz, Witold
    Zhang, Hongyun
    Hu, Liang
    IEEE TRANSACTIONS ON CYBERNETICS, 2025, 55 (02) : 740 - 752