An accelerator for attribute reduction based on perspective of objects and attributes

被引:39
作者
Liang, Jiye [2 ]
Mi, Junrong [1 ]
Wei, Wei [2 ]
Wang, Feng [2 ]
机构
[1] Shanxi Univ, Sch Management, Taiyuan 030006, Shanxi, Peoples R China
[2] Shanxi Univ, Sch Comp & Informat Technol, Minist Educ, Key Lab Computat Intelligence & Chinese Informat, Taiyuan 030006, Shanxi, Peoples R China
基金
中国国家自然科学基金;
关键词
Feature selection; Accelerating algorithm; Attribute reduction; Rough set; Large scale data; FEATURE-SELECTION; KNOWLEDGE GRANULATION; DECISION PERFORMANCE; ROUGH SETS; INFORMATION; ENTROPY; SYSTEMS; DIMENSIONALITY; UNCERTAINTY;
D O I
10.1016/j.knosys.2013.01.027
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Feature selection is an active area of research in pattern recognition, machine learning and artificial intelligence, which greatly improves the performance of forecasting or classification. In rough set theory, attribute reduction, as a special form of feature selection, aims to retain the discernability of the original attribute set. To solve this problem, many heuristic attribute reduction algorithms have been proposed in the literature. However, these methods are computationally time-consuming for large scale datasets. Recently, an accelerator was introduced by computing reducts on gradually reducing the size of the universe. Although the accelerator can considerably shorten the computational time, it remains a challenging issue. To further enhance the efficiency of these algorithms, we develop a new accelerator for attribute reduction, which simultaneously reduces the size of the universe and the number of attributes at each iteration of the process of reduction. Based on the new accelerator, several representative heuristic attribute reduction algorithms are accelerated. Experiments show that these accelerated algorithms can significantly reduce computational time while maintaining their results the same as before. (C) 2013 Elsevier B.V. All rights reserved.
引用
收藏
页码:90 / 100
页数:11
相关论文
共 47 条
  • [31] Positive approximation: An accelerator for attribute reduction in rough set theory
    Qian, Yuhua
    Liang, Jiye
    Pedrycz, Witold
    Dang, Chuangyin
    [J]. ARTIFICIAL INTELLIGENCE, 2010, 174 (9-10) : 597 - 618
  • [32] A review of feature selection techniques in bioinformatics
    Saeys, Yvan
    Inza, Inaki
    Larranaga, Pedro
    [J]. BIOINFORMATICS, 2007, 23 (19) : 2507 - 2517
  • [33] Selecting informative features with fuzzy-rough sets and its application for complex systems monitoring
    Shen, Q
    Jensen, R
    [J]. PATTERN RECOGNITION, 2004, 37 (07) : 1351 - 1363
  • [34] A rough-fuzzy approach for generating classification rules
    Shen, Q
    Chouchoulas, A
    [J]. PATTERN RECOGNITION, 2002, 35 (11) : 2425 - 2438
  • [35] Slezak D, 2002, FUND INFORM, V53, P365
  • [36] Slezak D., 1995, RES REPORT
  • [37] Rough set methods in feature selection and recognition
    Swiniarski, RW
    Skowron, A
    [J]. PATTERN RECOGNITION LETTERS, 2003, 24 (06) : 833 - 849
  • [38] Attributes Reduction Using Fuzzy Rough Sets
    Tsang, Eric C. C.
    Chen, Degang
    Yeung, Daniel S.
    Wang, Xi-Zhao
    Lee, John W. T.
    [J]. IEEE TRANSACTIONS ON FUZZY SYSTEMS, 2008, 16 (05) : 1130 - 1141
  • [39] Wang Guo-Yin, 2002, Chinese Journal of Computers, V25, P759
  • [40] Wang GY, 2005, FUND INFORM, V68, P289