Hiding Sensitive Association Rules by Elimination Selective Item among R.h.s Items for each Selective Transaction
暂无分享,去创建一个
[1] Tomasz Imielinski,et al. Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.
[2] Elisa Bertino,et al. A Survey of Quantification of Privacy Preserving Data Mining Algorithms , 2008, Privacy-Preserving Data Mining.
[3] Chris Clifton,et al. SECURITY AND PRIVACY IMPLICATIONS OF DATA MINING , 1996 .
[4] Chris Clifton,et al. Using unknowns to prevent discovery of association rules , 2001, SGMD.
[5] Vassilios S. Verykios,et al. Disclosure limitation of sensitive rules , 1999, Proceedings 1999 Workshop on Knowledge and Data Engineering Exchange (KDEX'99) (Cat. No.PR00453).
[6] Aris Gkoulalas-Divanis,et al. A Survey of Association Rule Hiding Methods for Privacy , 2008, Privacy-Preserving Data Mining.
[7] Rakesh Agrawal,et al. Privacy-preserving data mining , 2000, SIGMOD 2000.
[8] Elisa Bertino,et al. A Framework for Evaluating Privacy Preserving Data Mining Algorithms* , 2005, Data Mining and Knowledge Discovery.
[9] Amit Thakkar,et al. Association Rule Hiding by Heuristic Approach to Reduce Side Effects and Hide Multiple R. H. S. Items , 2012 .
[10] Elisa Bertino,et al. State-of-the-art in privacy preserving data mining , 2004, SGMD.
[11] A. Yao,et al. Fair exchange with a semi-trusted third party (extended abstract) , 1997, CCS '97.
[12] Vassilios S. Verykios,et al. An Experimental Study of Distortion-Based Techniques for Association Rule Hiding , 2004, DBSec.
[13] Elisa Bertino,et al. Hiding Association Rules by Using Confidence and Support , 2001, Information Hiding.
[14] Yehuda Lindell,et al. Privacy Preserving Data Mining , 2002, Journal of Cryptology.