Efficiently mining long patterns from databases

SIGMOD Record

Volumn 27, Issue 2, 1998, Pages 85-93

  Bayardo Jr , Roberto J ^a  

^a IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA REDUCTION; DATA STRUCTURES; DATABASE SYSTEMS; EMBEDDED SYSTEMS;

PATTERN-MINING ALGORITHMS;

DATA MINING;

EID: 0032091573     PISSN: 01635808     EISSN: None     Source Type: Journal    
DOI: 10.1145/276305.276313     Document Type: Article

References (16)

1. Agrawal, R.; Imielinski, T.; and Swami, A. 1993. Mining Association Rules between Sets of Items in Large Databases. In Proc. of the 1993 ACM-SIGMOD Conf. on the Management of Data, 207-216.
2. Agrawal, R.; Mannila, H.; Srikant, R.; Toivonen, H.; and Verkamo, A. I. 1996. Fast Discovery of Association Rules. In Advances in Knowledge Discovery and Data Mining, AAAI Press, 307-328.
3. Agrawal, R., and Srikant, R. 1994. Fast Algorithms for Mining Association Rules. IBM Research Report RJ9839, June 1994, IBM Almaden Research Center, San Jose, CA.
4. Agrawal, R. and Srikant, R. 1995. Mining Sequential Patterns. In Proc. of the 11th Int'l Conf. on Data Engineering, 3-14.
5. Bayardo, R. J. 1997. Brute-Force Mining of High-Confidence Classification Rules. In Proc. of the Third Int'l Conf. on Knowledge Discovery and Data Mining, 123-126.
6. Brin, S.; Motwani, R.; Ullman, J.; and Tsur, S. 1997. Dynamic Itemset Counting and Implication Rules for Market Basket Data. In Proc. of the 1997 SIGMOD Conf. on the Management of Data, 255-264.
7. Gunopulos, G.; Mannila, H.; and Saluja, S. 1997. Discovering All Most Specific Sentences by Randomized Algorithms. In Proc. of the 6th Int'l Conf. on Database Theory, 215-229.
8. Lin, D. and Kedern, Z. M. 1998. Pincer-Search: A New Algorithm for Discovering the Maximum Frequent Set. In Proc. of the Sixth European Conf. on Extending Database Technology, to appear.
9. Park, J. S.; Chen, M.-S.; and Yu, P. S. 1996. An Effective Hash Based Algorithm for Mining Association Rules. In Proc. of the 1995 SIGMOD Conf. on the Management of Data, 175-186.
10. Rymon, R. 1992. Search through Systematic Set Enumeration. In Proc. of Third Int'l Conf. on Principles of Knowledge Representation and Reasoning, 539-550.
11. Savasere, A.; Omiecinski, E.; and Navathe, S. 1995. An Efficient Algorithm for Mining Association Rules in Large Databases. In Proc. of the 21st Conf. on Very Large Data-Bases, 432-444.
12. Slagel, J. R.; Chang, C.-L.; and Lee, R. C. T. 1970. A New Algorithm for Generating Prime Implicants. IEEE Trans. on Computers, C-19(4):304-310.
13. Smythe, P. and Goodman, R. M. 1992. An Information Theoretic Approach to Rule Induction from Databases. IEEE Transactions on Knowledge and Data Engineering, 4(4):301-316.
14. Srikant, R. and Agrawal, R. 1996. Mining Sequential Patterns: Generalizations and Performance Improvements. In Proc. of the Fifth Int'l Conf. on Extending Database Technology, 3-17.
15. Srikant, R.; Vu, Q.; and Agrawal, R. 1997. Mining Association Rules with Item Constraints. In Proc. of the Third Int'l Conf. on Knowledge Discovery in Databases and Data Mining, 67-73.
16. Zaki, M. J.; Parthasarathy, S.; Ogihara, M.; and Li, W. 1997. New Algorithms for Fast Discovery of Association Rules. In Proc. of the Third Int'l Conf. on Knowledge Discovery in Databases and Data Mining, 283-286.