Efficient multidimensional suppression for k-anonymity


Dateien zu dieser Ressource

Prüfsumme: MD5:b1ec6f27bfbcf9b4529ef56bfd3fbe4f

KISILEVICH, Vachislav, Lior ROKACH, Yuval ELOVICI, Bracha SHAPIRA, 2010. Efficient multidimensional suppression for k-anonymity. In: IEEE Transactions on Knowledge and Data Engineering. 22(3), pp. 334-347. ISSN 1041-4347. Available under: doi: 10.1109/TKDE.2009.91

@article{Kisilevich2010Effic-17484, title={Efficient multidimensional suppression for k-anonymity}, year={2010}, doi={10.1109/TKDE.2009.91}, number={3}, volume={22}, issn={1041-4347}, journal={IEEE Transactions on Knowledge and Data Engineering}, pages={334--347}, author={Kisilevich, Vachislav and Rokach, Lior and Elovici, Yuval and Shapira, Bracha} }

<rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:void="http://rdfs.org/ns/void#" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.uni-konstanz.de/rdf/resource/123456789/17484"> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/17484"/> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2012-01-31T12:35:27Z</dcterms:available> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2012-01-31T12:35:27Z</dc:date> <dc:contributor>Shapira, Bracha</dc:contributor> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dc:contributor>Rokach, Lior</dc:contributor> <dc:creator>Shapira, Bracha</dc:creator> <dc:language>eng</dc:language> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/17484/1/Kisilevich.pdf"/> <dcterms:rights rdf:resource="https://kops.uni-konstanz.de/page/termsofuse"/> <dcterms:title>Efficient multidimensional suppression for k-anonymity</dcterms:title> <dc:contributor>Elovici, Yuval</dc:contributor> <dc:creator>Rokach, Lior</dc:creator> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/17484/1/Kisilevich.pdf"/> <dcterms:abstract xml:lang="eng">Many applications that employ data mining techniques involve mining data that include private and sensitive information about the subjects. One way to enable effective data mining while preserving privacy is to anonymize the data set that includes private information about subjects before being released for data mining. One way to anonymize data set is to manipulate its content so that the records adhere to k-anonymity. Two common manipulation techniques used to achieve k-anonymity of a data set are generalization and suppression. Generalization refers to replacing a value with a less specific but semantically consistent value, while suppression refers to not releasing a value at all. Generalization is more commonly applied in this domain since suppression may dramatically reduce the quality of the data mining results if not properly used. However, generalization presents a major drawback as it requires a manually generated domain hierarchy taxonomy for every quasi-identifier in the data set on which k-anonymity has to be performed. In this paper, we propose a new method for achieving k-anonymity named K-anonymity of Classification Trees Using Suppression (kACTUS). In kACTUS, efficient multidimensional suppression is performed, i.e., values are suppressed only on certain records depending on other attribute values, without the need for manually produced domain hierarchy trees. Thus, in kACTUS, we identify attributes that have less influence on the classification of the data records and suppress them if needed in order to comply with k-anonymity. The kACTUS method was evaluated on 10 separate data sets to evaluate its accuracy as compared to other k-anonymity generalization- and suppression-based methods. Encouraging results suggest that kACTUS' predictive performance is better than that of existing k-anonymity algorithms. Specifically, on average, the accuracies of TDS, TDR, and kADET are lower than kACTUS in 3.5, 3.3, and 1.9 percent, respectively, despite their usage of manually defined domain trees. The accuracy gap is increased to 5.3, 4.3, and 3.1 percent, respectively, when no domain trees are used.</dcterms:abstract> <dc:contributor>Kisilevich, Vachislav</dc:contributor> <dc:creator>Kisilevich, Vachislav</dc:creator> <dcterms:bibliographicCitation>First publ. in: IEEE Transactions on Knowledge and Data Engineering ; 22 (2010), 3. - pp. 334-347</dcterms:bibliographicCitation> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dc:creator>Elovici, Yuval</dc:creator> <dcterms:issued>2010</dcterms:issued> <dc:rights>terms-of-use</dc:rights> </rdf:Description> </rdf:RDF>

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

Kisilevich.pdf 498

Das Dokument erscheint in:

KOPS Suche


Mein Benutzerkonto