Beyond market baskets: Generalizing association rules to dependence rules

Data Mining and Knowledge Discovery

Volumn 2, Issue 1, 1998, Pages 39-68

  Silverstein, Craig ^a  

^a Stanford University   (United States)

Author keywords

Association rules; Closure properties; Data mining; Dependence rules; Market basket; Text mining

Indexed keywords

EID: 11344285341     PISSN: 13845810     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1009713703947     Document Type: Article

References (12)

1. R. Agrawal, A. Arning, T. Bollinger, M. Mehta, J. Shafer, and R. Srikant. The Quest Data Mining System. In Proceedings of the Second International Conference on Knowledge Discovery in Databases and Data, August 1996.
2. R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In Proceedings of the ACM SIGMOD International Conference on the Management of Data, pages 207-216, May 1993.
3. R. Agrawal, T. Imielinski, and A. Swami. Database mining: a performance perspective. IEEE Transactions on Knowledge and Data Engineering, 5:914-925, 1993.
4. R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A.I. Verkamo. Fast Discovery of Association Rules. In Fayyad et al (Fayyad et al., 1996), pages 307-328, 1996.
5. R. Agrawal and R. Srikant. Fast algorithms for mining association rules in large databases. In Proceedings of the 20th International Conference on Very Large Data Bases, pages 487-499, September 1994.
6. A. Agresti. A survey of exact inference for contingency tables. Statistical Science, 7:131-177, 1992.
7. M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, and R. Tarjan. Dynamic perfect hashing: Upper and lower bounds. In Proceedings of the 18th IEEE Symposium on Foundations of Computer Science, pages 524-531, 1988.
8. R. Ewald. Keynote address. The 3rd International Conference on Information and Knowledge Management, 1994.
9. U.M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthrusamy. Advances in Knowledge Discovery and Data Mining. AAAI Press, Menlo Park, CA, 1996.
10. M. Fredman, J. Komlós, and E. Szemerédi. Storing a sparse table with O(1) worst case access time. Journal of the ACM, 31(3):538-544, 1984.
11. T. Fukuda, Y. Morimoto, S. Morishita, and T. Tokuyama. Mining Optimized Association Rules for Numeric Attributes. In Proceedings of the Fifteenth ACM Symposium on Principles of Database Systems, 1996.
12. T. Fukuda, Y. Morimoto, S. Morishita, and T. Tokuyama. Mining optimized association rules for numeric data. In Proceedings of the ACM SIGMOD International Conference on Management of Data, pages 13-24, 1996.