An decision tree algorithm for k-anonymity data

MaRDI QIDQ2887530zbMATH OpenFDO

Authors Bingchun Lin, Guohua Liu, Mei Wang

Publication date 1 June 2012

Published in Journal of Wuhan University. Natural Science Edition (Search for Journal in Brave)

zbMATH Keywords

\(k\)-anonymitydata miningdecision tree

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• A practical approximation algorithm for optimal \(k\)-anonymity
• A new approach for achieving k-anonymity in database based on fuzzy clustering and 0-1 integer programming
• k-Anonymization with Minimal Loss of Information
• Data and Applications Security XIX
• Efficient systematic clustering method for k-anonymization

Cited in

(4)

• A hybrid approach for scalable sub-tree anonymization over big data using MapReduce on cloud
• Against Classification Attacks: A Decision Tree Pruning Approach to Privacy Protection in Data Mining
• a-diversity k-anonymity large data adaptive delay scheduling algorithm based on wavelet analysis
• A dynamic anonymization privacy-preserving model based on hierarchical sequential three-way decisions

This page was built for publication: An decision tree algorithm for \(k\)-anonymity data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2887530)