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 条
  • [31] FEATURE SELECTION WITH A LINEAR DEPENDENCE MEASURE
    DAS, SK
    IEEE TRANSACTIONS ON COMPUTERS, 1971, C 20 (09) : 1106 - &
  • [32] Optimized Ranking and Selection Methods for Feature Selection with Application in Microarray Experiments
    Cui, Xinping
    Zhao, Haibing
    Wilson, Jason
    JOURNAL OF BIOPHARMACEUTICAL STATISTICS, 2010, 20 (02) : 223 - 239
  • [33] Feature Ranking for Feature Sorting and Feature Selection: FR4(FS)2
    Santana-Morales, Paola
    Merchan, Alberto F.
    Marquez-Rodriguez, Alba
    Tallon-Ballesteros, Antonio J.
    BIO-INSPIRED SYSTEMS AND APPLICATIONS: FROM ROBOTICS TO AMBIENT INTELLIGENCE, PT II, 2022, 13259 : 545 - 550
  • [34] Robust autoencoder feature selector for unsupervised feature selection
    Ling, Yunzhi
    Nie, Feiping
    Yu, Weizhong
    Ling, Yunhao
    Li, Xuelong
    INFORMATION SCIENCES, 2024, 660
  • [35] An adaptive ranking moth flame optimizer for feature selection
    Yu, Xiaobing
    Wang, Haoyu
    Lu, Yangchen
    MATHEMATICS AND COMPUTERS IN SIMULATION, 2024, 219 : 164 - 184
  • [36] Efficient Feature Ranking and Selection Using Statistical Moments
    Hochma, Yael
    Felendler, Yuval
    Last, Mark
    IEEE ACCESS, 2024, 12 : 105573 - 105587
  • [37] Feature subset selection and ranking for data dimensionality reduction
    Wei, Hua-Liang
    Billings, Stephen A.
    IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2007, 29 (01) : 162 - 166
  • [38] Nonconvex Regularizations for Feature Selection in Ranking With Sparse SVM
    Laporte, Lea
    Flamary, Remi
    Canu, Stephane
    Dejean, Sebastien
    Mothe, Josiane
    IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2014, 25 (06) : 1118 - 1130
  • [39] An integrated feature ranking and selection framework for ADHD characterization
    Xiao C.
    Bledsoe J.
    Wang S.
    Chaovalitwongse W.A.
    Mehta S.
    Semrud-Clikeman M.
    Grabowski T.
    Brain Informatics, 2016, 3 (3) : 145 - 155
  • [40] Copula for Instance-wise Feature Selection and Ranking
    Peng, Hanyu
    Fang, Guanhua
    Li, Ping
    UNCERTAINTY IN ARTIFICIAL INTELLIGENCE, 2023, 216 : 1651 - 1661