Author:
Fienberg Stephen E.,Slavkovic Aleksandra B.
Publisher
Springer Science and Business Media LLC
Subject
Computer Networks and Communications,Computer Science Applications,Information Systems
Reference63 articles.
1. Agrawal, R., Imielinski, T., and Swami, A. 1993. Mining association rules between sets of items in large databases. In Proceedings of the 1993 ACM SIGMOD Conference International Conference on Management of Data, Washington, DC, pp. 207–216.
2. Agrawal, R. and Srikant, R. 1994. Fast algorithms for mining association rules. In Proceedings of the 20th VLDB Conference, Santiago, Chile, pp. 487–489.
3. Agrawal, R. and Srikant, R. 2000. Privacy-preserving data mining. In Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, Dallas, pp. 439–450.
4. Agresti, A. 2002.Categorical Data Analysis, 2nd edition. New York: Wiley.
5. Anderson, B. and Moore, A. 1998. AD-trees for fast counting and for fast learning of association rules. Knowledge Discovery from Databases Conference, KDD, pp. 134–138.
Cited by
30 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献