Privacy-aware market basket data set generation: A feasible approach for inverse frequent set mining

Proceedings of the 2005 SIAM International Conference on Data Mining, SDM 2005

Volumn , Issue , 2005, Pages 103-114

  Wu, Xintao ^a   Wu, Ying ^a   Wang, Yongge ^a   Li, Yingjiu ^b  

^a UNIVERSITY OF NORTH CAROLINA AT CHARLOTTE   (United States)

^b SINGAPORE MANAGEMENT UNIVERSITY   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

ASSOCIATION RULES; COMMERCE; COMPUTATIONAL COMPLEXITY; DATA MINING; GRAPH THEORY; INVERSE PROBLEMS; ITERATIVE METHODS; LINEAR PROGRAMMING; MAXIMUM LIKELIHOOD ESTIMATION; VIRTUAL REALITY;

DATA MINING COMMUNITY; FREQUENT ITEMSET MINING; FREQUENT SET MINING; ITERATIVE PROPORTIONAL FITTING; LINEAR PROGRAMMING TECHNIQUES; PRIVACY PRESERVING; SENSITIVE INFORMATIONS; SYNTHETIC DATASETS;

DATA PRIVACY;

EID: 63449084514     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972757.10     Document Type: Conference Paper

References (22)

1. R. Agrawal, T. Imilienski, and A. Swami. Mining association rules between sets of items in large databases. In Proceedings of the ACM SIGMOD International Conference on Management of Database, pages 207-216, 1993.
2. A. Agresti. Categorical data anlysis. Wiley, 1990.
3. M. Atallah, E. Bertino, A. Elmagarmid, M. Ibrahim, and V. Verykios. Disclosure limitation of sensitive rules. In Proceedings of the IEEE Knowledge and Data Engineering Exchange Workshop, pages 45-52, Nov 1999.
4. J. Badsberg. An environment for graphical models. Ph.D. Thesis, Aalborg University, Demark, 1995.
5. T. Calders. Computational complexity of itemset frequency satisfiability. In Proceedings of the 23nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database System, 2004.
6. E. Dasseni, V. Verykios, A. K. Elmagarmid, and E. Bertino. Hiding association rules by using confidence and support. In Proceedings of the 4th International Information Hiding Workshop, pages 369-383. Pittsburg, PA, April 2001.
7. A. Dobra and S. E. Fienberg. Bounds for cell entries in contingency tables given marginal totals and decomposable graphs. PNAS, 97(22):11885-11892, 2000.
8. A. Dobra and S. E. Fienberg. Bounds for cell entries in contingency tables induced by fixed marginal totals with applications to disclosure limitation. Statistical Journal of the United Nations ECE, 18:363-371, 2001.
9. A. Evfimievski, J. Gehrke, and R. Srikant. Limiting privacy breaches in privacy preserving data mining. In Proceedings of the 22nd Symposium on Principles of Database Systems, pages 211-222, 2003.
10. A. Evfimievski, R. Srikant, R. Agrawal, and J. Gehrke. Privacy preserving mining of association rules. In Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 217-228. Edmonton, Canada, July 2002.
11. KDDCUP 2000. http://www.ecn.purdue.edu/KDDCUP.
12. S. Lauritzen. Graphical Models. Oxford University Press, 1996.
13. T. Mielikainen. On inverse frequent set mining. In Proceedings of the 2nd Worksop on Privacy Preserving Data Mining, Nov 2003.
14. S. Oliveira and O. Zaiane. Protecting sensitive knowledge by data sanitization. In Proceedings of the 3rd IEEE International Conference on Data Mining, pages 211-218. Melbourne, Florida, Nov 2003.
15. G. Ramesh, W. Maniatty, and M. Zaki. Feasible itemset distributions in data mining: theory and application. In Proceedings of the 22nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pages 284-295. San Diego, CA, June 2003.
16. S. Rizvi and J. Haritsa. Maintaining data privacy in association rule mining. In Proceedings of the 28th International Conference on Very Large Data Bases, pages 682-693, August 2002.
17. Y. Saygin, V. Verykios, and C. Clifton. Using unknowns to prevent discovery of association rules. Sig-mod Record, 30(4):45-54, Dec 2001.
18. R. Tarjan. Decomposition by clique separators. Discrete Mathematics, 55:221-232, 1985.
19. J. Whittaker. Graphical Models in Applied Mathematical Multivariate Statistics. Wiley, 1990.
20. X. Wu, D. Barbará, and Y. Ye. Screening and interpreting multi-item associations based on log-linear modeling. In Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 276-285. Washinton D.C, August 2003.
21. X. Wu, Y. Wang, and Y. Zheng. Privacy preserving database application testing. In Proceedings of the ACM Workshop on Privacy in Electronic Society, pages 118-128, 2003.
22. Z. Zheng, R. Kohavi, and L. Mason. Real world performance of association rule algorithms. In Proceedings of the 7th ACM-SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 401-406. San Francisco, CA, August 2001.