Graph digest algorithm based on node importance

A summary algorithm and importance technology, applied in the computer field, can solve problems such as unsatisfactory summary results, important node merging, algorithm does not consider node importance factors, etc., and achieve the effect of wide practical value and application prospect

Pending Publication Date: 2022-05-13
NANJING UNIV OF POSTS & TELECOMM
View PDF0 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The traditional algorithm does not consider the importance of nodes, which often leads to the merger of important nodes in advance, so that the summary results cannot meet the needs of practical applications

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
  • Graph digest algorithm based on node importance
  • Graph digest algorithm based on node importance
  • Graph digest algorithm based on node importance

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0018] Embodiments of the present invention are described in detail below, examples of embodiments are shown in the drawings, wherein the same or similar designations from beginning to end indicate the same or similar elements or elements with the same or similar functions. The embodiments described below by reference to the accompanying drawings are exemplary and are intended to explain the present invention only, and cannot be construed as limitations of the present invention.

[0019] The present embodiment proposes a graph summary algorithm based on node importance, which mainly includes three stages: initialization stage, iterative merge stage and output stage. Its processes are as follows Figure 1 shown, including the following steps:

[0020] Step 201: According to the original graph, the unprocessed node set U and the processed set F, graph summary set Vs are established. initialize Calculate the node importance indicator for all nodes in U, and arrange the results in de...

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 graph digest algorithm based on node importance, which comprises the following steps of: establishing a node set, and carrying out importance index calculation and sorting on all points in the set; according to the importance sequence, nodes which are low in importance and are spaced by two hops are selected to form node pairs, new graph abstract vertexes are generated through combination, and meanwhile, a graph abstract vertex set is updated until all abstract nodes reach an algorithm threshold value; and traversing the summary vertex set, selecting summary point pairs to generate edges according to an MDL (minimum description length) principle, generating a correction edge set according to the original graph and the summary graph, and finally outputting the summary graph and the correction edge set. According to the method, abstracting can be carried out according to the importance of the nodes in the large graph, the defect that important nodes are merged in advance in a traditional graph abstracting algorithm is overcome, and the method has wide practical value and application prospects in the field of graph processing.

Description

Technical field [0001] The present invention relates to a graph summary algorithm based on the importance of nodes, belonging to the field of computer technology. Background [0002] With the advent of the era of big data, graph structure can concisely represent the complex relationships between objects, and is increasingly used in social relationship computing, network search, natural language processing, machine learning, and recommendation systems. Existing large systems and applications involve a large amount of entity interaction data, such as network links, social networks, IP interactions, and so on. With the explosive growth of the scale and complexity of graph datasets, how to design efficient graph processing algorithms has attracted more and more attention. [0003] Aiming at this problem, the researchers proposed a graph summary algorithm to compress the structure and attribute information of the original graph under the premise of allowing the profit and loss of som...

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 Applications(China)
IPC IPC(8): G06F16/901G06F16/904
CPCG06F16/9024G06F16/904
Inventor 刘强魏佳星刘浩季一木刘尚东吴飞
Owner NANJING UNIV OF POSTS & TELECOMM
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