This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Efficient Mining of Intertransaction Association Rules
January/February 2003 (vol. 15 no. 1)
pp. 43-56

Abstract—Most of the previous studies on mining association rules are on mining intratransaction associations, i.e., the associations among items within the same transaction where the notion of the transaction could be the items bought by the same customer, the events happened on the same day, etc. In this study, we break the barrier of transactions and extend the scope of mining association rules from traditional single-dimensional, intratransaction associations to multidimensional, intertransaction associations. An intertransaction association describes the association relationships among different transactions. In a database of stock price information, an example of such an association is "if (company) A's stock goes up on day one, B's stock will go down on day two but go up on day four." In this case, no matter whether we treat company or day as the unit of transaction, the associated items belong to different transactions. Moreover, such an intertransaction association can be extended to associate multiple properties in the same rule, so that multidimensional intertransaction associations can also be defined and discovered. Mining intertransaction associations pose more challenges on efficient processing than mining intratransaction associations because the number of potential association rules becomes extremely large after the boundary of transactions is broken. In this study, we introduce the notion of intertransaction association rule, define its measurements: support and confidence, and develop an efficient algorithm, FITI (an acronym for "First Intra Then Inter"), for mining intertransaction associations, which adopts two major ideas: 1) an intertransaction frequent itemset contains only the frequent itemsets of its corresponding intratransaction counterpart; and 2) a special data structure is built among intratransaction frequent itemsets for efficient mining of intertransaction frequent itemsets. We compare FITI with EH-Apriori, the best algorithm in our previous proposal, and demonstrate a substantial performance gain of FITI over EH-Apriori. Further extensions of the method and its implications are also discussed in the paper.

[1] R. Agrawal, T. Imielinski, and A. Swami, “Mining Association Rules Between Sets of Items in Large Databases,” Proc. 1993 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. 1994 Int'l Conf. Very Large Data Bases, pp. 487-499, Sept. 1994.
[3] R. Agrawal and R. Srikant, “Mining Sequential Patterns,” Proc. 1995 Int'l Conf. Data Eng., pp. 3-14, Mar. 1995.
[4] S. Brin, R. Motwani, and C. Silverstein, “Beyond Market Basket: Generalizing Association Rules to Correlations,” Proc. 1997 ACM-SIGMOD Int'l Conf. Management of Data, pp. 265-276, May 1997.
[5] C. Bettini, X.S. Wang, and S. Jajodia, “Testing Complex Temporal Relationships Involving Multiple Granularities and Its Application to Data Mining,” Proc. 15th ACM Symp. Principles of Database Systems, June 1996.
[6] C. Bettini, X. Sean Wang, and S. Jajodia, “Mining Temporal Relationships with Multiple Granularities in Time Sequences,” Data Eng. Bull. vol. 21, pp. 32-38, 1998.
[7] T. Fukuda, Y. Morimoto, S. Morishita, and T. Tokuyama, “Data Mining Using Two-Dimensional Optimized Association Rules: Scheme, Algorithms, and Visualization,” Proc. 1996 ACM-SIGMOD Int'l Conf. Management of Data, pp. 13-23, June 1996.
[8] J. Han and Y. Fu, “Discovery of Multiple-Level Association Rules from Large Databases,” Proc. 1995 Int'l Conf. Very Large Data Bases, pp. 420-431, Sept. 1995.
[9] M. Kamber, J. Han, and J.Y. Chiang, “Metarule-Guided Mining of Multi-Dimensional Association Rules Using Data Cubes,” Proc. Third Int'l Conf. Knowledge Discovery and Data Mining, pp. 207-210, Aug. 1997.
[10] M. Klemettinen, H. Mannila, P. Ronkainen, H. Toivonen, and A.I. Verkamo, “Finding Interesting Rules from Large Sets of Association Rules,” Proc. Third Int'l Conf. Information and Knowledge Management, N.R. Adam, K.B. Bhargava, and Y. Yesha, eds. pp. 401-407, 1994.
[11] H. Lu, J. Han, and L. Feng, “Stock Movement and$\big. n{\hbox{-}}{\rm{Dimensional}}\bigr.$Intertransaction Association Rules,” Proc. 1998 SIGMOD Workshop Research Issues on Data Mining and Knowledge Discovery, vol. 12, pp. 1-7, June 1998.
[12] B. Liu, W. Hsu, and Y. Ma, “Integrating Classification and Association Rule Mining,” Proc. 1998 Int'l Conf. Knowledge Discovery and Data Mining, pp. 80-86, Aug. 1998.
[13] L.V.S. Lakshmanan, R. Ng, J. Han, and A. Pang, “Optimization of Constrained Frequent Set Queries With 2-Variable Constraints,” Proc. 1999 ACM-SIGMOD Int'l Conf. Management of Data, pp. 157-168, June 1999.
[14] B. Lent, A. Swami, and J. Widom, “Clustering Association Rules,” Proc. 1997 Int'l Conf. Data Eng., pp. 220-231, Apr. 1997.
[15] R. Meo, G. Psaila, and S. Ceri, “A New SQL-Like Operator for Mining Association Rules,” Proc. 1996 Int'l Conf. Very Large Data Bases, pp. 122-133, Sept. 1996.
[16] H. Mannila, H. Toivonen, and A.I. Verkamo, “Discovery of Frequent Episodes in Event Sequences,” Data Mining and Knowledge Discovery, vol. 1, pp. 259-289, 1997.
[17] R.J. Miller and Y. Yang, “Association Rules Over Interval Data,” Proc. 1997 ACM-SIGMOD Int'l Conf. Management of Data, pp. 452-461, May 1997.
[18] R. Ng, L.V.S. Lakshmanan, J. Han, and A. Pang, “Exploratory Mining and Pruning Optimizations of Constrained Associations Rules,” Proc. 1998 ACM-SIGMOD Int'l Conf. Management of Data, pp. 13-24, June 1998.
[19] J.S. Park, M.S. Chen, and P.S. Yu, “An Effective Hash-Based Algorithm for Mining Association Rules,” Proc. 1995 ACM-SIGMOD Int'l Conf. Management of Data, pp. 175-186, May 1995.
[20] R. Srikant and R. Agrawal, “Mining Generalized Association Rules,” Proc. 1995 Int'l Conf. Very Large Data Bases, pp. 407-419, Sept. 1995.
[21] R. Srikant and R. Agrawal, “Mining Quantitative Association Rules in Large Relational Tables,” Proc. 1996 ACM-SIGMOD Int'l Conf. Management of Data, pp. 1-12, June 1996.
[22] C. Silverstein, S. Brin, R. Motwani, and J. Ullman, “Scalable Techniques for Mining Causal Structures,” Proc. 1998 Int'l Conf. Very Large Data Bases, pp. 594-605, Aug. 1998.
[23] A. Savasere, E. Omiecinski, and S. Navathe, “An Efficient Algorithm for Mining Association Rules in Large Databases,” Proc. 1995 Int'l Conf. Very Large Data Bases, pp. 432-443, Sept. 1995.
[24] R. Srikant, Q. Vu, and R. Agrawal, “Mining Association Rules with Item Constraints,” Proc. Third Int'l Conf. Knowledge Discovery and Data Mining (KDD '97), pp. 67-73, Aug. 1997.
[25] H. Toivonen, “Sampling Large Databases for Association Rules,” Proc. 1996 Int'l Conf. Very Large Data Bases, pp. 134-145, Sept. 1996.

Index Terms:
Data mining, association rules, temporal pattern discovery
Citation:
Anthony K.H. Tung, Hongjun Lu, Jiawei Han, Ling Feng, "Efficient Mining of Intertransaction Association Rules," IEEE Transactions on Knowledge and Data Engineering, vol. 15, no. 1, pp. 43-56, Jan.-Feb. 2003, doi:10.1109/TKDE.2003.1161581
Usage of this product signifies your acceptance of the Terms of Use.