A framework for condensation-based anonymization of string data
- 6 February 2008
- journal article
- Published by Springer Science and Business Media LLC in Data Mining and Knowledge Discovery
- Vol. 16 (3), 251-275
- https://doi.org/10.1007/s10618-008-0088-z
Abstract
No abstract availableThis publication has 16 references indexed in Scilit:
- Scalable Clustering Algorithms with Balancing ConstraintsData Mining and Knowledge Discovery, 2006
- Data Privacy through Optimal k-AnonymizationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- On Variable Constraints in Privacy Preserving Data MiningPublished by Society for Industrial & Applied Mathematics (SIAM) ,2005
- On the complexity of optimal K-anonymityPublished by Association for Computing Machinery (ACM) ,2004
- Privacy preserving mining of association rulesPublished by Association for Computing Machinery (ACM) ,2002
- On effective classification of strings with waveletsPublished by Association for Computing Machinery (ACM) ,2002
- Maintaining Data Privacy in Association Rule MiningPublished by Elsevier BV ,2002
- On the design and quantification of privacy preserving data mining algorithmsPublished by Association for Computing Machinery (ACM) ,2001
- Privacy-preserving data miningACM SIGMOD Record, 2000
- A general method applicable to the search for similarities in the amino acid sequence of two proteinsJournal of Molecular Biology, 1970