A method and device for obtaining multi-hop neighbor nodes
A neighbor node and acquisition method technology, which is applied in the computer field, can solve problems such as network congestion and reduce the computing efficiency of multi-hop neighbor nodes, and achieve the effect of improving computing efficiency
Active Publication Date: 2019-11-29
HONOR DEVICE CO LTD
View PDF5 Cites 0 Cited by
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Therefore, the existing BFS method for calculating multi-hop neighbors will generate a large amount of network communication costs, especially for some dense graphs or power-law graphs. A large amount of information transmission will cause network congestion, which will reduce the cost of querying multi-hop neighbors in large graphs. Node Computational Efficiency
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 moreImage
Smart Image Click on the blue labels to locate them in the text.
Smart ImageViewing Examples
Examples
Experimental program
Comparison scheme
Effect test
Embodiment Construction
[0057] Embodiments of the present invention provide a method and device for obtaining multi-hop neighbor nodes, which are used to improve the computational efficiency of querying multi-hop neighbor nodes in a large graph.
[0058] 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 following The described embodiments are only some, not all, embodiments of the present invention. All other embodiments obtained by those skilled in the art based on the embodiments of the present invention belong to the protection scope of the present invention.
[0059] The terms "first", "second" and the like in the description and claims of the present invention and the above drawings are used to distinguish similar obj...
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
Login to View More Abstract
The invention discloses a method and a device for obtaining multi-hop neighbor nodes, which are used for improving the calculation efficiency of querying multi-hop neighbor nodes in a large graph. In the method provided by the present invention, the 0-hop neighbors of each node in the topological network are obtained, and the set of 0-hop neighbors of all nodes is obtained. When the first node is used as the designated node, the k+ of the first node is calculated through the following iterative calculation process 1-hop neighbor set, the iterative calculation process includes the following steps a and b, step a, obtain the k-hop neighbor set of the first node, step b, k-hop destination node in the k-hop neighbor set of the first node, and all In the 0-hop neighbor set of a node, two node pairs with the same starting node are connected to form a node pair. After the node pair connection is completed, the k+1-hop neighbor set of the first node is obtained. When the k+1-hop neighbor set of the first node The number of hops k+1 in is equal to k max , output the k+1-hop neighbor set of the first node and the corresponding k+1-hop path.
Description
technical field [0001] The invention relates to the field of computer technology, in particular to a method and device for acquiring multi-hop neighbor nodes. Background technique [0002] A social network is a network of connected individuals and organizations. Now there are many social networks, such as Facebook, Twitter, paper citation network, Skype communication network, blog network and Renren, etc., showing a prosperous scene. In a social network, a vertex represents an object. For example, a paper, a sensor, a person, etc. can be used as a vertex. Edges represent the relationship between vertices. The relationship can include cooperative papers, friends, teachers, etc. Student relationship, citation relationship of papers, etc. [0003] Multi-hop neighbors have a wide range of applications on large graphs, such as community discovery, advertisement recommendation or friend recommendation, link prediction, finding friends of friends, and so on. On a large graph, a ...
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
Login to View More Patent Type & Authority Patents(China)
IPC IPC(8): H04L12/24H04L12/751H04L45/02
CPCH04L41/12H04L45/02
Inventor 刘文洁刘潭义张晓飞陈雷
Owner HONOR DEVICE CO LTD