Discovering significant rules

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

Volumn 2006, Issue , 2006, Pages 434-443

  Webb, Geoffrey I ^a  

^a MONASH UNIVERSITY   (Australia)

Author keywords

Association rules; Rule discovery; Statistics

Indexed keywords

CORRELATION METHODS; DATA MINING; KNOWLEDGE ENGINEERING; PROBLEM SOLVING; STATISTICAL METHODS;

ASSOCIATION RULES; CONSTITUENT ITEMS; RULE DISCOVERY;

INFORMATION RETRIEVAL;

EID: 33749562096     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1150402.1150451     Document Type: Conference Paper

References (30)

1. R. Agrawal, T. Imielinski, and A. Swami. Mining associations between sets of items in massive databases. In Proc. 1993 ACM-SIGMOD Int. Conf. Management of Data, pages 207-216, Washington, DC, May 1993.
2. A. Agresti. A survey of exact inference for contingency tables. Statistical Science, 7(1):131-153, February 1992.
3. Y. Bastide, N. Pasquier, R. Taouil, G. Stumme, and L. Lakhal. Mining minimal non-redundant association rules using frequent closed itemsets. In First Int. Conf. Computational Logic - CL 2000, pages 972-986, Berlin, 2000. Springer-Verlag.
4. S. D. Bay and M. J. Pazzani. Detecting group differences: Mining contrast sets. Data Mining and Knowledge Discovery, 5(3):213-246, 2001.
5. R. J. Bayardo, Jr., R. Agrawal, and D. Gunopulos. Constraint-based rule mining in large, dense databases. Data Mining and Knowledge Discovery, 4(2/3):217-240, 2000.
6. Y. Benjamini and Y. Hochberg. Controlling the false discovery rate: A new and powerful approach to multiple testing. Journal of the Royal Statistical Society Series B, 57:289-300, 1995.
7. Y. Benjamini and D. Yekutieli. The control of the false discovery rate in multiple testing under dependency. The Annals of Statistics, 29(4):1165-1188, 2001.
8. J.-F. Boulicaut and A. Bykowski. Frequent closures as a concise representation for binary data mining. In Proc. Pacific-Asia Conf. Knowledge Discovery and Datamining (PAKDD-2000), pages 62-73, Kyoto, Japan, 2000.
9. T. Brijs, G. Swinnen, K. Vanhoof, and G. Wets. Using association rules for product assortment decisions: A case study. In Knowledge Discovery and Data Mining, pages 254-260, 1999.
10. S. Brin, R. Motwani, and C. Silverstein. Beyond market baskets: Generalizing association rules to correlations. In J. Peckham, editor, SIGMOD 1997, Proc. ACM SIGMOD Int. Conf. Management of Data, pages 265-276, New York, NY, May 1997. ACM Press.
11. T. Calders and B. Goethals. Mining all non-derivable frequent itemsets. In Proc. 6th European Conf. Principles and Practice of Knowledge Discovery in Databases, PKDD 2002, pages 74-85, Berlin, 2002. Springer.
12. W. DuMouchel and D. Pregibon. Empirical Bayes screening for multi-item associations. In KDD-2001: Proc. Seventh ACM SIGKDD Int. Conf. Knowledge Discovery and Data Mining, pages 76-76, New York, NY, August 2001. ACM Press.
13. S. Hettich and S. D. Bay. The UCI KDD archive. [http://kdd.ics.uci.edu] Irvine, CA: University of California, Department of Information and Computer Science., 2006.
14. B. Holland and C. M. D. Improved Bonferroni-type multiple testing procedures. Psychological Bulletin, 104(1):145-149, 1988.
15. S. Holm. A simple sequentially rejective multiple test procedure. Scandinavian Journal of Statistics, 6:65-70, 1979.
16. International Business Machines. IBM intelligent miner user's guide, version 1, release 1, 1996.
17. C. Jermaine. Finding the most interesting correlations in a database: How hard can it be? Information Systems, 30(1):21-46, 2005.
18. B. Liu, W. Hsu, and Y. Ma. Pruning and summarizing the discovered associations. In Proc. Fifth ACM SIGKDD Int. Conf. Knowledge Discovery and Data Mining (KDD-99), pages 125-134, New York, August 1999. AAAI.
19. H. Mannila and H. Toivonen. Multiple uses of frequent sets and condensed representations. In Proc. Int. Conf. Knowledge Discovery and Data Mining KDD'96, pages 189-194, Portland, USA, 1996.
20. N. Megiddo and R. Srikant. Discovering predictive association rules. In Proc. Fourth Int. Conf. Knowledge Discovery and Data Mining (KDD-98), pages 27-78, Menlo Park, US, 1998. AAAI Press.
21. D. J. Newman, S. Hettich, C. Blake, and C. J. Merz. UCI repository of machine learning databases. [Machine-readable data repository]. University of California, Department of Information and Computer Science, Irvine, CA., 2006.
22. G. Piatetsky-Shapiro. Discovery, analysis, and presentation of strong rules. In G. Piatetsky-Shapiro and J. Frawley, editors, Knowledge Discovery in Databases, pages 229-248. AAAI/MIT Press, Menlo Park, CA., 1991.
23. T. Scheffer. Finding association rules that trade support optimally against confidence. Intelligent Data Analysis, 9(4):381-395, 1995.
24. J. P. Shaffer. Multiple hypothesis testing. Ann. Rev. Psychology, 46:561-584, 1995.
25. G. I. Webb. Magnum Opus Version 1.3. Software, G. I. Webb & Associates, Melbourne, Aust., 2002.
26. G. I. Webb. Magnum Opus Version 3.1. Software, G. I. Webb & Associates, Melbourne, Aust., 2006.
27. G. I. Webb and S. Zhang. K-optimal rule discovery. Data Mining and Knowledge Discovery, 10(1):39-79, 2005.
28. M. J. Zaki. Mining non-redundant association rules. Data Mining and Knowledge Discovery, 9(3):223-248, 2004.
29. H. Zhang, B. Padmanabhan, and A. Tuzhilin. On the discovery of significant statistical quantitative rules. In Proc. Tenth Int. Conf. Knowledge Discovery and Data Mining (KDD-2004), pages 374-383, New York, NY, August 2004. ACM Press.
30. Z. Zheng, R. Kohavi, and L. Mason. Real world performance of association rule algorithms. In Proc. Seventh Int. Conf. Knowledge Discovery and Data Mining (KDD-2001), pages 401-406, New York, NY, August 2001. ACM.