loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Data Structure for Association Rule Mining: T-Trees and P-Trees
June 2004 (vol. 16 no. 6)
pp. 774-778
ASCII Text
x 
 
Frans Coenen, Paul Leng, Shakil Ahmed, "Data Structure for Association Rule Mining: T-Trees and P-Trees," IEEE Transactions on Knowledge and Data Engineering, vol. 16, no. 6, pp. 774-778, June, 2004.
 
 
BibTex
x
 
@article{ 10.1109/TKDE.2004.8,
author = {Frans Coenen and Paul Leng and Shakil Ahmed},
title = {Data Structure for Association Rule Mining: T-Trees and P-Trees},
journal ={IEEE Transactions on Knowledge and Data Engineering},
volume = {16},
number = {6},
issn = {1041-4347},
year = {2004},
pages = {774-778},
doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2004.8},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Knowledge and Data Engineering
TI - Data Structure for Association Rule Mining: T-Trees and P-Trees
IS - 6
SN - 1041-4347
SP774
EP778
EPD - 774-778
A1 - Frans Coenen,
A1 - Paul Leng,
A1 - Shakil Ahmed,
PY - 2004
KW - Association Rule Mining
KW - T-tree
KW - P-tree.
VL - 16
JA - IEEE Transactions on Knowledge and Data Engineering
ER -
 

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.

[1] R. Agrawal and R. Srikant, Fast Algorithms for Mining Association Rules Proc. 20th Very Large Databses (VLDB) Conf., pp. 487-499, 1994.
[2] R.J. Bayardo, Efficiently Mining Long Patterns from Datasets Proc. ACM SIGMOD, Int'l Conf. Management of Data, pp. 85-93, 1998.
[3] S. Brin, R. Motwani, J. Ullman, and S. Tsur, Dynamic Itemset Counting and Implication Rules for Market Basket Data Proc. ACM SIGMOD, Int'l Conf. Management of Data, pp. 255-264, 1997.
[4] J. Han, J. Pei, and Y. Yiwen, Mining Frequent Patterns Without Candidate Generation Proc. ACM-SIGMOD Int'l Conf. Management of Data, pp. 1-12, 2000.
[5] Quest project,http://www.almaden.ibm.com/csquest/, IBM Almaden Research Center, 2004.
[6] R. Rymon, Search Through Systematic Set Enumeration Proc. Third Int'l Conf. Principles of Knowledge and Reasoning, pp. 539-550, 1992.
[7] M.J. Zaki, S. Parthasarathy, M. Ogihara, and W. Li, New algorithms for Fast Discovery of Association Rules Proc. Third Int'l Conf. Knowledge Discovery and Data Mining, 1997.

Index Terms:
Association Rule Mining, T-tree, P-tree.
Citation:
Frans Coenen, Paul Leng, Shakil Ahmed, "Data Structure for Association Rule Mining: T-Trees and P-Trees," IEEE Transactions on Knowledge and Data Engineering, vol. 16, no. 6, pp. 774-778, June 2004, doi:10.1109/TKDE.2004.8
Usage of this product signifies your acceptance of the Terms of Use.