DocumentCode
501183
Title
A New Hybrid Associative Classification Algorithm Based on OR-Tree and Pruning Skills
Author
Liao, Qin ; Wu, Jianhui ; Tang, Zhonghua
Author_Institution
Dept. Of Math., South China Univ. Of Technol., Guangzhou, China
Volume
2
fYear
2009
fDate
15-17 May 2009
Firstpage
129
Lastpage
132
Abstract
A new hybrid associative classification algorithm based on Order-tree and pruning skills is proposed to solve the problems that there are always too much time consuming and the searching spaces are always too large in traditional associative classification algorithm. In the method a structure of the orderly rules of the tree (OR-tree) is been designed to store the information of the classification rules so that the association rules can be organized when generated, meanwhile, a series of pruning skills that face the rule sets and the candidate classification rules are proposed to optimize the OR-tree. The experiment results show that the new hybrid associative classification algorithm based on OR-tree and pruning skill can not only reduce the searching space of frequent sets and the time consuming effectively, but also improve the mining efficiency of the associative rules.
Keywords
associative processing; data mining; pattern classification; tree searching; OR-tree; association rules; classification rules; frequent sets; hybrid associative classification algorithm; order tree; pruning skill; rule sets; searching space; Association rules; Classification algorithms; Classification tree analysis; Data mining; Design optimization; Information technology; Mathematics; Neural networks; Space technology; Tree data structures; associative classification; associative rules; pruning skill; the OR-tree;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Technology and Applications, 2009. IFITA '09. International Forum on
Conference_Location
Chengdu
Print_ISBN
978-0-7695-3600-2
Type
conf
DOI
10.1109/IFITA.2009.481
Filename
5231249
Link To Document