Injector: Mining background knowledge for data anonymization

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2008, Pages 446-455

  Li, Tiancheng ^a   Li, Ninghui ^a  

^a Purdue University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASSOCIATIVE PROCESSING; DATA MINING; DECISION SUPPORT SYSTEMS; INFORMATION MANAGEMENT; JET PUMPS; MINING; OCCUPATIONAL RISKS; SEARCH ENGINES; TECHNOLOGY;

ANONYMIZATION; BACKGROUND KNOWLEDGE; DATA ANONYMIZATION; DATA ENGINEERING; DATA MINING TECHNIQUES; DATA PUBLISHING; INTERNATIONAL CONFERENCES; MINING RESULTS; NEGATIVE ASSOCIATION RULES; PRIVACY RISKS; SENSITIVE INFORMATIONS;

KNOWLEDGE BASED SYSTEMS;

EID: 52649086216     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2008.4497453     Document Type: Conference Paper

References (36)

1. G. T. Duncan and D. Lambert, "Disclosure-limited data dissemination," J. Am. Stat. Assoc., pp. 10-28, 1986.
2. D. Lambert, "Measures of disclosure risk and harm," J. Official Stat., vol. 9, pp. 313-331, 1993.
3. P. Samarati and L. Sweeney, "Protecting privacy when disclosing information: k-anonymity and its enforcement through generalization and suppression, Tech. Rep. SRI-CSL-98-04, 1998.
4. L. Sweeney, "Achieving k-anonymity privacy protection using generalization and suppression," Int. J. Uncertain. Fuzz., vol. 10, no. 6, pp. 571-588, 2002.
5. _, "k-anonymity: A model for protecting privacy," Int. J. Uncertain. Fuzz., vol. 10, no. 5, pp. 557-570, 2002.
6. A. Machanavajjhala, J. Gehrke, D. Kifer, and M. Venkitasubramaniam, "l-diversity: Privacy beyond k-anonymity." in ICDE, 2006, p. 24.
7. R. C.-W. Wong, J. Li, A. W.-C. Fu, and K. Wang, "(α, k)-anonymity: an enhanced k-anonymity model for privacy preserving data publishing," in KDD, 2006, pp. 754-759.
8. X. Xiao and Y. Tao, "Personalized privacy preservation," in SIGMOD, 2006, pp. 229-240.
9. _, "Anatomy: simple and effective privacy preservation," in VLDB, 2006, pp. 139-150.
10. N. Koudas, D. Srivastava, T. Yu, and Q. Zhang, "Aggregate query answering on anonymized tables," in ICDE, 2007, pp. 116-125.
11. A. Savasere, E. Omiecinski, and S. B. Navathe, "Mining for strong negative associations in a large database of customer transactions," in ICDE, 1998, pp. 494-502.
12. C. M. Kuok, A. Fu, and M. H. Wong, "Mining fuzzy association rules in databases," SIGMOD Record, pp. 209-215.
13. R. Agrawal and R. Srikant, "Fast algorithms for mining association rules," in VLDB, 1994, pp. 487-499.
14. J. Han, J. Pei, and Y. Yin, "Mining frequent patterns without candidate generation," in SIGMOD, 2000, pp. 1-12.
15. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 2nd ed. The MIT Press, 2001.
16. S. Brin, R. Motwani, J. D. Ullman, and S. Tsur, "Dynamic itemset counting and implication rules for market basket data," in SIGMOD, 1997, pp. 255-264.
17. N. Li, T. Li, and S. Venkatasubramanian, "t-closeness: Privacy beyond k-anonymity and l-diversity," in ICDE, 2007, pp. 106-115.
18. D. J. Martin, D. Kifer, A. Machanavajjhala, J. Gehrke, and J. Y. Halpern, "Worst-case background knowledge for privacy-preserving data publishing," in ICDE, 2007, pp. 126-135.
19. P. Samarati, "Protecting respondent's privacy in microdata release," TKDE, vol. 13, no. 6, pp. 1010-1027, 2001.
20. V. S. Iyengar, "Transforming data to satisfy privacy constraints," in KDD, 2002, pp. 279-288.
21. R. J. Bayardo and R. Agrawal, "Data privacy through optimal k-anonymization," in ICDE, 2005, pp. 217-228.
22. K. LeFevre, D. DeWitt, and R. Ramakrishnan, "Incognito: Efficient full-domain k-anonymity," in SIGMOD, 2005, pp. 49-60.
23. C. Aggarwal, "On k-anonymity and the curse of dimensionality," in VLDB, 2005, pp. 901-909.
24. D. Kifer and J. Gehrke, "Injecting utility into anonymized datasets," in SIGMOD, 2006, pp. 217-228.
25. K. LeFevre, D. DeWitt, and R. Ramakrishnan, "Mondrian multidimensional k-anonymity," in ICDE, 2006, p. 25.
26. G. Aggrawal, T. Feder, K. Kenthapadi, S. Khuller, R. Panigrahy, D. Thomas, and A. Zhu, "Achieving anonymity via clustering," in PODS, 2006, pp. 153-162.
27. X. Yang and C. Li, "Secure xml publishing without information leakage in the presence of data inference," in VLDB, 2004, pp. 96-107.
28. L. V. S. Lakshmanan, R. T. Ng, and G. Ramesh, "To do or not to do: the dilemma of disclosing anonymized data," in SIGMOD, 2005, pp. 61-72.
29. R. Agrawal, T. Imielinski, and A. N. Swami, "Mining association rules between sets of items in large databases," in SIGMOD, 1993, pp. 207-216.
30. R. Srikant and R. Agrawal, "Mining generalized association rules," in VLDB, 1995, pp. 407-419.
31. J. Han and Y. Fu, "Discovery of multiple-level association rules from large databases," in VLDB, 1995, pp. 420-431.
32. R. Srikant and R. Agrawal, "Mining quantitative association rules in large relational tables," in SIGMOD, 1996, pp. 1-12.
33. R. J. Miller and Y. Yang, "Association rules over interval data," in SIGMOD, 1997, pp. 452-461.
34. R. Rastogi and K. Shim, "Mining optimized association rules with categorical and numeric attributes," in ICDE, 1998, pp. 503-512.
35. S. Brin, R. Motwani, and C. Silverstein, "Beyond market baskets: Generalizing association rules to correlations," in SIGMOD, 1997, pp. 265-276.
36. P.-N. Tan, V. Kumar, and J. Srivastava, "Selecting the right objective measure for association analysis," Inf. Syst., vol. 29, no. 4, pp. 293-313, 2004.