A practical approximation algorithm for optimal k-anonymity

k -Anonymity is a privacy preserving method for limiting disclosure of private information in data mining. The process of anonymizing a database table typically involves generalizing table entries and, consequently, it incurs loss of relevant information. This motivates the search for anonymization...

Full description

Saved in:

Bibliographic Details
Published in:	Data mining and knowledge discovery Vol. 25; no. 1; pp. 134 - 168
Main Authors:	Kenig, Batya, Tassa, Tamir
Format:	Journal Article
Language:	English
Published:	Boston Springer US 01.07.2012 Springer Nature B.V
Subjects:	Algorithms Approximation Artificial Intelligence Chemistry and Earth Sciences Clustering Computer Science Conferences Constraining Data mining Data Mining and Knowledge Discovery Information Storage and Retrieval International conferences Mathematical analysis Physics Privacy Statistics for Engineering Tables (data) Trees Frequent generalized itemsets Anonymity Approximation algorithms for NP-hard problems Privacy-preserving data mining Diversity
ISSN:	1384-5810, 1573-756X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!