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

Method for evolutionary analysis on anonymous graph data

An anonymous graph and graph data technology, which is applied in the field of evolution analysis of anonymous graph data, which can solve the problems of inability to perform evolution analysis, destroying identification information, and splitting snapshot connections.

Active Publication Date: 2013-12-11
TSINGHUA UNIV
View PDF1 Cites 2 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The existing anonymization technology destroys the identification information in the graph data and splits the connection between snapshots, making evolution analysis impossible

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
  • Method for evolutionary analysis on anonymous graph data
  • Method for evolutionary analysis on anonymous graph data
  • Method for evolutionary analysis on anonymous graph data

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0061] The technical solutions of the present invention will be further described below in conjunction with the accompanying drawings and through specific implementation methods.

[0062] like figure 1 As shown, the embodiment of the present invention records a method for evolution analysis of anonymous graph data, the method mainly includes the following steps:

[0063] A. Establish the mapping between the core nodes of each snapshot of the anonymous graph data, associate all the mappings, and obtain the core penetration of the anonymous graph data;

[0064] B. Use the node matching algorithm to match other nodes of each snapshot other than the above-mentioned core penetration, associate the nodes that can be matched, and expand the core penetration to full penetration;

[0065] The traversal refers to a node chain in which all nodes referring to the same object in each snapshot of the anonymous graph data are strung together in the time order of the snapshots; the core trav...

Embodiment 2

[0110] Based on Example 1, combined with Figure 4 and Figure 5 , this embodiment provides a specific implementation process of a method for performing evolution analysis on anonymous graph data.

[0111] like Figure 4 As shown, in this embodiment, a total of three snapshots of an anonymous graph data are obtained, which are recorded as like Figure 4 shown.

[0112] According to the degree of the node as the measure of the core degree of each node, select 3 nodes in each snapshot as the core nodes of the snapshot, then The corresponding core node sets are: respectively with Create a derived subgraph for the vertex set, and expand it into a weighted complete graph according to step A3 in Example 1 Calculate according to step A4 in the embodiment one again arrive the mapping m 1 ={→a2→,, arrive the mapping m 2 = {2→F, 3→B, 5→A}, arrive the mapping m 3 ={F→a, B→d, A→b}.

[0113] According to the mapping m 1 、m 2 and m 3 It can be seen that 2=m 1...

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 method for evolutionary analysis on anonymous graph data, and belongs to the field of graph data mining and analysis. The method comprises the following steps of mining the anonymous graph data to obtain the first k core nodes of each snapshot; for each snapshot, obtaining an induced subgraph taking the core nodes of the snapshot as vertexes; converting each induced subgraph into a corresponding weighted complete graph; establishing a mapping from each weighted complete graph to the next weighted complete graph; associating all the mappings to obtain a core penetration; iteratively extending a penetration towards the periphery in each snapshot of the anonymous graph data on the basis of a current penetration set; stopping extension under a condition of convergence to obtain a full penetration. The method provided by the invention can be used for the evolutionary analysis on a plurality of snapshots of the same graph data source which is published by adopting an anonymization technology at different time points, and the problem that the anonymous graph data cannot be evolutionarily analyzed in the prior art is solved.

Description

technical field [0001] The invention relates to the technical field of graph data mining and analysis, in particular to a method for evolution analysis of anonymous graph data. Background technique [0002] Graph is the most commonly used abstract data structure in computer science. It is more complex in structure and semantics than linear tables and trees, and has more general representation capabilities. Many application scenarios in the real world need to be represented by a graph structure, and graph-related processing and applications are almost ubiquitous. Take the social network we are in as an example, it is a typical data with graph as the basic structure. A social network embodies social connections among friends, and the complexity of these connections has increased over the course of human history with various technological advances, including transportation technology that facilitates long-distance travel, global communication technology, and digital communicat...

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/30
Inventor 丁旋刘云浩孙家广
Owner TSINGHUA UNIV
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