Graph calculation based personnel relation construction and analysis method

Abstract

The invention discloses a graph calculation-based personnel relation construction method, which comprises the following steps of: 1, extracting relation data, namely extracting finest-grained data of relation information by integrating internal and external data, and storing the finest-grained data into a graph database; and 2, constructing a relation model, namely combing relation types, traversing vertexes and edges stored in a graph database to achieve relation recombination, and forming the relation model. For example, in a first mode mentioned in the background technology, the relation model can be converted into a contact mobile phone of the target mobile phone taking the car N days before and after taking the car (default time), and the identity card of the owner of the mobile phone also subscribes the car. The flexibility of relation analysis is improved, due to the fact that the concept of the relation model is introduced, one or more relation models can be flexibly called in the relation analysis process, and different relation analysis results are obtained by introducing different parameters.

Description

technical field [0001] The invention relates to a method for constructing and analyzing a personnel relationship graph, in particular to a method for constructing and analyzing a personnel relationship based on graph calculation. Background technique [0002] The current methods of constructing and analyzing relationship graphs are generally based on the extraction of fixed data models. The following describes how to extract the relationship between people and vehicles based on fixed data models: [0003] Method 1: Contact the mobile phone of the target mobile phone 3 days before and after the ride (default time), and the ID card of the owner of the mobile phone has also booked the car; [0004] Method 2: The person on the train number is the same as the starting point of the target, and they stay in the same hotel as the target; [0005] Method 3: Except this time, people who have taken the same train (same flight) as the target within 3 months (default time); [0006] Me...

AI Technical Summary

Problems solved by technology

[0010] Aiming at the deficiencies of the current methods, the present invention utilizes the inherent advantages of graph databases in graph computing, converts relational analysis into graph computing, and based on the depth-first traversal algorithm and breadth-first traversal algorithm, real-time relational analysis, so that the final relationship that needs to be presented The data is obtained through graph calculation, which solves the analysis limitation problem caused by the persistence of relational data

Images