Considering main memory in mining association rules

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1676, Issue , 1999, Pages 209-218

  Xiao, Yongqiao ^a   Dunham, Margaret H ^a  

^a Southern Methodist University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA WAREHOUSES;

CPU TIME; DIFFERENT SIZES; ITEM SETS; LARGE ITEMSET; MAIN MEMORY; MINING ASSOCIATIONS; REDUNDANT COMPUTATION; SAMPLING DATA;

WAREHOUSES;

EID: 84958045398     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48298-9_23     Document Type: Conference Paper

References (12)

1. Rakesh Agrawal, Tomasz Imielinski, and Arun N. Swami. Mining association rules between sets of items in large databases. In Peter Buneman and Sushil Jajo- dia, editors, Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, pages 207-216, Washington, D.C., 26-28 May 1993.
2. Rakesh Agrawal, Heikki Mannila, Ramakrishnan Srikant, Hannu Toivonen, and A. Inkeri Verkamo. Fast discovery of association rules. In Usama M. Fayyad, Gregory Piatetsky-Shapiro, Padhraic Smyth, and Ramasamy Uthurusamy, editors, Advances in Knowledge Discovery and Data Mining, pages 307-328, Menlo Park, CA, 1996. AAAI Press.
3. Rakesh Agrawal and John C. Shafer. Parallel mining of association rules. IEEE Transactions on Knowledge and Data Engineering, 8(6):962-969, December 1996.
4. Rakesh Agrawal and Ramakrishnan Srikant. Fast Algorithms for Mining Asso- ciation Rules in Large Databases. In Proceedings of the Twentieth International Conference on Very Large Databases, pages 487-499, Santiago, Chile, 1994.
5. Sergey Brin, Rajeev Motwanik, Jeffrey D. Ullman, and Shalom Tsur. Dynamic itemset counting and implication rules for market basket data. In Proceedings of the ACM SIGMOD Conference, pages 255-264, 1997.
6. Eui-Hong Han, George Karypis, and Vipin Kumar. Scalable parallel data mining for association rules. In Proceedings of the ACM SIGMOD Conference, pages 277-288, 1997.
7. Jun-Lin Lin and M. H. Dunham. Mining association rules: Anti-skew algorithms. In Proceedings of the 14th International Conference on Data Engineering, Olando, Florida, February 1998. IEEE Computer Society Press.
8. Heikki Mannila, Hannu Toivonen, and A. Inkeri Verkamo. Efficient algorithms for discovering association rules. In Usama M. Fayyad and Ramasamy Uthurusamy, editors, AAAI Workshop on Knowledge Discovery in Databases (KDD-94), pages 181-192, July 1994.
9. Ashoka Savasere, Edward Omiecinski, and Shamkant B. Navathe. An efficient algorithm for mining association rules in large databases. In Proceedings of the 21nd International Conference on Very Large Databases, pages 432-444, Zurich, Swizerland, 1995.
10. Takahiko Shintani and Masaru Kitsuregawa. Hash based parallel algorithms for mining association rules. In Proceedings of PDIS, 1996.
11. Hannu Toivonen. Sampling large databases for association rules. In Proceedings of the 22nd International Conference on Very Large Databases, pages 134-145, Mumbai, India, 1996.
12. Yongqiao Xiao and Margaret H Dunham. Considering main memory in mining association rules. In Technical Report-99-CSE-4, Department of Computer Science, Southern Methodist University, 1999.