id	author	title	date	pages	extension	mime	words	sentences	flesch	summary	cache	txt
work_ungntmprafc7zgznwu6bag5amu	Xiaoxun Sun	An approximate microaggregation approach for microdata protection	2012	28	.pdf	application/pdf	8224	819	64	In this paper, we apply the concept of entropy to propose a distance metric to evaluate the amount of mutual information among records in microdata, and propose a method of constructing dependency tree to find the key attributes, which we then use method of constructing dependency tree to find the key attributes, which we can use to process select key attributes from the best dependency tree, and how to use it for the approximate 1. Satisfying k-anonymity with minimum data modification using generalization (recoding) and local suppression was shown to be NP-hard by Meyerson and Williams [21], The work presented in this paper is based on information theory, and is related to the application of dependency tree of information theory in data mining and databases. n attributes selected from Table 4, and each data set has the same number of records as the	./cache/work_ungntmprafc7zgznwu6bag5amu.pdf	./txt/work_ungntmprafc7zgznwu6bag5amu.txt