Tree structures for mining association rules

Data Mining and Knowledge Discovery

Volumn 8, Issue 1, 2004, Pages 25-51

  Coenen, Frans ^a   Goulbourne, Graham ^a   Leng, Paul ^a  

^a UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

Association rules; Set enumeration tree

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA MINING; DATABASE SYSTEMS; PROBLEM SOLVING; SET THEORY; TREES (MATHEMATICS);

ASSOCIATION RULES; KNOWLEDGE DISCOVERY IN DATABASES (KDD); SET-ENUMERATION TREE;

KNOWLEDGE ENGINEERING;

EID: 3543076364     PISSN: 13845810     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:DAMI.0000005257.93780.3b     Document Type: Article

References (14)

1. Agrawal, R., Imielinski, T., and Swami, A. 1993. Mining association rules between sets of items in large databases. In Proc. ACM SIGMOD-93, pp. 207-216.
2. Agrawal, R. and Srikant, R. 1994. Fast algorithms for mining association rules. In Proc. 20th VLDB Conference, Santiago, pp. 487-499.
3. Bayardo, R.J. 1998. Efficiently mining long patterns from databases. In Proc. ACM-SIGMOD Int Conf on Management of Data, pp. 85-93.
4. Bayardo, R.J., Agrawal, R., and Gunopolos, D. 1999. Constraint-based rule mining in large, dense databases. In Proc. 15th Int Conf on Data Engineering.
5. Brin, S., Motwani, R., Ullman, J.D., and Tsur, S. 1997. Dynamic itemset counting and implication rules for market basket data. In Proc. ACM SIGMOD Conference, pp. 255-264.
6. Fayyad, U., Piatetsky-Shapiro, G., and Smythe, P. 1996. Knowledge discovery and data mining: Towards a unifying framework. In Proceedings of the Second International Conference on Data Mining and Knowledge Discovery, AAAI Press, pp. 82-95.
7. Goulbourne, G., Coenen, F., and Leng, P. 2000. Algorithms for computing association rules using a partial-support tree. J. Knowledge-Based Systems, 13:141-149.
8. Han, J., Pei, J., and Yin, Y. 2000. Mining frequent patterns without candidate generation. In Proc. ACM SIGMOD 2000 Conference, pp. 1-12.
9. Houtsma, M. and Swami, A. 1993. Set-oriented mining of association rules. Research Report RJ 9567, IBM Almaden Research Centre, San Jose.
10. Mannila, H., Toivonen, H., and Verkamo, A.I. 1994. Efficient algorithms for discovering association rules. In Proc. AAAI Workshop on Knowledge Discovery in Databases, U.M. Fayyad and R. Uthurusamy (Eds.), Seattle, pp. 181-192.
11. Rymon, R. 1992. Search through systematic set enumeration. In Proc. 3rd Int'l Conf. on Principles of Knowledge Represenation and Reasoning, pp. 539-550.
12. Savasere, A., Omiecinski, E., and Navathe, S. 1995. An efficient algorithm for mining association rules in large databases. In Proc. 21st VLDB Conference, Zurich, pp. 432-444.
13. Toivonen, H. 1996. Sampling large databases for association rules. In Proc. 22nd VLDB Conference, Bombay, pp. 134-145.
14. Zaki, M.J., Parthasarathy, S., Ogihara, M., and Li, W. 1997. New algorithms for fast discovery of association rules. Technical report 651, University of Rochester, Computer Science Department, New York.