Feature selection with test cost constraint

被引：0
|
作者：
机构：
[1] Min, Fan
[2] Hu, Qinghua
[3] Zhu, William
来源：
Min, F. (minfanphd@163.com) | 1600年 / Elsevier Inc.卷 / 55期
关键词：
Constraint satisfaction problems;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Journal article (JA)
引用
收藏
相关论文
共 50 条
  • [1] Feature selection with test cost constraint
    Min, Fan
    Hu, Qinghua
    Zhu, William
    INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2014, 55 (01) : 167 - 179
  • [2] Feature Selection with Cost Constraint
    Liu, Xiaoping
    Li, Xiao-Bai
    AMCIS 2017 PROCEEDINGS, 2017,
  • [3] Feature Selection with Test Cost Constraint through a Simulated Annealing Algorithm
    Niu, Junxia
    Zhao, Hong
    Zhu, William
    JOURNAL OF INTERNET TECHNOLOGY, 2016, 17 (06): : 1133 - 1140
  • [4] Feature selection with time cost constraint
    Ding, H. (doceanh@163.com), 1600, Binary Information Press, Flat F 8th Floor, Block 3, Tanner Garden, 18 Tanner Road, Hong Kong (11):
  • [5] Feature Selection with Multi-Cost Constraint
    Li, Jingkuan
    Zhao, Hong
    Zhu, William
    JOURNAL OF INTERNET TECHNOLOGY, 2016, 17 (05): : 981 - 991
  • [6] VARIABLE COSTS-BASED MULTI-GRANULARITY FEATURE SELECTION WITH TEST COST CONSTRAINT
    Liao, Shujiao
    Lin, Yidong
    INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL, 2020, 16 (06): : 2047 - 2061
  • [7] FEATURE SELECTION WITH FUZZY CONSTRAINT
    DIDAY, E
    COMPTES RENDUS HEBDOMADAIRES DES SEANCES DE L ACADEMIE DES SCIENCES SERIE A, 1975, 281 (21): : 925 - 927
  • [8] Wrapper Framework for Test-Cost-Sensitive Feature Selection
    Jiang, Liangxiao
    Kong, Ganggang
    Li, Chaoqun
    IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS, 2021, 51 (03): : 1747 - 1756
  • [9] Feature Selection Under a Complexity Constraint
    Plasberg, Jan H.
    Kleijn, W. Bastiaan
    IEEE TRANSACTIONS ON MULTIMEDIA, 2009, 11 (03) : 565 - 571
  • [10] Semi-greedy heuristics for feature selection with test cost constraints
    Min F.
    Xu J.
    Granular Computing, 2016, 1 (03) : 199 - 211
12345