A method and a device for identifying super nodes in a relational graph constructed by mass data

A massive data and super node technology, applied in the field of data processing, can solve problems such as paralyzed calculation of relational graphs, low recognition efficiency, and dependence on expert experience
CN109840286AInactive Publication Date: 2019-06-04AGRICULTURAL BANK OF CHINA
3 Cites 6 Cited by

Patent Information

Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
AGRICULTURAL BANK OF CHINA
Publication Date
2019-06-04
Estimated Expiration
Not applicable · inactive patent

Smart Images

  • Figure 1
    Figure 1
  • Figure 2
    Figure 2
  • Figure 3
    Figure 3
Patent Text Reader

Abstract

The invention discloses a method and device for identifying super nodes in a relational graph constructed by mass data. The method comprises the steps of constructing the relational graph of the massdata, calculating the degree of each node, calculating the occurrence probability of the degree of each node according to power law distribution, and removing the nodes with the occurrence probabilitysmaller than a preset threshold value. Therefore, the super nodes in the complex network can be automatically identified, and the super nodes are identified according to the power law distribution, so that the probability of removing meaningful nodes is reduced.
Need to check novelty before this filing date? Find Prior Art

Description

technical field

[0001] The present invention relates to the field of data processing, in particular to a method and device for identifying super nodes in a relationship graph constructed from massive data. Background technique

[0002] With the development of Internet technology, a large amount of user data is recorded on the computer platform. In order to conduct research on certain issues, such as the analysis of fraudulent blacklist label propagation or the analysis of anti-money laundering transfer relationships, it is necessary to use massive data to generate complex relationship networks. , and analyze complex networks.

[0003] However, scale-free networks are included in complex networks. Scale-free networks have serious heterogeneity. A few nodes often have a large number of connections, while most nodes do have a small number of connections. However, when researching scale-free networks, more attention is paid to nodes with a small number of connections. For super...

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