Check patentability & draft patents in minutes with Patsnap Eureka AI!

Systems and methods of hierarchical community detection in graphs

A community and graphics technology, applied in the field of hierarchical community detection, can solve problems such as computational difficulties

Active Publication Date: 2019-10-11
HUAWEI TECH CO LTD
View PDF4 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0005] The problem with community detection in such big data is that it is computationally difficult when the big data includes, for example, a large number of graphs representing Internet connectivity

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
  • Systems and methods of hierarchical community detection in graphs
  • Systems and methods of hierarchical community detection in graphs
  • Systems and methods of hierarchical community detection in graphs

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0045] The present invention, in some of its embodiments, relates to community detection, and more particularly, but not exclusively, to systems and methods for hierarchical community detection in graphs.

[0046] As used herein, the term "graph" table refers to a set of objects represented as vertices or nodes that are associated with one or more other vertices or nodes with edges. The input graph represents the graph processed for detecting communities in it, sometimes denoted herein as G or G = (V, E), where V denotes a vertex and E denotes an edge. A labeled graph represents the processing of the input graph, sometimes denoted herein as G1=(V1,E1) or G1. A directed decoupled graph represents the processing of the labeled graph, sometimes denoted herein as D(G1). A filtered directed decoupled graph is created by filtering the edges of said directed decoupled graph D(G1), sometimes denoted herein as FD(G1). A compressed graph is computed based on the filtered directed deco...

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

There is provided an apparatus for detecting communities within a graph, comprising: a processor configured to compute the following cycle: creating a directed Decoupling graph of communities of vertices from computed possible moves between communities of the graph, filtering edges of the directed Decoupling graph to obtain respective communities each including one of: incoming edges to vertices of the respective community, or outgoing edges from vertices of the respective community, and updating vertices of the marked graph with community labels from edges of the filtered directed Decouplinggraph, wherein a packed graph created by merging vertices of each community of the filtered directed Decoupling graph and merging multiple edges between couples of vertices of the packed graph into asingle edge denotes the computed hierarchical communities of the marked graph. The graph eventually converges to a solution when executed in a parallel and / or distributed computing system.

Description

Background technique [0001] The present invention, in some of its embodiments, relates to community detection, and more particularly, but not exclusively, to systems and methods for hierarchical community detection in graphs. [0002] Community detection (CD for short) is the process of identifying communities in graphs. The communities are identified as closely related vertices. CDs have applications in a variety of fields, including computer vision, economics, social sciences, medical research, and genetics research, among others. [0003] There are two general approaches to community detection; planar and hierarchical. Hierarchical CD is a community detection process used to generate a hierarchical topology of the communities identified in the graph. Hierarchical CDs are generally more complex than planar CDs, but yield hierarchical community topologies and can provide better accuracy. [0004] Hierarchical community detection methods can include one of two general appr...

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/901
CPCG06F16/9024
Inventor 维克多·弗拉基米罗维奇·斯米尔诺夫亚历山大·弗拉基米罗维奇·斯莱萨连科亚历山大·尼古拉耶维奇·菲利波夫
Owner HUAWEI TECH CO LTD
Features
  • R&D
  • Intellectual Property
  • Life Sciences
  • Materials
  • Tech Scout
Why Patsnap Eureka
  • Unparalleled Data Quality
  • Higher Quality Content
  • 60% Fewer Hallucinations
Social media
Patsnap Eureka Blog
Learn More

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

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