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

Method, apparatus and system for mining similar frequent graphs in single graph, device and medium

A technology of graph mining and frequent subgraph, applied in the field of approximate frequent graph mining in a single graph, it can solve the problem that approximate frequent subgraph mining cannot be effectively solved, and achieves the effect of wide application, improving work efficiency and reducing workload.

Active Publication Date: 2018-09-28
EAST CHINA NORMAL UNIV
View PDF3 Cites 2 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The existing solutions cannot effectively solve the problem of approximate frequent subgraph mining when using relative values ​​to judge the similarity of subgraphs

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, apparatus and system for mining similar frequent graphs in single graph, device and medium
  • Method, apparatus and system for mining similar frequent graphs in single graph, device and medium
  • Method, apparatus and system for mining similar frequent graphs in single graph, device and medium

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0049] In the following description, many technical details are proposed in order to enable readers to better understand the application. However, those skilled in the art can understand that without these technical details and various changes and modifications based on the following implementation modes, the technical solution claimed in each claim of the present application can be realized.

[0050] The single graph used in the present invention is a single graph G(V, E, L, f), where V is the set of points in the single graph G, E is the set of edges in the single graph G, and L is the midpoint of the single graph G and A collection of edge labels, f is the correspondence from a point or edge to a label, each point or edge has a label, different points or edges can have the same label, |G| is the size of a single graph G, a single graph The size of G is the sum of the number of vertices and edges in a single graph G, ie |G|=|V|+|E|.

[0051] The subgraph used in the present...

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 relates to the field of graph data mining and graph matching, in particular to a method for mining similar frequent graphs in a single graph. The method comprises the steps of calculating a size upper limit of each frequent sub-graph of the single graph according to a given single graph size, given similarity and a given frequent degree; according to the size upper limit of each frequent sub-graph, traversing the single graph, and searching for all sub-graphs of the single graph; for the sub-graphs of the single graph, searching for all similar sub-graphs of the sub-graphs; for the similar sub-graphs of the sub-graphs, performing matching in the single graph, and searching for all matching graphs of the similar sub-graphs; forming matching graph sets by the matching graphs ofall the similar sub-graphs of the sub-graphs, and calculating the quantity of the matching graphs of the maximum independent set in the matching graph sets; and comparing the quantity of the matchinggraphs of the maximum independent set and the frequent degree, and if the quantity of the matching graphs of the maximum independent set is greater than or equal to the frequent degree, outputting the sub-graphs. The invention furthermore relates to an apparatus and a system for mining the similar frequent graphs in the single graph, a device and a medium.

Description

technical field [0001] The present invention relates to the fields of graph data mining (graph data mining) and graph matching (graph match), in particular to a method, device, equipment, medium and system for mining approximate frequent graphs in a single graph. Background technique [0002] In modern society, data has become a very important resource in any field, from scientific research, to economics, and even sociology. As society develops, data becomes more and more complex, making it very important to mine hidden patterns and extract useful information. However, data mining has always been a difficult problem, especially when the data is graph data. Graph data has become a powerful modeling tool due to its ability to preserve the relationship between data, and it is often used in biology, chemistry, network analysis and other fields. Frequent graph mining is an important problem in graph data mining. Given a graph or a set of graphs and a lower limit of frequency, i...

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/30G06K9/62
CPCG06F18/22
Inventor 林欣窦建凯吴永成
Owner EAST CHINA NORMAL 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