A Community Discovery Method Based on Random Walk
A technology of random walk and community discovery, which is applied in the field of complex networks, can solve problems such as high computational complexity of algorithms, unapplicable algorithms, prior knowledge of algorithms and narrow scope of use, etc., to achieve reduced calculation costs, short time, and adaptability strong effect
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0030] 1) By expressing with an undirected graph G figure 1 the complex network of said representations;
[0031] 2) Reference figure 2 , where ESS represents an edge, select a node with equal probability among all nodes [1, 2, 3, 4, 5, 6, 7] of the undirected graph G as the starting point of the random walk, where each The probability of a point being selected is 1 / 7, the starting node of the random walk obtained through random selection is 1, and the sequence of traversing nodes VS=(1); with 1 as the starting node, in its neighbor nodes [2, 3, 4 ] The target node is selected with medium probability, and the probability of each neighbor node being selected is 1 / 3. After random selection, the target node is 2, and the traversal node sequence VS=(1, 2); for each step of the random walk, the target node The node u is randomly selected from the neighbor nodes of the current node v with a medium probability, and the destination node is added to the sequence of traversed nodes a...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


