The Method of Attribute Reduction Based on Decision Tree

被引:0
作者
Li, Fachao [1 ]
Yin, Hongze [1 ]
Guan, Fei [1 ]
机构
[1] Hebei Univ Sci & Technol, Coll Sci, Shijiazhuang 050018, Peoples R China
来源
FRONTIERS OF MANUFACTURING SCIENCE AND MEASURING TECHNOLOGY, PTS 1-3 | 2011年 / 230-232卷
关键词
Data mining; Decision tree; Rough set; Information system; Attribute reduction;
D O I
10.4028/www.scientific.net/AMR.230-232.1303
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
This paper is for refining database in the data mining process. Based on the analysis of the features and disadvantages of this decision tree algorithm and the substantive characteristics of data mining, we propose the concept of the core samples set and prove its invariance. On this basis, we build an attribute reduction method based on decision tree algorithm and then give a specific implementation steps, further, combined with a specific instance analyze the characteristics and efficiency of the method. Results show that the attribute reduction method based on the decision tree has good maneuverability and explicableness. This method can simply realize the attribute reduction of information system and its basic ideas completely adapt to the attribute reduction problems of the uncertain environment.
引用
收藏
页码:1303 / 1307
页数:5
相关论文
共 15 条
  • [1] [Anonymous], 1992, DISCERNIBILITY MATRI, DOI DOI 10.1007/978-94-015-7975-9_21
  • [2] [Anonymous], 1993, C4 5 PROGRAMS MACHIN
  • [3] [Anonymous], 1984, OLSHEN STONE CLASSIF, DOI 10.2307/2530946
  • [4] Rough computational methods for information systems
    Guan, JW
    Bell, DA
    [J]. ARTIFICIAL INTELLIGENCE, 1998, 105 (1-2) : 77 - 103
  • [5] Han Ling, 2007, ALGORITHM ATTRIBUTE, V1
  • [6] Hunt E. B., 1966, EXPT INDUCTION
  • [7] Liu Q., 2001, ROUGH SET ROUGH REAS
  • [8] ROUGH SETS
    PAWLAK, Z
    [J]. INTERNATIONAL JOURNAL OF COMPUTER & INFORMATION SCIENCES, 1982, 11 (05): : 341 - 356
  • [9] QUINLAN JR, 1986, MACH LEARN, V1, P1, DOI DOI 10.1023/A:1022643204877
  • [10] RASTOGI R, 1998, PUBLIC DECISION TREE