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

Graph partitioning method based on shortest path and density clustering

A density clustering, shortest path technology, applied in special data processing applications, instruments, electrical digital data processing, etc., to achieve good versatility and good segmentation effect.

Inactive Publication Date: 2015-04-08
SHENZHEN INST OF ADVANCED TECH CHINESE ACAD OF SCI
View PDF2 Cites 6 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

This method converts the social system community detection problem into its corresponding weighted undirected graph segmentation problem by constructing a weighted undirected graph model corresponding to the social system, and proposes an evolutionary strategy that selects the modified modularity Q as the graph segmentation criterion Graph segmentation technology, this method has algorithm convergence 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
  • Graph partitioning method based on shortest path and density clustering

Examples

Experimental program
Comparison scheme
Effect test

Embodiment

[0037] A weighted undirected graph G=(V,E), V={v i}, E={e i}, i={1,2,3,...,n}, w(e i ) means side e i weight; the adjacency list is used as the storage structure of the graph, and the adjacency list information of each node is L(v i )={{v i1 ,e i1},{v i2 ,e i2},{v i3 ,e i3},...,{v im ,e im}}.

[0038] Set the density threshold minPt, the distance threshold minEp, set the initial category k=1, and mark the category of each node as 0, that is, type i =0, i={1,2,3,...,n}.

[0039] Randomly select a node v in V whose category is marked as 0 j , calculate N(v j ). Read the adjacency list information, calculate each node in the adjacency list to v j The path length Dis (that is, connect the node in the adjacency list with v j The weight of the edge), compare the size of Dis and the distance threshold minEp, and add the nodes corresponding to the distance smaller than minEp in the adjacency list to N(v j ), and further in-depth search calculations, that is, reading ...

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 a graph partitioning method based on a shortest path and density clustering. The graph partitioning method comprises the following steps: 1, defining a distance between any two points on a graph, namely G=(V, E), to be a length of the shortest path between the two points so as to obtain a distance space defining the distance between any two points; 2, clustering point sets obtained in the step 1 by a density-based clustering method, and classifying non-classified noise points into a group; 3, reducing subsets obtained in the step 2 into subgraphs obtained by partitioning of an original graph. The connectivity of subgraphs obtained by partitioning is guaranteed; furthermore, the partitioning speed is high, and the universality is good.

Description

technical field [0001] The invention relates to a graph segmentation method based on the shortest path and density clustering. Background technique [0002] A graph in graph theory is the most commonly used abstract data structure in computer science and has a wide range of applications. Many complex relationships in the real world can be represented by graphs, such as the molecular structure of proteins, social networks, circuit wiring, etc. The applications related to graphs involve many fields. The traditional ones include the determination of optimal transportation routes and the path of disease outbreaks. prediction, citation relationship of scientific and technological literature, etc.; emerging ones include social network analysis, semantic Web analysis, biological information network analysis, etc. Graph Partition refers to dividing the node set V of a given graph G=(V, E). The usual goal is to make the nodes belonging to the same subgraph more tightly connected af...

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): G06F19/00
Inventor 李刚宁立张涌
Owner SHENZHEN INST OF ADVANCED TECH CHINESE ACAD OF SCI
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