Method and system for determining step proximity centrality

Abstract

The invention discloses a stair closeness centrality determination method and system. The method comprises the following steps of: constructing a data map of a target database; forming a residual nodeset by all the nodes in the data map; calculating distances between all the node pairs in the residual node set, and calculating closeness centralities of all the nodes through the distances and weight functions; selecting a node with the maximum closeness centrality from the residual node set, deleting the selected node from the residual node set, and deleting edges associated with the selectednode from the data map so as to generate a new sub-map, wherein a stair closeness centrality of the selected node is closeness centrality calculated in the current sub-map; and judging whether the residual node set after the deletion is empty or not, and if the judging result is negative, repeating above steps to continue the calculation until the residual node set is empty, wherein stair closeness centralities of all the nodes are calculated. According to the method and system, stair closeness centrality indexes have better locality and anti-jamming capability.

Description

technical field [0001] The invention belongs to the field of graph data analysis in the computer field, and more specifically relates to a method and system for determining the centrality of ladder proximity for large-scale data graph analysis. Background technique [0002] At present, a large number of graph data and graph structures appear in our lives, such as social networks, transportation network graphs, biological networks, financial networks, scientific research data network graphs, and so on. With the continuous development of society, the scale of these data graphs is rapidly expanding, and the scale of data is increasing day by day. Therefore, it is very difficult to directly analyze the entire graph structure. Recently, researchers have proposed many methods for detecting and evaluating community and centrality measures in large-scale graphs. By detecting the key elements in the graph and sorting the nodes in the graph according to their importance, it is benefi...

AI Technical Summary

Problems solved by technology

[0004] Aiming at the above defects or improvement needs of the prior art, the present invention provides a method and system for determining the centrality of the ladder approach, thereby solving the problem that the centrality index obtained through the global calculation of the existing node centrality index and calculation method tends to be Technical problem with interference from a small number of nodes with high centrality

Images