Author:
Bonchi F.,Saygin Y.,Verykios V. S.,Atzori M.,Gkoulalas-Divanis A.,Kaya S. V.,Savaş E.
Publisher
Springer Berlin Heidelberg
Reference91 articles.
1. N.R. Adam and J.C. Wortmann. Security-control methods for statistical databases: A comparative study. ACM Computing Surveys, 21(4):515–556, 1989.
2. C.C. Aggarwal. On k-anonymity and the curse of dimensionality. In Proceedings of the 31th International Conference on Very Large Databases (VLDB’05), pp. 901–909, 2005.
3. D. Agrawal and C.C. Aggarwal. On the design and quantification of privacy preserving data mining algorithms. In Proceedings of the 20th Symposium on Principles of Database Systems (PODS’01), pp. 247–255, 2001.
4. R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In Proceedings of International Conference on Management of Data (SIGMOD’93), pp. 207–216, 1993.
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 Databases (VLDB’94), pp. 487–499, 1994.
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献