CN113553364A - Method for constructing relationship network of people, method for outputting contact path of people, storage medium and system for mutual assistance of people resources - Google Patents
Method for constructing relationship network of people, method for outputting contact path of people, storage medium and system for mutual assistance of people resources Download PDFInfo
- Publication number
- CN113553364A CN113553364A CN202110887930.3A CN202110887930A CN113553364A CN 113553364 A CN113553364 A CN 113553364A CN 202110887930 A CN202110887930 A CN 202110887930A CN 113553364 A CN113553364 A CN 113553364A
- Authority
- CN
- China
- Prior art keywords
- relationship
- degree
- user
- person
- associated person
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 45
- 238000004590 computer program Methods 0.000 claims description 5
- 238000004364 calculation method Methods 0.000 description 7
- 210000003462 vein Anatomy 0.000 description 6
- 235000012054 meals Nutrition 0.000 description 5
- 238000010276 construction Methods 0.000 description 2
- 238000012163 sequencing technique Methods 0.000 description 2
- 230000003442 weekly effect Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000007796 conventional method Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 230000002452 interceptive effect Effects 0.000 description 1
- 238000010187 selection method Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/248—Presentation of query results
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/01—Social networking
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Business, Economics & Management (AREA)
- Physics & Mathematics (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Databases & Information Systems (AREA)
- Computing Systems (AREA)
- Data Mining & Analysis (AREA)
- Computational Linguistics (AREA)
- Economics (AREA)
- General Engineering & Computer Science (AREA)
- Human Resources & Organizations (AREA)
- Marketing (AREA)
- Primary Health Care (AREA)
- Strategic Management (AREA)
- Tourism & Hospitality (AREA)
- General Business, Economics & Management (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention provides a method for constructing a personal relationship network, a method for outputting a person finding contact path, a storage medium and a personal resource mutual-assistance system, wherein the method for constructing the personal relationship network comprises the following steps: acquiring personal information and associated person information of a plurality of users; analyzing the relationship of each user according to the personal information and the associated person information of each user, and acquiring the degree of the relationship between each user and the corresponding associated person; and constructing a relationship network according to the relationship of each user and the relationship degree between each user and the corresponding associated person. After the contact path between the user and the person to be found is analyzed in the personal relationship network, the contact path can be output according to the degree of the relationship between every two adjacent persons in the contact path, so that the degree of the relationship between the two adjacent persons can be reflected by the contact path output by the personal relationship network, and the user can avoid selecting the contact path with the sparser relationship between the two adjacent persons as much as possible in the person finding process.
Description
Technical Field
The invention relates to the technical field of data processing, in particular to a method for constructing a personal relationship network, a method for outputting a person finding contact path, a storage medium and a personal resource mutual aid system.
Background
The social network covers all network service forms taking human social as a core, and is an interactive platform for people to communicate, communicate and participate. Because each person in a social network is associated with multiple people, there are a large number of personal resources that are not readily available in the social network.
In the conventional method for analyzing the relationship between the individual and social information of a plurality of users, the relationship between the individual and social information of the users is analyzed according to the personal and social information of the users, and then a relationship network is constructed according to the relationship between the individual and social information of the users. When a user wants to search a certain person in the personal relationship network, the personal information of the searched person is only needed to be input, and the personal relationship network can analyze a contact path for the user to contact the searched person according to the personal information of the user and the personal information of the searched person. At present, a relationship network of people and vessels usually analyzes a contact path according to the number of related associates between a user and a person to be found, specifically, a path with the least related associates is selected as the contact path, so that the contact time can be saved, but the degree of relationship between two adjacent persons cannot be reflected in the selected contact path, so that a situation that the relationship between the two adjacent persons is sparser may exist in the selected contact path, that is, the contact path is not suitable, and the user is difficult to contact the person to be found through the unsuitable contact path.
Disclosure of Invention
The invention aims to solve the technical problem of how to enable the contact path output by the relationship network to reflect the relationship degree between every two adjacent people.
In order to solve the technical problem, the invention provides a method for constructing a human relationship network, which comprises the following steps:
A. acquiring personal information and associated person information of a plurality of users;
B. analyzing the relationship of each user according to the personal information and the associated person information of each user;
C. constructing a relationship network according to the relationship of each user;
in the step B, after the relationship of the each user is analyzed, the relationship degree between each user and the corresponding associated person is obtained; and C, constructing a relationship network of the interpersonal relationship according to the relationship degree between each user and the corresponding associated person.
Preferably, the determinant of the degree of relationship comprises an answer to a question related to the degree of relationship for each user; in the step A, questions related to the degree of relationship are provided for each user to answer; and in the step B, analyzing the degree of relationship between each user and the corresponding associated person according to the answer of each user.
Preferably, the decision factor of the relationship degree includes a related judgment result of whether each user invites the corresponding associated person to register successfully; in the step B, it is determined whether each user invites the corresponding associated person to register successfully, if the invitation is successful, the degree of relationship is higher, and if the invitation is unsuccessful, the degree of relationship is lower.
Preferably, the decision factor of the relationship degree includes a correlation judgment result of whether the same associated person information exists; in the step B, it is determined whether the same associated person information exists in the associated person information of the plurality of users, and if so, the degree of relationship between the user corresponding to the same associated person information and the corresponding associated person is low.
Preferably, the determinant of the degree of relationship comprises the integrity of the associated person information; and B, acquiring corresponding integrity of the associated person information according to the associated person information of each user, wherein the higher the integrity of the associated person information is, the higher the relationship degree is.
Preferably, the determinant of the degree of relationship comprises the degree of authenticable of the associated person information; and B, acquiring corresponding related person information authenticable degree according to the related person information of each user, wherein the higher the authenticable degree of the related person information is, the higher the relation degree is.
Preferably, if the information that the user exits the relationship network is obtained, the associated person information uploaded to the relationship network by the user is encrypted.
The invention also provides a person finding contact path output method based on the personal relationship network, which comprises the following steps:
a. acquiring personal information of a user and personal information of a found person;
b. analyzing a contact path between the user and the person to be found in the personal relationship network according to the personal information of the user and the personal information of the person to be found;
c. acquiring the degree of relationship between every two adjacent persons in the contact path;
d. and outputting the contact path according to the degree of the relationship between every two adjacent persons in the contact path.
Preferably, the step d is to output the connection path and the degree of relationship between two adjacent persons.
Preferably, there are a plurality of the analyzed connection paths in step b; and d, specifically, sequencing and outputting the plurality of contact paths according to the degree of the relationship between every two adjacent persons in each contact path.
Preferably, in the step d, specifically, the relation degree average value of each contact path is calculated according to the relation degree between every two adjacent persons in each contact path, and then the plurality of contact paths are sorted and output according to the relation degree average value of each contact path.
Preferably, in the step d, the lowest value of the relationship degree between every two adjacent persons in each contact path is found out according to the relationship degree between every two adjacent persons in each contact path, and then the plurality of contact paths are sorted and output according to the lowest value of the relationship degree between every two adjacent persons in each contact path.
Preferably, there are a plurality of the connection paths analyzed in the step b, and the step d specifically outputs from the plurality of connection paths, preferably the one with a higher degree of relationship between two adjacent persons.
Preferably, in the step d, the average value of the relationship degree between every two adjacent persons in each connection path is calculated according to the relationship degree between every two adjacent persons in each connection path, and then the average value of the relationship degree between two adjacent persons is preferably output from the plurality of connection paths.
Preferably, in the step d, the lowest value of the relationship degree between two adjacent persons in each connection path is found out according to the height of the relationship degree between two adjacent persons in each connection path, and then the lowest value of the relationship degree between two adjacent persons is preferably selected from the plurality of connection paths to be higher for output.
Preferably, if there are a plurality of contact routes having a high degree of relationship, a contact route having a small number of persons is preferably output.
The present invention also provides a computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, implements the method for building a personal relationship network as described above and/or the method for outputting a person finding contact path as described above.
The invention also provides a human-vein resource mutual-help system, which comprises a computer-readable storage medium and a processor which are connected with each other, wherein the computer-readable storage medium is as described above.
The invention has the following beneficial effects: when the relationship network of the invention is constructed, the relationship between each user and the corresponding associated person is also constructed according to the relationship between each user and the corresponding associated person, so that after the relationship path between each user and the found person is analyzed in the relationship network of the people, the relationship degree between every two adjacent persons in the relationship path can be obtained, the relationship path can be output according to the relationship degree between every two adjacent persons in the relationship path, and the relationship path output by the relationship network of the people can reflect the relationship degree between two adjacent persons, thereby enabling the user to avoid selecting the relationship between two adjacent persons as much as possible in the process of finding persons.
Drawings
FIG. 1 is a flow chart of a method of construction of a personal relationship network;
FIG. 2 is a flow chart of a person finding contact path output method based on a relationship network;
FIG. 3 is a schematic diagram of a context relationship network constructed by an embodiment.
Detailed Description
The invention is described in further detail below with reference to specific embodiments.
The embodiment provides a personal vein resource mutual-help system, which comprises a computer readable storage medium and a processor which are connected with each other, wherein a computer program is stored on the computer readable storage medium, and when being executed by the processor, the computer program realizes the personal vein relation network construction method shown in fig. 1, so that a personal vein relation network for finding a person is constructed for the personal vein resource mutual-help system, and when the personal vein resource mutual-help system is in operation, the computer program is executed by the processor, so that the person finding contact path output method based on the personal vein relation network is realized, and a contact path for finding the person is output to a user.
Referring to fig. 1, the method for constructing a personal relationship network includes the following step A, B, C.
A. The personal information and the associated person information of a plurality of users are acquired.
When a user uses the human resource mutual-aid system, the user needs to register first, and when the user needs to upload own personal information and related person information, wherein the own personal information comprises the name, the gender, the age, a work unit, a work post, a graduate college and the like of the user, and the related person information comprises the name, the gender, the age, the work unit, the work post, the graduate college and the like of a corresponding related person. Therefore, after the plurality of users register successfully, the personal information and the corresponding associated person information uploaded by the plurality of users respectively are obtained by the human-vein resource mutual-aid system.
During registration of individual users, the system also provides questions to individual users regarding the degree of relationship, such as weekly meetings, weekly meals together, etc., wherein: the more the meeting times per week are, the higher the degree of relationship between the user and the associated person is; the more meals together per week, the higher the degree of relationship between the user and the associated person.
B. And analyzing the relationship of each user according to the personal information and the associated person information of each user.
After the user uploads the personal information and the associated person information, the system can analyze the relationship of each user according to the information, wherein the relationship of the user and the relationship of. For example, the user a uploads the personal information of itself and the related person information of the related person b, and among these information: if the working units of the user A and the associated person B are the same, the system can analyze that the relationship between the user A and the associated person B is a colleague; if the user A and the associated person B have the same working post but different working units, the system can analyze that the relationship between the user A and the associated person B is the same line; if the user A is the same as the graduate college of the associated person B, the system can analyze that the relationship between the user A and the associated person B is a schoolmate; if the user A and the related person B are different in work unit, work post and graduation institution, the system defaults that the relationship between the user A and the related person B is a common friend.
After analyzing the relationship of the relationship between the users, the system obtains the degree of the relationship between the users and the corresponding associated persons, and the determining factor of the degree of the relationship comprises at least one of the following factors: answers of all users for answering questions related to the relation degree, related judgment results of whether all users invite corresponding relatives to register successfully, related judgment results of whether the same relatives exist, information integrity of the relatives and information authentiability of the relatives. Specifically, after analyzing the relationship between the users according to the personal information and the associated person information of the users, the system further performs at least one of the following relationship degree analysis operations (1) to (5) to analyze the relationship degree between the users and the associated person:
(1) and analyzing the degree of relationship between each user and the corresponding associated person according to the answer of each user to the question related to the degree of relationship. These are questions provided by the system during the registration of the respective user, relating to the degree of relationship, such as the number of meetings per week, meals together per week, etc., wherein: the more the meeting times per week are, the higher the degree of relationship between the user and the associated person is; the more meals together per week, the higher the degree of relationship between the user and the associated person. The system provides corresponding answer options while providing the questions, wherein different answer options represent different scores, and after the user answers all the questions, the scores represented by the answer options of all the questions are added, so that the degree of relationship between the user and the corresponding associated person is analyzed by the total score after the addition. For example, the system provides two questions of the number of visitation times per week and the number of meals taken together per week, and provides corresponding four answer options (less than 2 times, 3-5 times, 6-10 times, and more than 11 times) for the two questions respectively, wherein the answer option score of less than 2 times is 2, the answer option score of 3-5 times is 2, the answer option score of 6-10 times is 3, and the answer option score of more than 11 times is 4, so that after the user answers the two questions, the total score obtained by adding the answer option scores of the two questions is 2-8, wherein the relationship degree corresponding to the total score of 2-5 is low, and the relationship degree corresponding to the total score of 6-8 is high.
(2) And judging whether each user invites the corresponding associated person to register successfully or not, wherein if the invitation is successful, the relation degree is higher, and if the invitation is failed, the relation degree is lower. Specifically, the system provides a function of filling in an invitation code during registration, taking a user A and an associated person B as an example, after the user A finishes registration, the system can generate a string of unique invitation codes for the user A to copy and share, when other people register, the unique invitation code of the user A can be filled in to indicate that the user A invites registration, therefore, if the associated person B of the user A fills in the unique invitation code of the user A during registration, the associated person B is indicated that the user A invites registration, and thus, the degree of relationship between the user A and the associated person B is high. Before the associator B registers, or when the associator B registers but does not fill in the unique invitation code of the user A, the fact that the user A invites the associator B to register fails means that the degree of relationship between the user A and the associator B is low.
(3) And judging whether the same associated person information exists in the associated person information of the plurality of users, wherein if the same associated person information exists, the degree of the relationship between the user corresponding to the same associated person information and the corresponding associated person is low. Specifically, if some associated person information is unique among the associated person information uploaded by each user, it means that only one user uploads the unique associated person information, so that the user contacts the corresponding associated person, and thus the degree of relationship between the user and the corresponding associated person is high; however, if the same associated person information exists in the associated person information uploaded by each user, the associated person corresponding to the same associated person information can be contacted through a plurality of users, and thus, the degree of relationship between the user corresponding to the same associated person information and the corresponding associated person is low. For example, the user a uploads the personal information of the user a and the related person information of the related person b, the user c uploads the personal information of the user a and the related person information of the related person b and the related person information of the related person d, that is, the user a and the user c both upload the related person information of the related person b, and only the user c uploads the related person information of the related person d.
(4) And acquiring corresponding integrity of the associated person information according to the associated person information of each user, wherein the higher the integrity of the associated person information is, the higher the relationship degree is. Specifically, the related person information uploaded by the user includes the name, sex, age, work unit, work post, graduation institution and the like of the corresponding related person; if the user uploads all the information of the associated persons, namely the integrity of the information of the associated persons is very high, the user is meant to have very deep understanding degree of the corresponding associated persons, and therefore the degree of the relationship between the user and the corresponding associated persons is considered to be high; if the user only uploads part of the associated person information, namely the integrity of the associated person information is low, the user is meant to have low understanding degree of the corresponding associated person, and therefore the relationship degree between the user and the corresponding associated person is considered to be low.
(5) And acquiring corresponding associator information authenticable degree according to the associator information of each user, wherein the higher the authenticable degree of the associator information is, the higher the relation degree is. Specifically, the related person information uploaded by the user includes the name, sex, age, work unit, work post, graduation institution and the like of the corresponding related person; the name, sex and age of the associated person can be authenticated through the valid certificate (such as an identity card) of the associated person, the work unit and the work post of the associated person can be authenticated through the official website of the employment company of the associated person, and the graduation colleges of the associated person can be authenticated through the learning letter network or other academic information inquiry websites, so that the user can be attached with the valid certificate photo or the website which can authenticate the information of the associated person when uploading the information of the associated person. If all the information in the information of the associated persons uploaded by the user is accompanied by a valid certificate photo or a website which can be authenticated, the information of the associated persons is very high in authenticable degree, and therefore the degree of relationship between the user and the corresponding associated persons is considered to be high; if only one or part of the information of the associated person uploaded by the user is attached with a valid certificate photo or a website which can be authenticated, the information of the associated person is low in authenticable degree, and therefore the degree of the relationship between the user and the corresponding associated person is considered to be low.
In this embodiment, if the system performs at least two of the above relationship degree analysis operations to analyze the relationship degree between each user and the corresponding associated person, the system may assign a certain proportional weight to the result of each relationship degree analysis operation, perform weighted scoring, and obtain the final relationship degree according to the score after weighted calculation. For example, the user A uploads the personal information of the user A and the related person information of the related person B, the user C uploads the personal information of the user A and the related person information of the related person B and the related person D, the user E uploads the personal information of the user A and the related person information of the related person B and the related person D, and the system performs all relation degree analysis operations on the relation degree between each user and the corresponding related person; in the results of the relationship degree analysis operation, a score of 10 indicates that the relationship degree is high, a score of 5 indicates that the relationship degree is low, the ratio weight of the relationship degree analysis operation (1) is 30%, the ratio weight of the relationship degree analysis operation (2) is 20%, the ratio weight of the relationship degree analysis operation (3) is 20%, the ratio weight of the relationship degree analysis operation (4) is 15%, and the ratio weight of the relationship degree analysis operation (5) is 15%. The score between each user and the corresponding associated person after weighted calculation is 10 × 30% +10 × 20% + 15% +10 × 15% +5 × 30% +5 × 20% +5 × 15% +5 × 5 ═ 5, so that the degree of relationship between the user and the corresponding associated person is marked as high when the score greater than or equal to the preset value of 7.5 is obtained after weighted calculation, and the degree of relationship between the user and the corresponding associated person is marked as low when the score less than the preset value of 7.5 is obtained after weighted calculation. The relationship degree between each user and the corresponding associated person is specifically exemplified as follows:
degree of relationship between user a and related person b: the degree of relationship obtained by performing the analysis operations (1), (2) and (4) of the degree of relationship is high (the detailed analysis process is not repeated here), and the scores are 10 respectively; the degree of relationship obtained by performing the relationship degree analysis operations (3) and (5) is low (the detailed analysis process is not repeated here), and the scores are 5 respectively; therefore, if the score obtained by performing the weighted calculation on each score is 10 × 30% +10 × 20% +5 × 20% +10 × 15% +5 × 15% + 8.25 and is greater than the preset value of 7.5, the final degree of relationship between the user a and the associated person b is high.
Degree of relationship between user C and associated person B: the degree of relationship obtained by performing the analysis operations (1), (4) and (5) of the degree of relationship is high (the detailed analysis process is not repeated here), and the scores are 10 respectively; performing the relationship degree analysis operations (2) and (3), wherein the obtained relationship degree is low (the detailed analysis process is not repeated here), and the scores are respectively 5; therefore, the score obtained by performing the weighted calculation on each score is 10 × 30% +5 × 20% +10 × 15% +8, which is greater than the preset value of 7.5, and the final degree of relationship between the user c and the associated person b is high.
Degree of relationship between user C and associated D: the degree of relationship obtained by performing the analysis operations (2), (4) and (5) of the degree of relationship is high (the detailed analysis process is not repeated here), and the scores are 10 respectively; the degree of relationship obtained by performing the analysis operations (1) and (3) of the degree of relationship is low (the detailed analysis process is not repeated here), and the scores are 5 respectively; therefore, the score after the weighted calculation of each score is 5 × 30% +10 × 20% +5 × 20% +10 × 15% +7.5, which is equal to the preset value, the final degree of relationship between the user c and the associated person d is high.
Degree of relationship between user E and associated person B: the degree of relationship obtained by performing the relationship degree analysis operations (4) and (5) is high (the detailed analysis process is not repeated here), and the scores are 10 respectively; the degree of relationship obtained by performing the analysis operations (1), (2) and (3) of the degree of relationship is low (the detailed analysis process is not repeated here), and the scores are 5 respectively; therefore, if the score obtained by weighting each score is 5 × 30% +5 × 20% +10 × 15% +6.5, which is less than the preset value of 7.5, the final degree of relationship between the user e and the associated person b is low.
Degree of relationship between user E and associated D: the degree of relationship obtained by performing the degree of relationship analysis operation (4) is high (the detailed analysis process is not repeated here), and the scores are 10 respectively; the degree of relationship obtained by performing the analysis operations (1), (2), (3) and (5) of the degree of relationship is low (the detailed analysis process is not repeated here), and the scores are 5 respectively; therefore, if the score obtained by weighting each score is 5 × 30% +5 × 20% +10 × 15% +5 × 15% +5.75 and is less than the preset value of 7.5, the final degree of relationship between the user e and the associated character is high.
In other embodiments, the degree of relationship between each user and the corresponding associated person may be subdivided into more than three levels, for example, into high, medium, and low levels, or into a first level, a second level, a third level, and a fourth level … ….
C. And constructing a relationship network according to the relationship of the.
After the relationship of each user and the degree of the relationship between each user and the corresponding associated person are analyzed, a relationship network can be constructed according to the relationship of each user and the degree of the relationship between each user and the corresponding associated person. For example, the user a uploads the personal information of the user a and the related person information of the related person B, the user c uploads the personal information of the user a and the related person information of the related person B and the related person information of the related person d, the user e uploads the personal information of the user a and the related person information of the related person B and the related person information of the related person d, and the relationship between the user a and the related person B is analyzed as a alumni through the step B (the detailed analysis process is not repeated herein), the relationship between the user c and the related person B is a colleague, the relationship between the user c and the related person d is a alumni, the relationship between the user e and the related person B is a commend, the relationship between the user e and the related person B is a coop, the relationship between the user e and the related person d is a coop, and the relationship between the user a and the related person B is analyzed as a high degree through the analysis operation of the relationship degree in the step B (the detailed analysis process is not repeated herein), if the degree of the relationship between the user C and the associated person B is high, the degree of the relationship between the user C and the associated person D is high, the degree of the relationship between the user E and the associated person B is low, and the degree of the relationship between the user E and the associated person D is low, a relationship network of the relationship between the user E and the associated person D as shown in fig. 3 can be constructed.
After the relationship network is established, if the information that a certain user exits the relationship network is obtained, the information of the associated person uploaded to the relationship network by the user is encrypted so as to protect the privacy of the corresponding associated person.
Referring to fig. 2, the method for outputting a person finding contact path based on a personal relationship network includes the following steps a, b, c and d.
a. Personal information of a user and personal information of a person to be found are acquired.
During the operation of the personal information mutual-aid system, when a registered user wants to find a person, the personal information of the person to be found can be input into the personal information mutual-aid system, and the user uploads the personal information of the user when registering, so that the system can acquire the personal information of the user and the personal information of the person to be found. The personal information of the person to be found can be one or more of name, sex, age, work unit, work post and graduate school, and the system screens the person to be found meeting the conditions according to the personal information of the person to be found. For example, if the user a wants to find a person who graduates from school X and is currently on work post Y, the personal information of the person to be found input by the user a includes that school X is graduate school X and work post Y, and the system analyzes accordingly to find that the associated person is qualified, that is, the associated person is the person to be found.
b. And analyzing a contact path between the user and the searched person in the personal relationship network according to the personal information of the user and the personal information of the searched person.
After the associated person is analyzed to be the found person, the system analyzes two contact paths between the user A and the found person according to the personal information of the user A and the personal information of the found person, and the two contact paths are respectively as follows: a, B, C, D; (II) A-B-E-D.
c. And acquiring the degree of relationship between every two adjacent persons in the contact path.
After two contact paths between the user A and the found person D are analyzed, the relation degree between every two adjacent persons in each contact path is obtained, and the following can be obtained: in the first connection path A, B, C and D, the degree of relationship between A and B is high (the weighted score is 8.25), the degree of relationship between B and C is high (the weighted score is 8), and the degree of relationship between C and D is high (the weighted score is 7.5); in the second connection path, i.e., a first connection path, i.e., a second connection path, i.e., a fifth connection path, i.e., a high degree of relationship between the first connection path and the second connection path, i.e., a high degree of relationship between the second connection path, i.e., a low degree of relationship between the second connection path, i.e., a fifth connection path, i.e., a high degree of relationship between the second connection, i.e., a high degree of the second, i.5.e., a low, and a low, i.5.5, and a low, i.5, a degree of the second, i.5, a weight, i.e., a low, a degree of the second, a second, and a second, i.e., a second, and a second, a low, and a low, and a second, and a, a degree of relationship between the degree of the second, and a second, and a, a second, and a, a second, and a second, a second, and a, a second, a.
d. And outputting the contact path according to the degree of the relationship between every two adjacent persons in the contact path.
After the degree of relationship between every two adjacent persons in two contact paths between the user A and the found person D is analyzed, the contact paths are output according to the degree of relationship between every two adjacent persons in the contact paths, and the output modes are three, specifically the following (1) to (3):
(1) and outputting two contact paths and the degree of relationship between every two adjacent persons in each contact path, so that the user A can select a proper contact path to search the found person according to the degree of relationship between every two adjacent persons in each contact path.
(2) And sequencing and outputting the two contact paths according to the degree of relationship between every two adjacent persons in the two contact paths. There are two sorting output modes: the first is to sort and output according to the average value of the relation degree of each contact path, and the second is to sort and output according to the lowest value of the relation degree between every two adjacent persons in each contact path.
The first sort output mode specifically: as can be seen from the above, in the first connection path a, b, c, d, the degree of relationship between a and b is high (the weighted score is 8.25), the degree of relationship between b and c is high (the weighted score is 8), and the degree of relationship between c and d is high (the weighted score is 7.5); in the second connection path A, B, E, D, the degree of relationship between A and B is high (the weight score is 8.5), the degree of relationship between B and E is low (the weight score is 6.5), and the degree of relationship between E and D is low (the weight score is 5.75); therefore, the average value of the degree of relationship of the first contact route is (8.25+8+ 7.5)/3-7.92 according to the degree of relationship between every two adjacent persons in the first contact route, and the average value of the degree of relationship of the second contact route is (8.25+6.5+ 5.75)/3-6.83 according to the degree of relationship between every two adjacent persons in the second contact route; and then, sorting and outputting the two contact paths according to the average value of the relation degrees of the contact paths, wherein in the two output contact paths, the first contact path with the higher average value of the relation degrees is ranked at the first position, and the second contact path with the lower average value of the relation degrees is ranked at the second position.
The second sort output mode specifically: as can be seen from the above, in the first connection path a, b, c, d, the degree of relationship between a and b is high (the weighted score is 8.25), the degree of relationship between b and c is high (the weighted score is 8), and the degree of relationship between c and d is high (the weighted score is 7.5); in the second connection path A, B, E, D, the degree of relationship between A and B is high (the weight score is 8.5), the degree of relationship between B and E is low (the weight score is 6.5), and the degree of relationship between E and D is low (the weight score is 5.75); therefore, the lowest value of the degree of relationship between every two adjacent persons in the first contact path is found to be 7.5 according to the degree of relationship between every two adjacent persons in the first contact path, and the lowest value of the degree of relationship between every two adjacent persons in the second contact path is found to be 5.75 according to the degree of relationship between every two adjacent persons in the second contact path; and then, sorting and outputting the two contact paths according to the lowest value of the relationship degree between every two adjacent persons in each contact path, wherein in the two output contact paths, the first contact path with the highest value of the relationship degree is arranged at the first position, and the second contact path with the lowest value of the relationship degree is arranged at the second position.
(3) And preferably outputting the person with the higher relation degree between two adjacent persons from the two connection paths, namely only outputting one connection path with the higher relation degree. The output mode has two types: the method preferably selects the person with the higher average degree of the relationship between the two adjacent persons from the two contact paths to output, and preferably selects the person with the lower average degree of the relationship between the two adjacent persons from the two contact paths to output.
The first output mode is specifically: as can be seen from the above, in the first connection path a, b, c, d, the degree of relationship between a and b is high (the weighted score is 8.25), the degree of relationship between b and c is high (the weighted score is 8), and the degree of relationship between c and d is high (the weighted score is 7.5); in the second connection path A, B, E, D, the degree of relationship between A and B is high (the weight score is 8.5), the degree of relationship between B and E is low (the weight score is 6.5), and the degree of relationship between E and D is low (the weight score is 5.75); therefore, the average value of the degree of relationship of the first contact route is (8.25+8+ 7.5)/3-7.92 according to the degree of relationship between every two adjacent persons in the first contact route, and the average value of the degree of relationship of the second contact route is (8.25+6.5+ 5.75)/3-6.83 according to the degree of relationship between every two adjacent persons in the second contact route; and then, only outputting a first contact path with a higher relation degree average value, and not outputting a second contact path with a lower relation degree average value.
The second output mode is specifically as follows: as can be seen from the above, in the first connection path a, b, c, d, the degree of relationship between a and b is high (the weighted score is 8.25), the degree of relationship between b and c is high (the weighted score is 8), and the degree of relationship between c and d is high (the weighted score is 7.5); in the second connection path A, B, E, D, the degree of relationship between A and B is high (the weight score is 8.5), the degree of relationship between B and E is low (the weight score is 6.5), and the degree of relationship between E and D is low (the weight score is 5.75); therefore, the lowest value of the degree of relationship between every two adjacent persons in the first contact path is found to be 7.5 according to the degree of relationship between every two adjacent persons in the first contact path, and the lowest value of the degree of relationship between every two adjacent persons in the second contact path is found to be 5.75 according to the degree of relationship between every two adjacent persons in the second contact path; and then, only outputting the first contact path with the highest relation degree, and not outputting the second contact path with the lowest relation degree.
In other embodiments, if there are multiple contact paths with higher relationship degree, that is, there are multiple contact paths with higher average value of relationship degree, or there are multiple contact paths with higher minimum value of relationship degree, the contact paths with less number of people in the contact paths are preferably output, and the selection method is a conventional technical means in the art and will not be described herein again.
To sum up, when the relationship network of the present embodiment is constructed, in addition to the relationship between each user and the corresponding associated person, the relationship degree between each user and the corresponding associated person is also determined, so that after the relationship path between each user and the person to be found is analyzed in the relationship network of the relationship between each user and the corresponding associated person, the relationship degree between every two adjacent persons in the relationship path can be obtained, and the relationship path can be output according to the relationship degree between every two adjacent persons in the relationship path, so that the relationship path output by the relationship network of the relationship between two adjacent persons can reflect the relationship degree between the two adjacent persons, and the user can avoid selecting the relationship path with a sparse relationship between the two adjacent persons as much as possible in the person finding process.
The above description is only the embodiments of the present invention, and the scope of patent protection is not limited thereto. The insubstantial changes or substitutions will now be made by those skilled in the art based on the teachings of the present invention, which fall within the scope of the claims.
Claims (10)
1. The method for constructing the human relationship network comprises the following steps:
A. acquiring personal information and associated person information of a plurality of users;
B. analyzing the relationship of each user according to the personal information and the associated person information of each user;
C. constructing a relationship network according to the relationship of each user;
the method is characterized in that: in the step B, after the relationship of the each user is analyzed, the relationship degree between each user and the corresponding associated person is obtained; and C, constructing a relationship network of the interpersonal relationship according to the relationship degree between each user and the corresponding associated person.
2. The method for constructing a personal relationship network as claimed in claim 1, wherein: the determinant of the degree of relationship comprises answers of all users to questions related to the degree of relationship; in the step A, questions related to the degree of relationship are provided for each user to answer; and in the step B, analyzing the degree of relationship between each user and the corresponding associated person according to the answer of each user.
3. The method for constructing a personal relationship network as claimed in claim 1, wherein: the decision factor of the relation degree comprises a relevant judgment result of whether each user invites the corresponding associated person to register successfully or not; in the step B, it is determined whether each user invites the corresponding associated person to register successfully, if the invitation is successful, the degree of relationship is higher, and if the invitation is unsuccessful, the degree of relationship is lower.
4. The method for constructing a personal relationship network as claimed in claim 1, wherein: the decision factor of the relation degree comprises a related judgment result of whether the same associated person information exists or not; in the step B, it is determined whether the same associated person information exists in the associated person information of the plurality of users, and if so, the degree of relationship between the user corresponding to the same associated person information and the corresponding associated person is low.
5. A person finding contact path output method based on a relationship network is characterized by comprising the following steps:
a. acquiring personal information of a user and personal information of a found person;
b. analyzing a contact path between the user and the person to be found in the personal relationship network according to the personal information of the user and the personal information of the person to be found;
c. acquiring the degree of relationship between every two adjacent persons in the contact path;
d. and outputting the contact path according to the degree of the relationship between every two adjacent persons in the contact path.
6. The person finding contact path output method as claimed in claim 5, wherein there are a plurality of contact paths analyzed in the step b, and the step d specifically outputs from the plurality of contact paths, preferably the one with higher relationship degree between two adjacent persons.
7. The method as claimed in claim 6, wherein the step d comprises calculating an average value of the relationship degree between two adjacent persons in each link path according to the relationship degree between two adjacent persons in each link path, and outputting the average value of the relationship degree between two adjacent persons from the plurality of link paths preferably higher.
8. The method as claimed in claim 6, wherein the step d is to find the lowest value of the relationship between two adjacent persons in each link path according to the relationship between two adjacent persons in each link path, and then output the lowest value of the relationship between two adjacent persons from the plurality of link paths.
9. Computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the method for building a personal relationship network according to any one of claims 1 to 4 and/or the method for outputting a contact path for a person according to any one of claims 5 to 8.
10. A personal resource mutual aid system comprising a computer readable storage medium and a processor coupled to each other, wherein the computer readable storage medium is as claimed in claim 9.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110887930.3A CN113553364A (en) | 2021-08-03 | 2021-08-03 | Method for constructing relationship network of people, method for outputting contact path of people, storage medium and system for mutual assistance of people resources |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110887930.3A CN113553364A (en) | 2021-08-03 | 2021-08-03 | Method for constructing relationship network of people, method for outputting contact path of people, storage medium and system for mutual assistance of people resources |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN113553364A true CN113553364A (en) | 2021-10-26 |
Family
ID=78105206
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110887930.3A Pending CN113553364A (en) | 2021-08-03 | 2021-08-03 | Method for constructing relationship network of people, method for outputting contact path of people, storage medium and system for mutual assistance of people resources |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113553364A (en) |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20040148275A1 (en) * | 2003-01-29 | 2004-07-29 | Dimitris Achlioptas | System and method for employing social networks for information discovery |
| CN104219255A (en) * | 2013-05-29 | 2014-12-17 | 赵剑 | Social network mutual-assisting technique for satisfying user demands based on mobile phone address list |
| US8935192B1 (en) * | 2010-04-22 | 2015-01-13 | Google Inc. | Social search engine |
| CN105719192A (en) * | 2016-01-27 | 2016-06-29 | 浙江慧脑信息科技有限公司 | Connection distance setting and using method |
| CN109584094A (en) * | 2018-11-23 | 2019-04-05 | 中国运载火箭技术研究院 | A kind of interpersonal path quick positioning system, method and medium |
| CN109800363A (en) * | 2018-12-13 | 2019-05-24 | 深圳壹账通智能科技有限公司 | Construct method, apparatus, equipment and the storage medium of standing relational network |
| CN111177583A (en) * | 2019-12-30 | 2020-05-19 | 山东合天智汇信息技术有限公司 | Social platform-based interpersonal analysis method and system |
| CN112528166A (en) * | 2020-12-16 | 2021-03-19 | 平安养老保险股份有限公司 | User relationship analysis method and device, computer equipment and storage medium |
-
2021
- 2021-08-03 CN CN202110887930.3A patent/CN113553364A/en active Pending
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20040148275A1 (en) * | 2003-01-29 | 2004-07-29 | Dimitris Achlioptas | System and method for employing social networks for information discovery |
| US8935192B1 (en) * | 2010-04-22 | 2015-01-13 | Google Inc. | Social search engine |
| CN104219255A (en) * | 2013-05-29 | 2014-12-17 | 赵剑 | Social network mutual-assisting technique for satisfying user demands based on mobile phone address list |
| CN105719192A (en) * | 2016-01-27 | 2016-06-29 | 浙江慧脑信息科技有限公司 | Connection distance setting and using method |
| CN109584094A (en) * | 2018-11-23 | 2019-04-05 | 中国运载火箭技术研究院 | A kind of interpersonal path quick positioning system, method and medium |
| CN109800363A (en) * | 2018-12-13 | 2019-05-24 | 深圳壹账通智能科技有限公司 | Construct method, apparatus, equipment and the storage medium of standing relational network |
| CN111177583A (en) * | 2019-12-30 | 2020-05-19 | 山东合天智汇信息技术有限公司 | Social platform-based interpersonal analysis method and system |
| CN112528166A (en) * | 2020-12-16 | 2021-03-19 | 平安养老保险股份有限公司 | User relationship analysis method and device, computer equipment and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Evans et al. | Subjective social location: Data from 21 nations | |
| Waites et al. | Increasing the cultural responsiveness of family group conferencing | |
| US20150278964A1 (en) | Determining reputation of users with respect to skills | |
| JP6249466B1 (en) | Online test method and online test server for evaluating idea creativity | |
| Haque et al. | Concept mapping of photovoices: Sequencing and integrating methods to understand immigrants' perceptions of neighborhood influences on health | |
| KR20170050617A (en) | System for knowledge verification based on crowdsourcing | |
| KR20160084307A (en) | Method and device for providing contact information | |
| SARIALTIN | A Qualitative Study on the Conceptual Framework and Success | |
| US20140272897A1 (en) | Method and system for blending assessment scores | |
| CN113553364A (en) | Method for constructing relationship network of people, method for outputting contact path of people, storage medium and system for mutual assistance of people resources | |
| Cheng | The U21 rankings of national higher education systems: Re-analyze to optimize | |
| CN110851721A (en) | Method and equipment for recommending test questions according to individual features of user | |
| Tanner | Nested Sampling in Sequential Mixed Methods Research Designs: Comparing Recipe and Result | |
| Brinkman et al. | The projection of racial identity on social network | |
| CN109146737B (en) | Intelligent interaction method and device based on examination platform | |
| KR20090000102A (en) | A production method of interview relation by optimal condition and record medium recording thereof | |
| JP4927458B2 (en) | Wish list creation assist system | |
| KR101751292B1 (en) | Method for grading practice and system for executing the method | |
| KR102213962B1 (en) | Apparatus and method for performing a benchmark test through crowd sourcing | |
| KR101753340B1 (en) | System for managing address list and Method for threrof | |
| Wijerathna et al. | Finding evidences by crowdsourcing | |
| De Marco et al. | Jobless and burnt out: digital inequality and online access to the labor market | |
| US20240070592A1 (en) | Methods and systems employing professional culture traits to evaluate compatibility between individuals or groups of individuals | |
| CN103391239A (en) | Method and device for chatting in SNS (social networking services) | |
| Dzikrillah et al. | The Use of Crowdsourcing Technology and TOPSIS Method in The Development of Tourism Decision Support System Based On Wisdom of The Crowd |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |