This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Transaction Mapping Algorithm for Frequent Itemsets Mining
April 2006 (vol. 18 no. 4)
pp. 472-481
In this paper, we present a novel algorithm for mining complete frequent itemsets. This algorithm is referred to as the TM (Transaction Mapping) algorithm from hereon. In this algorithm, transaction ids of each itemset are mapped and compressed to continuous transaction intervals in a different space and the counting of itemsets is performed by intersecting these interval lists in a depth-first order along the lexicographic tree. When the compression coefficient becomes smaller than the average number of comparisons for intervals intersection at a certain level, the algorithm switches to transaction id intersection. We have evaluated the algorithm against two popular frequent itemset mining algorithms, FP-growth and dEclat, using a variety of data sets with short and long frequent patterns. Experimental data show that the TM algorithm outperforms these two algorithms.

[1] R. Agrawal, T. Imielinski, and A.N. Swami, “Mining Association Rules between Sets of Items in Large Databases,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 207-216, May 1993.
[2] R. Agrawal and R. Srikant, “Fast Algorithms for Mining Association Rules,” Proc. 20th Int'l Conf. Very Large Data Bases, pp. 487-499, 1994.
[3] B. Goethals, “Survey on Frequent Pattern Mining,” manuscript, 2003.
[4] J. Han, J. Pei, and Y. Yin, “Mining Frequent Patterns without Candidate Generation,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 1-12, May 2000.
[5] J. Pei, J. Han, H. Lu, S. Nishio, S. Tang, and D. Yang, “Hmine: Hyper-Structure Mining of Frequent Patterns in Large Databases,” Proc. IEEE Int'l Conf. Data Mining, pp. 441-448, 2001.
[6] A. Pietracaprina and D. Zandolin, “Mining Frequent Itemsets Using Patricia Tries,” Proc. ICDM 2003 Workshop Frequent Itemset Mining Implementations, Dec. 2003.
[7] G. Grahne and J. Zhu, “Efficiently Using Prefix-Trees in Mining Frequent Itemsets,” Proc. ICDM 2003 Workshop Frequent Itemset Mining Implementations, Dec. 2003.
[8] 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, pp. 283-286, 1997.
[9] P. Shenoy, J.R. Haritsa, S. Sudarshan, G. Bhalotia, M. Bawa, and D. Shah, “Turbo-Charging Vertical Mining of Large Databases,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 22-23, May 2000.
[10] D. Burdick, M. Calimlim, and J. Gehrke, “MAFIA: A Maximal Frequent Itemset Algorithm for Transactional Databases,” Proc. Int'l Conf. Data Eng., pp. 443-452, Apr. 2001.
[11] M.J. Zaki and K. Gouda, “Fast Vertical Mining Using Diffsets,” Proc. Ninth ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining, pp. 326-335, 2003.
[12] R. Agrawal, C. Aggarwal, and V. Prasad, “A Tree Projection Algorithm for Generation of Frequent Item Sets,” Parallel and Distributed Computing, pp. 350-371, 2000.
[13] R.J. Bayardo, “Efficiently Mining Long Patterns from Databases,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 85-93, June 1998.

Index Terms:
Algorithms, association rule mining, data mining, frequent itemsets.
Citation:
Mingjun Song, Sanguthevar Rajasekaran, "A Transaction Mapping Algorithm for Frequent Itemsets Mining," IEEE Transactions on Knowledge and Data Engineering, vol. 18, no. 4, pp. 472-481, April 2006, doi:10.1109/TKDE.2006.52
Usage of this product signifies your acceptance of the Terms of Use.