This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Itemset Trees for Targeted Association Querying
November/December 2003 (vol. 15 no. 6)
pp. 1522-1534

Abstract—Association mining techniques search for groups of frequently co-occurring items in a market-basket type of data and turn these groups into business-oriented rules. Previous research has focused predominantly on how to obtain exhaustive lists of such associations. However, users often prefer a quick response to targeted queries. For instance, they may want to learn about the buying habits of customers that frequently purchase cereals and fruits. To expedite the processing of such queries, we propose an approach that converts the market-basket database into an itemset tree. Experiments indicate that the targeted queries are answered in a time that is roughly linear in the number of market baskets, N. Also, the construction of the itemset tree has O(N) space and time requirements. Some useful theoretical properties are proven.

[1] R. Agarwal, C. Aggarwal, and V.V.V. Prassad, Depth-First Generation of Large Itemsets of Association Rules IBM Technical. Report RC21538, July 1999.
[2] R. Agarwal, C. Aggarwal, and V.V.V. Prassad, A Tree Projection Agorithm for Generation of Frequent Itemsets J. Parallel and Distributed Computing, 2000.
[3] 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.
[4] R. Agrawal, H. Manilla, R. Srikant, H. Toivonen, and A.I. Verkami, “Fast Discovery of Association Rules,” Advances in Knowledge Discovery and Data Mining, U.M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy, eds., pp. 307-328, 1996.
[5] R. Agrawal and J.C. Shafer, Parallel Mining of Association Rules: Design, Implementation, and Experience IEEE Trans. Knowledge and Data Eng., pp. 487-499, Dec. 1996.
[6] 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.
[7] C.C. Aggarwal and P.S. Yu, "A New Approach to Online Generation of Association Rules," IEEE Trans. Knowledge and Data Eng. , vol. 13, no. 4, 2001, pp. 527-540; .
[8] R. Bayardo and R. Agrawal, "Mining the Most Interesting Rules," Proc. Fifth ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining, ACM Press, New York, 1999.
[9] S. Brin, R. Motwani, J. Ullman, and S. Tsur, “Dynamic Itemset Counting and Implication Rules for Market Basket Data,” ACM SIGMOD Conf. Management of Data, May 1997.
[10] S. Brin and L. Page, Dynamic Data Mining: Exploring Rule Spaces by Sampling Manuscript available fromhttp://csdl.computer.org/comp/trans/tk/2001/ 04/k0527abs.htmhttp://www-db.stanford.edu ~sergey, 2003.
[11] M.S. Chen, J.S. Park, and P.S. Yu, "Data Mining for Path Traversal Patterns in a Web Environment," Proc. 16th Int'l Conf. Distributed Computing Systems (ICDCS 96), IEEE CS Press, 1996, pp. 385-392.
[12] D.W. Cheung, V.T. Ng, A.W. Fu, and W. Fu, Efficient Mining of Association Rules in Distributed Databases IEEE Trans. Knowledge and Data Eng., vol. 8, pp. 911-922, 1996.
[13] D.W. Cheung, J. Han, V. Ng, and C.Y. Wong, Maintenance of Discovered Association Rules in Large Databases Proc. Int'l Conf. Data Eng., 1996.
[14] D.H. Fisher, M. Pazzani, and P. Langley, Concept Formation: Knowledge and Experience in Unsupervised Learning. Morgan Kaufman, 1991.
[15] J.H. Gennari, P. Langley, and D.H. Fisher, "Models of Incremental Concept Formation," Artificial intelligence, vol. 40, nos. 1-3, pp. 11-59, 1989.
[16] A. Hafez, J.S. Deogun, and V.V. Raghavan, Item-Set Tree: A Data Structure for Data Mining Proc. Conf. Data Warehousing and KDD (DaWaK-99), pp. 183-192, 1999.
[17] J. Han, "Towards On-Line Analytical Mining in Large Databases," ACM SIGMOD Record, Mar. 1998, pp.97-107.
[18] J. Han and Y. Fu, “Mining Multiple-Level Association Rules in Large Databases,” IEEE Trans. Knowledge and Data Eng., pp. 798-805, 1999.
[19] J. Han, J. Pei, and Y. Yin, Mining Frequent Patterns without Candidate Generation Proc. ACM SIGMOD Conf. Management of Data (SIGMOD '00), pp. 1-12, 2000.
[20] C. Hidber, "Online Association Rule Mining," Proc. ACM SIGMOD Int'l Conf. Management of Data, ACM Press, New York, 1999, pp. 145-156.
[21] B. Liu, W. Hsu, and Y. Ma, Pruning and Summarizing the Discovered Associations Proc. Fifth ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining, pp. 125-134, 1999.
[22] B. Nag, P.M. Deshpande, and D. DeWitt, Using a Knowledge Cache for Interactive Discovery of Association Rules Proc. Fifth ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining, pp. 244-253, 1999.
[23] 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.
[24] V.V. Raghavan and A. Hafez, Dynamic Data Mining Proc. 13th Int'l Conf. Industrial and Eng. Applications of Artificial Intelligence, pp. 220-229, 2000.
[25] R. Srikant and R. Agrawal, “Mining Generalized Association Rules,” Proc. 1995 Int'l Conf. Very Large Data Bases, pp. 407-419, Sept. 1995.
[26] H. Toivonen, “Sampling Large Databases for Association Rules,” Proc. 1996 Int'l Conf. Very Large Data Bases, pp. 134-145, Sept. 1996.
[27] G. Widmer and M. Kubat, Learning in the Presence of Concept Drift and Hidden Contexts Machine Learning, vol. 23, pp. 69-101, 1996.
[28] Machine Learning, vol. 32, no. 2,special issue on concept drift and learning in context-sensitive domains, G. Widmer and M. Kubat, eds., 1998.
[29] M. Zaki, Generating Non-Redundant Association Rules Proc. Sixth ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining, pp. 34-43, 2000.

Index Terms:
Data mining, association mining, market baskets.
Citation:
Miroslav Kubat, Alaaeldin Hafez, Vijay V. Raghavan, Jayakrishna R. Lekkala, Wei Kian Chen, "Itemset Trees for Targeted Association Querying," IEEE Transactions on Knowledge and Data Engineering, vol. 15, no. 6, pp. 1522-1534, Nov.-Dec. 2003, doi:10.1109/TKDE.2003.1245290
Usage of this product signifies your acceptance of the Terms of Use.