Fast vertical mining using diffsets

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2003, Pages 326-335

  Zaki, Mohammed J ^a   Gouda, Karam ^b  

^a Rensselaer Polytechnic Institute   (United States)

^b BENHA UNIVERSITY   (Egypt)

Author keywords

Association rule mining; Diffsets; Frequent itemsets

Indexed keywords

ASSOCIATION MINING; ASSOCIATION RULE MINING; CANDIDATE PATTERNS; DATA REPRESENTATIONS; DIFF-SETS; FREQUENCY COUNTING; FREQUENT ITEMSETS; FREQUENT PATTERNS; HORIZONTAL APPROACH; INTERMEDIATE RESULTS; INTERSECTION OPERATION; MINING ALGORITHMS; MINING METHODS;

ASSOCIATION RULES; ASSOCIATIVE PROCESSING; MINING;

DATA MINING;

EID: 6344277753     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/956750.956788     Document Type: Conference Paper

References (24)

1. R. Agrawal, et al. Fast discovery of association rules. In U. Fayyad and et al (eds.), Advances in Knowledge Discovery and Data Mining, AAAI Press, 1996.
2. Ramesh Agrawal, Charu Aggarwal, and V. V. V. Prasad. Depth First Generation of Long Patterns. In 7th Int'l Conference on Knowledge Discovery and Data Mining, August 2000.
3. Jay Ayres, J. E. Gehrke, Tomi Yiu, and Jason Flannick. Sequential pattern mining using bitmaps. In SIGKDD Int'l Conf. on Knowledge Discovery and Data Mining, July 2002.
4. R. J. Bayardo. Efficiently mining long patterns from databases. In ACM SIGMOD Conf. Management of Data, June 1998.
5. S. Brin, R. Motwani, J. Ullman, and S. Tsur. Dynamic itemset counting and implication rules for market basket data. In ACM SIGMOD Conf. Management of Data, May 1997.
6. D. Burdick, M. Calimlim, and J. Gehrke. MAFIA: a maximal frequent itemset algorithm for transactional databases. In Intl. Conf. on Data Engineering, April 2001.
7. B. Dunkel and N. Soparkar. Data organization and access for efficient data mining. In 15th IEEE Intl. Conf. on Data Engineering, March 1999.
8. K. Gouda and M. J. Zaki. Efficiently mining maximal frequent itemsets. In 1st IEEE Int'l Conf. on Data Mining, November 2001.
9. D. Gunopulos, H. Mannila, and S. Saluja. Discovering all the most specific sentences by randomized algorithms. In Intl. Conf. on Database Theory, January 1997.
10. J. Han and M. Kamber. Data Mining: Concepts and Techniuqes. Morgan Kaufmann Publishers, San Francisco, CA, 2001.
11. J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In ACM SIGMOD Conf. Management of Data, May 2000.
12. D.-I. Lin and Z. M. Kedem. Pincer-search: A new algorithm for discovering the maximum frequent set. In 6th Intl. Conf. Extending Database Technology, March 1998.
13. J.-L. Lin and M. H. Dunham. Mining association rules: Anti-skew algorithms. In 14th Intl. Conf. on Data Engineering, February 1998.
14. J. S. Park, M. Chen, and P. S. Yu. An effective hash based algorithm for mining association rules. In Intl. Conf. Management of Data, May 1995.
15. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Discovering frequent closed itemsets for association rules. In 7th Intl. Conf. on Database Theory, January 1999.
16. J. Pei, J. Han, and R. Mao. Closet: An efficient algorithm for mining frequent closed itemsets. In SIGMOD Int'l Workshop on Data Mining and Knowledge Discovery, May 2000.
17. S. Sarawagi, S. Thomas, and R. Agrawal. Integrating association rule mining with databases: alternatives and implications. In ACM Intl. Conf. Management of Data, June 1998.
18. A. Savasere, E. Omiecinski, and S. Navathe. An efficient algorithm for mining association rules in large databases. In 21st VLDB Conf., 1995.
19. J. Shafer, R. Agrawal, and M. Mehta. Sprint: A scalable parallel classifier for data mining. In 22nd VLDB Conference, March 1996.
20. P. Shenoy, et al. Turbo-charging vertical mining of large databases. In Intl. Conf. Management of Data, May 2000.
21. M. J. Zaki. Generating non-redundant association rules. In Int'l Conf. Knowledge Discovery and Data Mining, August 2000.
22. M. J. Zaki. Scalable algorithms for association mining. IEEE Transactions on Knowledge and Data Engineering, 12 (3):372-390, May-June 2000.
23. M. J. Zaki and C.-J. Hsiao. ChARM: An efficient algorithm for closed itemset mining. In 2nd SIAM Int'l Conf. on Data Mining, April 2002.
24. M. J. Zaki, S. Parthasarathy, M. Ogihara, and W. Li. New algorithms for fast discovery of association rules. In 3rd Intl. Conf. on Knowledge Discovery and Data Mining, August 1997.