Expert interpersonal relationship graph drawing method and system

Abstract

The invention discloses an expert interpersonal relationship graph drawing method and system, and relates to the technical field of the Internet. The method comprises the steps: crawling a plurality of parts of academic data associated with experts from a network for each expert; analyzing each academic data according to a first preset rule to obtain a teacher-student relationship of experts; analyzing the academic data according to a second preset rule to obtain a same-gate relationship of experts; analyzing each academic data according to a third preset rule to obtain a school friend relationship of experts; analyzing each academic data according to a fourth preset rule to obtain a student relationship of experts; according to the teacher-student relationship, the same-door relationship,the school friend relationship and the student relationship, drawing to obtain an expert interpersonal relationship graph of experts. A lot of manpower and material resources are saved, and the resource utilization rate is improved; talent resources are efficiently and accurately recommended, and a high-quality talent chain is provided for the society; the influence on a data collection main bodyis small, and research value can be provided for various fields of society.

Description

technical field [0001] The present invention relates to the technical field of the Internet, in particular to a method and system for drawing an expert network relationship map. Background technique [0002] At present, the collection technology of expert network relationship map is limited to manual questionnaire survey, visit survey and other forms. However, the social transportation is convenient and the population mobility is too strong, which leads to low prevalence rate of data collection, low collection efficiency, data missing or data misjudgment, etc. Condition. [0003] The source of the existing network map is limited to certain monopoly departments (such as the Ministry of Public Security) who are responsible for it full-time. Relatives can be checked from the household registration office. The relationship security and confidentiality coefficient is high, it is difficult to obtain and there will be untimely updates, and it is difficult to prevent fraud, etc. Co...

AI Technical Summary

Problems solved by technology

[0002] At present, the collection technology of expert network relationship map is limited to manual questionnaire survey, visit survey and other forms. However, the social transportation is convenient and the population mobility is too strong, which leads to low prevalence rate of data collection, low collection efficiency, data missing or data misjudgment, etc. Condition

[0003] The source of the existing network map is limited to certain monopoly departments (such as the Ministry of Public Security) who are full-time responsible. The relationship between relatives can be checked from the household registration office. The relationship security and confidentiality coefficient is high, and it is difficult to obtain and will not be updated in time, and it is difficult to prevent fraud, etc. Condition

At this stage, various social software emerges in an endless stream, complicated and complex, one person has multiple applications, one person has multiple accounts, thousands of people have thousands of faces, user registration information is not true, and multiple identities are difficult to distinguish, which brings great difficulties to the collection and processing of interpersonal relationships

Because interpersonal relationships involve a wide network, the same person's personal network is extremely limited, the coverage rate is incomplete, and the amount of information collected is small, which is not conducive to the drawing of the network relationship map

Images