Self-sufficient itemsets: An approach to screening potentially interesting associations between items

ACM Transactions on Knowledge Discovery from Data

Volumn 4, Issue 1, 2010, Pages

  Webb, Geoffrey I ^a  

^a MONASH UNIVERSITY   (Australia)

Author keywords

Association discovery; Association rules; Itemset discovery; Itemset screening; Statistical evaluation

Indexed keywords

ASSOCIATION DISCOVERIES; COMPUTATIONAL TECHNIQUE; DATA ANALYSTS; DISCOVERY ALGORITHM; ITEM SETS; ITEMSET; POST PROCESSING; STATISTICAL EVALUATION; STATISTICAL MEASURES; SUPERSETS;

ASSOCIATION RULES; ASSOCIATIVE PROCESSING;

FUNCTION EVALUATION;

EID: 77955631169     PISSN: 15564681     EISSN: 1556472X     Source Type: Journal    
DOI: 10.1145/1644873.1644876     Document Type: Article

References (39)

1. AGRAWAL, R., IMIELINSKI, T., AND SWAMI, A. 1993. Mining associations between sets of items in massive databases. In Proceedings of the ACM-SIGMOD International Conference on Management of Data. 207-216.
2. AGRESTI, A. 1992. A survey of exact inference for contingency tables. Statis. Sci. 7, 1, 131-153.
3. AGRESTI, A. 2002. Categorical Data Analysis. Wiley-Interscience, New York.
4. AUMANN, Y. AND LINDELL, Y. 1999. A statistical theory for quantitative association rules. In Proceedings of the 5th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'99). 261-270.
5. BASTIDE, Y., PASQUIER, N., TAOUIL, R., STUMME, G., AND LAKHAL, L. 2000. Mining minimal nonredundant association rules using frequent closed itemsets. In Proceedings of the 1st International Conference on Computational Logic (CL'00). Springer-Verlag, Berlin, 972-986.
6. BAYARDO, JR., R. J. AND AGRAWAL, R. 1999. Mining the most interesting rules. In Proceedings of the 5th ACMSIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'99). 145-154.
7. BAYARDO, JR., R. J., AGRAWAL, R., AND GUNOPULOS, D. 2000. Constraint-based rule mining in large, dense databases. Data Min. Knowl. Disc. 4, 2/3, 217-240.
8. BRIJS, T., SWINNEN, G., VANHOOF, K., ANDWETS, G. 1999. Using association rules for product assortment decisions: A case study. In Proceedings of the 5th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM Press, New York, NY, 254-260.
9. CALDERS, T. AND GOETHALS, B. 2002. Mining all non-derivable frequent itemsets. In Proceedings of the 6th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD'02). Springer, Berlin, 74-85.
10. CHAN, R., YANG, Q., AND SHEN, Y. D. 2003. Mining high utility itemsets. In Proceedings of the 3rd IEEE International Conference on Data Mining. 19-26.
11. CHENG, J., KE, Y., AND NG,W. 2006. Tolerance closed frequent itemsets. In Proceedings of the 6th International Conference on Data Mining. 139-148.
12. COOLEY, R., TAN, P.-N., AND SRIVASTAVA, J. 1999. Discovery of interesting usage patterns from Web data. In Proceedings of the International WEBKDD'99 Workshop. Springer, Berlin, 163-182.
13. DUMOUCHEL, W. 1999. Bayesian data mining in large frequency tables, with an application to the FDA spontaneous reporting system. Americ. Statis. 53, 3, 177-190.
14. DUMOUCHEL, W. AND PREGIBON, D. 2001. Empirical Bayes screening for multi-item associations. In Proceedings of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'01). ACM Press, New York, NY, 76-76
15. GOETHALS, B. 2007. NDI. Software. http://www.adrem.ua.ac.be/ goethals/software/.
16. HETTICH, S. AND BAY, S.D. 2006. The UCIKDDarchive. Department of Information and Computer Science. University of California, Irvine, CA. http://kdd.ics.uci.edu.
17. HOLM, S. 1979. A simple sequentially rejective multiple test procedure. Scandinavian J. Statis. 6, 65-70.
18. JAROSZEWICZ, S. AND SIMOVICI,D. A. 2004. Interestingness of frequent itemsets using Bayesian networks as background knowledge. In Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'04). R. Kohavi, J. Gehrke, and J. Ghosh, Eds. ACM Press, New York, NY, 178-186.
19. LIU, B., HSU, W., AND MA, Y. 2001. Identifying non-actionable association rules. In Proceedings of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'01). 329-334.
20. MALIK, H. H. AND KENDER, J. R. 2006. High quality, efficient hierarchical document clustering using closed interesting itemsets. In Proceedings of the 6th IEEE International Conference on Data Mining. IEEE, 991-996.
21. MEGIDDO, N. AND SRIKANT, R. 1998. Discovering predictive association rules. In Proceedings of the 4th International Conference on Knowledge Discovery and Data Mining (KDD'98). AAAI Press, Menlo Park, US, 27-78.
22. NEWMAN, D. J., HETTICH, S., BLAKE, C., AND MERZ, C. J. 2006. UCI repository of machine learning databases. [Machine-readable data repository]. Department of Information and Computer Science, University of California, Irvine, CA.
23. PEI, J., DONG, G., ZOU, W., AND HAN, J. 2002. On computing condensed frequent pattern bases. In Proceedings of the 2nd IEEE International Conference on Data Mining (ICDM'02). 378-385.
24. PIATETSKY-SHAPIRO, G. 1991. Discovery, analysis, and presentation of strong rules. In Knowledge Discovery in Databases, G. Piatetsky-Shapiro and J. Frawley, Eds. AAAI/MIT Press, Menlo Park, CA., 229-248.
25. SHAFFER, J. P. 1995. Multiple hypothesis testing. Annual Rev. Psych. 46, 561-584.
26. TABACHNICK, B. G. AND FIDELL, L. S. 2001. Using Multivariate Statistics. Allyn and Bacon, Boston, MA.
27. WEBB, G. I. 1995. OPUS: An efficient admissible algorithm for unordered search. J. Arti. Intell. Res. 3, 431-465.
28. WEBB, G. I. 2001. Discovering associations with numeric variables. In Proceedings of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'01). The ACM, New York, NY, 383-388.
29. WEBB, G. I. 2007. Discovering significant patterns. Mach. Learn. 68, 1, 1-33.
30. WEBB, G. I. 2009. Magnum Opus Version 4.3. Software, G. I. Webb & Associates, Melbourne, Aust.
31. WEBB, G. I. AND ZHANG, S. 2005. K-optimal rule discovery. Data Mining Knowl. Discov. 10, 1, 39-79.
32. WU, X., BARBAŔA, D., AND YE, Y. 2003. Screening and interpreting multi-item associations based on log-linear modeling. In Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 276-285.
33. XIN, D., HAN, J., YAN, X., AND CHENG, H. 2005. Mining compressed frequent-pattern sets. In Proceedings of the International Conference on Very Large Databases (VLDB'05). 709-720.
34. YAO, H. AND HAMILTON, H. J. 2006. Mining itemset utilities from transaction databases. Data Knowl. Engin. 59, 603-626.
35. ZAKI, M. J. 2000. Generating non-redundant association rules. In Proceedings of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'00). ACM, New York, NY, 34-43.
36. ZAKI, M. J. 2004. Mining non-redundant association rules. Data Mining Knowl. Discov. 9, 3, 223-248.
37. ZAKI, M. J. AND HSIAO, C. J. 2002. CHARM: An efficient algorithm for closed itemset mining. In Proceedings of the 2nd SIAM International Conference on Data Mining. 457-473.
38. ZHANG, H., PADMANABHAN, B., AND TUZHILIN, A. 2004. On the discovery of significant statistical quantitative rules. In Proceedings of the 10th International Conference on Knowledge Discovery and Data Mining (KDD'04). ACM Press, New York, NY, 374-383.
39. ZHENG, Z., KOHAVI, R., ANDMASON, L. 2001. Real world performance of association rule algorithms. In Proceedings of the 7th International Conference on Knowledge Discovery and Data Mining (KDD'01). ACM, New York, NY, 401-406.