Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

A network anonymity method for graph structure modification based on optimal grouping of degree sequences

A packet network, degree sequence technology, applied in the fields of instrumentation, computing, electrical digital data processing, etc., can solve problems such as complex algorithms

Active Publication Date: 2020-11-10
NANJING UNIV OF POSTS & TELECOMM
View PDF4 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] The purpose of the present invention is to solve the problem that the algorithm required for the anonymity process in the prior art is too complex, and to provide a network anonymity method based on the optimal grouping of the degree sequence to modify the graph structure. Processing; specific technical solutions are as follows:

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
  • A network anonymity method for graph structure modification based on optimal grouping of degree sequences
  • A network anonymity method for graph structure modification based on optimal grouping of degree sequences
  • A network anonymity method for graph structure modification based on optimal grouping of degree sequences

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0041] In order to enable those skilled in the art to better understand the solutions of the present invention, the technical solutions in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention.

[0042] In the embodiment of the present invention, a network anonymity method for modifying the graph structure based on the optimal grouping of the degree sequence is provided, see Figure 13 , the method specifically includes the steps: firstly, by converting the optimal grouping problem of network node degree value sequence k anonymity into a shortest path problem of a directed grouping network; then, according to the shortest path of the directed grouping network The sequence is k-anonymized; finally, according to the k-anonymous information of the network node degree value sequence, the network structure is modified to realize the k-anonymous operation of the network node...

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

A network anonymity method for performing graph structure modification based on an optimal grouping of a degree sequence, the method first converts the optimal grouping problem of a network node degree value sequence k anonymity into a shortest path problem of a directed grouped network; performing k anonymity on the network node degree value sequence according to the shortest path of the directed grouped network; modifying the network structure according to k anonymity information of the network node degree value sequence, and realizing the k anonymity operation of the network node degree value. The method can effectively reduce the amount of calculation in the network data anonymity process, and is suitable for large-scale network data anonymity processing.

Description

technical field [0001] The invention belongs to the technical field of data mining and is applied to solve the problem of privacy protection, in particular to a network anonymity method for modifying graph structure based on optimal grouping of degree sequences. Background technique [0002] As more and more web data is published publicly, the anonymization of web data has become an important issue. [0003] Deleting a node's identifier is the simplest method of anonymity, but faces attacks on node identification based on limited background knowledge. Network data usually has complex topological structure characteristics, and the anonymization method for relational data cannot be directly applied to network data. In recent years, graph anonymization has become the mainstream method of anonymizing network data. Node K anonymity is an important method in graph anonymity technology. The idea of ​​node K-anonymity technology is to cluster all the nodes into several super-poin...

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
Patent Type & Authority Patents(China)
IPC IPC(8): G06F21/62
CPCG06F21/6254
Inventor 张海涛于晨光韦伟胡栋朱少楠张建宇
Owner NANJING UNIV OF POSTS & TELECOMM
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

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

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com