Privacy preserving processing of data decision tree based on sample selection and Singular Value Decomposition

Data mining is a set of automated techniques used to extract hidden or buried information from large databases. With the development of data mining technologies, privacy protection has become a challenge for data mining applications in many fields. To solve this problem, many privacy-preserving data mining methods have been proposed. One important type of such methods is based on Singular Value Decomposition (SVD). In the proposed algorithm, attributes are grouped according to their distance difference similarity by clustering the data set using decision tree classification. Secondly, the algorithm packetizes the attributes according to their SA value in each group. Thirdly, for each group it selects attributes from the smallest bucket and searches for a similar attributes in the attributes-1 largest buckets from the same group to create an equivalence class following the unique attribute-distinct diversity anonymization model. The proposed algorithm satisfies the “utility based anonymization principle that crucial information is protected from being suppressed. Also, weights given to attributes improve clustering and give the ability to control the generalization´s depth. In prototype decision tree is combination of clustering and classification technique such methods are called ensemble classifier, this new proposed method is more efficient in balancing data privacy and data utility.