Rough set-based decision tree construction algorithm

被引：0

作者：

Han, Sang-Wook ^{[1
]}

Kim, Jae-Yearn ^{[1
]}

机构：

[1] Hanyang Univ, Dept Ind Engn, Seoul 133791, South Korea

来源：

COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2007, PT 1, PROCEEDINGS | 2007年 / 4705卷

关键词：

rough set; decision tee; core;

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

We apply rough set theory to obtain knowledge from the construction of a decision tree. Decision trees are widely used in machine learning. A variety of methods for making decision trees have been developed. Our algorithm, which compares the core attributes of objects and builds decision trees based on those attributes, represents a new type of tree construction. Experiments show that the new algorithm can help to extract more meaningful and accurate rules than other algorithms.

引用

页码：710 / +

页数：3

共 13 条

[1]

Bai JS, 2003, 2003 INTERNATIONAL CONFERENCE ON NATURAL LANGUAGE PROCESSING AND KNOWLEDGE ENGINEERING, PROCEEDINGS, P533

[2]

BAZAN J, 1994, LECT NOTES ARTIF INT, V869, P346

[3]

Duda RO, 2006, PATTERN CLASSIFICATI

[4]

FRANK E, 2003, WEKA

[5]

Han J., 2006, DATA MINING CONCEPTS, P285

[6]

Minz S, 2003, LECT NOTES COMPUT SC, V2737, P172

[7]

Pawlak Z., 1982, INT J COMPUTER INFOR, V11

[8]

Quinlan J. R., 1986, Machine Learning, V1, P81, DOI 10.1023/A:1022643204877

[9] Improved use of continuous attributes in C4.5 [J].

Quinlan, JR .

JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 1996, 4 :77-90

[10]

SKOWRON A, 1991, DISCERNIBILITY MATRI

← 1 2 →