Two new techniques for hiding sensitive itemsets and their empirical evaluation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4081 LNCS, Issue , 2006, Pages 302-311

  HajYasien, Ahmed ^a   Estivill Castro, Vladimir ^a  

^a GRIFFITH UNIVERSITY   (Australia)

Author keywords

Association rules; Data sanitization; Privacy preserving data mining; Sanitizing algorithms; Sensitive itemsets

Indexed keywords

ALGORITHMS; ASSOCIATIVE PROCESSING; DATA MINING; ENGINEERING RESEARCH; OPTIMIZATION;

ASSOCIATION RULE DOMAIN; DATA SANITIZATION; PRIVACY PRESERVING DATA MINING; SANITIZING ALGORITHMS; SENSITIVE ITEMSETS;

DATA PRIVACY;

EID: 33751363543     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11823728_29     Document Type: Conference Paper

References (15)

1. Frequent itemset mining dataset repository. http://fimi.cs.helsinki.fi/ data/.
2. R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In Proc. of the ACM SIGMOD Conference on Management of Data, pages 207-216, Washington D.C., USA, May 1993.
3. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Jorge B. Bocca, Matthias Jarke, and Carlo Zaniolo, editors, Proc. 20th Int. Conf. Very Large Data Bases, VLDB, pages 487-499. Morgan Kaufmann, December 1994.
4. M. Atallah, E. Bertino, A. Elmagarmid, M. Ibrahim, and V. Verykios. Disclosure limitation of sensitive rules. In Proc. of 1999 IEEE Knowledge and Data Engineering Exchange Workshop (KDEX'99), pages 45-52, Chicago, IL., November 1999.
5. T. Brijs, G. Swinnen, K. Vanhoof, and G. Wets. Using association rules for product assortment decisions: A case study. In Knowledge Discovery and Data Mining, pages 254-260, 1999.
6. C. Clifton, M. Kantarcioglu, and J. Vaidya. Defining privacy for data mining. In Proc. of the National Science Foundation Workshop on Next Generation Data Mining, pages 126-133, Baltimore, MD, USA, November 2002.
7. E. Dasseni, V. S. Verykios, A. K. Elmagarmid, and E. Bertino. Hiding association rules by using confidence and support. In Proc. of the 4th Information Hiding Workshop, pages 369-383, Pittsburg,PA, April 2001.
8. D. Edgar. Data sanitization techniques. White Papers, 2004.
9. A. HajYasien, V. Estivill-castro, and R. Topor. Sanitization of databases for refined privacy trade-offs. In Proc. of the IEEE International Conference on Intelligence and Security Informatics (ISI 2006), San Diego, USA, May 2006. Springer LNCS.
10. J. Han and M. Kamber. Data mining:Concepts and Techniques. 2001.
11. J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In Weidong Chen, Jeffrey Naughton, and Philip A. Bernstein, editors, ACM SIGMOD Intl. Conference on Management of Data, pages 1-12, Dallas, May 2000. ACM Press.
12. S. R. M. Oliveira and O. R. Zaiane. Privacy preserving frequent itemset mining. In Proc. of the IEEE ICDM Workshop on Privacy, Security, and Data Mining, pages 43-54, Maebashi City, Japan, December 2002.
13. S. R. M. Oliveira and O. R. Zaiane. Algorithms for balancing privacy and knowledge discovery in association rule mining. In Proc. of the 7th International Database Engineering and Applications Symposium, pages 54-63, China, July 2003.
14. S.R.M. Oliveira, O.R. Zaiane, and Y. Saygin. Secure association rule sharing. In Proc. of the 8th PAKDD Conference, pages 74-85, Sydney, Australia, May 2004. Springer Verlag Lecture Notes in Artificial Intelligence 3056.
15. Y. Saygin, V. S. Verykios, and C. Clifton. Using unknowns to prevent discovery of association rules. SIGMOD Record, 30(4):45-54, December 2001.