http://rdf.ncbi.nlm.nih.gov/pubchem/patent/CN-106096453-B
Outgoing Links
| Predicate | Object |
|---|---|
| classificationCPCAdditional | http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F2221-2107 |
| classificationCPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F21-6254 |
| classificationIPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F21-62 |
| filingDate | 2016-06-27-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| grantDate | 2017-03-08-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| publicationDate | 2017-03-08-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| publicationNumber | CN-106096453-B |
| titleOfInvention | Quick anonymity privacy algorithm towards microdata |
| abstract | The invention discloses a kind of quick anonymity privacy algorithm towards microdata, is related to anonymous secret protection technical field.The thought of the law of identity in set and Incognito algorithm are combined by the present invention, it is proposed that F Incognito algorithm.F Incognito algorithm regards one of them node for reaching the extensive attribute of highest level as complete or collected works, and using the thought of the common factor equal to A of A and complete or collected works, the node to other attributes compositions judges, effectively reduces the amount of calculation of equivalence class quantity.Experiment shows：The algorithm can retain Incognito algorithm and obtain feature, while improve the time efficiency for solving extensive node table, the time shortens ratio and is up to 60%.Therefore, F Incognito algorithm process large data sets when, with significant advantage. |
| priorityDate | 2016-06-27-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| type | http://data.epo.org/linked-data/def/patent/Publication |
Incoming Links
| Predicate | Subject |
|---|---|
| isDiscussedBy | http://rdf.ncbi.nlm.nih.gov/pubchem/compound/CID7753 http://rdf.ncbi.nlm.nih.gov/pubchem/substance/SID419514609 |
Total number of triples: 13.