A k -Anonymity Clustering Method for Effective Data Privacy Preservation
暂无分享,去创建一个
[1] Latanya Sweeney,et al. k-Anonymity: A Model for Protecting Privacy , 2002, Int. J. Uncertain. Fuzziness Knowl. Based Syst..
[2] Anil K. Jain,et al. Data clustering: a review , 1999, CSUR.
[3] Adam Meyerson,et al. On the complexity of optimal K-anonymity , 2004, PODS.
[4] J. MacQueen. Some methods for classification and analysis of multivariate observations , 1967 .
[5] Raymond Chi-Wing Wong,et al. Achieving k-Anonymity by Clustering in Attribute Hierarchical Structures , 2006, DaWaK.
[6] Yehuda Lindell,et al. Privacy Preserving Data Mining , 2002, Journal of Cryptology.
[7] Catherine Blake,et al. UCI Repository of machine learning databases , 1998 .
[8] Vipin Kumar,et al. Introduction to Data Mining , 2022, Data Mining and Machine Learning Applications.
[9] Gerald J. Lieberman,et al. Introduction to operation research. , 2001 .
[10] Sumit Sarkar,et al. A Tree-Based Data Perturbation Approach for Privacy-Preserving Data Mining , 2006, IEEE Transactions on Knowledge and Data Engineering.
[11] Rakesh Agrawal,et al. Privacy-preserving data mining , 2000, SIGMOD 2000.
[12] Elisa Bertino,et al. Efficient k -Anonymization Using Clustering Techniques , 2007, DASFAA.
[13] Charu C. Aggarwal,et al. On k-Anonymity and the Curse of Dimensionality , 2005, VLDB.
[14] Anil K. Jain,et al. Algorithms for Clustering Data , 1988 .
[15] Vipin Kumar,et al. Introduction to Data Mining, (First Edition) , 2005 .
[16] David J. DeWitt,et al. Incognito: efficient full-domain K-anonymity , 2005, SIGMOD '05.
[17] Josep Domingo-Ferrer,et al. Ordinal, Continuous and Heterogeneous k-Anonymity Through Microaggregation , 2005, Data Mining and Knowledge Discovery.