DocumentCode :
974792
Title :
Data structure for association rule mining: T-trees and P-trees
Author :
Coenen, Frans ; Leng, Paul ; Ahmed, Shakil
Author_Institution :
Dept. of Comput. Sci., Liverpool Univ., UK
Volume :
16
Issue :
6
fYear :
2004
fDate :
6/1/2004 12:00:00 AM
Firstpage :
774
Lastpage :
778
Abstract :
Two new structures for association rule mining (ARM), the T-tree, and the P-tree, together with associated algorithms, are described. The authors demonstrate that the structures and algorithms offer significant advantages in terms of storage and execution time.
Keywords :
data mining; tree data structures; P-trees; T-trees; association rule mining; tree data structure; Association rules; Data mining; Data preprocessing; Data structures; Frequency; Indexing; Itemsets; Mechanical factors; Memory; Tree data structures; 65; Association Rule Mining; P-tree.; T-tree;
fLanguage :
English
Journal_Title :
Knowledge and Data Engineering, IEEE Transactions on
Publisher :
ieee
ISSN :
1041-4347
Type :
jour
DOI :
10.1109/TKDE.2004.8
Filename :
1294897
Link To Document :
بازگشت