Beyond Market Baskets: Generalizing Association Rules to Dependence Rules
暂无分享,去创建一个
Rajeev Motwani | Craig Silverstein | Sergey Brin | R. Motwani | S. Brin | Craig Silverstein | Sergey Brin
[1] Friedhelm Meyer auf der Heide,et al. Dynamic perfect hashing: upper and lower bounds , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[2] Heikki Mannila,et al. Efficient Algorithms for Discovering Association Rules , 1994, KDD Workshop.
[3] Gregory Piatetsky-Shapiro,et al. Advances in Knowledge Discovery and Data Mining , 2004, Lecture Notes in Computer Science.
[4] Yasuhiko Morimoto,et al. Data mining using two-dimensional optimized association rules: scheme, algorithms, and visualization , 1996, SIGMOD '96.
[5] Jiawei Han,et al. Discovery of Multiple-Level Association Rules from Large Databases , 1995, VLDB.
[6] Tomasz Imielinski,et al. Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.
[7] Heikki Mannila,et al. Finding interesting rules from large sets of discovered association rules , 1994, CIKM '94.
[8] M.A.W. Houtsma,et al. Set-Oriented Mining for Association Rules , 1993, ICDE 1993.
[9] R. Srikant,et al. The Quest Data Mining , 1996 .
[10] A. Agresti. [A Survey of Exact Inference for Contingency Tables]: Rejoinder , 1992 .
[11] Jörg Rech,et al. Knowledge Discovery in Databases , 2001, Künstliche Intell..
[12] Hannu T. T. Toivonen,et al. Samplinglarge databases for finding association rules , 1996, VLDB 1996.
[13] William Frawley,et al. Knowledge Discovery in Databases , 1991 .
[14] W. H. Mac Williams. Keynote address , 2006, AIEE-IRE '51.
[15] Hannu Toivonen,et al. Sampling Large Databases for Association Rules , 1996, VLDB.
[16] Dimitrios Gunopulos,et al. Discovering All Most Specific Sentences by Randomized Algorithms , 1997, ICDT.
[17] K. Pearson. On the Criterion that a Given System of Deviations from the Probable in the Case of a Correlated System of Variables is Such that it Can be Reasonably Supposed to have Arisen from Random Sampling , 1900 .
[18] Ramakrishnan Srikant,et al. Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.
[19] G. C. Tiao,et al. Inference and Disputed Authorship: The Federalist , 1966 .
[20] Shamkant B. Navathe,et al. An Efficient Algorithm for Mining Association Rules in Large Databases , 1995, VLDB.
[21] Yasuhiko Morimoto,et al. Mining optimized association rules for numeric attributes , 1996, J. Comput. Syst. Sci..
[22] Ramakrishnan Srikant,et al. The Quest Data Mining System , 1996, KDD.
[23] János Komlós,et al. Storing a sparse table with O(1) worst case access time , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[24] Ramakrishnan Srikant,et al. Mining generalized association rules , 1995, Future Gener. Comput. Syst..
[25] Tomasz Imielinski,et al. Database Mining: A Performance Perspective , 1993, IEEE Trans. Knowl. Data Eng..
[26] S. Fienberg,et al. Inference and Disputed Authorship: The Federalist , 1966 .
[27] P. Laplace,et al. Oeuvres complètes de Laplace. Tome 7 / publiées sous les auspices de l'Académie des sciences, par MM. les secrétaires perpétuels , 1879 .
[28] Heikki Mannila,et al. Fast Discovery of Association Rules , 1996, Advances in Knowledge Discovery and Data Mining.
[29] Philip S. Yu,et al. An effective hash-based algorithm for mining association rules , 1995, SIGMOD '95.
[30] Bill Broyles. Notes , 1907, The Classical Review.
[31] Arun N. Swami,et al. Set-oriented mining for association rules in relational databases , 1995, Proceedings of the Eleventh International Conference on Data Engineering.