A new two-phase sampling based algorithm for discovering association rules

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

Volumn , Issue , 2002, Pages 462-468

  Chen, Bin ^a   Haas, Peter ^b   Scheuermann, Peter ^c  

^a EXELIXIS INC   (United States)

^b IBM ALMADEN RESEARCH CENTER   (United States)

^c Northwestern University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; DATA MINING; DATABASE SYSTEMS; SAMPLING; STATISTICAL METHODS;

ASSOCIATION RULES; TWO PHASE SAMPLING;

ALGORITHMS;

EID: 0242625264     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/775107.775114     Document Type: Conference Paper

References (22)

1. S. Acharya, P.B. Gibbons, and V. Poosala. Congressional samples for approximate answering of group-by queries. In Proc. 2000 ACM SIGMOD, 2000.
2. R.C. Agarwal, C.C. Aggarwal, and V.V.V. Prasad. Depth first generation of long patterns. In Proc. Sixth ACM SIGKDD, 2000.
3. R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In Proc. 1993 ACM SIGMOD, 1993.
4. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proc. 20th VLDB, 1994.
5. R.J. Bayardo. Efficiently mining large patterns from databases. In Proc. 1998 ACM SIGMOD, 1998.
6. V. Barnett and T. Lewis. Outliers in Statistical Data. John Wiley & Sons, New York 1994.
7. S. Brin, R. Motwani, J. Ullman, and S. Tsur. Dynamic itemset counting and implication rules for market basket data. In Proc. 1997 ACM SIGMOD, 1997.
8. S. Choudhuri, M. Datar, R. Motwani, V. Narasayya. Overcoming limitations of sampling for aggregation queries. In Proc. 17th ICDE, 2001.
9. J. Ernvall and O. Nevalainen. An algorithm for unbiased random sampling. Comput. J., 25:45-47, 1982
10. P. Gibbons. Distinct sampling for highly-accurate answers to distinct values queries and event reports. In Proc. VLDB Conference., 2001.
11. P.J. Haas. Techniques for Online Exploration of Large Object-Relational Datasets. In Proc. 11th Intl. Conf. Scientific and Statistical Database Management, IEEE Press pages 4-12. 1999.
12. Lisa Hellerstein. Proof of the NP-completeness of FAST. Private Correspondence 2000.
13. C. Hidber. Online association rule mining. In Proc. ACM SIGMOD, 1999.
14. Jiawei Han, Jian Pei, and Yiwen Yin. Mining frequent patterns without candidate generation. In Proc. ACM SIGMOD, 2000.
15. P.J. Huber. Robust Statistics. Wiley, New York 1981.
16. G.H. John and P. Langley. Static versus dynamic sampling for data mining. In Proc. Second Intl. Conf. Knowledge Discovery and Data Mining, AAAI Press pages 367-370 1996.
17. J. Kivinen and H. Mannila. The power of sampling in knowledge discovery. In Proc. Thirteenth ACM SIGACT-SIGMOD-SIGART Symp. Principles of Database Sys., ACM Press pages 77-85 1994.
18. R.G. Miller. Beyond ANOVA: Basics of Applied Statistics. Wiley, New York 1986.
19. F. Olken. Random Sampling from Databases. Ph.D. Dissertation, University of California, Berkeley, CA, 1993. Available as Tech. Report LBL-32883, Lawrence Berkeley Laboratories, Berkeley, CA.
20. H. Toivonen. Sampling large databases for association rules. In Proc. 22nd VLDB, 1996.
21. R. Winter and K. Auerbach. The big time: 1998 Winter VLDB survey. Database Programming Design, August 1998
22. M.J. Zaki, S.Parthasarathy, W. Lin, and M. Ogihara. Evaluation of sampling for data mining of association rules. Technical Report 617, University of Rochester, Rochester, NY 1996.