This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Graph-Based Approach for Discovering Various Types of Association Rules
September/October 2001 (vol. 13 no. 5)
pp. 839-845

Abstract—Mining association rules is an important task for knowledge discovery. We can analyze past transaction data to discover customer behaviors such that the quality of business decision can be improved. Various types of association rules may exist in a large database of customer transactions. The strategy of mining association rules focuses on discovering large itemsets, which are groups of items which appear together in a sufficient number of transactions. In this paper, we propose a graph-based approach to generate various types of association rules from a large database of customer transactions. This approach scans the database once to construct an association graph and then traverses the graph to generate all large itemsets. Empirical evaluations show that our algorithms outperform other algorithms which need to make multiple passes over the database.

[1] Y. Aumann et al., “Borders: An Efficient Algorithm for Association Generation in Dynamic Databases,” J. Intelligent Information Systems, pp. 61-73, 1999.
[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.J. Bayardo, “Efficiently Mining Long Patterns From Databases,” ACM SIGMOD Conf. Management of Data, June 1998.
[4] C.L. Carter and H.J. Hamilton., “Efficient Attribute-Oriented Algorithms for Knowledge Discovery from Large Databases,” IEEE Trans. Knowledge and Data Eng., vol. 10, no. 2, pp. 193-208, Mar./Apr. 1998.
[5] R.J. Hilderman et al., “Data Mining in Large Databases Using Domain Generalization Graphs,” J. Intelligent Information Systems, pp. 195-234, 1999.
[6] J. Han and Y. Fu, “Mining Multiple-Level Association Rules in Large Databases,” IEEE Trans. Knowledge and Data Eng., pp. 798-805, 1999.
[7] M. Houtsma and A. Swami, “Set-Oriented Mining of Association Rules in Relational Databases,” 11th Int'l Conf. Data Eng., 1995.
[8] H. Mannila et al., “Efficient Algorithm for Discovering Association Rules,” Proc. AAAI Workshop Knowledge Discovery in Databases, pp. 181-192, 1994.
[9] 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.
[10] R. Srikant and R. Agrawal, “Mining Generalized Association Rules,” Proc. 1995 Int'l Conf. Very Large Data Bases, pp. 407-419, Sept. 1995.
[11] S.-J. Yen and A.L.P. Chen, “An Efficient Approach to Discovering Knowledge from Large Databases,” Fourth Int'l Conf. Parallel and Distributed Information Systems, Dec. 1996.

Index Terms:
Data mining, knowledge discovery, association rule, association pattern, graph-based approach.
Citation:
Show-Jane Yen, Arbee L.P. Chen, "A Graph-Based Approach for Discovering Various Types of Association Rules," IEEE Transactions on Knowledge and Data Engineering, vol. 13, no. 5, pp. 839-845, Sept.-Oct. 2001, doi:10.1109/69.956106
Usage of this product signifies your acceptance of the Terms of Use.