New method about how to construct decision tree based on association rule

Author

Gao, Jing ; Zhao, Baoyong

Author_Institution

Inf. Coll., Capital Univ. of Econ. & Bus., Beijing, China

fYear

2011

fDate

12-14 Oct. 2011

Firstpage

131

Lastpage

135

Abstract

Nowadays, decision tree is widely used as one of the most powerful tools in data mining. However, to construct an optimization decision tree is a complete NP problem. So a new method about how to construct decision tree, which is based on association rule mining, is proposed in this paper. Firstly, approximate exact rule with high reliability is defined. Secondly new attributes are generated from the approximate exact rule. And then its evaluation method is discussed in detail. Thirdly, the decision tree is constructed with both the new generated attributes and its original data. Finally, after comprehensive analysis, experimental results show that this new method has higher accuracy than any other old method.

Keywords

computational complexity; data mining; decision trees; approximate exact rule; association rule; complete NP problem; data mining; optimization decision tree; Accuracy; Approximation algorithms; Association rules; Classification algorithms; Decision trees; Itemsets; approximate exact rule; association rule; decision tree;

fLanguage

English

Publisher

ieee

Conference_Titel

Open-Source Software for Scientific Computation (OSSC), 2011 International Workshop on

Conference_Location

Beijing

Print_ISBN

978-1-61284-492-3

Type

conf

DOI

10.1109/OSSC.2011.6184708

Filename

6184708