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 条
  • [1] [Anonymous], 1992, Intelligent Decision Support. Handbook of Applications and Advances of the Rough Sets Theory, DOI DOI 10.1007/978-94-015-7975-9_21
  • [2] [Anonymous], 1985, Bull. Pol. Acad. Sci. Math
  • [3] Rough-fuzzy weighted k-nearest leader classifier for large data sets
    Babu, V. Suresh
    Viswanath, P.
    [J]. PATTERN RECOGNITION, 2009, 42 (09) : 1719 - 1731
  • [4] Consistency-based search in feature selection
    Dash, M
    Liu, HA
    [J]. ARTIFICIAL INTELLIGENCE, 2003, 151 (1-2) : 155 - 176
  • [5] A vague-rough set approach for uncertain knowledge acquisition
    Feng, Lin
    Li, Tianrui
    Ruan, Da
    Gou, Shirong
    [J]. KNOWLEDGE-BASED SYSTEMS, 2011, 24 (06) : 837 - 843
  • [6] Guyon I., 2003, J MACH LEARN RES, V3, P1157
  • [7] Information-preserving hybrid data reduction based on fuzzy-rough techniques
    Hu, QH
    Yu, DR
    Xie, ZX
    [J]. PATTERN RECOGNITION LETTERS, 2006, 27 (05) : 414 - 423
  • [8] Mixed feature selection based on granulation and approximation
    Hu, Qinghua
    Liu, Jinfu
    Yu, Daren
    [J]. KNOWLEDGE-BASED SYSTEMS, 2008, 21 (04) : 294 - 304
  • [9] Hybrid attribute reduction based on a novel fuzzy-rough model and information granulation
    Hu, Qinghua
    Xie, Zongxia
    Yu, Daren
    [J]. PATTERN RECOGNITION, 2007, 40 (12) : 3509 - 3521
  • [10] LEARNING IN RELATIONAL DATABASES - A ROUGH SET APPROACH
    HU, XH
    CERCONE, N
    [J]. COMPUTATIONAL INTELLIGENCE, 1995, 11 (02) : 323 - 338