A Distributed PageRank Acceleration Method Based on Similarity Estimation
A similarity and distributed technology, applied in the field of computer networks, can solve problems such as unguaranteed, slow convergence speed, large amount of calculation, etc., and achieve the effect of reducing the number of encounters, speeding up the speed, and accelerating the convergence speed
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0062] A distributed PageRank acceleration method based on similarity estimation according to the present invention will be described in detail below with reference to the drawings and embodiments.
[0063] Such as figure 1 As shown, the present invention proposes a distributed PageRank acceleration method based on similarity estimation, and its steps are as follows:
[0064] Step 1) Each subgraph calculates the feature vector representing its own successor metaset information:
[0065] The subgraph model is represented by a directed graph G, G=(V,E). V={v 1 ,v 2 ,...,v n} is the vertex set, E={e 1 ,e 2 ,...,e m} is an edge set. The number of nodes is n=|V|, and the number of edges is m=|E|. v i ∈V, (i=1,2,…,n), represents a node of the subgraph. (v i ,v j ) ∈ E, representing the node v i to node v j a directed edge of
[0066] Compute the successor set S of subgraphs. The successor metaset S is defined as:
[0067] S={u|u∈V∧(v,u)∈E∧u≠v}
[0068] According t...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
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