This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A New Approach to Online Generation of Association Rules
July/August 2001 (vol. 13 no. 4)
pp. 527-540

Abstract—We discuss the problem of online mining of association rules in a large database of sales transactions. The online mining is performed by preprocessing the data effectively in order to make it suitable for repeated online queries. We store the preprocessed data in such a way that online processing may be done by applying a graph theoretic search algorithm whose complexity is proportional to the size of the output. The result is an online algorithm which is independent of the size of the transactional data and the size of the preprocessed data. The algorithm is almost instantaneous in the size of the output. The algorithm also supports techniques for quickly discovering association rules from large itemsets. The algorithm is capable of finding rules with specific items in the antecedent or consequent. These association rules are presented in a compact form, eliminating redundancy. The use of nonredundant association rules helps significantly in the reduction of irrelevant noise in the data mining process.

[1] C.C. Aggarwal, Z. Sun, and P.S. Yu, “Online Generation of Profile Association Rules,”Proc. KDD Conf., 1998.
[2] 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.
[3] 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.
[4] R. Agrawal and R. Srikant, “Mining Sequential Patterns,” Proc. 1995 Int'l Conf. Data Eng., pp. 3-14, Mar. 1995.
[5] S. Agrawal, R. Agrawal, P.M. Deshpande, A. Gupta, J.F. Naughton, R. Ramakrishnan, and S. Sarawagi, "On the Computation of Multidimensional Aggregates," Proc. 22nd Int'l Conf. Very Large Databases, pp. 506-521,Mumbai (Bombay), India, Sept. 1996.
[6] M.S. Chen, J. Han, and P.S. Yu, “Data Mining: An Overview from Database Perspective,” IBM Research Report RC 20556,
[7] C. Dyreson, “Information Retreival from an Incomplete Data Cube,” Proc. 22nd Int'l Conf. Very Large Databases, pp. 532-543, 1996.
[8] A. Gupta, V. Harinarayan, and D. Quass, "Aggregate-Query Processing in Data Warehousing Environments," Proc. Eighth Int'l Conf. Very Large Databases (VLDB), pp. 358-369,Zurich, Switzerland, Sept. 1995.
[9] 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.
[10] V. Harinarayan, A. Rajaraman, and J. D. Ullman, “Implementing Data Cubes Efficiently,” Proc. ACM SIGMOD, pp. 205-216, June 1996
[11] M. Houtsma and A. Swami, “Set-Oriented Mining of Association Rules in Relational Databases,” 11th Int'l Conf. Data Eng., 1995.
[12] L. Kaufman and P.J. Rousseeuw, Finding Groups in Data–An Introduction to Cluster Analysis. Wiley, 1990.
[13] 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.
[14] B. Lent, A. Swami, and J. Widom, “Clustering Association Rules,” Proc. 1997 Int'l Conf. Data Eng., pp. 220-231, Apr. 1997.
[15] H. Mannila, H. Toivonen, and A.I. Verkamo, “Efficient Algorithms for Discovering Association Rules,” Proc. AAAI Workshop Knowledge Discovery in Databases, pp. 181-192, July 1994.
[16] R.T. Ng and J. Han, "Efficient and Effective Clustering Methods for Spatial Data Mining," Proc. 20th Int'l Conf. Very Large Databases, Morgan Kaufmann, 1994, pp. 144-155.
[17] 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.
[18] G. Piatetsky-Shapiro, “Discovery, Analysis and Presentation of Strong Rules,” Knowledge Discovery in Databases, 1991.
[19] 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.
[20] A. Shukla, P.M. Deshpande, J.F. Naughton, and K. Ramasamy, "Storage Estimation for Multidimensional Aggregates in the Presence of Hierarchies," Proc. 22nd Int'l Conf. Very Large Databases, pp. 522-531,Mumbai (Bombay), India, Sept. 1996.
[21] R. Srikant and R. Agrawal, “Mining Generalized Association Rules,” Proc. 1995 Int'l Conf. Very Large Data Bases, pp. 407-419, Sept. 1995.
[22] 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.
[23] H. Toivonen, “Sampling Large Databases for Association Rules,” Proc. 1996 Int'l Conf. Very Large Data Bases, pp. 134-145, Sept. 1996.
[24] W. Ziarko, “The Discovery, Analysis, and Representation of Data Dependencies in Databases,” Knowledge Discovery in Databases, 1991.
[25] C.C Aggarwal and P.S. Yu, “Online Generation of Association Rules,” ICDE Conf., 1998.

Index Terms:
OLAP, association rules, data mining, knowledge discovery.
Citation:
Charu C. Aggarwal, Philip S. Yu, "A New Approach to Online Generation of Association Rules," IEEE Transactions on Knowledge and Data Engineering, vol. 13, no. 4, pp. 527-540, July-Aug. 2001, doi:10.1109/69.940730
Usage of this product signifies your acceptance of the Terms of Use.