K-cryptonym improving method

A selection method and generalization technology, applied in special data processing applications, instruments, electrical digital data processing, etc., can solve the problems of reducing information accuracy and long execution time, and achieve the effect of shortening execution time and improving accuracy.

Inactive Publication Date: 2011-08-17
TIANJIN UNIV
View PDF0 Cites 21 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0011] The K-anonymity method in the prior art needs to compare all the nodes in the generalization grid when judging and comparing. When the scale of the generalization grid is relatively large, the execution time will be very long, which is very important for data processing. Unfavorable; this me

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • K-cryptonym improving method
  • K-cryptonym improving method
  • K-cryptonym improving method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0038] In order to make the object, technical solution and advantages of the present invention clearer, the implementation manner of the present invention will be further described in detail below in conjunction with the accompanying drawings.

[0039] In order to shorten the execution time and improve the accuracy of information, the embodiment of the present invention provides an improved K-anonymity method. The embodiment of the present invention is based on the K-anonymity algorithm for de-identifying private data. The processing is mainly to further optimize the generalization lattice after obtaining the optimal node, as described below for details:

[0040] 101: Select a quasi-identifier according to the original data set, determine the generalization method by the quasi-identifier, and establish an initial generalization lattice corresponding to the generalization method;

[0041] Among them, the K-min set is saved after traversing the initial generalization lattice. s...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses a K-cryptonym improving method, relating to a data mining field. The K-cryptonym improving method comprising the following steps of selecting a quasi-identifier according to an original dataset; determining a generalizing mode and establishing an initial generalizing lattice corresponding to the generalizing mode; judging whether the initial generalizing lattice is empty or not; if not, selecting a global optimum node from all nodes of the initial generalizing lattice according to the optimum node selection mode and obtaining a first generalizing lattice; carrying out the cryptonym processing on the data to be issued according to the global optimum node and obtaining the quantity of cryptonym cluster; judging whether the quantity of the cryptonym cluster is less than the prearranged quantity or not; if so, carrying out the optimum node selection mode calculation on the first generalizing lattice and obtaining the optimum node; if not, carrying out the secondary K-cryptonym calculation to the first generalizing lattice and obtaining the optimum node as the cryptonym cluster is an isolated cluster; generalizing the data to be issued according to the generalizing mode corresponding to the optimum node; and issuing the generalized data. By adopting the K-cryptonym improving method, the execution time is shortened, and the information accuracy is improved.

Description

technical field [0001] The invention relates to K-anonymity in the field of data mining, in particular to an improved K-anonymity method. Background technique [0002] The commonly used processing methods for data anonymization are derived from the data processing methods in statistical databases, mainly through the loss of information on the attribute values ​​in the published data in exchange for the accuracy of re-identifying some individuals through these attribute values, and at the same time It is possible to guarantee the availability of published data, and to achieve a balance between the accuracy of published data and privacy protection. Traditional privacy protection methods often sacrifice the accuracy of individual data records in order to ensure the overall trend of published data. [0003] K-Anonymity (K-anonymity algorithm): K-anonymity (K-Anonymity) is different from traditional access control and other goal-based privacy protection technologies. It is a typ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): G06F17/30G06F21/00
Inventor 张静
Owner TIANJIN UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap