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

Parallel Enumeration Method of Maximum Bipartite Groups Based on Sparse Bipartite Graph

A bipartite graph and grouping technology, applied in instruments, database indexing, computing, etc., can solve problems such as low computing efficiency, and achieve the effect of improving computing efficiency, reducing memory pressure, and efficiently assigning initialization tasks.

Inactive Publication Date: 2021-08-31
SHENZHEN UNIV
View PDF4 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] This application provides a parallel enumeration method for extremely large bipartite groups based on sparse bipartite graphs, which can solve the technical problem of low computational efficiency in the prior art for solving MBE problems

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
  • Parallel Enumeration Method of Maximum Bipartite Groups Based on Sparse Bipartite Graph
  • Parallel Enumeration Method of Maximum Bipartite Groups Based on Sparse Bipartite Graph
  • Parallel Enumeration Method of Maximum Bipartite Groups Based on Sparse Bipartite Graph

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0028] In order to make the purpose, features and advantages of the present invention more obvious and understandable, the technical solutions in the embodiments of the present invention will be clearly and completely described below in conjunction with the accompanying drawings in the embodiments of the present invention. Obviously, the described The embodiments are only some of the embodiments of the present invention, but not all of them. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without making creative efforts belong to the protection scope of the present invention.

[0029] Currently, graph models, as an abstraction of complex relationships in data, have been widely used in various fields, such as social networks, recommendation systems, and bioinformatics. Such graph data contains many dense substructures. From these graphs, finding these dense substructures, such as clique, biclique, and k-cores, is a ...

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 parallel enumeration method of extremely large bipartite groups based on a sparse bipartite graph. Compared with the prior art, the invention adopts a parallel computing method, which can enable parallel computing of various computing tasks, including uniform initialization tasks Assignment and efficient task migration, as well as de-redundancy operations on the amount of information of a single task, so that redundant and repeated information is stored in a common area, and each task will only be queried and obtained when it is executed. , which not only reduces the pressure on the memory, but also speeds up the task migration, and can effectively improve the computing efficiency when solving the MBE problem.

Description

technical field [0001] The invention relates to the technical field of graph data mining, in particular to a parallel enumeration method for extremely large dichotomous groups based on a sparse bipartite graph. Background technique [0002] In recent years, the MBE (maximal biclique enumeration) problem based on bipartite graphs is one of the research hotspots in the field of graph data mining. MBE problems can be applied to the discovery and analysis of biological phylogenetic trees, protein interaction network structures, product recommendations, and character interest analysis. [0003] At present, to solve the MBE problem on the bipartite graph, the serial calculation method is generally adopted. This calculation method cannot make full use of hardware resources, and the calculation efficiency is low. Contents of the invention [0004] The present application provides a method for parallel enumeration of extremely large bipartite groups based on a sparse bipartite gra...

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): G06F16/22G06F16/2458
CPCG06F16/2246G06F16/2465
Inventor 何宇李荣华毛睿荣钰王毅廖好
Owner SHENZHEN 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