Database Reference
In-Depth Information
References
1. U.S. Dept. of Health and Human Services: Standards for privacy of individually identifiable
health information; Final Rule, 2002. Federal Register 45 CFR: Pt. 160 and 164.
2. National Institutes of Health: Final NIH statement on sharing research data, 2003. NOT-OD-
03-032.
3. O. Abul, M. Atzori, F. Bonchi, and F. Giannotti. Hiding sequences. In Proceedings of the 23rd
International Conference on Data Engineering Workshops (ICDEW), pages 147-156, 2007.
4. C. C. Aggarwal and P. S. Yu.
Privacy Preserving Data Mining: Models and Algorithms.
Springer-Verlag, 2008.
5. 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 Manage-
ment of Data, pages 207-216, 1993.
6. R. Agrawal and J. C. Shafer.
Parallel mining of association rules.
IEEE Transactions on
Knowledge and Data Engineering, 8(1):962-969, 1996.
7. 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), pages
487-499, 1994.
8. R. Agrawal and R. Srikant. Privacy preserving data mining. SIGMOD Record, 29(2):439-450,
2000.
9. A. Amiri.
Dare to share: Protecting sensitive knowledge with data sanitization.
Decision
Support Systems, 43(1):181-191, 2007.
10. M. Atallah, E. Bertino, A. Elmagarmid, M. Ibrahim, and V. S. Verykios. Disclosure limita-
tion of sensitive rules. In Proceedings of the 1999 IEEE Knowledge and Data Engineering
Exchange Workshop (KDEX), pages 45-52, 1999.
11. R. Bayardo. Efficiently mining long patterns from databases. Proceedings of the 1998 ACM
SIGMOD International Conference on Management of Data, 1998.
12. T. Calders. Computational complexity of itemset frequency satisfiability. In Proceedings
of the 23rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems
(PODS), pages 143-154, 2004.
13. T. Calders. The complexity of satisfying constraints on databases of transactions. Acta Infor-
matica, 44(7):591-624, 2007.
14. T. Calders. Itemset frequency satisfiability: Complexity and axiomatization. Theoretical Com-
puter Science, 394(1):84-111, 2008.
15. L. Chang and I. S. Moskowitz. Parsimonious downgrading and decision trees applied to the
inference problem. In Proceedings of the 1998 Workshop on New Security Paradigms (NSPW),
pages 82-89, 1998.
16. K. Chen and L. Liu. Privacy preserving data classification with rotation perturbation. In
Proceedings of the 5th IEEE International Conference on Data Mining, pages 589-592, 2005.
