Matches in DBpedia 2016-04 for { <http://doi.org/10.1145/1055558.1055591> ?p ?o }
Showing triples 1 to 22 of
22
with 100 triples per page.
- 1055558.1055591 author1 "Adam Meyerson".
- 1055558.1055591 author2 "Ryan Williams".
- 1055558.1055591 contribution "On the complexity of optimal k-anonymity".
- 1055558.1055591 doi "10.1145/1055558.1055591".
- 1055558.1055591 first1 "Adam".
- 1055558.1055591 first2 "Ryan".
- 1055558.1055591 isCitedBy K-anonymity.
- 1055558.1055591 isCitedBy Ryan_Williams_(computer_scientist).
- 1055558.1055591 isbn "158113858X".
- 1055558.1055591 journal "PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems".
- 1055558.1055591 last1 "Meyerson".
- 1055558.1055591 last2 "Williams".
- 1055558.1055591 location "New York, NY, USA".
- 1055558.1055591 pages "223–228".
- 1055558.1055591 pages "223–8".
- 1055558.1055591 place "New York, NY".
- 1055558.1055591 publisher "ACM".
- 1055558.1055591 quote "The technique of k-anonymization has been proposed in the literature as an alternative way to release public information, while ensuring both data privacy and data integrity. We prove that two general versions of optimal k-anonymization of relations are NP-hard, including the suppression version which amounts to choosing a minimum number of entries to delete from the relation. We also present a polynomial time algorithm for optimal k-anonymity that achieves an approximation ratio independent of the size of the database, when k is constant. In particular, it is a O-approximation where the constant in the big-O is no more than 4. However, the runtime of the algorithm is exponential in k. A slightly more clever algorithm removes this condition, but is a O-approximation, where m is the degree of the relation. We believe this algorithm could potentially be quite fast in practice.".
- 1055558.1055591 title "On the Complexity of Optimal K-Anonymity".
- 1055558.1055591 title "Proceedings of the Twenty-third ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems".
- 1055558.1055591 url kanon-pods04.pdf.
- 1055558.1055591 year "2004".