Efficient techniques for document sanitization
暂无分享,去创建一个
Mukesh K. Mohania | Venkatesan T. Chakaravarthy | Prasan Roy | Himanshu Gupta | M. Mohania | H. Gupta | Prasan Roy
[1] Sunita Sarawagi,et al. Efficient Batch Top-k Search for Dictionary-based Entity Recognition , 2006, 22nd International Conference on Data Engineering (ICDE'06).
[2] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[3] Gökhan Tür,et al. Sanitization and Anonymization of Document Repositories , 2009, Database Technologies: Concepts, Methodologies, Tools, and Applications.
[4] David Zuckerman,et al. Electronic Colloquium on Computational Complexity, Report No. 100 (2005) Linear Degree Extractors and the Inapproximability of MAX CLIQUE and CHROMATIC NUMBER , 2005 .
[5] David Zuckerman. Linear Degree Extractors and the Inapproximability of Max Clique and Chromatic Number , 2007, Theory Comput..
[6] Luis Gravano,et al. Snowball: a prototype system for extracting relations from large text collections , 2001, SIGMOD '01.
[7] John F. Roddick,et al. Association mining , 2006, CSUR.
[8] Mukesh K. Mohania,et al. Efficiently linking text documents with relevant structured information , 2006, VLDB.
[9] A. Reisner,et al. De-identification algorithm for free-text nursing notes , 2005, Computers in Cardiology, 2005.
[10] L. Sweeney. Replacing personally-identifying information in medical records, the Scrub system. , 1996, Proceedings : a conference of the American Medical Informatics Association. AMIA Fall Symposium.
[11] David J. DeWitt,et al. Incognito: efficient full-domain K-anonymity , 2005, SIGMOD '05.
[12] Ramakrishnan Srikant,et al. Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.
[13] Latanya Sweeney,et al. k-Anonymity: A Model for Protecting Privacy , 2002, Int. J. Uncertain. Fuzziness Knowl. Based Syst..