Target object selection method, server, and computer storage medium

A server, comprising:

• a memory;
• and
• a processor coupled to the memory and configured to:
• select candidate users meeting a first condition in a target area based on location information reported by user terminals using location based service, the first condition characterizing a time duration within which a user has appeared in the target area;
• after the candidate users who appeared in the target area within the time duration based on the location information are selected, extract social relationship chains of the candidate users in the target area, and obtaining connection relationships for all candidate users whose corresponding social relationship chain includes at least one other candidate user, including:
• for each candidate user represented by a candidate vertex,
• determining that a currently-being-processed candidate vertex has at least one related vertex and establishing a connection between each related vertex and the candidate vertex, each related vertex representing one other candidate user that included in the social relationship chain of the candidate user currently being processed, wherein the candidate user currently being processed corresponds to candidate vertex A, vertex B corresponding to the candidate user B who meets the first condition in the target area and also is included in the social relationship chain is the related vertex of candidate vertex A, and vertex C corresponding to the candidate user C who meets the first condition in the target area but is not included in the social relationship chain is not the related vertex of candidate vertex A;
• and
• obtaining a connection relationship corresponding to the candidate user currently being processed, the connection relationship including connections among the candidate vertex and all related vertex;
• select, among connection relationships of all candidate users, a connection relationship in which the total number of vertexes exceeds a number threshold value, and taking candidate users in the selected connection relationship as target users, each target user being one of the candidate users that also appears in a social relationship chain of another candidate user;
• and
• send information to the target user in the target area.

A non-transitory storage medium storing computer executable program instructions, when being executed by a processor, the program instructions cause the processor to perform:

• selecting candidate users meeting a first condition in a target area based on location information reported by user terminals using location based service, the first condition after selecting the candidate users who appeared in the target area within the time duration based on the location information, extracting social relationship chains of the candidate users in the target area, and obtaining connection relationships for all candidate users whose corresponding social relationship chain includes at least one other candidate user, including:
• for each candidate user represented by a candidate vertex,
• determining that a currently-being-processed candidate vertex has at least one related vertex and establishing a connection between each related vertex and the candidate vertex, each related vertex representing one other candidate user that included in the social relationship chain of the candidate user currently being processed, wherein the candidate user currently being processed corresponds to candidate vertex A, vertex B corresponding to the candidate user B who meets the first condition in the target area and also is included in the social relationship chain is the related vertex of candidate vertex A, and vertex C corresponding to the candidate user C who meets the first condition in the target area but is not included in the social relationship chain is not the related vertex of candidate vertex A;
• and
• obtaining a connection relationship corresponding to the candidate user currently being processed, the connection relationship including connections among the candidate vertex and all related vertex;
• selecting, among connection relationships of all candidate users, a connection relationship in which the total number of vertexes exceeds a number threshold value, and taking candidate users in the selected connection relationship as target users, each target user being one of the candidate users that also appears in a social relationship chain of another candidate user;
• and
• sending information to the target user.