Discovering frequent patterns in sensitive data
暂无分享,去创建一个
Adam D. Smith | Srivatsan Laxman | Abhradeep Thakurta | Raghav Bhaskar | Adam D. Smith | Abhradeep Thakurta | S. Laxman | Raghav Bhaskar
[1] Philip S. Yu,et al. A Condensation Approach to Privacy Preserving Data Mining , 2004, EDBT.
[2] Sofya Raskhodnikova,et al. Smooth sensitivity and sampling in private data analysis , 2007, STOC '07.
[3] Bart Goethals,et al. Survey on Frequent Pattern Mining , 2003 .
[4] Massimo Barbaro,et al. A Face Is Exposed for AOL Searcher No , 2006 .
[5] Mohammed J. Zaki,et al. Efficient algorithms for mining closed itemsets and their lattice structure , 2005, IEEE Transactions on Knowledge and Data Engineering.
[6] Latanya Sweeney,et al. k-Anonymity: A Model for Protecting Privacy , 2002, Int. J. Uncertain. Fuzziness Knowl. Based Syst..
[7] J. Davenport. Editor , 1960 .
[8] Adam D. Smith,et al. Composition attacks and auxiliary information in data privacy , 2008, KDD.
[9] Heikki Mannila,et al. Principles of Data Mining , 2001, Undergraduate Topics in Computer Science.
[10] ASHWIN MACHANAVAJJHALA,et al. L-diversity: privacy beyond k-anonymity , 2006, 22nd International Conference on Data Engineering (ICDE'06).
[11] Cynthia Dwork,et al. Calibrating Noise to Sensitivity in Private Data Analysis , 2006, TCC.
[12] Philip S. Yu,et al. Top 10 algorithms in data mining , 2007, Knowledge and Information Systems.
[13] Ashwin Machanavajjhala,et al. Privacy in Search Logs , 2009, ArXiv.
[14] Nina Mishra,et al. Releasing search queries and clicks privately , 2009, WWW '09.
[15] Kunal Talwar,et al. Mechanism Design via Differential Privacy , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[16] Ashwin Machanavajjhala,et al. l-Diversity: Privacy Beyond k-Anonymity , 2006, ICDE.
[17] Tomasz Imielinski,et al. Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.
[18] Geoffrey I. Webb,et al. Supervised Descriptive Rule Discovery: A Unifying Survey of Contrast Set, Emerging Pattern and Subgroup Mining , 2009, J. Mach. Learn. Res..
[19] Petra Perner,et al. Data Mining - Concepts and Techniques , 2002, Künstliche Intell..
[20] Vitaly Shmatikov,et al. De-anonymizing Social Networks , 2009, 2009 30th IEEE Symposium on Security and Privacy.
[21] Jayant R. Haritsa,et al. A Framework for High-Accuracy Privacy-Preserving Mining , 2005, ICDE.
[22] Jinyan Li,et al. Efficient mining of emerging patterns: discovering trends and differences , 1999, KDD '99.
[23] Simon Parsons,et al. Principles of Data Mining by David J. Hand, Heikki Mannila and Padhraic Smyth, MIT Press, 546 pp., £34.50, ISBN 0-262-08290-X , 2004, The Knowledge Engineering Review.
[24] Ramakrishnan Srikant,et al. Mining sequential patterns , 1995, Proceedings of the Eleventh International Conference on Data Engineering.
[25] David Chou. Information Discovery on Electronic Health Records , 2010 .
[26] Takashi Washio,et al. State of the art of graph-based data mining , 2003, SKDD.
[27] Taneli Mielikäinen,et al. On Inverse Frequent Set Mining , 2003 .
[28] Cynthia Dwork,et al. Differential Privacy , 2006, ICALP.
[29] Heikki Mannila,et al. Discovery of Frequent Episodes in Event Sequences , 1997, Data Mining and Knowledge Discovery.
[30] Frank McSherry,et al. Privacy integrated queries: an extensible platform for privacy-preserving data analysis , 2009, SIGMOD Conference.
[31] Aaron Roth,et al. A learning theory approach to noninteractive database privacy , 2011, JACM.
[32] Irit Dinur,et al. Revealing information while preserving privacy , 2003, PODS.
[33] G. Niklas Norén,et al. Temporal pattern discovery for trends and transient effects: its application to patient records , 2008, KDD.
[34] Alexandre V. Evfimievski,et al. Limiting privacy breaches in privacy preserving data mining , 2003, PODS.
[35] Jeffrey Scott Vitter,et al. Dynamic Generation of Discrete Random Variates , 1993, SODA '93.